Related papers: Natural Monoids and Non-commutative Arithmetics
In this work, we investigate the commutative monoids over which the axiomatizable class of regular S-acts is primitive normal and antiadditive. We prove that the primitive normality of an axiomatizable class of regular S-acts over the…
We establish a new sufficient condition under which a monoid is non-finitely based and apply this condition to Lee monoids $L_\ell^1$, obtained by adjoining an identity element to the semigroup generated by two idempotents $a$ and $b$…
Let $M$ be a cancellative and commutative monoid. A non-invertible element of $M$ is called an atom (or irreducible element) if it cannot be factored into two non-invertible elements, while an atom $a$ of $M$ is called strong if $a^n$ has a…
We define and study the Picard group of a monoid scheme and the class group of a normal monoid scheme. To do so, we develop some ideal theory for (pointed abelian) noetherian monoids, including primary decomposition and discrete valuations.…
Factorizations of monoids are studied. Two necessary and sufficient conditions in terms of so-called descent 1-cocyles for a monoid to be factorized through two submonoids are found. A full classification of those factorizations of a monoid…
Monoidal closed categories naturally model NMILL, non-commutative multiplicative intuitionistic linear logic: the monoidal unit and tensor interpret the multiplicative verum and conjunction; the internal hom interprets linear implication.…
We extend a few fundamental aspects of the classical theory of non-unique factorization, as presented in Geroldinger and Halter-Koch's 2006 monograph on the subject, to a non-commutative and non-cancellative setting, in the same spirit of…
Inspired by methods in prime characteristic in commutative algebra, we introduce and study combinatorial invariants of seminormal monoids. We relate such numbers with the singularities and homological invariants of the semigroup ring…
We consider a certain left action by the monoid $SL_2(\mathbf{N}_0)$ on the set of divisor pairs $\mathcal{D}_f := \{ (m, n) \in \mathbf{N}_0 \times \mathbf{N}_0 : m \lvert f(n) \}$ where $f \in \mathbf{Z}[x]$ is a polynomial with integer…
There are different notions of computation, the most popular being monads, applicative functors, and arrows. In this article we show that these three notions can be seen as monoids in a monoidal category. We demonstrate that at this level…
We study the arithmetic of seminormal $v$-noetherian weakly Krull monoids with nontrivial conductor which have finite class group and prime divisors in all classes. These monoids include seminormal orders in holomorphy rings in global…
Let $\mathcal S \subseteq \mathbb Z^m \oplus T$ be a finitely generated and reduced monoid. In this paper we develop a general strategy to study the set of elements in $\mathcal S$ having at least two factorizations of the same length,…
We present efficient algorithms to decide whether two given counting functions on non-abelian free groups or monoids are at bounded distance from each other and to decide whether two given counting quasimorphisms on non-abelian free groups…
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…
We study the structure of the commutative multiplicative monoid $\mathbb N_0[x]^*$ of all the non-zero polynomials in $\mathbb Z[x]$ with non-negative coefficients. We show that $\mathbb N_0[x]^*$ is not a half-factorial monoid and is not a…
We present a general method for proving that a semigroup is non-finitely based. The method is strong enough to cover the non-finite basis arguments in articles [1,3,4,5,7,8, 11,14,16,21,27,31,36,37]. In particular, the method allows to…
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…
'Skolem arithmetic' is the complete theory $T$ of the multiplicative monoid $(\mathbb{N},\cdot)$. We give a full characterization of the $\varnothing$-definable stably embedded sets of $T$, showing in particular that, up to the relation of…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
This paper develops the fundamentals of modular representation theory for finite monoids, introducing the decomposition matrix and exploring its connection to Brauer characters. We define modular characteristic and explain how the…