Related papers: Random groups and nonarchimedean lattices

We study endomorphisms of a free group of finite rank by means of their action on specific sets of elements. In particular, we prove that every endomorphism of the free group of rank 2 which preserves an automorphic orbit (i.e., acts ``like…

The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. This paper gives a preliminary insight into Kolmogorov's…

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

The group of 2-by-2 matrices with integer entries and determinant $\pm > 1$ can be identified either with the group of outer automorphisms of a rank two free group or with the group of isotopy classes of homeomorphisms of a 2-dimensional…

We investigate which higher rank simple Lie groups admit profinitely but not abstractly commensurable lattices. We show that no such examples exist for the complex forms of type $E_8$, $F_4$, and $G_2$. In contrast, there are arbitrarily…

In this paper we initiate a study of first-order rich groups, i.e., groups where the first-order logic has the same power as the weak second order logic. Surprisingly, there are quite a lot of finitely generated rich groups, they are…

Given a positive definite even lattice and a commutative ring, there is a standard construction of a lattice vertex algebra over the commutative ring, and it admits a natural grading by non-negative integers. We describe the groups of…

We call a finitely generated group lacunary hyperbolic if one of its asymptotic cones is an R-tree. We characterize lacunary hyperbolic groups as direct limits of Gromov hyperbolic groups satisfying certain restrictions on the hyperbolicity…

The determination of the density functions for products of random elements from specified classes of matrices is a basic problem in random matrix theory and is also of interest in theoretical physics. For connected simple Lie groups of…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

The aim of this work is to understand some of the asymptotic properties of sequences of lattices in a fixed locally compact group. In particular we will study the asymptotic growth of the Betti numbers of the lattices renormalized by the…

For real hyperbolic spaces, the dynamics of individual isometries and the geometry of the limit set of nonelementary discrete isometry groups have been studied in great detail. Most of the results were generalised to discrete isometry…

We consider the properties of vibrational dynamics on random networks, with random masses and spring constants. The localization properties of the eigenstates contrast greatly with the Laplacian case on these networks. We introduce several…

We are concerned with orderable groups and particularly those with orderings invariant not only under multiplication, but also under a given automorphism or family of automorphisms. Several applications to topology are given: we prove that…

We establish an arithmeticity vs. non-linearity alternative for irreducible lattices in suitable product groups, such as for instance products of topologically simple groups. This applies notably to a (large class of) Kac-Moody groups. The…

In this paper we use techniques from convex projective geometry to produce many new examples of thin subgroups of lattices in special linear groups that are isomorphic to the fundamental groups of finite volume hyperbolic manifolds. More…

We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…

In this note, we investigate fundamental relations between exploration processes in random graphs, and branching processes. We formulate a class of models that we call {\em rank-$k$ random graphs}, and that are special in that their…

Recently, the search for topological states of matter has turned to non-Hermitian systems, which exhibit a rich variety of unique properties without Hermitian counterparts. Lattices modeled through non-Hermitian Hamiltonians appear in the…

We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…