Related papers: Balanced walls for random groups

Given a finitely generated amenable group we consider ergodic random Schr\"odinger operators on a Cayley graph with random potentials and random boundary conditions. We show that the normalised eigenvalue counting functions of finite volume…

We perform a detailed investigation of the statistical properties of the projected distribution of galaxy clusters obtained in Cold Dark Matter (CDM) models with both Gaussian and skewed primordial density fluctuations. We use N-body…

If a class of finitely generated groups Curly(G) is closed under isometric amalgamations along free subgroups, then every G in Curly(G) can be quasi-isometrically embedded in a group Hat(G) in Curly(G) that has no proper subgroups of finite…

A finite group $G$ is called $C$-quasirandom (by Gowers) if all non-trivial irreducible complex representations of $G$ have dimension at least $C$. For any unit $\ell^{2}$ function on a finite group we associate the quantum probability…

Let X be a proper CAT(0) space. A halfspace system (or cubulation) of X is a set H of open halfspaces closed under closure-complementation and such that every point in X has a neighbourhood intersecting only finitely many walls of H. Given…

Loop groups G as families of mappings of the complex manifold M into another complex manifold N preserving marked points $s_0\in M$ and $y_0\in N$ are investigated. Quasi-invariant measures $\mu $ on G relative to dense subgroups $G'$ are…

We show that for a large class of finite groups G, the number of Galois extensions E/Q of group G and discriminant $|d_E|\leq y$ grows like a power of $y$ (for some specified exponent). The groups G are the regular Galois groups over Q and…

Malle proposed a conjecture for counting the number of $G$-extensions $L/K$ with discriminant bounded above by $X$, denoted $N(K,G;X)$, where $G$ is a fixed transitive subgroup $G\subset S_n$ and $X$ tends towards infinity. We introduce a…

To every Gromov hyperbolic space X one can associate a space at infinity called the Gromov boundary of X. Gromov showed that quasi-isometries of hyperbolic metric spaces induce homeomorphisms on their boundaries, thus giving rise to a…

We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…

Given a group $G$, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of $G$ where each element of $G$ is included in the generating set independently at random with probability $p$. In this article, we…

For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…

We construct new families of quasimorphisms on many groups acting on CAT(0) cube complexes. These quasimorphisms have a uniformly bounded defect of 12, and they "see" all elements that act hyperbolically on the cube complex. We deduce that…

We consider models of random groups in which the typical group is of intermediate rank (in particular, it is not hyperbolic). These models are parallel to M. Gromov's well-known constructions and include for example a "density model" for…

We consider robust covariance estimation with group symmetry constraints. Non-Gaussian covariance estimation, e.g., Tyler scatter estimator and Multivariate Generalized Gaussian distribution methods, usually involve non-convex minimization…

A group G is called bounded if every conjugation-invariant norm on G has finite diameter. We introduce various strengthenings of this property and investigate them in several classes of groups including semisimple Lie groups, arithmetic…

We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…

The past decade highlighted the usefulness of social network simulations that run on k-regular, n-size, connected graphs. These can be seen as small-scale models of human social networks of large societies. By narrowing down onto k-regular…

We give sharp bounds in Breuillard, Green and Tao's finitary version of Gromov's theorem on groups with polynomial growth. Precisely, we show that for every non-negative integer d there exists $c=c(d)>0$ such that if $G$ is a group with…

Gromov's theorem states that a finitely generated group has polynomial growth if and only if it is virtually nilpotent. A key ingredient in its proof is the small doubling property. In this work, we study entropy analogues of this property…