Related papers: Power monoids: A bridge between Factorization Theo…

Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states that evolve deterministically and at discrete time steps. Considered up to isomorphism, those correspond to functional graphs. As such, FDSs…

A Puiseux monoid is an additive submonoid of the nonnegative cone of rational numbers. Although Puiseux monoids are torsion-free rank-one monoids, their atomic structure is rich and highly complex. For this reason, they have been important…

In the first part of this paper, we establish a variation of a recent result by Bienvenu and Geroldinger on the (almost) non-existence of absolute irreducibles in (restricted) power monoids of numerical monoids: we argue the (almost)…

If $G$ is a strongly connected finite directed graph, the set $\mathcal{T}G$ of rooted directed spanning trees of $G$ is naturally equipped with a structure of directed graph: there is a directed edge from any spanning tree to any other…

In this work, it is proved that a set of numbers closed under addition and whose representations in a rational base numeration system is a rational language is not a finitely generated additive monoid. A key to the proof is the definition…

This paper introduces and systematically develops the theory of polyadic group rings, a higher arity generalization of classical group rings $\mathcal{R}[\mathsf{G}]$. We construct the fundamental operations of these structures, defining…

We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restricted to the special case of partitions with 2 columns. We…

Any rational number can be factored into a product of several rationals whose sum vanishes. This simple but nontrivial fact was suggested as a problem on a maths olympiad for high-school students. We completely solve similar questions in…

A classical tool in the study of real closed fields are the fields $K((G))$ of generalised power series (i.e., formal sums with well-ordered support) with coefficients in a field $K$ of characteristic 0 and exponents in an ordered abelian…

Factorizations over cones and their duals play central roles for many areas of mathematics and computer science. One of the reasons behind this is the ability to find a representation for various objects using a well-structured family of…

Non-unique factorizations theory, which started in algebraic number theory, over the years has expanded into several areas of mathematics. Here, we propose yet another branching. We show that some concepts of factorizations theory, such as…

We introduce a linearized version of group field theory. It can be viewed either as a group field theory over the additive group of a vector space or as an asymptotic expansion of any group field theory around the unit group element. We…

Given an ideal $I$ in a commutative ring $A$, a divided power structure on $I$ is a collection of maps $\{\gamma_n \colon I \to A\}_{n \in \mathbb{N}}$, subject to axioms that imply that it behaves like the family $\{x \mapsto…

We isolate a combinatorial property of capacities leading to a construction of proper forcings. Then we show that many classical capacities such as the Newtonian capacity satisfy the property.

Let H be an algebraic group scheme over a field k acting on a commutative k-algebra A which is a unique factorisation domain. We show that, under certain mild assumptions, the monoid of nonzero H-stable principal ideals in A is free…

Let $H$ be a Krull monoid with infinite cyclic class group $G$ and let $G_P \subset G$ denote the set of classes containing prime divisors. We study under which conditions on $G_P$ some of the main finiteness properties of factorization…

This is an exposition of some new results on associated primes and the depth of different kinds of powers of monomial ideals in order to show a deep connection between commutative algebra and some objects in combinatorics such as simplicial…

In 1960 Schwinger [J. Schwinger, Proc.Natl.Acad.Sci. 46 (1960) 570- 579] proposed the algorithm for factorization of unitary operators in the finite M dimensional Hilbert space according to a coprime decomposition of M. Using a special…

We study direct-sum decompositions of torsion-free, finitely generated modules over a (commutative) Bass ring $R$ through the factorization theory of the corresponding monoid $T(R)$. Results of Levy-Wiegand and Levy-Odenthal together with a…

In this paper we study the concept of radical factorization in the context of abstract ideal theory in order to obtain a unified approach to the theory of factorization into radical ideals and elements in the literature of commutative…