Related papers: Minimal presentations of shifted numerical monoids

Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…

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…

The set $S(n)$ of all elementary symmetric polynomials in $n$ variables is a minimal generating set for the algebra of symmetric polynomials in $n$ variables, but over a finite field ${\mathbb F}_q$ the set $S(n)$ is not a minimal…

Let $S \subset \mathbb{N}_0$ be a numerical monoid and let $\mathcal P_{\mathrm{fin}} (S)$, resp $\mathcal P_{\mathrm{fin},0}(S)$, denote the power monoid, resp. the restricted power monoid, of $S$, that is the set of all finite nonempty…

The theory of commutative monads on cartesian closed categories provides a framework where aspects of the theory of distributions and other extensive quantities can be formulated and some results proved. We make explicit a link between our…

We study the problem of finding the smallest $m$ such that every element of an exponential family can be written as a mixture of $m$ elements of another exponential family. We propose an approach based on coverings and packings of the face…

We consider a natural generalization of braids which we call shrinking braids. We state the relations of shrinking braids and use them to define algebraically the monoid $R$. We endow a subset of $R$ with a \emph{left distributive monoid}…

In recent years codes that are not Uniquely Decipherable (UD) are been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not…

In this note we give a presentation for the monoid $IO_n$ of all order-preserving transformations of a $n$-chain whose ranges are intervals. We also consider the submonoid $IO_n^-$ of $IO_n$ consisting of order-decreasing transformations,…

We compute the quiver of any monoid that has a basic algebra over an algebraically closed field of characteristic zero. More generally, we reduce the computation of the quiver over a splitting field of a class of monoids that we term…

Wreath products involving symmetric inverse monoids/semigroups/categories arise in many areas of algebra and science, and presentations by generators and relations are crucial tools in such studies. The current paper finds such…

We develop layered monoidal theories -- a generalisation of monoidal theories combining formal descriptions of a system at different levels of abstraction. Via their representation as string diagrams, monoidal theories provide a graphical…

The main result here is a characterisation of binary $2$-neighbour-transitive codes with minimum distance at least $5$ via their minimal subcodes, which are found to be generated by certain designs. The motivation for studying this class of…

We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with a family of algebraic laws, and might be useful for more general rewrite systems. These tools consist in introducing a…

For a diagonalizable monoid scheme $A(M)_S$ acting on an algebraic space $X$, we introduce for any submonoid $N$ of $M$ an attractor space $X^N$. We then investigate and study various aspects of attractors associated to monoids.

The dual symmetric inverse monoid $\mathscr{I}_n^*$ is the inverse monoid of all isomorphisms between quotients of an $n$-set. We give a monoid presentation of $\mathscr{I}_n^*$ and, along the way, establish criteria for a monoid to be…

A fully invarient congruence relations on the free algebra on a given type induces a variety of the given type. In contrast, a congruence relation of the free algebra provides algebra of that type. This algebra is given by a so-called…

For a connected graph $G$ with order $n$, let $e(G)$ be the number of its distinct eigenvalues and $d$ be the diameter. We denote by $m_G(\mu)$ the eigenvalue multiplicity of $\mu$ in $G$. It is well known that $e(G)\geq d+1$, which shows…

Attached to a singular analytic curve germ in $d$-space is a numerical semigroup: a subset $S$ of the non-negative integers which is closed under addition and whose complement isfinite. Conversely, associated to any numerical semigroup $S$…

We study algebraic and arithmetic properties of submonoids (resp. subrings) of factorial monoids (resp. factorial domains) whose non-invertible elements all lie in the conductor. This continues earlier work of Baeth, Cisto, et al.. On our…