Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.03070

Telescopic Structure of Numerical Semigroups Generated by Unsigned Stirling Numbers of the First Kind

Takao Komatsu·Kyunghwan Song
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $$ S_n=\left\langle \genfrac{[}{]}{0pt}{}{n}{1},\ldots,\genfrac{[}{]}{0pt}{}{n}{n-1}\right\rangle $$ be the numerical semigroup generated by the nontrivial unsigned Stirling numbers of the first kind in the $n$th row. Writing $a=\genfrac{[}{]}{0pt}{}{n}{n-1}=\binom n2$ and $b_j=\genfrac{[}{]}{0pt}{}{n}{n-2j}$, we determine the complete gcd filtration of the reduced generating system. More precisely, if \[ M_j=\frac12\operatorname{lcm}\{m\ge1:φ(m)\le2j\}, \] then $$ \gcd(a,b_1,\ldots,b_j)=\frac{a}{\gcd(a,M_j)}. $$ The proof uses prime-power block polynomials and exact $p$-adic support at threshold degrees. We then establish a divisor-support property for canonical mixed-radix reductions and combine it with an elementary-symmetric growth estimate to prove that, after inactive generators are removed, the resulting generating sequence is telescopic. Consequently, the Apéry set of $S_n$ is rectangular, yielding an explicit Frobenius formula. The same structure shows that $S_n$ is free and symmetric and gives explicit formulas for its genus and conductor, while its type is one.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Takao Komatsu, Kyunghwan Song. 2026-10-02. Telescopic Structure of Numerical Semigroups Generated by Unsigned Stirling Numbers of the First Kind. https://arxiv.org/abs/2610.03070

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

New Results for Euler Sums

We present a large number of analytic evaluations of Euler sums, namely sums such as \begin{align} M(m,n_0,n_1,n_2, \ldots, n_t) &= \sum_{k=1}^\infty \frac{H(k)^m}{k^{n_0} (k+1)^{n_1} (k+2)^{n_2} \cdots (k+t)^{n_t}}, \nonumber \end{align} for nonnegative integers $m$ and $(n_i)$, with $m \geq 1$ and $n_0 + n_1 + \cdots + n_t \geq 2$, where $H(k) = \sum_{j=1}^k 1/j$ is the harmonic function. These results were obtained either by algebraic manipulations, or else by very high-precision numerical evaluations combined with an integer relation algorithm to obtain the analytic formulas. We show how many of these results can be derived from a few basic facts, and that these techniques are applicable to Euler sums of even more general forms than the above cases. We then show that these results permit the calculation of constants for Euler sums resembling the Stieltjes $γ$ constants arising in the theory of the Riemann zeta function, and we also present some preliminary results on the asymptotic behavior of these constants. A sign error has been corrected in eq. 98.

math.NT↗
arXiv2026

The moments of split greatest common divisors

Sequences of the form $(\gcd(u_n,v_n))_{n \in \mathbb N}$, with $(u_n)_n$, $(v_n)_n$ sums of $S$-units, have been considered by several authors. The study of $\gcd(n,u_n)$ corresponds, after Silverman, to divisibility sequences arising from the algebraic group $\mathbb G_{\mathrm{a}} \times \mathbb G_{\mathrm{m}}$; in this case, Sanna determined all asymptotic moments of the arithmetic function $\log\,\gcd (n,u_n)$ when $(u_n)_n$ is a Lucas sequence. Here, we characterize the asymptotic behavior of the moments themselves $\sum_{n \leq x}\,\gcd(n,u_n)^λ$, thus solving the moment problem for $\mathbb G_{\mathrm{a}} \times \mathbb G_{\mathrm{m}}$. We give both unconditional and conditional results, the latter only relying on standard conjectures in analytic number theory.

math.NT↗