Frobenius allowable gaps of Generalized Numerical Semigroups

DOI10.37236/10748MaRDI QIDQ6364069arXivFDO

Authors Deepesh Singhal, Yuxin Lin

Publication date 29 March 2021

Published in arXiv

Full work available at URL https://doi.org/10.37236/10748

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) The Frobenius problem (11D07) Commutative semigroups (20M14)

arXiv classification

math.CO

Abstract: A generalised numerical semigroup (GNS) is a submonoid $S$ of $mathbb{N}^d$ for which the complement $mathbb{N}^{d}setminusS$ is finite. The points in the complement $mathbb{N}^{d}setminusS$ are called gaps. A gap $F$ is considered Frobenius allowable if there is some relaxed monomial ordering on $mathbb{N}^d$ with respect to which $F$ is the largest gap. We characterise the Frobenius allowable gaps of a GNS. A GNS that has only one Frobenius allowable gap is called a Frobenius GNS. We estimate the number of Frobenius GNS with a given Frobenius gap $F=(F^{(1)},dots,F^{(d)})inmathbb{N}^d$ and show that it is close to $sqrt{3}^{(F^{(1)}+1)cdots(F^{(d)}+1)}$ for large $d$. We define notions of quasi-irreducibility and quasi-symmetry for GNS. While in the case of $d=1$ these notions coincide with irreducibility and symmetry of GNS, they are distinct in higher dimensions.

This page was built for publication: Frobenius allowable gaps of Generalized Numerical Semigroups

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