Results 51 to 60 of about 1,288,795 (193)
Genericity of chaos for colored graphs
Topological Algebra and its Applications, 2021 To each colored graph one can associate its closure in the universal space of isomorphism classes of pointed colored graphs, and this subspace can be regarded as a generalized subshift.
Lijó Ramón Barral, Nozawa Hiraku
doaj +1 more source
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
MathematicsThe category of directed graphs is isomorphic to a particular category whose objects are labeled undirected bipartite graphs and whose morphisms are undirected graph morphisms that respect the labeling. Based on this isomorphism, we begin by showing that
Sebastian Pardo-Guerra +2 more
doaj +1 more source
Isomorphism Classes of Uniform Groups
Rocky Mountain Journal of Mathematics, 2002 This paper concerns finite rank torsion-free Abelian groups which are extensions of a rigid completely decomposable group by a homocyclic \(p\)-group. The main results are a classification up to near isomorphism, and a count of the number of isomorphism classes in a given near isomorphism class.
openaire +2 more sources
The isomorphism problem for classes of computable fields [PDF]
Archive for Mathematical Logic, 2004 Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider only countable members.
openaire +4 more sources
Isomorphisms in switching classes of graphs [PDF]
Journal of the Australian Mathematical Society, 1978 AbstractWe investigate conditions on a permutation group G sufficient to ensure that G fixes a graph in any switching class of graphs that it stabilizes. Our main result gives a necessary and sufficient condition for a dihedral group G to have this property.
Harries, David, Liebeck, Hans
openaire +2 more sources
Towards an Isomorphism Dichotomy for Hereditary Graph Classes [PDF]
, 2014 In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs.
Schweitzer, Pascal, Pascal Schweitzer
core +1 more source
Finite Local Rings of Length 4
AxiomsThis paper presents a comprehensive characterization of finite local rings of length 4 and with residue field Fpm, where p is a prime number. Such rings have an order of p4m elements.
Sami Alabiad +2 more
doaj +1 more source
K-theory and phase transitions at high energies
Pracì Mìžnarodnogo Geometričnogo Centru, 2016 The duality between E8xE8 heteritic string on manifold K3xT2 and Type IIA string compactified on a Calabi-Yau manifold induces a correspondence between vector bundles on K3xT2 and Calabi-Yau manifolds.
T. V. Obikhod
doaj +1 more source
Testing first-order properties for subclasses of sparse graphs [PDF]
, 2013 We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nešetřil and Ossona de Mendez.
Thomas, Robin +2 more
core +1 more source
Representations of group rings and groups [PDF]
International Journal of Group Theory, 2018 An isomorphism between the group ring of a finite group and a ring of certain block diagonal matrices is established. It is shown that for any group ring matrix $A$ of $mathbb{C} G$ there exists a matrix $U$ (independent of $A$) such that $U^{-1}AU= diag(
Ted Hurley
doaj +1 more source