On factorization invariants and Hilbert functions

Abstract Nonunique factorization in cancellative commutative semigroups is often studied using combinatorial factorization invariants, which assign to each semigroup element a quantity determined by the factorization structure. For numerical semigroups (additive subsemigroups of the natural numbers), several factorization invariants are known to admit predictable behavior for sufficiently large semigroup elements. In particular, the catenary degree and delta set invariants are both eventually periodic, and the omega-primality invariant is eventually quasilinear. In this paper, we demonstrate how each of these invariants is determined by Hilbert functions of graded modules. In doing so, we extend each of the aforementioned eventual behavior results to finitely generated semigroups, and provide a new framework through which to study factorization structures in this setting.

[1]  Pedro A. García-Sánchez,et al.  On the number of factorizations of an element in an atomic monoid , 2002, Adv. Appl. Math..

[2]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[3]  The computation of factorization invariants for affine semigroups , 2015, Journal of Algebra and Its Applications.

[4]  Roberto Pelayo,et al.  On the set of elasticities in numerical monoids , 2014 .

[5]  W. Bruns,et al.  On the coefficients of Hilbert quasipolynomials , 2005, math/0512329.

[6]  Christopher O'Neill,et al.  How Do You Measure Primality? , 2014, Am. Math. Mon..

[7]  Lilian Buzer,et al.  Computing efficiently the lattice width in any dimension , 2011, Theor. Comput. Sci..

[8]  Scott T. Chapman,et al.  Factorizations of Algebraic Integers, Block Monoids, and Additive Number Theory , 2011, Am. Math. Mon..

[9]  C. O'Neill,et al.  Factorization invariants in numerical monoids , 2015, 1508.00128.

[10]  J. Bruce Fields.  Length functions determined by killing powers of several ideals in a local ring , 2000 .

[11]  Askold Khovanskii,et al.  Sums of finite sets, orbits of commutative semigroups, and Hilbert functions , 1995 .

[12]  S. Chapman,et al.  THE CATENARY AND TAME DEGREE OF NUMERICAL SEMIGROUPS , 2007 .

[13]  Roberto Pelayo,et al.  On dynamic algorithms for factorization invariants in numerical monoids , 2017, Math. Comput..

[14]  Fabien Feschet,et al.  The Exact Lattice Width of Planar Sets and Minimal Arithmetical Thickness , 2006, IWCIA.

[15]  B. Sturmfels,et al.  Combinatorial Commutative Algebra , 2004 .

[16]  J. L. Mott,et al.  Cohen-Kaplansky domains: Integral domains with a finite number of irreducible elements , 1992 .

[17]  Christopher O'Neill,et al.  On the linearity of ω-primality in numerical monoids , 2013, 1309.7476.

[18]  On the asymptotic behaviour of lengths of factorizations , 1992 .

[19]  S. Robins,et al.  Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra , 2007 .

[20]  A. Geroldinger.  Chains of factorizations in weakly Krull domains , 1997 .

[21]  Imre Z. Ruzsa.  Sums of Finite Sets , 1996 .

[22]  M. A. Moreno-Frías,et al.  Computation of the ω-primality and asymptotic ω-primality with applications to numerical semigroups , 2013, 1307.5807.

[23]  A. Vigneron-Tenorio,et al.  Computation of Delta sets of numerical monoids , 2014 .

[24]  On the asymptotic behaviour of the number of distinct factorizations into irreducibles , 1993 .

[25]  Kevin M. Woods,et al.  Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior , 2016, 1608.08520.

[26]  Pedro A. García-Sánchez,et al.  Factorization Invariants in half-Factorial Affine Semigroups , 2013, Int. J. Algebra Comput..

[27]  An Overview of the Computational Aspects of Nonunique Factorization Invariants , 2015, 1504.07424.

[28]  Wolfgang Hassler,et al.  Local tameness of v-noetherian monoids , 2008 .