Chomp on numerical semigroups

DOI10.5802/ALCO.16MaRDI QIDQ1649927zbMATH OpenOpenAlexWikidataFDO

Authors Ignacio García Marco, Kolja Knauer

Publication date 29 June 2018

Published in Algebraic Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1705.11034

zbMATH Keywords

numerical semigroupinfinite posetsymmetric semigroupchomp gameposet gameApéry set

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Commutative semigroups (20M14) Combinatorial games (91A46)

Abstract: We consider the two-player game chomp on posets associated to numerical semigroups and show that the analysis of strategies for chomp is strongly related to classical properties of semigroups. We characterize, which player has a winning-strategy for symmetric semigroups, semigroups of maximal embedding dimension and several families of numerical semigroups generated by arithmetic sequences. Furthermore, we show that which player wins on a given numerical semigroup is a decidable question. Finally, we extend several of our results to the more general setting of subsemigroups of $mathbbNimesT$, where $T$ is a finite abelian group.

Recommendations

• On three-rowed chomp
• scientific article; zbMATH DE number 1748378
• scientific article; zbMATH DE number 1944398
• Chomp on generalized Kneser graphs and others
• scientific article; zbMATH DE number 2124071

Cites work

• scientific article; zbMATH DE number 7075886 (Why is no real title available?)
• scientific article; zbMATH DE number 5054195 (Why is no real title available?)
• scientific article; zbMATH DE number 2229032 (Why is no real title available?)
• A Curious Nim-Type Game
• A combinatorial identity involving relatively prime integers
• A note on Symmetric Semigroups and almost arithmetic sequences
• Algebraic invariants of projective monomial curves associated to generalized arithmetic sequences
• Complete intersection lattice ideals
• Computing the degree of a lattice ideal of dimension one
• Maximality properties in numerical semigroups and applications to one-dimensional analytically irreducible local domains
• Minimal free resolution of the associated graded ring of monomial curves of generalized arithmetic sequences
• Möbius function of semigroup posets through Hilbert series.
• Numerical semigroups generated by intervals
• Numerical semigroups with maximal embedding dimension.
• Numerical semigroups.
• Numerical semigroups: Apéry sets and Hilbert series.
• On Numerical Semigroups Generated by Generalized Arithmetic Sequences
• On numerical semigroups
• On symmetric numerical semigroups
• On the Möbius function of the locally finite poset associated with a numerical semigroup.
• On the linear diophantine problem of Frobenius.
• The Value-Semigroup of a One-Dimensional Gorenstein Ring
• The second Feng-Rao number for codes coming from telescopic semigroups

Cited in

(3)

• Cayley posets
• Chomp on generalized Kneser graphs and others
• Beyond Coins, Stamps, and Chicken McNuggets: An Invitation to Numerical Semigroups

This page was built for publication: Chomp on numerical semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1649927)