Related papers: Some remarks on depth of dead ends in groups

Consider a one-ended word-hyperbolic group. If it is the fundamental group of a graph of free groups with cyclic edge groups then either it is the fundamental group of a surface or it contains a finitely generated one-ended subgroup of…

In this paper we investigate metric properties of the groups $\Gamma_d(q)$ whose Cayley graphs are the Diestel-Leader graphs $DL_d(q)$ with respect to a given generating set $S_{d,q}$. These groups provide a geometric generalization of the…

A graph is said to be uniquely hamiltonian if it has a unique hamiltonian cycle. For a natural extension of this concept to infinite graphs, we find all uniquely hamiltonian vertex-transitive graphs with finitely many ends, and also discuss…

A group is known as `large' if some finite index subgroup admits a surjective homomorphism onto a non-abelian free group. In this paper, we give a necessary and sufficient condition for a finitely presented group to be large, in terms of…

For every $n \geq 1$, let $(\mathrm{FW}_n)$ denote the fixed-point property for median graphs of cubical dimension $n$ (or equivalently, for CAT(0) cube complexes of dimension $n$). In this article, we construct explicit examples of groups…

Motivated by the open problem of exhibiting a subset of Euclidean space which has no exponential Riesz basis, we focus on exponential Riesz bases in finite abelian groups. We point out that that every subset of a finite abelian group has…

Let $\mathbb {F}_q$ be a finite field and $G$ a finte group with $(|G|,q)=1$. By a group code in $\mathbb {F}_q[G]$ we mean a two-sided ideal in $\mathbb {F}_q[G]$. We will prove a general criterion for the existence of group codes with…

We study fundamental groups of non compact Riemannian manifolds. We find conditions which ensure that the fundamental group is trivial, finite or finitely generated.

A finitely presented group is weakly geometrically simply connected (wgsc) if it is the fundamental group of some compact polyhedron whose universal covering is wgsc i.e. it has an exhaustion by compact connected and simply connected…

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…

The additivity with respect to exact sequences is notoriously a fundamental property of the algebraic entropy of group endomorphisms. It was proved for abelian groups by deeply exploiting their structure. On the other hand, a solvable…

A group is small if it has countably many complete $n$-types over the empty set for each natural number n. More generally, a group $G$ is weakly small if it has countably many complete 1-types over every finite subset of G. We show here…

A variety of groups does not contain all metabelian groups if and only if there is an absolute bound for the nilpotency classes of powerful $p$-groups in the given variety. Similarly, a variety contains only finitely many finite $p$-groups…

A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that its automorphism group ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple…

We define a notion of depth for an inclusion of multimatrix algebras B < A based on a comparison of powers of the induction-restriction table M (and its transpose matrix). This notion of depth coincides with the depth from [Kadison, 2008].…

We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…

By analogy with the Cayley graph of a group with respect to a finite generating set or the Cayley--Abels graph of a totally disconnected, locally compact group, we detail countable connected graphs associated to Polish groups that we term…

We characterize the finitely generated groups that admit a Cayley graph whose only automorphisms are the translations, confirming a conjecture by Watkins from 1976. The proof relies on random walk techniques. As a consequence, every…