Related papers: Random groups and nonarchimedean lattices

Let Gamma be an S-arithmetic subgroup of a solvable algebraic group G over an algebraic number field F, such that the finite set S contains at least one place that is nonarchimedean. We construct a certain group H, such that if L is any…

Following [Botur, M., Chajda, I., Hala\v{s}, R.: Are basic algebras residuated structures?, Soft Comput. 14 (2010), 251-255] we discuss the connections between left-residuated partially ordered groupoids and the so-called basic algebras,…

Random graphs offer a useful mathematical representation of a variety of real world complex networks. Exponential random graphs, for example, are particularly suited towards generating random graphs constrained to have specified statistical…

We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…

Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…

We revise the enumeration of the imprimitive rank two quaternionic reflection groups, adding missing groups and establishing isomorphisms between groups in the published tables. The isomorphisms are obtained as a consequence of the…

The space of deformations of the integer Heisenberg group under the action of $\textrm{Aut}(H(\mathbb{R}))$ is a homogeneous space for a non-reductive group. We analyze its structure as a measurable dynamical system and obtain mean and…

Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a…

By the planarity rank of a semigroup variety we mean the largest number of generators of a free semigroup of a variety with respect to which the semigroup admits a planar Cayley graph. Since the time when L.M.Martynov formulated the problem…

We show that low-density random quotients of cubulated hyperbolic groups are again cubulated (and hyperbolic). Ingredients of the proof include cubical small-cancellation theory, the exponential growth of conjugacy classes, and the…

Let $\Gamma$ be a torsion-free hyperbolic group. We study $\Gamma$--limit groups which, unlike the fundamental case in which $\Gamma$ is free, may not be finitely presentable or geometrically tractable. We define model $\Gamma$--limit…

The theoretical existence of non-classical Schottky groups is due to Marden. Explicit examples of such kind of groups are only known in rank two, the first one by by Yamamoto in 1991 and later by Williams in 2009. In 2006, Maskit and the…

We introduce a new class of locally compact groups, namely the strongly compactly covered groups, which are the Hausdorff topological groups $G$ such that every element of $G$ is contained in a compact open normal subgroup of $G$. For…

We propose new classes of random matrix ensembles whose statistical properties are intermediate between statistics of Wigner-Dyson random matrices and Poisson statistics. The construction is based on integrable N-body classical systems with…

Central limit theorems for the log-volume of a class of random convex bodies in $\mathbb{R}^n$ are obtained in the high-dimensional regime, that is, as $n\to\infty$. In particular, the case of random simplices pinned at the origin and…

We prove that the lattice of normal subgroups of ultraproducts of compact simple non-abelian groups is distributive. In the case of ultraproducts of finite simple groups or compact connected simple Lie groups of bounded rank the set of…

Asymptotic properties of finitely generated subgroups of free groups, and of finite group presentations, can be considered in several fashions, depending on the way these objects are represented and on the distribution assumed on these…

Random graph (RG) models play a central role in the complex networks analysis. They help to understand, control, and predict phenomena occurring, for instance, in social networks, biological networks, the Internet, etc. Despite a large…

Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…

We investigate interactions between Ramsey theory, topological dynamics, and model theory. We introduce various Ramsey-like properties for first order theories and characterize them in terms of the appropriate dynamical properties of the…