On integer partitions corresponding to numerical semigroups (Q6171698)

From MaRDI portal
scientific article; zbMATH DE number 7726199
Language Label Description Also known as
English
On integer partitions corresponding to numerical semigroups
scientific article; zbMATH DE number 7726199

    Statements

    On integer partitions corresponding to numerical semigroups (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2023
    0 references
    Numerical semigroups arise as a way to study linear Diophantine equations. Specifically, given coprime nonnegative integers \(a_1,a_2,\ldots,a_k\), for what integers \(d\) are there nonnegative integers \(x_1,x_2,\ldots,x_k\) such that \(a_1x_1+a_2x_2+\cdots+a_kx_k=d\)? The set of such integers \(d\) is called the numerical semigroup. Numerical semigroups are cofinite additive submonoids of the natural numbers. In 2011, to study partitions with a given set of hook lengths, \textit{W. J. Keith} and \textit{R. Nath} [J. Comb. Number Theory 3, No. 1, 39--50 (2011; Zbl 1244.05021)] constructed an injection from numerical semigroups to integer partitions. In this paper, the authors study the connection between numerical semigroups and integer partitions. They explore this connection between partitions and numerical semigroups with a focus on classifying the partitions that appear in the image of the injection from numerical semigroups. Constantin, Houston-Edwards and Kaplan [\textit{H. Constantin} et al., Springer Proc. Math. Stat. 220, 99--127 (2017; Zbl 1418.05018)] considered the function \(S(N)\), which denotes the number of partitions with largest hook length \(N\) in the image of Keith and Nath's map. They proved that \[ \lim_{N\rightarrow\infty}\frac{S(N)}{T(N)}=0, \] where \(T(N)\) denotes all partitions with largest hook length \(N\). Furthermore, they conjectured that if \(S'(n)\) denotes the number of partitions of size at most \(n\) that are in the image of Keith and Nath's map, then \[ \lim_{N\rightarrow\infty}\frac{S'(N)}{P(N)}=0, \] where \(P(N)\) denotes all partitions of size at most \(n\). The main goal of this paper is to continue the study of \(S'(N)\). The authors further refine the function \(S'(N)\) in three different ways by studying the number of such partitions with a given number of parts, largest hook length, or number of parts of size \(1\). These three statistics are related to the numerical semigroup invariants genus, Frobenius number, and multiplicity, respectively.
    0 references
    0 references
    partitions
    0 references
    numerical semigroups
    0 references
    Frobenius number
    0 references
    genus
    0 references
    multiplicity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references