Results 61 to 70 of about 1,288,795 (193)

The size of a stratifying system can be arbitrarily large

open access: yesComptes Rendus. Mathématique, 2023
In this short note we construct two families of examples of large stratifying systems in module categories of algebras. The first examples consist on stratifying systems of infinite size in the module category of an algebra $A$.
Treffinger, Hipolito
doaj   +1 more source

Isomorphism Classes of Vertex-Transitive Tournaments

open access: yes, 2023
Tournaments are graphs obtained by assigning a direction for every edge in an undirected complete graph. We give a formula for the number of isomorphism classes of vertex-transitive tournaments with prime order. For that, we introduce Cayley tournaments,
Zetzsche, Stefan
core  

On a relation between GAG codes and AG codes

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023
In this paper, we first give a relationship between generalized algebraic geometry codes (GAG codes) and algebraic geometry codes (AG codes). More precisely, we show that a GAG code is contained (up to isomorphism) in a suitable AG code.
Şenel Engin, Öke Figen
doaj   +1 more source

A lattice theoretical interpretation of generalized deep holes of the Leech lattice vertex operator algebra

open access: yesForum of Mathematics, Sigma, 2023
We give a lattice theoretical interpretation of generalized deep holes of the Leech lattice VOA $V_\Lambda $ . We show that a generalized deep hole defines a ‘true’ automorphism invariant deep hole of the Leech lattice. We also show that there is a
Ching Hung Lam, Masahiko Miyamoto
doaj   +1 more source

Abstract Euler Diagram Isomorphism [PDF]

open access: yes, 2008
Euler diagrams are widely used for information visualization and form the basis of a variety of formal languages that are used to express constraints in computing.
Andrew Fish   +6 more
core  

Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs [PDF]

open access: yes, 2016
Given two graphs, Subgraph Isomorphism is the problem of deciding whether the first graph (the base graph) contains a subgraph isomorphic to the second graph (the pattern graph).
Otachi, Yota   +2 more
core   +1 more source

Directed Graphs representing isomorphism classes of C-Hypergroupoids

open access: yesRatio Mathematica, 2012
We investigate the relation of directed graphs and hyperstructures by virtue of the graph hyperoperation. A new class of graphs arises in this way representing isomorphism classes of C-hypergroupoids and we present the 17 such graphs that correspond to ...
Antonios Kalampakas   +2 more
doaj  

Frobenius Local Rings of Length 5 and Index of Nilpotency 3

open access: yesMathematics
This paper investigates finite local non-chain rings associated by the well-known invariants p,n,m,l, and k, where p is a prime number. In particular, we provide a comprehensive characterization of Frobenius local rings of length l=5 and index of ...
Sami Alabiad, Alhanouf Ali Alhomaidhi
doaj   +1 more source

Isomorphisms between pattern classes [PDF]

open access: yesJournal of Combinatorics, 2015
11 ...
Albert, M. H.   +2 more
openaire   +5 more sources

Enumerating Switching Isomorphism Classes of Signed Graphs

open access: yes, 2022
Let Γ be a simple connected graph, and let {+,−}^E(Γ) be the set of signatures of Γ. For σ a signature of Γ, we call the pair Σ = (Γ,σ) a signed graph of Γ.
Healy, Nathaniel
core  

Home - About - Disclaimer - Privacy