Related papers: The directed Cayley diameter and the Davenport con…
Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…
Let G be a compact connected Lie group with trivial center. Using the action of G on its Lie algebra, we define an operator norm | |_{G} which induces a bi-invariant metric d_G(x,y)=|Ad(yx^{-1})|_{G} on G. We prove the existence of a…
We survey the known group properties that a sequence of finite groups or group actions needs to satisfy to admit subsets of bounded cardinality producing expander Cayley or Schreier graphs. We prove that an infinite amenable group and…
An equation to compute the dp-rank of any abelian group is given. It is also shown that its dp-rank, or more generally that of any one-based group, agrees with its Vapnik-Chervonenkis density. Furthermore, strong abelian groups are…
Let $p$ be an odd prime, and $D_{2p}=\langle \tau,\sigma\mid \tau^p=\sigma^2=e,\sigma\tau\sigma=\tau^{-1}\rangle$ the dihedral group of order $2p$. In this paper, we provide the number of (connected) Cayley (di-)graphs on $D_{2p}$ up to…
Let $\mathcal{G}$ be a properly face 2-coloured (say black and white) \break piecewise-linear triangulation of the sphere with vertex set $V$. Consider the abelian group $\mathcal{A}_W$ generated by the set $V$, with relations $r+c+s=0$ for…
Computing the diameter of a graph, i.e. the largest distance, is a fundamental problem that is central in fine-grained complexity. In undirected graphs, the Strong Exponential Time Hypothesis (SETH) yields a lower bound on the time vs.…
For finite reflection groups of types A and B, we determine the diameter of the graph whose vertices are reduced words for the longest element and whose edges are braid relations. This is deduced from a more general theorem that applies to…
We prove that the cardinality of the torsion subgroups in homology of a closed hyperbolic manifold of any dimension can be bounded by a doubly exponential function of its diameter. It would follow from a conjecture by Bergeron and Venkatesh…
We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…
We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…
Given a finitely generated, torsion-free nilpotent group, we find the maximum possible (critical) regularity for its faithful actions by diffeomorphisms of the closed or half-open interval and of the circle. Our result gives an expression…
The problem of constructing or characterizing strongly regular Cayley graphs (or equivalently, regular partial difference sets) has garnered significant attention over the past half-century. In 2003, Miklavi\v{c} and Poto\v{c}nik [European…
Given a finite group $G$, the Engel graph of $G$ is a directed graph $\Gamma(G)$ encoding pairs of elements satisfying some Engel word. Namely, $\Gamma(G)$ is the directed graph, where the vertices are the non-hypercentral elements of $G$…
An infinite graph G is minor excluded if there is a finite graph that is not a minor of G. We prove that minor excluded graphs have finite Assouad-Nagata dimension and study minor exclusion for Cayley graphs of finitely generated groups.…
The diameter of an undirected or a directed graph is defined to be the maximum shortest path distance over all pairs of vertices in the graph. Given an undirected graph $G$, we examine the problem of assigning directions to each edge of $G$…
The paper is devoted to the study of geodesic orbit Riemannian metrics on nilpotent Lie groups. The main result is the construction of continuous families of pairwise non-isomorphic connected and simply connected nilpotent Lie groups, every…
We investigate the relationship between various isomorphism invariants for finite groups. Specifically, we use the Weisfeiler-Leman dimension (WL) to characterize, compare and quantify the effectiveness and complexity of invariants for…
The main goal of the current paper is to determine the total number of diamonds in the subgroup lattice of a finite abelian group. This counting problem is reduced to finite $p$-groups. Explicit formulas are obtained in some particular…
In conventional gauge theory, a charged point particle is described by a representation of the gauge group. If we propagate the particle along some path, the parallel transport of the gauge connection acts on this representation. The…