Related papers: Primitive Permutation Groups and Strongly Factoriz…

Let $g$ be an element of a group $G$. For a positive integer $n$, let $E_n(g)$ be the subgroup generated by all commutators $[...[[x,g],g],\dots ,g]$ over $x\in G$, where $g$ is repeated $n$ times. We prove that if $G$ is a profinite group…

Recently, Gray and Ruskuc (arXiv:1101.1833) proved that if e is a rank k idempotent transformation of the set {1,...,n} to itself and k<=n-2, then the maximal subgroup of the free idempotent generated semigroup over the full transformation…

In this paper subcentral (resp., central) idempotent series and composition subcentral (resp., central) idempotent series in an inverse semigroup are introduced and investigated. It is shown that if $S=EG$ is a factorizable inverse monoids…

Working in a theory with an integer-valued dimension on interpretable sets, we classify pseudofinite definably primitive permutation groups acting on one-dimensional sets which satisfy a version of chain condition on centralizers and on…

For a group $G$ and a subgroup $H$ of $G$ this article discusses the normalizer of $H$ in the units of a group ring $RG$. We prove that $H$ is only normalized by the `obvious' units, namely products of elements of $G$ normalizing $H$ and…

Given a finite permutation group $G$ with domain $\Omega$, we associate two subsets of natural numbers to $G$, namely $\mathcal{I}(G,\Omega)$ and $\mathcal{M}(G,\Omega)$, which are the sets of cardinalities of all the irredundant and…

A semigroup is completely simple if it has no proper ideals and contains a primitive idempotent. We say that a completely simple semigroup $S$ is a homogeneous completely simple semigroup if any isomorphism between finitely generated…

We generalize certain parts of the theory of group rings to the twisted case. Let G be a finite group acting (possibly trivially) on a field L of characteristic coprime to the order of the kernel of this operation. Let K in L be the fixed…

We prove that every odd-order group is symmetric harmonious: there exists a permutation $g_0,g_1,\ldots, g_{\ell-1}$ of elements of $G$ such that the consecutive products $g_0g_1,g_1g_2,\ldots, g_{\ell-1}g_0$ also form a permutation of…

Let A be an associative algebra with identity over a field k. An atomistic subsemiring R of the lattice of subspaces of A, endowed with the natural product, is a subsemiring which is a closed atomistic sublattice. When R has no zero…

We investigate the computational complexity for determining various properties of a finite transformation semigroup given by generators. We introduce a simple framework to describe transformation semigroup properties that are decidable in…

A linear group G on a finite vector space V, (that is, a subgroup of GL(V)) is called (1/2)-transitive if all the G-orbits on the set of nonzero vectors have the same size. We complete the classification of all the (1/2)-transitive linear…

Let $P,$ $S,$ and $T$ be semigroups, $f:P\to S$ and $g:P\to T$ semigroup homomorphisms, and $X$ a generating set for $S$ (possibly infinite). Clearly, a <i>necessary</i> condition for there to exist a homomorphism $S\to T$ making a…

We show that every finite group $T$ is isomorphic to a normalizer quotient $N_{S_n}(H)/H$ for some $n$ and a subgroup $H\leq S_n$. We show that this holds for all large enough $n\ge n_0(T)$ and also with $S_n$ replaced by $A_n$. The two…

For an arbitrary finite permutation group $G$, subgroup of the symmetric group $S_\ell$, we determine the permutations involving only members of $G$ as $\ell$-patterns, i.e., avoiding all patterns in the set $S_\ell \setminus G$. The set of…

We define the rank of elements of general unital rings, discuss its properties and give several examples to support the definition. In semiprime rings we give a characterization of rank in terms of invertible elements. As an application we…

Let $G$ be a finite group and define $\rho(G) = \prod_{x \in G} o(x)$, where $o(x)$ denotes the order of the element $x \in G$. Let $\Omega$ be the prime omega function giving the number of (not necessarily distinct) prime factors of a…

Let $G$ be a finite group and $\sigma =\{\sigma_{i} | i\in I\}$ some partition of the set of all primes $\Bbb{P}$, that is, $\sigma =\{\sigma_{i} | i\in I \}$, where $\Bbb{P}=\bigcup_{i\in I} \sigma_{i}$ and $\sigma_{i}\cap \sigma_{j}=…

We describe and count the maximal subsemigroups of many well-known monoids of transformations and monoids of partitions. More precisely, we find the maximal subsemigroups of the full spectrum of monoids of order- or orientation-preserving…

The delta set of a numerical semigroup $S$, denoted $\Delta(S)$, is a factorization invariant that measures the complexity of the sets of lengths of elements in $S$. We study the following problem: Which finite sets occur as the delta set…