Related papers: Finite basis problem for involution semigroups of …
This note is devoted to the construction of two very easy examples, of respective dimensions 4 and 6, of graded Lie algebras whose grading is not given by a semigroup, the latter one being a semisimple algebra. It is shown that 4 is the…
We investigate the class of quasitrivial semigroups and provide various characterizations of the subclass of quasitrivial and commutative semigroups as well as the subclass of quasitrivial and order-preserving semigroups. We also determine…
We investigate structural properties of non-sofic groups, assuming that such groups exist. We introduce and study two classes: minimal non-sofic groups and $\omega$-non-sofic groups. For minimal non-sofic groups, we establish strong…
A fence is a particular partial order on a (finite) set, close to the linear order. In this paper, we calculate the rank of the semigroup $\mathcal{FI}_{n}$ of all order-preserving partial injections on an $n$-element fence. In particular,…
A semigroup is \emph{nilpotent} of degree 3 if it has a zero, every product of 3 elements equals the zero, and some product of 2 elements is non-zero. It is part of the folklore of semigroup theory that almost all finite semigroups are…
Let $G$ be a finite permutation group on $\Omega$. An ordered sequence $(\omega_1,\ldots,\omega_\ell)$ of elements of $\Omega$ is an irredundant base for $G$ if the pointwise stabilizer is trivial and no point is fixed by the stabilizer of…
The $3$-element additively idempotent semiring $S_7$ is a nonnitely based algebra of the smallest possible order. In this paper we study the nite basis problem for some additively idempotent semirings that relate to $S_7$. We present a su…
We analyse the complexity of constructing involution centralisers in unitary groups over fields of odd order. In particular, we prove logarithmic bounds on the number of random elements required to generate a subgroup of the centraliser of…
A finite group $G$ is called $k$-factorizable if for every ordered factorization $|G|=a_1\cdots a_k$ into integers each greater than $1$ there exist subsets $A_1,\dots,A_k\subseteq G$ such that $|A_i|=a_i$ for each $i$ and $G=A_1\cdots…
In this paper, nil extensions of some special type of ordered semigroups, such as, simple regular ordered semigroups, left simple and right regular ordered semigroup. Moreover, we have characterized complete semilattice decomposition of all…
The distinguishing number of $G \leqslant \sym(\Omega)$ is the smallest size of a partition of $\Omega$ such that only the identity of $G$ fixes all the parts of the partition. Extending earlier results of Cameron, Neumann, Saxl and Seress…
We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…
Building on previous work by Lambert, Plagne and the third author, we study various aspects of the behavior of additive bases in infinite abelian groups and semigroups. We show that, for every infinite abelian group $T$, the number of…
This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…
The question of whether there exists a finite group of order at least three in which every element except one is a commutator has remained unresolved in group theory. In this article, we address this open problem by developing an…
The involution fixity ${\rm ifix}(G)$ of a permutation group $G$ of degree $n$ is the maximum number of fixed points of an involution. In this paper we study the involution fixity of primitive almost simple exceptional groups of Lie type.…
We study properties of minimal mutation-infinite quivers. In particular we show that every minimal-mutation infinite quiver of at least rank 4 is Louise and has a maximal green sequence. It then follows that the cluster algebras generated…
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
A set $B$ is a basis for a vector space $V$ if every element of $V$ can be uniquely written as a linear combination of the elements of $B$. There is a similar definition of a basis for a finite group. We show that certain semidirect…
We describe an algorithm to identify a minimal set of "braid relations" which span and preserve all sets of involution words for twisted Coxeter systems of finite or affine type. We classify the cases in which adding the smallest possible…