English
Related papers

Related papers: Kesten's theorem for Invariant Random Subgroups

200 papers

The fundamental representations of the special linear group ${\rm SL}_n$ over the complex numbers are the exterior powers of $\mathbb{C}^n$. We consider the invariant rings of sums of arbitrary many copies of these ${\rm SL}_n$-modules. The…

Algebraic Geometry · Mathematics 2018-07-26 Lukas Braun

A recent development in graph-minor theory is to study local separators, vertex-sets that separate graphs locally but not necessarily globally. The local separators of a graph roughly correspond to the genuine separators of its local…

Combinatorics · Mathematics 2025-01-15 Johannes Carmesin , George Kontogeorgiou , Jan Kurkofka , Will J. Turner

We determine the rings of invariants in the symmetric algebra on the dual of a vector space V over the field of two elements, for the group G of orthogonal transformations preserving a non-singular quadratic form on V. The invariant ring is…

Group Theory · Mathematics 2007-05-23 P. H. Kropholler , S. Mosheni Rajaei , J. Segal

Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…

Statistics Theory · Mathematics 2023-10-23 Adam B Kashlak

We find a lower bound on the proportion of derangements in a finite transitive group that depends on the minimal nontrivial subdegree. As a consequence, we prove that, if $\Gamma$ is a $G$-vertex-transitive digraph of valency $d\ge 1$, then…

Group Theory · Mathematics 2024-12-20 Marco Barbieri , Pablo Spiga

For a graph $\Gamma=(V(\Gamma),E(\Gamma))$, a subset $C$ of $V(\Gamma)$ is called an $(\alpha,\beta)$-regular set in $\Gamma$, if every vertex of $C$ is adjacent to exactly $\alpha$ vertices of $C$ and every vertex of $V(\Gamma)\setminus C$…

Combinatorics · Mathematics 2025-10-02 Meiqi Peng , Yuefeng Yang

The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…

Combinatorics · Mathematics 2013-09-25 Gareth A. Jones

Benjamini and Schramm introduced the notion of distributional limit of a sequence of graphs with uniformly bounded valence and studied such limits in the case that the involved graphs are planar. We investigate distributional limits of…

Metric Geometry · Mathematics 2013-09-05 Hossein Namazi , Pekka Pankka , Juan Souto

Let $G/\Gamma$ be the quotient of a semisimple Lie group by an arithmetic lattice. We show that for reductive subgroups $H$ of $G$ that is large enough, the orbits of $H$ on $G/\Gamma$ intersect nontrivially with a fixed compact set. As a…

Dynamical Systems · Mathematics 2021-11-04 Han Zhang , Runlin Zhang

Let \( G \) be a finite non-cyclic group. Define \( \mathrm{Cyc}(G) \) as the set of all elements \( a \in G \) such that for any $b\in G$, the subgroup \( \langle a, b \rangle \) is cyclic. The \emph{non-cyclic graph} $\Gamma(G)$ of \( G…

Combinatorics · Mathematics 2025-04-22 Parveen Parveen , Bikash Bhattacharjya

A subset $S$ of a vertex set of a graph $G$ is a total $(k,r)$-dominating set if every vertex $u \in V(G)$ is within distance $k$ of at least $r$ vertices in $S$. The minimum cardinality among all total $(k,r)$-dominating sets of $G$ is…

Discrete Mathematics · Computer Science 2015-11-24 Louisa Harutyunyan

Let $\Gamma$ be a lattice in a connected semisimple Lie group $G$ with trivial center and no compact factors. We introduce a volume invariant for representations of $\Gamma$ into $G$, which generalizes the volume invariant for…

Geometric Topology · Mathematics 2012-09-24 Sungwoon Kim , Inkang Kim

The exponential growth rate of non polynomially growing subgroups of $GL_d$ is conjectured to admit a uniform lower bound. This is known for non-amenable subgroups, while for amenable subgroups it is known to imply the Lehmer conjecture…

Classical Analysis and ODEs · Mathematics 2022-08-25 Emmanuel Breuillard , Péter P. Varjú

For every regular graph, we define a sequence of integers, using the recursion of the Martin polynomial. This sequence counts spanning tree partitions and constitutes the diagonal coefficients of powers of the Kirchhoff polynomial. We prove…

Combinatorics · Mathematics 2025-03-18 Erik Panzer , Karen Yeats

Let P be a locally finite circle packing in the plane invariant under a non-elementary Kleinian group Gamma and with finitely many Gamma-orbits. When Gamma is geometrically finite, we construct an explicit Borel measure on the plane which…

Dynamical Systems · Mathematics 2012-02-23 Hee Oh , Nimish Shah

In this paper, we study the Bergman metric of a finite ball quotient $\mathbb{B}^n/\Gamma$, where $\Gamma \subseteq \mathrm{Aut}(\mathbb{B}^n)$ is a finite, fixed point free, abelian group. We prove that this metric is K\"ahler--Einstein if…

Complex Variables · Mathematics 2020-09-17 Peter Ebenfelt , Ming Xiao , Hang Xu

Let $\Gamma$ be a finitely generated group acting by probability measure preserving maps on the standard Borel space $(X,\mu)$. We show that if $H\leq\Gamma$ is a subgroup with relative spectral radius greater than the global spectral…

Group Theory · Mathematics 2014-12-17 Miklos Abert

In the present article we study the following problem. Let G be a linear algebraic group over Q, $\Gamma$ be an arithmetic lattice and H be an observable Q-subgroup. There is a H-invariant measure $\mu_H$ supported on the closed submanifold…

Dynamical Systems · Mathematics 2020-03-04 Runlin Zhang

A group G that is not finitely generated can be written as the union of a chain of proper subgroups. The cofinality spectrum of G, written CF(S), is the set of regular cardinals lambda such that G can be expressed as the union of a chain of…

Logic · Mathematics 2016-09-06 Saharon Shelah , Simon Thomas

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