Related papers: A generalization of a question asked by B. H. Neum…

A celebrated unresolved conjecture of Peter Frankl states that every finite union-closed collection of sets ($B$), with non-empty universe, admits an abundant element. The best result in the literature states that if $|B|=n$, then there…

Given a finite group $G$, we say that $G$ has weak normal covering number $\gamma_w(G)$ if $\gamma_w(G)$ is the smallest integer with $G$ admitting proper subgroups $H_1,\ldots,H_{\gamma_w(G)}$ such that each element of $G$ has a conjugate…

We show that for any finitely generated group of matrices that is not virtually solvable, there is an integer m such that, given an arbitrary finite generating set for the group, one may find two elements a and b that are both products of…

Let $ n, q $ be positive integers. We show that if $ G $ is a finitely generated residually finite group satisfying the identity $ [x,_ny^q]\equiv 1, $ then there exists a function $ f(n) $ such that $ G $ has a nilpotent subgroup of finite…

A classical theorem of R. Baer describes the nilpotent radical of a finite group G as the set of all Engel elements, i.e. elements y in G such that for any x in G the n-th commutator [x,y,...,y] equals 1 for n big enough. We obtain a…

We say that a group $G$ is almost Engel if for every $g\in G$ there is a finite set ${\mathscr E}(g)$ such that for every $x\in G$ all sufficiently long commutators $[...[[x,g],g],\dots ,g]$ belong to ${\mathscr E}(g)$, that is, for every…

A finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is attained, the word $w$ is called rich. An infinite word $w$ is called rich if every finite factor of $w$ is rich. Let $w$ be a word…

Let $R_n(G)$ denotes the set of all right $n$-Engel elements of a group $G$. We show that in any group $G$ whose 5th term of lower central series has no element of order 2, $R_3(G)$ is a subgroup. Furthermore we prove that $R_4(G)$ is a…

Using combinatorial techniques, we answer two questions about simple classical Lie groups. Define $N(G,m)$ to be the number of conjugacy classes of elements of finite order $m$ in a Lie group $G$, and $N(G,m,s)$ to be the number of such…

We construct inner amenable groups G with infinite conjugacy classes and such that the associated II_1 factor does not have property Gamma of Murray and von Neumann. This solves a problem posed by Effros in 1975.

Let G be a finite quasisimple group of Lie type. We show that there are regular semisimple elements x,y in G, x of prime order, and |y| is divisible by at most two primes, such that the product of the conjugacy classes of x and y contain…

Recently, Baumslag and Wiegold proved that a finite group $G$ is nilpotent if and only if $o(xy)=o(x)o(y)$ for every $x,y\in G$ of coprime order. Motivated by this result, we study the groups with the property that $(xy)^G=x^Gy^G$ and those…

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the least number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We prove that there is a positive constant $c$…

An old problem in group theory is that of describing how the order of an element behaves under multiplication. To generalize some classical bounds concerning the order $\mathrm o(ab)$ of two elements $a, b$ in a finite abelian group to the…

A word $w$ is called rich if it contains $| w|+1$ palindromic factors, including the empty word. We say that a rich word $w$ can be extended in at least two ways if there are two distinct letters $x,y$ such that $wx,wy$ are rich. Let $R$…

Let $D$ be a division ring with infinite center, $n$ be a positive integer and $w(x_1,x_2,\cdots, x_m)=1$ be a generalized group identity over the general linear group $\GL_n(D)$. The aim of this paper is to prove that every subnormal…

Let $G$ be a finite group and $N_{\Omega}(G)$ be the intersection of the normalizers of all subgroups belonging to the set $\Omega(G),$ where $\Omega(G)$ is a set of all subgroups of $G$ which have some theoretical group property. In this…

An infinite family of graphs ${\cal F}$ is called feasible if for any pair of integers $(n,m)$, $n \geq 1$, $0 \leq m \leq \binom{n}{2}$, there is a member $G \in {\cal F}$ such that $G$ has $n$ vertices and $m$ edges. We prove that given a…

For all sufficiently large odd integers $n$, the following version of Higman's embedding theorem is proved in the variety ${\cal B}_n$ of all groups satisfying the identity $x^n=1$. A finitely generated group $G$ from ${\cal B}_n$ has a…

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…