English
Related papers

Related papers: The directed Cayley diameter and the Davenport con…

200 papers

Using methods of Marklof and Str\"ombergsson we establish several limit laws for metric parameters of random Cayley graphs of finite abelian groups with respect to a randomly chosen set of generators of a fixed size. Doing so we settle a…

Dynamical Systems · Mathematics 2017-06-13 Uri Shapira , Reut Zuck

In this paper we are interested in the asymptotic enumeration of Cayley graphs. It has previously been shown that almost every Cayley digraph has the smallest possible automorphism group: that is, it is a digraphical regular representation…

Combinatorics · Mathematics 2020-05-18 Joy Morris , Mariapia Moscatiello , Pablo Spiga

We show that a finitely generated soluble group is virtually nilpotent if and only if the diameter of its finite coset spaces admits a uniform polynomial lower bound in terms of their size. We obtain the same conclusion for certain finitely…

Group Theory · Mathematics 2026-04-21 David Guo

Let $G$ be a finite abelian group, let $E$ be a subset of $G$, and form the Cayley (directed) graph of $G$ with connecting set $E$. We explain how, for various matrices associated to this graph, the spectrum can be used to give information…

Combinatorics · Mathematics 2013-12-13 Joshua E. Ducey , Deelan M. Jalil

We obtain an asymptotic upper bound for the product of the $p$-parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a finite vector space of order divisible by a prime $p$. An…

Group Theory · Mathematics 2023-06-05 Attila Maróti , Saveliy V. Skresanov

It is known, that the existence of dead ends (of arbitrary depth) in the Cayley graph of a group depends on the chosen set of generators. Nevertheless there exist many groups, which do not have dead ends of arbitrary depth with respect to…

Group Theory · Mathematics 2007-05-23 Jörg Lehnert

We give a geometric approach to groups defined by automata via the notion of enriched dual of an inverse transducer. Using this geometric correspondence we first provide some finiteness results, then we consider groups generated by the dual…

Group Theory · Mathematics 2015-03-13 Daniele D'Angeli , Emanuele Rodaro

Recently, several works by a number of authors have provided characterizations of integral undirected Cayley graphs over generalized dihedral groups and generalized dicyclic groups. We generalize and unify these results in two different…

Combinatorics · Mathematics 2023-06-26 Angelot Behajaina , François Legrand

We investigate the geometry of word metrics on fundamental groups of manifolds associated with the generating sets consisting of elements represented by closed geodesics. We ask whether the diameter of such a metric is finite or infinite.…

Differential Geometry · Mathematics 2021-06-28 Bastien Karlhofer , Jarek Kędra , Michał Marcinkowski , Alexander Trost

An explicit algorithm is given for the computation of the Hausdorff dimension of the closure of a regular branch group in terms of an arbitrary branch structure. We implement this algorithm in GAP and apply it to a family of GGS-groups…

Group Theory · Mathematics 2026-01-29 Jorge Fariña-Asategui

Roundness of metric spaces was introduced by Per Enflo as a tool to study uniform structures of linear topological spaces. The present paper investigates geometric and topological properties detected by the roundness of general metric…

Metric Geometry · Mathematics 2007-05-23 J. -F. Lafont , S. Prassidis

The commuting graph of a group $G$ is the simple undirected graph whose vertices are the non-central elements of $G$ and two distinct vertices are adjacent if and only if they commute. It is conjectured by Jafarzadeh and Iranmanesh that…

Group Theory · Mathematics 2012-06-20 Michael Giudici , Aedan Pope

The action dimension of a discrete group $G$ is the minimum dimension of contractible manifold that admits a proper $G$-action. We compute the action dimension of the direct limit of a simple complex of groups for several classes of…

Geometric Topology · Mathematics 2019-07-03 Michael W. Davis , Giang Le , Kevin Schreve

Let P be a locally finite circle packing in the plane invariant under a non-elementary Kleinian group Gamma and with finitely many Gamma-orbits. When Gamma is geometrically finite, we construct an explicit Borel measure on the plane which…

Dynamical Systems · Mathematics 2012-02-23 Hee Oh , Nimish Shah

We classify finite-dimensional complex Hopf algebras $A$ which are pointed, that is, all of whose irreducible comodules are one-dimensional, and whose group of group-like elements $G(A)$ is abelian such that all prime divisors of the order…

Quantum Algebra · Mathematics 2010-06-29 N. Andruskiewitsch , H. -J. Schneider

We define the Cayley graph and its growth function for multivalued groups. We prove that if we change a finite set of generators of multivalued group, or change the starting point, we get an equivalent growth function. We prove that if we…

Group Theory · Mathematics 2025-05-27 Valeriy G. Bardakov , Tatyana A. Kozlovskaya , Matvei N. Zonov

We find the nonabelian finite simple groups with order prime divisors not exceeding 1000. More generally, we determine the sets of nonabelian finite simple groups whose maximal order prime divisor is a fixed prime less than 1000. Our…

Group Theory · Mathematics 2012-02-16 Andrei V. Zavarnitsine

In this paper,we construct some directed strongly regular Cayley graphs on dihedral groups,these generalizes some earlier constructions.We also characterize some certain directed strongly regular Cayley graphs on dihedral groups…

Combinatorics · Mathematics 2019-09-20 Yiqin He , Bicheng Zhang , Rongquan Feng

A result of Pyber states that every finite group $G$ contains an abelian subgroup whose order is quasi-polynomially large in $\lvert G\rvert$. We prove a similar result for $K$-approximate subgroups of solvable groups under only modest…

Combinatorics · Mathematics 2025-12-18 Carl Schildkraut

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

Computational Complexity · Computer Science 2020-05-21 Jeffrey Finkelstein