English
Related papers

Related papers: Groups that produce expander graphs

200 papers

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

Number Theory · Mathematics 2009-05-20 Gyan Prakash

In this paper, by using the Groebner-Shirshov bases, we give characterizations of the Schreier extensions of groups when the group is presented by generators and relations. An algorithm to find the conditions of a group to be a Schreier…

Group Theory · Mathematics 2009-03-04 Yuqun Chen

We study which groups with pairing can occur as the Jacobian of a finite graph. We provide explicit constructions of graphs whose Jacobian realizes a large fraction of odd groups with a given pairing. Conditional on the generalized Riemann…

Combinatorics · Mathematics 2019-03-26 Louis Gaudet , David Jensen , Dhruv Ranganathan , Nicholas Wawrykow , Theodore Weisman

We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.

Discrete Mathematics · Computer Science 2018-03-26 Didier Caucal

Given a group $\Gamma$, we establish a connection between the unitarisability of its uniformly bounded representations and the asymptotic behaviour of the isoperimetric constants of Cayley graphs of $\Gamma$ for increasingly large…

Functional Analysis · Mathematics 2018-02-19 Maria Gerasimova , Dominik Gruber , Nicolas Monod , Andreas Thom

We construct novel examples of finitely generated groups that exhibit seemingly-contradicting probabilistic behaviors with respect to Burnside laws. We construct a finitely generated group that satisfies a Burnside law, namely a law of the…

Group Theory · Mathematics 2026-04-30 Gil Goffer , Be'eri Greenfeld , Alexander Yu. Olshanskii

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…

Combinatorics · Mathematics 2020-05-20 C. Dalfó , M. A. Fiol , N. López

The genus graphs have been studied by many authors, but just a few results concerning in special cases: Planar, Toroidal, Complete, Bipartite and Cartesian Product of Bipartite. We present here a derive general lower bound for the genus of…

General Topology · Mathematics 2016-01-05 J. E. Strapasson , S. I. R. Costa , M. M. S. Alves

We show that for some absolute (explicit) constant $C$, the following holds for every finitely generated group $G$, and all $d >0$: If there is some $ R_0 > \exp(\exp(Cd^C))$ for which the number of elements in a ball of radius $R_0$ in a…

Group Theory · Mathematics 2010-04-09 Yehuda Shalom , Terence Tao

We define a way of approximating actions on measure spaces using finite graphs; we then show that in quite general settings these graphs form a family of expanders if and only if the action is expanding in measure. This provides a somewhat…

Geometric Topology · Mathematics 2021-01-13 Federico Vigolo

Let $\Gamma$ be a group and $(\Gamma_n)_{n=1} ^{\infty}$ be a descending sequence of finite-index normal subgroups. We establish explicit upper bounds on the diameters of the directed Cayley graphs of the $\Gamma/\Gamma_n$ , under some…

Group Theory · Mathematics 2017-10-13 Henry Bradford

We consider a finitely generated group acting minimally on a compact space by homeomorphsims, and assume that the Schreier graph of at least one orbit is quasi-isometric to a line. We show that the topological full group of such an action…

Group Theory · Mathematics 2021-01-07 Nóra Gabriella Szőke

Motivated by expansion in Cayley graphs, we show that there exist infinitely many groups $G$ with a nontrivial irreducible unitary representation whose average over every set of $o(\log\log|G|)$ elements of $G$ has operator norm $1 - o(1)$.…

Combinatorics · Mathematics 2017-05-15 Yufei Zhao

A partial difference set $S$ in a finite group $G$ satisfying $1 \notin S$ and $S = S^{-1}$ corresponds to an undirected strongly regular Cayley graph ${\rm Cay}(G,S)$. While the case when $G$ is abelian has been thoroughly studied, there…

Combinatorics · Mathematics 2020-09-17 Eric Swartz , Gabrielle Tauscheck

We generalize the theory of critical groups from graphs to simplicial complexes. Specifically, given a simplicial complex, we define a family of abelian groups in terms of combinatorial Laplacian operators, generalizing the construction of…

Combinatorics · Mathematics 2011-03-01 Art M. Duval , Caroline J. Klivans , Jeremy L. Martin

We study generic properties of topological groups in the sense of Baire category. First we investigate countably infinite (discrete) groups. We extend a classical result of B. H. Neumann, H. Simmons and A. Macintyre on algebraically closed…

Consider a finite primitive solvable group. We observe that a result of Y. Yang implies that there exist two points whose pointwise stabilizer has derived length at most $9$. We show that, if the group has odd cardinality, then there exist…

Group Theory · Mathematics 2025-04-22 Francesca Lisi , Luca Sabatini

In this article we complete the work of enumerating typical abelian coverings of Cayley graphs, by reducing the problem to enumerating certain subgroups of finite abelian groups.

Combinatorics · Mathematics 2024-02-27 Haimiao Chen

A theorem of Glasner from 1979 shows that if $Y \subset \mathbb{T} = \mathbb{R}/\mathbb{Z}$ is infinite then for each $\epsilon > 0$ there exists an integer $n$ such that $nY$ is $\epsilon$-dense. This has been extended in various works by…

Dynamical Systems · Mathematics 2022-11-01 Kamil Bulinski , Alexander Fish

We present simple graph-theoretic characterizations of Cayley graphs for monoids, semigroups and groups. We extend these characterizations to commutative monoids, semilattices, and abelian groups.

Discrete Mathematics · Computer Science 2019-03-18 Didier Caucal