Related papers: Membership Problem in groups acting freely on Z^n-…
This is an expository paper aimed to outline the current situation with problems related with the occurrence of eigenvalue $1$ of elements in linear groups and group representations.
We give a lower bound on the expected degree of the free minimal spanning forest of a vertex transitive graph in terms of its spectral radius. This result answers a question of Lyons-Peres-Schramm and simplifies the Gaboriau-Lyons proof of…
We show that free Burnside groups of sufficiently large odd exponent are non--amenable in a certain strong sense, more precisely, their left regular representations are isolated from the trivial representation uniformly on finite generating…
We present a new approach to the proof of ergodic theorems for actions of free groups based on geometric covering and asymptotic invariance arguments. Our approach can be viewed as a direct generalization of the classical geometric covering…
We show that every group with free $\mathbb{Z}^n$-length function is CAT(0).
We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural…
For a finitely generated group $G$ the Nielsen graph $N_n(G)$, $n\geq \operatorname{rank}(G)$, describes the action of the group $\operatorname{Aut}F_n$ of automorphisms of the free group $F_n$ on generating $n$-tuples of G by elementary…
In this article, we consider actions of \mathcal{Z}_+^d, \mathcal{R}_+^d and finitely generated free groups on a von Neumann algebras $M$ and prove a version of maximal ergodic inequality. Additionally, we establish non-commutative…
We consider a family of 2-step nilpotent Lie algebras associated to uniform complete graphs on odd number of vertices. We prove that the symmetry group of such a graph is the holomorph of the additive cyclic group $\Z_n$. Moreover, we prove…
We present a simple technique that allows to generate Feynman diagrams for vector models with interactions of order $2n$ and similar models (Gross-Neveu, Thirring model), using a bootstrap equation that uses only the free field value of the…
We extend Burger--Mozes theory of closed, non-discrete, locally quasiprimitive automorphism groups of locally finite, connected graphs to the semiprimitive case, and develop a generalization of Burger--Mozes universal groups acting on the…
We provide an explicit computation of the cohomology groups (with untwisted coefficients) of semidirect products of the form $\mathbb{Z}^n\rtimes \mathbb{Z}/m$ with $m$ free of squares, by means of formulas that only depend on $n$, $m$ and…
We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the DGM net. The recursions allow for many large-scale properties…
In this article, we study geometric properties of nilpotent groups. We find a geometric criterion for the word problem for the finitely generated free nilpotent groups. By geometric criterion, we mean a way to determine whether two words…
If Gamma is any finite graph, then the unlabelled configuration space of n points on Gamma, denoted UC^n(Gamma), is the space of n-element subsets of Gamma. The braid group of Gamma on n strands is the fundamental group of UC^n(Gamma). We…
In this paper, we generalize the tools that were introduced in [Dar19b] in order to study the Andreadakis problem for subgroups of IAn. In particular, we study the behaviour of the Andreadakis problem when we add inner automorphisms to a…
By using a notion of a geometric Dehn twist in $\sharp_k(S^2 \times S^1)$, we prove that when projections of two $\mathbb{Z}$-splittings to the free factor complex are far enough from each other in the free factor complex, Dehn twist…
We give an algorithm to solve the Conjugacy Problem for ascending HNN-extensions of free groups. To do this, we give algorithms to solve certain problems on dynamics of free group endomorphisms.
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.…
Let $G$ be a fundamental group of a graph of group where the graph is a rose or a star graph and the vertex groups are free groups, free abelian groups or right-angled Artin groups. We prove the linearity of $G$ over $\mathbb{Z}$ under…