English
Related papers

Related papers: Uniform Mixing on Cayley Graphs

200 papers

A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the…

Combinatorics · Mathematics 2020-05-26 Joy Morris , Josip Smolcic

Let $G$ be a Cayley graph of the elementary abelian $2$-group $\mathbb{Z}_2^{n}$ with respect to a set $S$ of size $d$. We prove that for any such $G, S$ and $d$, the maximum degree of any induced subgraph of $G$ on any set of more than…

Combinatorics · Mathematics 2020-11-10 Noga Alon , Kai Zheng

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…

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

In this paper we study continuous-time quantum walks on Cayley graphs of the symmetric group, and prove various facts concerning such walks that demonstrate significant differences from their classical analogues. In particular, we show that…

Quantum Physics · Physics 2007-05-23 Heath Gerhardt , John Watrous

If all the eigenvalues of the Hermitian-adjacency matrix of a mixed graph are integers, then the mixed graph is called \emph{H-integral}. If all the eigenvalues of the (0,1)-adjacency matrix of a mixed graph are \emph{Gaussian integers},…

Combinatorics · Mathematics 2023-02-17 Monu Kadyan , Bikash Bhattacharjya

We study the random composition of a small family of O(n^3) simple permutations on {0,1}^n. Specifically we ask how many randomly selected simple permutations need be composed to yield a permutation that is close to k-wise independent. We…

Combinatorics · Mathematics 2007-05-23 Shlomo Hoory , Alex Brodsky

The unitary Cayley graph of $\mathbb Z/n\mathbb Z$, denoted $G_{\mathbb Z/n\mathbb Z}$, is the graph with vertices $0,1,\ldots,$ $n-1$ in which two vertices are adjacent if and only if their difference is relatively prime to $n$. These…

Combinatorics · Mathematics 2018-11-21 Colin Defant

Using a Cayley complex (generalizing the Cayley graph) and Clifford algebras, we are able to give, for a large class of finitely presented groups, a uniform construction of spectral triples with $D_{+}$ of index 1.

Operator Algebras · Mathematics 2016-11-10 Sebastien Palcoux

Answering an open question from 2007, we construct infinite $k$-crossing-critical families of graphs that contain vertices of any prescribed odd degree, for any sufficiently large~$k$. To answer this question, we introduce several…

Combinatorics · Mathematics 2019-03-19 Drago Bokal , Mojca Bračič , Marek Derňár , Petr Hliněný

A vertex coloring of a given simple graph $G=(V,E)$ with $k$ colors ($k$-coloring) is a map from its vertex set to the set of integers $\{1,2,3,\dots, k\}$. A coloring is called perfect if the multiset of colors appearing on the neighbours…

Combinatorics · Mathematics 2020-05-29 O. G. Parshina , M. A. Lisitsyna

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

A graph is universally $k$-edge-weightable if for every $k$-element set $Q\subset\mathbb{R}$, it admits a proper $Q$-edge weighting. The settled 1-2-3 conjecture implies that for any arithmetic progression $\{a,b,c\}$, every nice regular…

Combinatorics · Mathematics 2026-02-16 Kecai Deng

We are interested in various aspects of spectral rigidity of Cayley and Schreier graphs of finitely generated groups. For each pair of integers $d\geq 2$ and $m \ge 1$, we consider an uncountable family of groups of automorphisms of the…

Group Theory · Mathematics 2025-12-19 Rostislav Grigorchuk , Tatiana Nagnibeda , Aitor Pérez

We prove quantum ergodicity and quantum mixing for sequences of finite Schreier graphs converging to an infinite Cayley graph whose adjacency operator has absolutely continuous spectrum. Under Benjamini-Schramm convergence (or strong…

Spectral Theory · Mathematics 2026-02-11 Charles Bordenave , Cyril Letrouit , Mostafa Sabri

We construct an infinite family of triples (G,S1, S2) each consisting of a group G and a pair (S1, S2) of distinct subsets of G with the following properties. i The two Cayley graphs Cay(G, S1) and Cay(G,S2) are non-isomorphic. ii The…

Combinatorics · Mathematics 2025-05-07 Masao Ishikawa , Fumihiko Nakano , Taizo Sadahiro

In this paper, we study the integral Cayley graphs over a non-abelian group $U_{6n}=\langle a,b\mid a^{2n}=b^3=1, a^{-1}ba=b^{-1}\rangle$ of order $6n$. We give a necessary and sufficient condition for the integrality of Cayley graphs over…

Combinatorics · Mathematics 2024-01-17 Jing Wang , Xiaogang Liu , Ligong Wang

Let $X$ be a lazy random walk on a graph $G$. If $G$ is undirected, then the mixing time is upper bounded by the maximum hitting time of the graph. This fails for directed chains, as the biased random walk on the cycle $\mathbb{Z}_n$ shows.…

Probability · Mathematics 2016-03-18 Lucas Boczkowski , Yuval Peres , Perla Sousi

In this paper, generalizing the result in \cite{GXY}, we construct strongly regular Cayley graphs by using union of cyclotomic classes of $\F_q$ and Gauss sums of index $w$, where $w\geq 2$ is even. In particular, we obtain three infinite…

Combinatorics · Mathematics 2012-08-07 Fan Wu

In this paper, we give a necessary and sufficient condition for the integrality of Cayley graphs over the dihedral group $D_n=\langle a,b\mid a^n=b^2=1,bab=a^{-1}\rangle$. Moreover, we also obtain some simple sufficient conditions for the…

Combinatorics · Mathematics 2016-06-08 Lu Lu , Qiongxiang Huang , Xueyi Huang

Let $R$ be a finite ring with identity. The unit graph (unitary Cayley graph) of $R$ is the graph with vertex set $R$, where two distinct vertices $x$ and $y$ are adjacent exactly whenever $x+y$ is a unit in $R$ ($x-y$ is a unit in $R$).…

Combinatorics · Mathematics 2024-04-11 Shahin Rahimi , Ashkan Nikseresht