Let $\M(A,θ)$ be a free partially commutative monoid. We give here a necessary and sufficient condition on a subalphabet $B\subset A$ such that the right factor of a bisection $\M(A,θ)=\M(B,θ\_B).T$ be also partially commutative free. This extends strictly the (classical) elimination theory on partial commutations and allows to construct new factorizations of $\M(A,θ)$ and associated bases of $L\_K(A,θ)$.
In this work, an effective construction, via Schützenberger's monoidal factorization, of dual bases for the non commutative symmetric and quasi-symmetric functions is proposed.
We give the definition of Lazard and Hall sets in the context of transitive factorizations of free monoids. The equivalence of the two properties is proved. This allows to build new effective bases of free partially commutative Lie algebras. The commutation graphs for which such sets exist are completely characterized and we explicit, in this context, the classical PBW rewriting process.
Primary decomposition of commutative monoid congruences is insensitive to certain features of primary decomposition in commutative rings. These features are captured by the more refined theory of mesoprimary decomposition of congruences, introduced here complete with witnesses and associated prime objects. The combinatorial theory of mesoprimary decomposition lifts to arbitrary binomial ideals in monoid algebras. The resulting binomial mesoprimary decomposition is a new type of intersection decomposition for binomial ideals that enjoys computational efficiency and independence from ground fiel…
If $R$ is a finite commutative ring, then the affine monoid of $R$ is the monoid of all affine mappings $x\mapsto ax+b$ on $R$. Alternatively, it is the semidirect product of the multiplicative monoid of $R$ with the additive group of $R$. In this paper we compute the Gabriel quiver of the complex algebra of the affine monoid of any finite commutative ring.
Transfer Krull monoids are a recent concept including all commutative Krull domains and also, for example, wide classes of non-commutative Dedekind domains. We show that transfer Krull monoids are fully elastic (i.e., every rational number between $1$ and the elasticity of the monoid can be realized as the elasticity of an element). In commutative Krull monoids which have sufficiently many prime divisors in all classes of their class group, the set of catenary degrees and the set of tame degrees are intervals. Without the assumption on the distribution of prime divisors, arbitrary finite sets …
Resources and their use and consumption form a central part of our life. Many branches of science and engineering are concerned with the question of which given resource objects can be converted into which target resource objects. For example, information theory studies the conversion of a noisy communication channel instance into an exchange of information. Inspired by work in quantum information theory, we develop a general mathematical toolbox for this type of question. The convertibility of resources into other ones and the possibility of combining resources is accurately captured by the m…
Transfer Krull monoids are monoids which allow a weak transfer homomorphism to a commutative Krull monoid, and hence the system of sets of lengths of a transfer Krull monoid coincides with that of the associated commutative Krull monoid. We unveil a couple of new features of the system of sets of lengths of transfer Krull monoids over finite abelian groups G, and we provide a complete description of the system for all groups G having Davenport constant D(G) = 5 (these are the smallest groups for which no such descriptions were known so far). Under reasonable algebraic finiteness assumptions, s…
For an element $a$ of a monoid $H$, its set of lengths $\mathsf L (a) \subset \mathbb N$ is the set of all positive integers $k$ for which there is a factorization $a=u_1 \cdot \ldots \cdot u_k$ into $k$ atoms. We study the system $\mathcal L (H) = \{\mathsf L (a) \mid a \in H \}$ with a focus on the unions $\mathcal U_k (H) \subset \mathbb N$ which are the unions of all sets of lengths containing a given $k \in \mathbb N$. The Structure Theorem for Unions -- stating that for all sufficiently large $k$, the sets $\mathcal U_k (H)$ are almost arithmetical progressions with the same difference a…
In an atomic, cancellative, commutative monoid, the ω-value measures how far an element is from being prime. In numerical monoids, we show that this invariant exhibits eventual quasilinearity (i.e., periodic linearity). We apply this result to describe the asymptotic behavior of the ω-function for a general numerical monoid and give an explicit formula when the monoid has embedding dimension 2.
We investigate quasisymmetric functions coming from combinatorial Hopf monoids. We show that these invariants arise naturally in Ehrhart theory, and that some of their specializations are Hilbert functions for relative simplicial complexes. This class of complexes, called forbidden composition complexes, also forms a Hopf monoid, thus demonstrating a link between Hopf algebras, Ehrhart theory, and commutative algebra. We also study various specializations of quasisymmetric functions.
We study the representation theory of the increasing monoid. Our results provide a fairly comprehensive picture of the representation category: for example, we describe the Grothendieck group (including the effective cone), classify injective objects, establish properties of injective and projective resolutions, construct a derived auto-duality, and so on. Our work is motivated by numerous connections of this theory to other areas, such as representation stability, commutative algebra, simplicial theory, and shuffle algebras.
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 Baeth and Smertnig's work on the factorization theory of non-commutative, but cancellative monoids [J. Algebra 441 (2015), 475-551]. Then, we bring in power monoids and, applying the abstract machinery developed in the first part, we undertake the study of their arithmetic. More in particular, let $H$ be a multiplicatively written monoid. The set $\mathcal P_…
