Related papers: Quasi-isometric Higman embeddings and the Dehn fun…
In this paper, we study lower bounds on the K-theory of the maximal $C^*$-algebra of a discrete group based on the amount of torsion it contains. We call this the finite part of the operator K-theory and give a lower bound that is valid for…
We give an infinite family of monoids $\Pi_N$ (for $N=2, 3, \dots$), each with a single defining relation of the form $bUa = a$, such that the Dehn function of $\Pi_N$ is at least exponential. More precisely, we prove that the Dehn function…
We introduce and investigate different definitions of effective amenability, in terms of computability of F{\o}lner sets, Reiter functions, and F{\o}lner functions. As a consequence, we prove that recursively presented amenable groups have…
The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…
We prove that groups in a certain class of metabelian locally compact groups, have quadratic Dehn function. As an application, we embed the solvable Baumslag-Solitar groups into finitely presented metabelian groups with quadratic Dehn…
Embeddings of word structures into matrix semigroups provide a natural bridge between combinatorics on words and linear algebra. However, low-dimensional matrix semigroups impose strong structural restrictions on possible embeddings.…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
We define a numerical quasi-isometry invariant of a finitely generated group, whose values parametrize the difference between the group being uniformly embeddable in a Hilbert space and the reduced C*-algebra of the group being exact.
We describe sufficient conditions which guarantee that a finite set of mapping classes generate a right-angled Artin group quasi-isometrically embedded in the mapping class group. Moreover, under these conditions, the orbit map to…
We observe that a function on a group equipped with a bi-invariant word metric is Lipschitz if and only if it is a partial quasimorphism bounded on the generating set. We also show that an undistorted element is always detected by an…
Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous results cover only a few specific instances of this general…
We construct a finitely presented group with property (T) which can not act on on reasonable spaces. Such group is constructed using an generalization of Hall embedding theorem, where property (T) is added at the expense of weakening the…
We say that a finitely generated group $G$ has property (QT) if it acts isometrically on a finite product of quasi-trees so that orbit maps are quasi-isometric embeddings. A quasi-tree is a connected graph with path metric quasi-isometric…
In this work we introduce a new succinct variant of the word problem in a finitely generated group $G$, which we call the power word problem: the input word may contain powers $p^x$, where $p$ is a finite word over generators of $G$ and $x$…
It was shown by Gersten that a central extension of a finitely generated group is quasi-isometrically trivial provided that its Euler class is bounded. We say that a finitely generated group $G$ satisfies Property QITB (quasi-isometrically…
If G is a finitely generated group, and A an algebraic group, then Hom(G,A) is a possibly reducible algebraic variety denoted by R_A(G). Here we define the profile function, P_d(R_A(G)), of the representation variety of G over A to be…
Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…
The representation zeta function of a profinite group $G$ encodes the distribution of continuous irreducible complex representations of $G$ as a function of the dimension. Its abscissa of convergence $\alpha(G)$ describes the polynomial…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
Let $G$ be a finitely generated group, and let $\Sigma$ be a finite subset that generates $G$ as a monoid. The \emph{word problem of $G$ with respect to $\Sigma$} consists of all words in the free monoid $\Sigma^{\ast}$ that are equal to…