On the number of numerical semigroups of prime power genus

preprint2012arXivOpen access

Abstract

Given g≥1g\ge 1, the number n(g)n(g) of numerical semigroups S⊂NS \subset \N of genus ∣N∖S∣|\N \setminus S| equal to gg is the subject of challenging conjectures of Bras-Amorós. In this paper, we focus on the counting function n(g,2)n(g,2) of \textit{two-generator} numerical semigroups of genus gg, which is known to also count certain special factorizations of 2g2g. Further focusing on the case g=pkg=p^k for any odd prime pp and k≥1k \ge 1, we show that n(pk,2)n(p^k,2) only depends on the class of pp modulo a certain explicit modulus M(k)M(k). The main ingredient is a reduction of gcd⁡(pα+1,2pβ+1)\gcd(p^α+1, 2p^β+1) to a simpler form, using the continued fraction of α/βα/β. We treat the case k=9k=9 in detail and show explicitly how n(p9,2)n(p^9,2) depends on the class of pp mod M(9)=3⋅5⋅11⋅17⋅43⋅257M(9)=3 \cdot 5 \cdot 11 \cdot 17 \cdot 43 \cdot 257.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.