English
Related papers

Related papers: Building Large Free Subshifts Using the Local Lemm…

200 papers

The end compactification |\Gamma| of the locally finite graph \Gamma is the union of the graph and its ends, endowed with a suitable topology. We show that \pi_1(|\Gamma|) embeds into a nonstandard free group with hyperfinitely many…

Geometric Topology · Mathematics 2012-03-30 Isaac Goldbring , Alessandro Sisto

Let $s_n^\mathrm{ch}(\Gamma)$ denote the number of characteristic subgroups of index at most $n$ in a finitely generated group $\Gamma$. In response to a question of I. Rivin we show that if $\Gamma = F_r$ is the free group on $r \geq 2$…

Group Theory · Mathematics 2025-10-07 Liam Hanany , Alexander Lubotzky

We count the finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$. More precisely: each such subgroup $H$ can be represented by its Stallings graph $\Gamma(H)$, we consider the number of vertices of $\Gamma(H)$ to…

Group Theory · Mathematics 2022-01-03 Frédérique Bassino , Cyril Nicaud , Pascal Weil

We show that an arithmetic lattice $\Gamma$ in a semi-simple Lie group $G$ contains a torsion-free subgroup of index $\delta(v)$ where $v = \mu (G/\Gamma)$ is the co-volume of the lattice. We prove that $\delta$ is polynomial in general and…

Group Theory · Mathematics 2024-02-22 Tsachik Gelander , Raz Slutsky

We study the largest component of a random (multi)graph on n vertices with a given degree sequence. We let n tend to infinity. Then, under some regularity conditions on the degree sequences, we give conditions on the asymptotic shape of the…

Combinatorics · Mathematics 2007-07-13 Svante Janson , Malwina Luczak

Let $G$ be a connected, real semisimple Lie group. Let $K<G$ be maximal compact, and let $\Gamma < G$ be discrete and such that $\Gamma \backslash G$ has finite volume. If the real rank of $G$ is $1$ and $\Gamma$ is torsion-free, then…

K-Theory and Homology · Mathematics 2025-05-06 Hao Guo , Peter Hochs , Hang Wang

A $k$-configuration is a collection of $k$ distinct integers $x_1,\ldots,x_k$ together with their pairwise arithmetic means $\frac{x_i+x_j}{2}$ for $1 \leq i < j \leq k$. Building on recent work of Filmus, Hatami, Hosseini and Kelman on…

Number Theory · Mathematics 2025-01-20 Adrian Beker

In this two part work we prove that for every finitely generated subgroup $\Gamma < \text{Out}(F_n)$, either $\Gamma$ is virtually abelian or $H^2_b(\Gamma;\mathbb{R})$ contains an embedding of $\ell^1$. The method uses actions on…

Group Theory · Mathematics 2025-03-12 Michael Handel , Lee Mosher

Erd\H{o}s, Hajnal and Szemer\'{e}di proved that any subset $G$ of vertices of a shift graph $\text{Sh}_{n}^{k}$ has the property that the independence number of the subgraph induced by $G$ satisfies $\alpha(\text{Sh}_{n}^{k}[G])\geq…

Combinatorics · Mathematics 2021-11-24 Andrii Arman , Vojtěch Rödl , Marcelo Tadeu Sales

Let $G$ be the group of automorphisms of a free group $F_\infty$ of infinite order. Let $H$ be the stabilizer of first $m$ generators of $F_\infty$. We show that the double cosets of $\Gamma$ with respect to $H$ admit a natural semigroup…

Group Theory · Mathematics 2017-08-08 Yury Neretin

In this paper, we improve the results in the author's previous paper \cite{Usu22}, which deals with the quantitative problem on Littlewood's conjecture. We show that, for any $0<\gamma<1$, any $(\alpha,\beta)\in\mathbb{R}^2$ except on a set…

Number Theory · Mathematics 2024-04-23 Shunsuke Usuki

Let $X = G/\Gamma$, where $G$ is a Lie group and $\Gamma$ is a lattice in $G$, let $U$ be an open subset of $X$, and let $\{g_t\}$ be a one-parameter subgroup of $G$. Consider the set of points in $X$ whose $g_t$-orbit misses $U$; it has…

Dynamical Systems · Mathematics 2021-10-22 Dmitry Kleinbock , Shahriar Mirzadeh

The Cayley sum graph $\Gamma_A$ of a set $A \subseteq \mathbb{Z}_n$ is defined to have vertex set $\mathbb{Z}_n$ and an edge between two distinct vertices $x, y \in \mathbb{Z}_n$ if $x + y \in A$. Green and Morris proved that if the set $A$…

Combinatorics · Mathematics 2024-12-05 Marcelo Campos , Gabriel Dahia , João Pedro Marciano

For a finitely generated group $\Gamma$ denote by $\mu(\Gamma)$ the growth coefficient of $\Gamma$, that is, the infimum over all real numbers $d$ such that $s_n(\Gamma)<n!^d$. We show that the growth coefficient of a virtually free group…

Group Theory · Mathematics 2011-05-09 Jan-Christoph Schlage-Puchta

Let $N$ be a fixed positive integer, and let $f\in S_k(N)$ be a primitive cusp form given by the Fourier expansion $f(z)=\sum_{n=1}^{\infty} \lambda_f(n)n^{\frac{k-1}{2}}e(nz)$. We consider the partial sum $S(x,f)=\sum_{n\leq…

Number Theory · Mathematics 2023-08-15 Claire Frechette , Mathilde Gerbelli-Gauthier , Alia Hamieh , Naomi Tanabe

We investigate quantitative aspects of the LEF property for subgroups of the topological full group $[[ \sigma ]]$ of a two-sided minimal subshift over a finite alphabet, measured via the LEF growth function. We show that the LEF growth of…

Group Theory · Mathematics 2023-07-19 Henry Bradford , Daniele Dona

Let $\Gamma$ be a countable discrete group, $H$ a lcsc totally disconnected group and $\rho : \Gamma \rightarrow H$ a homomorphism with dense image. We develop a general and explicit technique which provides, for every compact open subgroup…

Dynamical Systems · Mathematics 2020-06-30 Michael Björklund , Yair Hartman , Hanna Oppelmayer

The Lov\'{a}sz Local Lemma is a very powerful tool in probabilistic combinatorics, that is often used to prove existence of combinatorial objects satisfying certain constraints. Moser and Tardos have shown that the LLL gives more than just…

Combinatorics · Mathematics 2019-09-13 Anton Bernshteyn

We prove that given a finite rank free group $\mathbb{F}$ of rank $\geq 3$ and two exponentially growing outer automorphisms $\psi$ and $\phi$ with dual lamination pairs $\Lambda^\pm_\psi$ and $\Lambda^\pm_\phi$ associated to them, and…

Group Theory · Mathematics 2018-05-15 Pritam Ghosh

A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph $G$ with no minor isomorphic to a fixed graph $H$ has a certain structure. The structure can then be exploited to deduce far-reaching…

Combinatorics · Mathematics 2021-01-05 Ken-ichi Kawarabayashi , Robin Thomas , Paul Wollan
‹ Prev 1 4 5 6 7 8 10 Next ›