Related papers: Diagrams with Selection and Method for Constructin…

We construct an infinite family of connected, 2-generated Cayley digraphs Cay(G;a,b) that do not have hamiltonian paths, such that the orders of the generators a and b are arbitrarily large. We also prove that if G is any finite group with…

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

In this short note we prove that, if $p$ is an odd prime dividing the order of a sporadic simple group, then with the exception of four groups for $p=3$, all sporadic simple groups are generated by an involution and an element of order $p$.

Groups, in which every subgroup containing some fixed primary cyclic subgroup has a complement, are investigated.

It is well known that every finite simple group has a generating pair. Moreover, Guralnick and Kantor proved that every finite simple group has the stronger property, known as $\frac{3}{2}$-generation, that every nontrivial element is…

We provide an example of a non-finitely generated group which admits a nonempty strongly aperiodic SFT. Furthermore, we completely characterize the groups with this property in terms of their finitely generated subgroups and the roots of…

We prove that every finitely-generated group of homeomorphisms of the 2-dimensional sphere all of whose elements have a finite order which is a power of 2 and so that there exists a uniform bound for the order of group elements is finite.…

We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…

We show that any free product of two countable groups, one of them being infinite, admits a faithful and homogeneous action on the Random Graph. We also show that a large class of HNN extensions or free products, amalgamated over a finite…

We prove in Theorem $2.2$ that the multiplicatively closed subset generated by at most two elements in the set of natural numbers $\mathbb{N}$ has arbitrarily large gaps by explicitly constructing large integer intervals with known prime…

We prove that the palindromic width of HNN extension of a group by proper associated subgroups is infinite. We also prove that the palindromic width of the amalgamated free product of two groups via a proper subgroup is infinite (except…

Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…

We construct a 2-generator recursively presented group with infinite torsion length. We also explore the construction in the context of solvable and word-hyperbolic groups.

In this paper we define Ordered Generating System for finite non-abelian groups, which is a generalization of the basis theorem for finite abelian groups. We prove the following: If each composition factor of a group G has Ordered…

We prove that every finite simple group of Lie type $G$ can be generated by three regular unipotent elements. In certain cases we show that two regular unipotents are sufficient to generate $G$.

We classify simple groups that act by birational transformations on compact complex K\"ahler surfaces. Moreover, we show that every finitely generated simple group that acts non-trivially by birational transformations on a projective…

A recent conjecture of the author and Teng Fang states that there are only finitely many finite simple groups with no cubic graphical regular representation. In this paper, we make a crucial progress towards this conjecture by giving an…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

It was shown that in a group of bijections of an infinite set some families of subsets, related to the cardinality of some eigenspaces, are generating. Besides, we derived a criterion for generating by sets of this kind.

All groups have 2 generators. For every prime power q, the Generalized Burnside Theorem (Theorem GB) produces an infinite number of solvable groups, Some, such as groups of a prime power exponent, have only elements of finite order and are…