Related papers: On Logically Cyclic Groups

We say that $M$ and $S$ form a \textsl{splitting} of $G$ if every nonzero element $g$ of $G$ has a unique representation of the form $g=ms$ with $m\in M$ and $s\in S$, while $0$ has no such representation. The splitting is called {\it…

In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.

In this paper we survey a new criteria for solvability of finite groups in terms of number of supersolvable (also known as polycyclic) and non-supersolvable subgroups. In particular, we present original examples of supersolvable groups such…

A finite group G is said to be a cut group if all central units in the integral group ring ZG are trivial. In this article, we extend the notion of cut groups, by introducing extended cut groups. We study the properties of extended cut…

Let $H$ be a subgroup of a group $G$. We say that $H$ satisfies the power condition with respect to $G$, or $H$ is a power subgroup of $G$, if there exists a non-negative integer $m$ such that $H=G^{m}=<g^{m} | g \in G >$. In this note, the…

A group is called capable if it is a central factor group. We consider the capability of finite groups of class two and exponent $p$, $p$ an odd prime. We restate the problem of capability as a problem about linear transformations, which…

This work is meant to demonstrate new class of prime numbers -- cyclic prime numbers, that can be derived from any prime number at certain numeric systems. Cyclic prime numbers are also related to the cyclic numbers and full reptend prime…

This contains a new version of the so-called non-commutative Gauss algorithm for polycyclic groups. Its results allow to read off the order and the index of a subgroup in an (possibly infinite) polycyclic group.

In this paper we introduce and study the concept of cyclic subgroup commutativity degree of a finite group $G$. This quantity measures the probability of two random cyclic subgroups of $G$ commuting. Explicit formulas are obtained for some…

In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.

We consider algebras with basis numerated by elements of a group $G.$ We fix a function $f$ from $G\times G$ to a ground field and give a multiplication of the algebra which depends on $f$. We study the basic properties of such algebras. In…

We study the number of cylic subgroups in finite groups and get that $G$ has $|G|-3$ cyclic subgroups if and only if $G \cong D_{10}$ or $Q_8$.

A matrix group is said to be permutation-like if any matrix of the group is similar to a permutation matrix. G. Cigler proved that, if a permutation-like matrix group contains a normal cyclic subgroup which is generated by a maximal cycle…

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

A subgroup $H$ of a finite group $G$ is submodular in $G$ if there is a subgroup chain $H=H_0\leq\ldots\leq H_i\leq H_{i+1}\leq \ldots \leq H_n=G$ such that $H_i$ is a modular subgroup of $H_{i+1}$ for every $i$. We investigate finite…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_kg)$ where $g\in G$ and $n_1,\cdots,n_k\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…

If we treat the symmetric group $S_n$ as a probability measure space where each element has measure $1/n!$, then the number of cycles in a permutation becomes a random variable. The Cycle Length Lemma describes the expected values of…

Denote by $G$ a finite group and let $\psi(G)$ denote the sum of element orders in $G$. In 2009, H.Amiri, S.M.Jafarian Amiri and I.M.Isaacs proved that if $|G|=n$ and $G$ is non-cyclic, then $\psi(G)<\psi(C_n)$, where $C_n$ denotes the…

Marius T\u{a}rn\u{a}uceanu described the finite groups $G$ having $|G|-1$ cyclic subgroups. We describe the finite groups $G$ having $|G|-\Delta$ cyclic subgroups for $\Delta=2, 3, 4$ and $5$.