1,258 research outputs found
On the Automorphism Groups of Almost All Circulant Graphs and Digraphs
We attempt to determine the structure of the automorphism group of a generic circulant graph. We first show that almost all circulant graphs have automorphism groups as small as possible. Dobson has conjectured that almost all of the remaining circulant (di)graphs (those whose automorphism groups are not as small as possible) are normal circulant (di)graphs. We show this conjecture is not true in general, but is true if we consider only those circulant (di)graphs whose orders are in a “large” subset of integers. We note that all non-normal circulant (di)graphs can be classified into two natural classes (generalized wreath products, and deleted wreath type), and show that neither of these classes contains almost every non-normal circulant digraph
On the Automorphism Groups of Almost All Circulant Graphs and Digraphs
We attempt to determine the structure of the automorphism group of a generic circulant graph. We first show that almost all circulant graphs have automorphism groups as small as possible. Dobson has conjectured that almost all of the remaining circulant (di)graphs (those whose automorphism groups are not as small as possible) are normal circulant (di)graphs. We show this conjecture is not true in general, but is true if we consider only those circulant (di)graphs whose orders are in a “large” subset of integers. We note that all non-normal circulant (di)graphs can be classified into two natural classes (generalized wreath products, and deleted wreath type), and show that neither of these classes contains almost every non-normal circulant digraph
Conjugacy growth series of some infinitely generated groups
It is observed that the conjugacy growth series of the infinite fini-tary
symmetric group with respect to the generating set of transpositions is the
generating series of the partition function. Other conjugacy growth series are
computed, for other generating sets, for restricted permutational wreath
products of finite groups by the finitary symmetric group, and for alternating
groups. Similar methods are used to compute usual growth polynomials and
conjugacy growth polynomials for finite symmetric groups and alternating
groups, with respect to various generating sets of transpositions. Computations
suggest a class of finite graphs, that we call partition-complete, which
generalizes the class of semi-hamiltonian graphs, and which is of independent
interest. The coefficients of a series related to the finitary alternating
group satisfy congruence relations analogous to Ramanujan congruences for the
partition function. They follow from partly conjectural "generalized Ramanujan
congruences", as we call them, for which we give numerical evidence in Appendix
C
On the automorphism groups of almost all circulant graphs and digraphs
Open access, licensed under Creative CommonsWe attempt to determine the structure of the automorphism group of a generic circulant graph. We first show that almost all circulant graphs have automorphism groups as small as possible. The second author has conjectured that almost all of the remaining circulant (di)graphs (those whose automorphism group is not as small as possible) are normal circulant (di)graphs. We show this conjecture is not true in general, but is true if we consider only those circulant (di)graphs whose order is in a “large” subset of integers. We note that all non-normal circulant (di)graphs can be classified into two natural classes (generalized wreath products, and deleted wreath type), and show that neither of these classes contains almost every non-normal circulant digraph.Ye
The Farrell-Jones conjecture for fundamental groups of graphs of abelian groups
We show that the Farrell-Jones Conjecture holds for fundamental groups of
graphs of groups with abelian vertex groups. As a special case, this shows that
the conjecture holds for generalized Baumslag-Solitar groups
- …