For a finite abelian group G and a splitting field K of G, let (G,K) denote the largest integer l ∈ ℕ for which there is a sequence $S=g₁·...·g_l$ over G such that $(X^{g₁}-a₁)·...·(X^{g_l}-a_l)\ne 0\in K\left[G\right]$ for all $a₁,...,a_l\in K^{\times }$. If (G) denotes the Davenport constant of G, then there is the straightforward inequality (G) - 1 ≤ (G,K). Equality holds for a variety of groups, and a conjecture of W. Gao et al. states that equality holds for all groups. We offer further groups for which equality holds, but we also give the first examples of groups G for which (G) -...

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids....

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids. In 1991, Klarner, Birget and Satterfield proved the undecidability...

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids....

If $a$ and $b$ are positive integers with $a\le b$ and $a^2\equiv a\mathrm{mod}b$, then the set$$M_{a,b}=\{x\in \mathbb{N}:x\equiv a\mathrm{mod}b\text{or}x=1\}$$is a multiplicative monoid known as an arithmetical congruence monoid (or ACM). For any monoid $M$ with units $M^{\times }$ and any $x\in M\setminus M^{\times }$ we say that $t\in \mathbb{N}$ is a factorization length of $x$ if and only if there exist irreducible elements $y_1,...,y_t$ of $M$ and $x=y_1\cdots y_t$. Let $ℒ\left(x\right)=\{t_1,...,t_j\}$ be the set of all such lengths (where $t_i\<t_{i+1}$ whenever $i\<j$). The Delta-set of the element $x$ is defined as the set of gaps in $ℒ\left(x\right)$: $\Delta \left(x\right)=\{t_{i+1}-t_i:1\le i\<k\}$ and the Delta-set of the monoid $M$ is given by ${\bigcup }_{x\in M\setminus M^{\times }}\Delta \left(x\right)$. We consider the $\Delta \left(M\right)$ when $M=M_{a,b}$ is an ACM with...

In this paper groups are considered inducing groups of power automorphisms on each factor of their derived series. In particular, it is proved that soluble groups with such property have derived length at most 3, and that this bound is best possible.

Let $G$ be a finite group. The intersection graph ${\Delta }_G$ of $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of $G$, and two distinct vertices $X$ and $Y$ are adjacent if $X\cap Y\ne 1$, where $1$ denotes the trivial subgroup of order $1$. A question was posed by Shen (2010) whether the diameters of intersection graphs of finite non-abelian simple groups have an upper bound. We answer the question and show that the diameters of intersection...