Related papers: Random Groups at Density $d<1/2$: Sharp Length Ine…

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

An arbitrary homomorphism between groups is nonincreasing for stable commutator length, and there are infinitely many (injective) homomorphisms between free groups which strictly decrease the stable commutator length of some elements.…

Our main result is a robust generalisation of the Cockayne-Lorimer theorem on the multicolour Ramsey number of matchings. It is moreover a generalisation of the transference generalisation of Cockayne-Lorimer, which (informally) says that…

It has long been known that particles with short-range repulsive interactions in spatial dimension d=1 form universal quantum liquids in the low density limit: all properties can be related to those of the spinless free Fermi gas. Previous…

Let $w=w(x_1,\ldots,x_r)$ be a lower central word or a derived word. We show that the word $w(u_1,\ldots,u_r)$ is concise whenever $u_1,\ldots,u_r$ are non-commutator words in disjoint sets of variables, thus proving a generalized version…

Let $G, G_1,\dots,G_N$ be independent copies of a standard gaussian random vector in $\mathbb{R}^d$ and denote by $\Gamma = \sum_{i=1}^N \langle G_i,\cdot\rangle e_i$ the standard gaussian ensemble. We show that, for any set $A\subset…

According to the well-known Heyde theorem, the Gaussian distribution on the real line is characterized by the symmetry of the conditional distribution of one linear form of $n$ independent random variables given another. In the article, we…

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…

We obtain assumption-free, non-asymptotic, uniform bounds on the product of the height and the width of uniformly random trees with a given degree sequence, conditioned Bienaym\'e trees and simply generated trees. We show that for a tree of…

Given a finitely presented group $Q,$ we produce a short exact sequence $1\to N \hookrightarrow G \twoheadrightarrow Q \to 1$ such that $G$ is a torsion-free Gromov hyperbolic group without the unique product property and $N$ is without the…

Let $S=\Gamma\backslash \mathbb{H}$ be a hyperbolic surface of finite topological type, such that the Fuchsian group $\Gamma \le \operatorname{PSL}_2(\mathbb{R})$ is non-elementary, and consider any generating set $\mathfrak S$ of $\Gamma$.…

This article studies the infinite-width limit of deep feedforward neural networks whose weights are dependent, and modelled via a mixture of Gaussian distributions. Each hidden node of the network is assigned a nonnegative random variable…

Consider a sequence of Gibbsian line ensembles, whose lowest labeled curves (i.e., the edge) have tight one-point marginals. Then, given certain technical assumptions on the nature of the Gibbs property and underlying random walk measure,…

In his proof of the fundamental lemma, Ng\^o established the product formula for the Hitchin fibration over the anisotropic locus. One expects this formula over the larger generically regular semisimple locus, and we confirm this by…

We prove an asymptotically tight bound on the extremal density guaranteeing subdivisions of bounded-degree bipartite graphs with a mild separability condition. As corollaries, we answer several questions of Reed and Wood on embedding sparse…

A sharp, distribution free, non-asymptotic result is proved for the concentration of a random function around the mean function, when the randomization is generated by a finite sequence of independent data and the random functions satisfy…

We prove a central limit theorem for non-commutative random variables in a von Neumann algebra with a tracial state: Any non-commutative polynomial of averages of i.i.d. samples converges to a classical limit. The proof is based on a…

Let $M$ be a random $m \times n$ matrix with binary entries and i.i.d. rows. The weight (i.e., number of ones) of a row has a specified probability distribution, with the row chosen uniformly at random given its weight. Let $N(n,m)$ denote…

Recently, Cochran and Harvey defined torsion-free derived series of groups and proved an injectivity theorem on the associated torsion-free quotients. We show that there is a universal construction which extends such an injectivity theorem…

By now, we have a product theorem in every finite simple group $G$ of Lie type, with the strength of the bound depending only in the rank of $G$. Such theorems have numerous consequences: bounds on the diameters of Cayley graphs, spectral…