English
Related papers

Related papers: Abelian Cayley digraphs with asymptotically large …

200 papers

Sidorenko's conjecture asserts that every bipartite graph $H$ has the property that, for any host graph $G$, the homomorphism density from $H$ to $G$ is asymptotically at least as large as in a quasirandom graph with the same edge density…

Combinatorics · Mathematics 2025-07-22 Yuqi Zhao

Following work of Rieffel, we define the Cayley compactification of an abelian group with specified generating set. We investigate its structure using methods from discrete geometry and commutative algebra.

Combinatorics · Mathematics 2007-05-23 Mike Develin

We show that Cayley graphs of virtually Abelian groups satisfy a Li-Yau type gradient estimate despite the fact that they do not satisfy any known variant of the curvature-dimension inequality with non-negative curvature.

Analysis of PDEs · Mathematics 2016-10-18 Gabor Lippner , Shuang Liu

Famously, Kohel proved that isogeny graphs of ordinary elliptic curves are beautifully structured objects, now called volcanos. We prove graph structural theorems for abelian varieties of any dimension with commutative endomorphism ring and…

Number Theory · Mathematics 2025-08-06 Sarah Arpin , Stefano Marseglia , Caleb Springer

We consider quasirandom properties for Cayley graphs of finite abelian groups. We show that having uniform edge-distribution (i.e., small discrepancy) and having large eigenvalue gap are equivalent properties for such Cayley graphs, even if…

Combinatorics · Mathematics 2016-10-21 Yoshiharu Kohayakawa , Vojtěch Rödl , Mathias Schacht

We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…

Metric Geometry · Mathematics 2025-08-07 Wanying Huang , David Hume , Samuel J. Kelly , Ryan Lam

Does every $n$-vertex Cayley graph have an orthonormal eigenbasis all of whose coordinates are $O(1/\sqrt{n})$? While the answer is yes for abelian groups, we show that it is no in general. On the other hand, we show that every $n$-vertex…

Combinatorics · Mathematics 2020-10-29 Ashwin Sah , Mehtaab Sawhney , Yufei Zhao

We define a family of graphs we call dual systolic graphs. This definition comes from graphs that are duals of systolic simplicial complexes. Our main result is a sharp (up to constants) isoperimetric inequality for dual systolic graphs.…

Combinatorics · Mathematics 2023-04-18 Daniel Carmon , Amir Yehudayoff

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…

Combinatorics · Mathematics 2016-12-13 Xueyi Huang , Qiongxiang Huang

Consider the random Cayley graph of a finite Abelian group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll \log k \ll \log |G|$. Draw a vertex $U \sim \operatorname{Unif}(G)$. We show that the graph distance…

Probability · Mathematics 2025-10-14 Jonathan Hermon , Sam Olesker-Taylor

It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…

Combinatorics · Mathematics 2024-06-11 Bartłomiej Bychawski

We conservatively extend classical elementary differential calculus to the Cartesian closed category of convergence spaces. By specializing results about the convergence space representation of directed graphs, we use Cayley graphs to…

Discrete Mathematics · Computer Science 2015-05-05 Daniel R. Patten , Howard A. Blair , David W. Jakel , Robert J. Irwin

We provide asymptotic formulae for the numbers of bipartite graphs with given degree sequence, and of loopless digraphs with given in- and out-degree sequences, for a wide range of parameters. Our results cover medium range densities and…

Combinatorics · Mathematics 2020-06-30 Anita Liebenau , Nick Wormald

A finite group $G$ is a "non-DCI group" if there exist subsets $S_1$ and $S_2$ of $G$, such that the associated Cayley digraphs $C\overrightarrow{ay}(G;S_1)$ and $C\overrightarrow{ay}(G;S_2)$ are isomorphic, but no automorphism of $G$…

Combinatorics · Mathematics 2023-03-08 Dave Witte Morris , Joy Morris

We address the problem of constructing large undirected circulant networks with given degree and diameter. First we discuss the theoretical upper bounds and their asymptotics, and then we describe and implement a computer-based method to…

Combinatorics · Mathematics 2015-03-26 Ramiro Feria-Puron , Hebert Perez-Roses , Joe Ryan

We introduce a notion of Ricci curvature for Cayley graphs that can be thought of as "medium-scale" because it is neither infinitesimal nor asymptotic, but based on a chosen finite radius parameter. We argue that it gives the foundation for…

Group Theory · Mathematics 2020-07-06 Assaf Bar-Natan , Moon Duchin , Robert Kropholler

We derive an asymptotic formula which counts the number of abelian extensions of prime degrees over rational function fields. Specifically, let $\ell$ be a rational prime and $K$ a rational function field $\Bbb F_q(t)$ with $\ell \nmid q$.…

Number Theory · Mathematics 2015-09-07 Chih-Yun Chuang , Yen-Liang Kuan

Associated to an abelian variety $A$ of dimension $g$ over a number field $K$ is a Galois representation $\rho_A\colon Gal(\bar{K}/K)\to GL_{2g}(\hat{\mathbb{Z}})$. The representation $\rho_A$ encodes the Galois action on the torsion points…

Number Theory · Mathematics 2019-11-01 David Zywina

We present two results on expansion of Cayley graphs. The first result settles a conjecture made by DeVos and Mohar. Specifically, we prove that for any positive constant $c$ there exists a finite connected subset $A$ of the Cayley graph of…

Group Theory · Mathematics 2011-12-12 Martha Giannoudovardi

For a digraph $\Gamma$, if $F$ is the smallest field that contains all roots of the characteristic polynomial of the adjacency matrix of $\Gamma$, then $F$ is called the splitting field of $\Gamma$. The extension degree of $F$ over the…

Combinatorics · Mathematics 2023-08-08 Shixin Wang , Majid Arezoomand , Tao Feng