Related papers: Minimal zero-sum sequences of length five over fin…

A group $G$ is called logically cyclic, if it contains an element $s$ such that every element of $G$ can be defined by a first order formula with parameter $s$. The aim of this paper is to investigate the structure of such groups.

A finite group $G$ is called a Schur group, if any Schur ring over $G$ is the transitivity module of a permutation group on the set $G$ containing the regular subgroup of all right translations. It was proved by R. P\"oschel (1974) that…

A primary covering of a finite group $G$ is a family of proper subgroups of $G$ whose union contains the set of elements of $G$ having order a prime power. We denote with $\sigma_0(G)$ the smallest size of a primary covering of $G$, and…

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the minimum number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We find lower bounds linear in $n$ for…

The Davenport constant for a finite abelian group $G$ is the minimal length $\ell$ such that any sequence of $\ell$ terms from $G$ must contain a nontrivial zero-sum sequence. For the group $G=(\mathbb Z/n\mathbb Z)^2$, its value is $2n-1$,…

Let $G$ be a finite non-cyclic, non-characteristically simple group with the property that all proper characteristic subgroups of $G$ are cyclic. We call such a group $\mathrm{CCS}$ group, short for \emph{Characteristic Cyclic}. In this…

Let $\mathcal{A}$ be a sequence of $rk$ terms which is made up of $k$ distinct integers each appearing exactly $r$ times in $\mathcal{A}$. The sum of all terms of a subsequence of $\mathcal{A}$ is called a subsequence sum of $\mathcal{A}$.…

The construction of shortest feedback shift registers for a finite sequence S_1,...,S_N is considered over the finite ring Z_{p^r}. A novel algorithm is presented that yields a parametrization of all shortest feedback shift registers for…

Let $G$ be a finite group. By a sequence over $G$, we mean a finite unordered sequence of terms from $G$, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered such that their product equals…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple graph with vertex set $G$ and two distinct vertices are adjacent if one of them is a power of the other. Let $n=p_1^{n_1}p_2^{n_2}\cdots p_r^{n_r},$ where…

Let $G$ be a finite abelian group and $p$ be the smallest prime dividing $|G|$. Let $S$ be a sequence over $G$. We say that $S$ is regular if for every proper subgroup $H \subsetneq G$, $S$ contains at most $|H|-1$ terms from $H$. Let…

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$.

The power graph of a group is the simple graph with vertices as the group elements, in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power of the other. We study (minimal) cut-sets of the…

The subgroup pattern of a finite group $G$ is the table of marks of $G$ together with a list of representatives of the conjugacy classes of subgroups of $G$. In this article we describe a collection of sequences realized by the subgroup…

Let $A$ be a finite nilpotent group acting fixed point freely on the finite (solvable) group $G$ by automorphisms. It is conjectured that the nilpotent length of $G$ is bounded above by $\ell(A)$, the number of primes dividing the order of…

Let $p$ be any odd prime number. Let $k$ be any positive integer such that $2\leq k\leq [\frac{p+1}3]+1$. Let $S = (a_1,a_2,...,a_{2p-k})$ be any sequence in ${\Bbb Z}_p$ such that there is no subsequence of length $p$ of $S$ whose sum is…

Let $G$ be an additive finite abelian group with exponent $\exp(G)$. For $L\subseteq \mathbb N$, let $\mathsf{s}_{L}(G)$ be the smallest integer $\ell$ such that every sequence $S$ over $G$ of length $\ell$ has a zero-sum subsequence $T$ of…

In this paper we show that if $G$ is a primitive subgroup of $S_{n}$ that is not large base, then any irredundant base for $G$ has size at most $5 \log n$. This is the first logarithmic bound on the size of an irredundant base for such…

Let $G$ be a finite abelian group with exponent $n$. Let $\eta(G)$ denote the smallest integer $\ell$ such that every sequence over $G$ of length at least $\ell$ has a zero-sum subsequence of length at most $n$. We determine the precise…

The infinitude is established of the set ${\bf U_1}$ of positive integers $N>5$ such that $G(N)\le \min(G(N/q), G(Np))$ where $q, p$ are primes, $q\ | N$ and $G(N):=\frac{\sigma(N)}{N\log \log N}$ stands for Gronwall number, $\sigma(N)$…