Results 41 to 50 of about 1,288,795 (193)
On the number of isomorphism classes of derived subgroups [PDF]
Czechoslovak Mathematical Journal, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jafari Taghvasani, Leyli +2 more
openaire +1 more source
Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs [PDF]
, 2005 This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs ...
Nagoya, Takayuki +2 more
core +1 more source
CLASSES OF STRUCTURES WITH NO INTERMEDIATE ISOMORPHISM PROBLEMS [PDF]
The Journal of Symbolic Logic, 2016 AbstractWe say that a theory T is intermediate under effective reducibility if the isomorphism problems among its computable models is neither hyperarithmetic nor on top under effective reducibility. We prove that if an infinitary sentence T is uniformly effectively dense, a property we define in the paper, then no extension of it is intermediate, at ...
openaire +2 more sources
Isomorphism versus commensurability for a class of finitely presented groups
, 2014 We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability problem is ...
Arzhantseva, Goulnara +2 more
core +1 more source
The graph isomorphism problem on geometric graphs [PDF]
, 2013 The graph isomorphism (GI) problem asks whether two given graphs are isomorphic or not. The GI problem is quite basic and simple, however, it's time complexity is a long standing open problem. The GI problem is clearly in NP, no polynomial time algorithm
Ryuhei Uehara, Uehara, Ryuhei
core +1 more source
Some Remarks on a Classification of Nilpotent Compatible Leibniz Algebras
MathematicsIn this note, we describe compatible Leibniz algebras and present several of their properties. Our aim is to present a comprehensive classification of non-Lie nilpotent compatible Leibniz algebras in low dimensions.
Nil Mansuroğlu
doaj +1 more source
Étude des $(n+1)$-tissus de courbes en dimension $n$
Comptes Rendus. Mathématique, 2023 For $(n+1)$-webs by curves in an ambiant $n$-dimensional manifold, we first define a generalization of the well known Blaschke curvature of the dimension two, which vanishes iff the web has the maximum possible rank which is one.
Dufour, Jean-Paul, Lehmann, Daniel
doaj +1 more source
ON GROUPS WITH TWO ISOMORPHISM CLASSES OF DERIVED SUBGROUPS [PDF]
Glasgow Mathematical Journal, 2013 AbstractThe structure of groups which have at most two isomorphism classes of derived subgroups ($\mathfrak{D}$2-groups) is investigated. A complete description of $\mathfrak{D}$2-groups is obtained in the case where the derived subgroup is finite: the solution leads an interesting number theoretic problem. In addition, detailed information is obtained
LONGOBARDI, Patrizia +3 more
openaire +3 more sources
Isomorphisms and homeomorphisms of a class of graphs and spaces
aequationes mathematicae, 2002 We solve the isomorphism problem for the whole class of Lins-Mandel gems (graphs encoded manifolds). We also present certain homeomorphisms of branched cyclic coverings of two-bridge hyperbolic links. As a consequence, we prove that, in in a wide subset of interesting cases, the isomorphism conditions for Lins-Mandel gems are equivalent to the ...
Lins, S., Mulazzani, M.
openaire +4 more sources
Homomorphic Preimages of Geometric Paths
Discussiones Mathematicae Graph Theory, 2018 A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism f : G → H. A geometric graph Ḡ is a simple graph G together with a straight line drawing of G in the plane with the vertices in
Cockburn Sally
doaj +1 more source