Defines a canonical labelling function for finite solvable groups via presentations and cohomology so that can(G) equals can(H) exactly when G and H are isomorphic.
International Journal of Algebra and Computation12(05), 623–644 (2002)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Analogues of Sylow's first, Cauchy's, and Hall's theorems are established for finite skew braces, with application to classification of order pq examples.
Maniplexes are positioned as a unifying combinatorial structure with a proposed edge-labeled graph storage format, demonstrated by linking two regular 4-maniplex datasets to existing graph censuses via canonical forms.
citing papers explorer
-
Computing canonical labellings of finite solvable groups
Defines a canonical labelling function for finite solvable groups via presentations and cohomology so that can(G) equals can(H) exactly when G and H are isomorphic.
-
Analogues of Sylow's first theorem, Cauchy's theorem, and Hall's theorem for skew braces
Analogues of Sylow's first, Cauchy's, and Hall's theorems are established for finite skew braces, with application to classification of order pq examples.