相关论文: Enumerating submonoids of finite commutative monoi…
We prove a representation theorem for totally ordered idempotent monoids via a nested sum construction. Using this representation theorem we obtain a characterization of the subdirectly irreducible members of the variety of semilinear…
A commutative monoid $M$ is called a linearly orderable monoid if there exists a total order on $M$ that is compatible with the monoid operation. The finitary power monoid of a commutative monoid $M$ is the monoid consisting of all nonempty…
We study the maximal subgroups (also known as group $\mathcal{H}$-classes) of finitely presented special inverse monoids. We show that the maximal subgroups which can arise in such monoids are exactly the recursively presented groups, and…
New sequences of hyperoperations \cite{BE15,HI26,ACK28,GO47,TAR69} are presented together with their local algebraic properties. The commutative hyperoperations reported by Bennet \cite{BE15} are presented as a sequence of monoids. After…
Let T_n be the full transformation semigroup of all mappings from the set {1,...,n} to itself under composition. Let E = E(T_n) denote the set of idempotents of T_n and let e be an arbitrary idempotent satisfying |im(e)|=r < n-1. We prove…
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…
We study the question of whether for each n there is another integer m with lambda(m)=lambda(n), where lambda is Carmichael's function. We give a "near" proof of the fact that this is the case unconditionally, and a complete conditional…
Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid $M$, it is natural to ask how long a sequence of elements of $M$ needs to be to ensure the…
This article studies the equation $[A,B]^k = {\rm Id}_n$ for matrices over $\mathbb{C}$, characterizing the pairs $(k,n)$ for which solutions exist via a classical result of Lam and Leung on sums of roots of unity. The problem is next…
In this paper we show that the membership problems for finitely generated submonoids and for rational subsets are recursively equivalent for groups with two or more ends.
We analyze the set of increasingly enumerable additive submonoids of R, for instance, the set of logarithms of the positive integers with respect to a given base. We call them $\omega$-monoids. The $\omega$-monoids for which consecutive…
Let $A\subset B$ be an extension of commutative reduced rings and $M\subset N$ an extension of positive commutative cancellative torsion-free monoids. We prove that $A$ is subintegrally closed in $B$ and $M$ is subintegrally closed in $N$…
Let X be a countably infinite set, Inj(X) the monoid of all injective endomaps of X, and Sym(X) the group of all permutations of X. We classify all submonoids of Inj(X) that are closed under conjugation by elements of Sym(X).
If T is a commutative monad on a cartesian closed category, then there exists a natural T-bilinear pairing from T(X) times the space of T(1)-valued functions on X ("integration"), as well as a natural T-bilinear action on T(X) by the space…
Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…
A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of "shifted" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we examine minimal…
A sequence $(e_i)_{i \le m}$ of nonnegative integers $e_i$, where $m \in \mathbb{N}$ or $m =\infty$, is called a binomid index if $\sum_{i=n-k+1}^{n} e_i\geq \sum_{i=1}^ke_i$ for all $k, n \in \mathbb{N}$ such that $ 1\le k \le n < m$.…
We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…
We investigate the structure of the monoid of endomorphisms of the ordered set $(\mathbb{Q},{\leq})$ of rational numbers. We show that for any countable linearly ordered set $\Omega$, there are uncountably many maximal subgroups of…
Transfer systems are combinatorial objects which classify $N_\infty$ operads up to homotopy. By results of A. Blumberg and M. Hill, every transfer system associated to a linear isometries operad is also saturated (closed under a particular…