Related papers: A note on Engel elements in the first Grigorchuk g…

The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…

We survey left 3-Engel elements in groups.

Let $G$ be a group. The intersection graph $\Gamma(G)$ of $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two…

Suppose a group $G$ acts properly on a simplicial complex $\Gamma$. Let $l$ be the number of $G$-invariant vertices and $p_1, p_2, ... p_m$ be the sizes of the $G$-orbits having size greater than 1. Then $\Gamma$ must be a subcomplex of…

Let $m,n$ be positive integers and $w$ a multilinear commutator word. Assume that $G$ is a finite group having subgroups $G_1,\ldots,G_m$ whose union contains all $w$-values in $G$. Assume further that all elements of the subgroups…

A well known question of Gromov asks whether every one-ended hyperbolic group $\Gamma$ has a surface subgroup. We give a positive answer when $\Gamma$ is the fundamental group of a graph of free groups with cyclic edge groups. As a result,…

A finite simplicial graph \Gamma determines a right-angled Artin group G_\Gamma, with generators corresponding to the vertices of \Gamma, and with a relation vw=wv for each pair of adjacent vertices. We compute the lower central series…

We show that if $G$ is a real semi-simple Lie group, and $\Gamma$ is a discrete subgroup of $G$ containing a subgroup $\Sigma$ acting ergodically (in a strong sense) on the Furstenberg boundary of $G$, then $\Gamma$ is not isomorphic to a…

For $\Gamma$ a group of order $mp$ for $p$ prime where $gcd(p,m)=1$, we consider those regular subgroups $N\leq Perm(\Gamma)$ normalized by $\lambda(\Gamma)$, the left regular representation of $\Gamma$. These subgroups are in one-to-one…

Engel groups and Engel elements became popular in 50s. We consider in the paper the more general nil-groups and nil-elements in groups. All these notions are related to nilpotent groups and nilpotent radicals in groups. These notions…

Given an integer $k\ge3$ and a group $G$ of odd order, if there exists a $2$-$(v,k,1)$-design and if $v$ is sufficiently large, then there is such a design whose automorphism group has a subgroup isomorphic to $G$. A weaker result is proved…

We prove new results on inheritance of Green's relations by subsemigroups in the presence of stability of elements. We provide counterexamples in other cases to show in particular that not all right-stable semigroups are embeddable in…

In this paper, we study different forbidden subgraph characterizations of the prime-order element graph $\Gamma(G)$ defined on a finite group $G$. Its set of vertices is the group $G$ and two vertices $x,y \in G$ are adjacent if the order…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…

Given a finitely-generated group G, and a finite group \Gamma, Philip Hall defined \delta_\Gamma to be the number of factor groups of G that are isomorphic to \Gamma. We show how to compute the Hall invariants by cohomological and…

While lattices in semi-simple Lie groups are studied very well, only little is known about discrete subgroups of infinite covolume. The main class of examples are Schottky groups. Here we investigate some new examples. We consider subgroups…

Let $\mathfrak{g}$ be a semisimple complex Lie algebra of finite dimension and $\mathfrak{h}$ be a semisimple subalgebra. We present an approach to find the branching rules for the pair $\mathfrak{g}\supset\mathfrak{h}$. According to an…

There is a procedure, due to Dani and Levcovitz, for taking a finite simplicial graph (\Gamma) and a subgraph (\Lambda) of its complement, checking some conditions, and, if satisfied, producing a graph (\Delta) such that the right-angled…

The distinguishing number $D(\Gamma)$ of a graph $\Gamma$ is the least size of a partition of the vertices of $\Gamma$ such that no non-trivial automorphism of $\Gamma$ preserves this partition. We show that if the automorphism group of a…

We deal with involution ordered semigroups possessing a greatest element, we introduce the concepts of $*$-regularity, $*$-intra-regularity, $*$-bi-ideal element and $*$-quasi-ideal element in this type of semigroups and, using the right…