Related papers: Minimal partition-free groups

In this article we give a sufficient and necessary condition to determine wether or not an element of the free group induces a non-trivial element of the free Burnside group of sufficiently large odd exponent. This criterion can be stated…

We associate a graph $\Gamma_G$ to a non locally cyclic group $G$ (called the non-cyclic graph of $G$) as follows: take $G\backslash Cyc(G)$ as vertex set, where $Cyc(G)=\{x\in G | \left<x,y\right> \text{is cyclic for all} y\in G\}$, and…

Given a set A of non-negative integers and a set B of positive integers,we are interested in computing all sets C (of positive integers) that are minimal in the family of sets K (of positive integers) such that (i) K contains no elements…

A ring A is called presimplifiable if whenever a; b belongs to A and a = ab, then either a = 0 or b is a unit in A. Let A be a commutative ring and G be an abelian torsion group. For the group ring A[G], we prove that A[G] is…

We say that a finite group $G$ satisfies the independence property if, for every pair of distinct elements $x$ and $y$ of $G$, either $\{x,y\}$ is contained in a minimal generating set for $G$ or one of $x$ and $y$ is a power of the other.…

Let G be an exceptional algebraic group defined over an algebraically closed field k of characteristic p>0 and let H be a subgroup of G. Then following Serre we say H is G-completely reducible or G-cr if, whenever H is contained in a…

We prove that for every graph $H$, if a graph $G$ has no (odd) $H$ minor, then its vertex set $V(G)$ can be partitioned into three sets $X_1$, $X_2$, $X_3$ such that for each~$i$, the subgraph induced on $X_i$ has no component of size…

We know that any finite abelian group $G$ appears as a subgroup of infinitely many multiplicative groups $\mathbb{Z}_n^\times$ (the abelian groups of size $\phi(n)$ that are the multiplicative groups of units in the rings…

The minimal faithful permutation degree $\mu(G)$ of a finite group $G$ is the least integer $n$ such that $G$ is isomorphic to a subgroup of the symmetric group $S_n$. If $G$ has a normal subgroup $N$ such that $\mu(G/N) > \mu(G)$, then $G$…

An irredundant cover of a finite group $G$ is a collection of proper subgroups whose union is $G$ and which contains no smaller subcover. We classify finite groups which possess exactly two irredundant covers, thereby initiating an answer…

Let G be the free product of groups A and B with commuting subgroups H \leqslant A and K \leqslant B, and let C be the class of all finite groups or the class of all finite p-groups. We derive the description of all C-separable cyclic…

Let $G$ be a finite group and denote by $o(g)$ the order of an element $g\in G$. We say that $G$ is an $LCM$-group if $o(x^ny)$ is a divisor of the least common multiple of $o(x^n)$ and $o(y)$ for all $x, y\in G$ and $n\in\mathbb{N}$. This…

A group is called metahamiltonian if all non-abelian subgroups of it are normal. This concept is a natural generation of Hamiltonian groups. In this paper, a complete classification of finite metahamiltonian $p$-groups is given.

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$ and $G$ a finite group. $G$ is said to be \emph{$\sigma$-soluble} if every chief factor $H/K$ of $G$ is a $\sigma_{i}$-group for some $i=i(H/K)$. A…

Let G be an abelian group and let lambda be the smallest rank of any group whose direct sum with a free group is isomorphic to G. If lambda is uncountable, then G has lambda pairwise disjoint, non-free subgroups. There is an example where…

Let $G$ be a finite group and $A$ be a subgroup of $G$. Then $A$ is called a $p$-$CAP$-subgroup of $G$, if $A$ covers or avoids every $pd$-chief factor of $G$. A subgroup $H$ of $G$ is said to be an $ICPC$-subgroup of $G$, if $H \cap [H,G]…

Let $G$ be a nonabelian group, $A\subseteq G$ an abelian subgroup and $n\geqslant 2$ an integer. We say that $G$ has an $n$-abelian partition with respect to $A$, if there exists a partition of $G$ into $A$ and $n$ disjoint commuting…

The intersection graph of a group $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 distinct vertices $H$…

We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with…

We prove that the group algebra $KG$ of a group $G$ over a field $K$ is primitive, provided that $G$ has a free subgroup with the same cardinality as $G$, and that $G$ satisfies the following condition $(\ast)$: for each subset $M$ of $G$…