Related papers: Finite Coverings of Semigroups and Related Structu…
We describe the structure of 0-simple countably compact topological inverse semigroups and the structure of congruence-free countably compact topological inverse semigroups.
We curry the elementary arithmetic operations of addition and multiplication to give monotone injections on N, and describe & study the inverse monoids that arise from also considering their generalised inverses. This leads to well-known…
In this short note, we describe the finite groups $G$ having $|G|-1$ cyclic subgroups. This leads to a nice characterization of the symmetric group $S_3$.
This paper studies Young diagrams of symmetric and pseudo-symmetric numerical semigroups and describes new operations on Young diagrams as well as numerical semigroups. These provide new decompositions of symmetric and pseudo-symmetric…
We prove that the symmetric group $S_n$ has a unique minimal cover $\mathcal{M}$ by maximal nilpotent subgroups, and we obtain an explicit and easily computed formula for the order of $\mathcal{M}$. In addition, we prove that the order of…
Suppose that $G$ is a finite group and $H$ is a subgroup of $G$. We say that $H$ is s-semipermutable in $G$ if $HG_p = G_pH$ for any Sylow $p$-subgroup $G_p$ of $G$ with $(p, |H|) = 1$. We investigate the influence of s-semipermutable…
We characterize numerical semigroups for which the poset of its ideal class monoid is a lattice, and study the irreducible elements of such a lattice with respect to union, intersection, infimum and supremum.
This paper examines in a new way some known facts about numerical semigroups especially when the number of minimal generators (that is the embedding dimension) is at most three and at least two minimal generators are coprime. For such…
A numerical semigroup is an additive subsemigroup of the natural numbers that contains zero and has finite complement. A numerical semigroup is irreducible if it cannot be written as an intersection of numerical semigroups properly…
Maximally embedding dimension (MED) numerical semigroups are a wide and interesting family, with some remarkable algebraic and combinatorial properties. Associated to any numerical semigroup one can construct a MED closure, as it is well…
Denote by $\mathrm m(S)$ the multiplicity of a numerical semigroup $S$. A covariety is a nonempty family $\mathscr{C}$ of numerical semigroups that fulfills the following conditions: there is the minimum of $\mathscr{C},$ the intersection…
For every group $G$, the set $\mathcal{P}(G)$ of its subsets forms a semiring under set-theoretical union $\cup$ and element-wise multiplication $\cdot$ and forms an involution semigroup under $\cdot$ and element-wise inversion ${}^{-1}$.…
A numerical set $S$ is a cofinite subset of $\mathbb{N}$ which contains $0$. We use the natural bijection between numerical sets and Young diagrams to define a numerical set $\widetilde{S}$, such that their Young diagrams are complements.…
This paper deals with combinatorial aspects of finite covers of groups by cosets or subgroups. Let $a_1G_1,...,a_kG_k$ be left cosets in a group $G$ such that ${a_iG_i}_{i=1}^k$ covers each element of $G$ at least $m$ times but none of its…
In this paper we compute the minimum degree of a faithful representation by partial transformations of a finite semigroup admitting a faithful completely reducible matrix representation over the field of complex numbers. This includes all…
We investigate the notion of soficity for monoids. A group is sofic as a group if and only if it is sofic as a monoid. All finite monoids, all commutative monoids, all free monoids, all cancellative one-sided amenable monoids, all…
Motivated by appearance of multisemigroups in the study of additive $2$-categories, we define and investigate the notion of a multisemigroup with multiplicities. This notion seems to be better suitable for applications in higher…
We propose a way of associating to each finitely generated monoid or semigroup a formal language, called its loop problem. In the case of a group, the loop problem is essentially the same as the word problem in the sense of combinatorial…
We explore the notion of sectional number of a group homomorphism, leading to a generalization of the covering number of a group, and present several characterizations when the sectional number is finite, providing estimates for computing…
It is well-known that small categories have equivalent descriptions as partial monoids. We provide a formulation of partial monoid and partial monoid homomorphism involving $s$ and $t$ instead of identities and then following a recent…