English
Related papers

Related papers: Quantum Unique Ergodicity for Cayley graphs of qua…

200 papers

Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups:…

Representation Theory · Mathematics 2010-10-01 Cristopher Moore , Alexander Russell

We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…

Group Theory · Mathematics 2026-05-06 John M. Mackay , Joseph P. MacManus , Davide Spriano

A graph $\Gamma$ is said to be a semi-Cayley graph over a group $G$ if it admits $G$ as a semiregular automorphism group with two orbits of equal size. We say that $\Gamma$ is normal if $G$ is a normal subgroup of ${\rm Aut}(\Gamma)$. We…

Combinatorics · Mathematics 2020-04-22 Majid Arezoomand , Mohsen Ghasemi

We define a class of dynamical maps on the quasi-local algebra of a quantum spin system, which are quantum analogues of probabilistic cellular automata. We develop criteria for such a system to be ergodic, i.e., to possess a unique…

Condensed Matter · Physics 2009-10-28 S. Richter , R. F. Werner

We investigate the analogue of the Quantum Unique Ergodicity (QUE) conjecture for half-integral weight automorphic forms. Assuming the Generalized Riemann Hypothesis (GRH) we establish QUE for both half-integral weight holomorphic Hecke…

Number Theory · Mathematics 2020-02-12 Stephen Lester , Maksym Radziwiłł

If $G$ is a group and $S$ a generating set, $G$ canonically embeds into the automorphism group of its Cayley graph and it is natural to try to minimize, over all generating sets, the index of this inclusion. This infimum is called the…

Group Theory · Mathematics 2024-03-21 Paul-Henry Leemann , Mikael de la Salle

In a recent paper (arXiv:1211.6372), Bergelson and Tao proved that if $G$ is a $D$-quasi-random group, and $x$,$g$ are drawn uniformly and independently from $G$, then the quadruple $(g,x,gx,xg)$ is roughly equidistributed in the subset of…

Combinatorics · Mathematics 2019-02-20 Tim Austin

We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…

Operator Algebras · Mathematics 2024-12-11 Mateusz Wasilewski

We show that a Wigner induced random orthonormal basis of spherical harmonics is almost surely quantum ergodic. Here, a random basis is identified with an element of the product probability space of unitary groups, each endowed with the…

Probability · Mathematics 2021-07-13 Robert Chang

We study Cayley graphs of abelian groups from the perspective of quantum symmetries. We develop a general strategy for determining the quantum automorphism groups of such graphs. Applying this procedure, we find the quantum symmetries of…

Quantum Algebra · Mathematics 2024-02-07 Daniel Gromada

We call a graph $k$-geodetic, for some $k\geq 1$, if it is connected and between any two vertices there are at most $k$ geodesics. It is shown that any hyperbolic group with a $k$-geodetic Cayley graph is virtually-free. Furthermore, in…

Group Theory · Mathematics 2023-06-16 Murray Elder , Adam Piggott , Kane Townsend

In this paper, we introduce the concept of $k$-integral graphs. A graph $\Gamma$ is called $k$-integral if the extension degree of the splitting field of the characteristic polynomial of $\Gamma$ over rational field $\mathbb Q$ is equal to…

Combinatorics · Mathematics 2025-08-06 Alireza Abdollahi , Majid Arezoomand , Tao Feng , Shixin Wang

The relative Cayley graph of a group $G$ with respect to its proper subgroup $H$, is a graph whose vertices are elements of $G$ and two vertices $h\in H$ and $g\in G$ are adjacent if $g=hc$ for some $c\in C$, where $C$ is an inversed-closed…

Combinatorics · Mathematics 2015-10-14 Mohammad Farrokhi Derakhshandeh Ghouchan , Mehdi Rajabian , Ahmad Erfanian

The partial automorphisms of a graph $X$ having $N$ vertices are the bijections $\sigma:I\to J$ with $I,J\subset\{1,\ldots,N\}$ which leave invariant the edges. These bijections form a semigroup $\widetilde{G}(X)$, which contains the…

Operator Algebras · Mathematics 2021-12-07 Teo Banica

We show that if H is a quasiconvex subgroup of a hyperbolic group G then the relative Cayley graph Y (also known as the Schreier coset graph) for G/H is Gromov-hyperbolic. We also observe that in this situation if G is torsion-free and…

Group Theory · Mathematics 2016-09-07 Ilya Kapovich

A quantum graph $\mathcal{G}$ housed by a matrix algebra $M_n$ can be encoded as an operator system $\mathcal S=\mathcal{S}_{\mathcal{G}}\le M_n$. There are two sensible notions of quantum automorphism group for any such:…

Quantum Algebra · Mathematics 2025-11-18 Alexandru Chirvasitu , Piotr M. Sołtan , Mateusz Wasilewski

A Cayley graph over a group $G$ is said to be central if its connection set is a normal subset of $G$. We prove that every central Cayley graph over a simple group $G$ has at most two pairwise nonequivalent Cayley representations over $G$…

Group Theory · Mathematics 2024-06-07 Jin Guo , Wenbin Guo , Grigory Ryabov , Andrey V. Vasil'ev

Let $f=(f^x\mid x\in S)$, $S\subset\mathbb{Z}^m$, be a semigroup of ergodic measure-preserving transformations of a probability space $(\Omega,\mathsf{P})$ and $h$ a real random function on $S$, such that $h(x+y,\omega)\le…

Probability · Mathematics 2020-09-08 Vytautas Kazakevicius

We propose a version of the Quantum Ergodicity theorem on large regular graphs of fixed valency. This is a property of delocalization of "most" eigenfunctions. We consider expander graphs with few short cycles (for instance random large…

Mathematical Physics · Physics 2015-11-03 Nalini Anantharaman , Etienne Le Masson

For every fixed graph $H$ and every fixed $0 < \alpha < 1$, we show that if a graph $G$ has the property that all subsets of size $\alpha n$ contain the ``correct'' number of copies of $H$ one would expect to find in the random graph…

Combinatorics · Mathematics 2008-04-07 Raphael Yuster