Ordinarization numbers of numerical semigroups

Imagine you have a giant, infinite warehouse filled with boxes labeled with every whole number: 0, 1, 2, 3, and so on. A Numerical Semigroup is like a special club inside this warehouse. To be in the club, you must follow two rules:

The Zero Rule: The number 0 is always in the club.
The Additive Rule: If you take any two numbers in the club and add them together, the result must also be in the club.

However, this club isn't allowed to be too full. There must be a finite number of "missing" numbers (gaps) that are not in the club. The total count of these missing numbers is called the Genus ( $g$ ).

The Big Question: How Many Clubs Are There?

Mathematicians have been obsessed with a simple question: If we fix the number of missing items (the genus) to be, say, 10, how many different valid clubs can we make?
As the number of missing items gets larger, the number of possible clubs explodes. It turns out this number grows at a rate related to the Golden Ratio (the same ratio found in seashells and sunflowers).

The "Ordinarization Tree": A Family Tree of Numbers

The authors of this paper are interested in organizing these clubs into a family tree.

The Root: At the very top of the tree is the "Ordinary Club." This is the simplest possible club for a given genus. It contains 0 and then every number starting from $g+1$ . It's the most "complete" club possible.
The Branches: You can create other clubs by taking the Ordinary Club, removing a specific number, and adding a smaller number back in (while keeping the rules intact).
The Ordinarization Number: This is the paper's main character. Imagine you are standing on a specific club in the tree. The Ordinarization Number is simply the number of steps you have to take up the tree to get back to the root (the Ordinary Club).
- If you are right next to the root, your number is 1.
- If you are far away in the deep branches, your number is high.

What Did They Discover?

1. Counting the Steps (The Polyhedron Puzzle)

The authors wanted to know: "How many clubs have exactly 2 steps to the root? How many have 3 steps?"
They realized this isn't just a counting game; it's a geometry problem.

The Analogy: Imagine trying to count how many dots you can fit inside a specific shape (a polyhedron) drawn on graph paper.
The Discovery: They found that for a fixed number of steps (say, 2), the number of clubs follows a very specific, rhythmic pattern as the genus gets larger. It's not a simple straight line; it's a Quasipolynomial.
- Simple Metaphor: Think of a clock. The hands move in a smooth curve, but if you only look at the minute hand every 12 minutes, it jumps in a pattern. The number of clubs behaves like that clock hand—it follows a polynomial formula, but the formula changes slightly depending on whether the genus is even, odd, or divisible by 12.

2. The Two-Generator Clubs (The Triangle Game)

Some clubs are very simple: they are built using just two "building blocks" (generators). For example, a club built only from multiples of 3 and 5.

The Discovery: For these simple clubs, the Ordinarization Number is exactly equal to the number of dots you can fit inside a right-angled triangle with specific corners.
Why it matters: This turns a complex algebra problem into a simple geometry problem. Instead of doing hard math, you just count the dots in a triangle.

3. The "Supersymmetric" Clubs

The authors also looked at more complex clubs built with three or more generators, specifically a special type called "supersymmetric."

The Discovery: As these clubs get bigger and bigger, the ratio of their "steps to the root" compared to their total size settles down to a predictable fraction.
- For 2 generators, the ratio settles at 1/4.
- For 3 generators, it settles at 1/6.
- It seems like a pattern: the more generators you have, the "closer" to the root the club tends to be relative to its size.

4. The Interval Clubs

Finally, they looked at clubs built from a continuous block of numbers, like $\{10, 11, 12, 13, 14\}$ .

The Discovery: They found a neat formula to calculate the Ordinarization Number based on how wide the interval is and where it starts. It depends on whether the number of "steps" needed to cover the gaps is an even or odd number.

Why Does This Matter?

You might ask, "Who cares about counting number clubs?"

Predicting Growth: This research helps mathematicians understand how complex these structures get as they grow. It's like trying to predict how many different species of birds exist as the Earth gets larger.
Bridging Fields: The paper is a beautiful example of how Number Theory (counting numbers), Geometry (shapes and triangles), and Algebra (formulas) are all connected. They used the shape of a triangle to solve a problem about counting numbers.
Solving Conjectures: They proved a specific guess (conjecture) made by a mathematician named Bras-Amorós, showing that for clubs with 2 steps, the number of clubs always increases as the genus increases.

In a Nutshell

This paper is a map. It takes a chaotic, infinite forest of number patterns and organizes them into a neat tree. It tells us exactly how many paths lead to the top, how the shape of the forest changes as it grows, and how to count the trees using simple geometry. It turns the abstract mystery of "how many ways can I arrange these numbers?" into a solvable puzzle of dots in triangles and steps on a ladder.

Here is a detailed technical summary of the paper "Ordinarization Numbers of Numerical Semigroups" by Cyrusian and Kaplan.

1. Problem Statement and Context

The paper investigates the combinatorial structure of numerical semigroups, specifically focusing on the ordinarization number, a metric introduced by Bras-Amorós.

Numerical Semigroup ( $S$ ): An additive submonoid of $\mathbb{N}_0$ with finite complement. Key invariants include the genus $g(S)$ (number of gaps), the Frobenius number $F(S)$ (largest gap), and the multiplicity $m(S)$ (smallest non-zero element).
Ordinarization Tree ( $T_g$ ): Bras-Amorós organized all numerical semigroups of a fixed genus $g$ into a rooted tree. The root is the "ordinary" semigroup $S_g = \{0, g+1, g+2, \dots\}$ . The ordinarization transform maps a non-ordinary semigroup $S$ to $S' = S \cup \{F(S)\} \setminus \{m(S)\}$ .
Ordinarization Number ( $r(S)$ ): The length of the unique path from $S$ to the root $S_g$ in $T_g$ . By Proposition 1.4, $r(S)$ equals the number of elements in $S \cap \{1, 2, \dots, g\}$ .
The Core Problem: The authors study the function $n_{g,r}$ $n_{g, r}$ , which counts the number of numerical semigroups of genus $g$ $g$ with a fixed ordinarization number $r$ $r$ .
- Motivation: This relates to Conjecture 1.5 (Bras-Amorós), which posits that $n_{g,r} \leq n_{g+1,r}$ for all $r, g \geq 1$ . Proving this for specific $r$ contributes to the broader open conjecture that the total number of semigroups $N(g)$ is non-decreasing ( $N(g) \geq N(g-1)$ ).

2. Methodology

The authors employ a multi-faceted approach combining combinatorial number theory, polyhedral geometry, and computational algebra:

Polyhedral Geometry and Ehrhart Theory:
- The condition for a set to be a numerical semigroup of genus $g$ with ordinarization number $r$ can be translated into a system of linear inequalities involving the gaps and added elements.
- This defines a rational polytope (or a family of polytopes parameterized by $g$ ).
- Counting the semigroups becomes equivalent to counting integer points within these polytopes.
- The authors utilize Ehrhart theory, which states that the number of integer points in a dilated rational polytope is a quasipolynomial (a function that behaves like a polynomial but with periodic coefficients).
- They use computer algebra systems (Sage and Normaliz) to compute Hilbert series of the associated cones to derive explicit quasipolynomial formulas.
Geometric Counting for Embedding Dimension 2:
- For semigroups generated by two elements ( $S = \langle a, b \rangle$ ), the problem of counting elements $\leq g(S)$ is mapped to counting integer points in a right triangle with rational vertices.
- They utilize properties of factorizations and Betti elements (specifically, that for $n < ab$ , factorizations are unique) to simplify the counting.
Recursive and Structural Analysis:
- The paper analyzes the degrees of vertices in the ordinarization tree (how many children a node has) and the distribution of effective generators.
- They extend results from dimension 2 to supersymmetric semigroups (a class of symmetric semigroups with specific generator structures) and semigroups generated by intervals.

3. Key Contributions and Results

A. Counting Semigroups with Fixed Ordinarization Number

Theorem 3.4: For any fixed $r$ , the sequence $n_{g,r}$ is eventually a quasipolynomial in $g$ of degree $2r$.
Theorem 3.5 (Main Result for $r=2$ ): The authors derive an explicit formula for $n_{g,2}$ $n_{g, 2}$ .
- The formula is a quasipolynomial of degree 4 and period 12.
- They provide the explicit polynomials $f_0(x), \dots, f_{11}(x)$ for each residue class modulo 12.
- Corollary 3.6: Using this formula, they prove Conjecture 1.5 for $r=2$ , showing that $n_{g,2} \leq n_{g+1,2}$ for all $g \geq 1$ . This confirms the monotonicity for ordinarization number 2.

B. Ordinarization Numbers of 2-Generated Semigroups

Geometric Characterization: They show that for $S = \langle a, b \rangle$ , $r(S)$ corresponds to the number of integer points in a specific right triangle (minus one for the origin).
Proposition 4.6: An explicit summation formula for $r(\langle a, b \rangle)$ is derived.
Theorem 4.7: They establish tight bounds for $r(\langle a, b \rangle)$ relative to the genus, showing that $r(S) \approx \frac{1}{4}g(S)$ asymptotically.
Proposition 4.8: For a fixed generator $a$ , $r(\langle a, b \rangle)$ is a linear quasipolynomial in $b$ with a period dividing $a$ (or $2a $if$ a $is even). They provide explicit formulas for$ a=2, 3, 4, 5, 6$.

C. Supersymmetric Numerical Semigroups

Proposition 5.4: For supersymmetric semigroups generated by 3 elements ( $S = \langle bc, ac, ab \rangle$ ), the ratio of the ordinarization number to the genus converges to 1/6 as the generators grow large (contrasting with the 1/4 limit for 2-generated semigroups).
Proposition 5.6: They provide a general recursive formula for the ordinarization number of supersymmetric semigroups with $n$ generators, based on counting factorizations with specific constraints on the first generator.

D. Semigroups Generated by Intervals

Theorem 6.2: The authors derive a closed-form formula for the ordinarization number of semigroups generated by an interval $S = \langle a, a+1, \dots, a+x \rangle$ .
The formula depends on the parity of $n = \lceil (a-1)/x \rceil$ and yields linear expressions in terms of $x$ and $a$ .

E. Vertex Degrees in the Ordinarization Tree

Theorem 2.8: They bound the number of children a semigroup can have that possess no effective generators (leaves in the tree).
Proposition 2.10: They construct an infinite family of semigroups with exactly 4 effective generators that still possess children in the tree, disproving the heuristic that "large genus implies many effective generators."

4. Significance and Impact

Resolution of Conjectures: The paper provides the first proof of Bras-Amorós's conjecture ( $n_{g,r} \leq n_{g+1,r}$ ) for $r=2$ , a significant step toward the general conjecture regarding the growth of $N(g)$ .
Methodological Bridge: It successfully bridges the gap between the combinatorial study of numerical semigroups and Ehrhart theory. By framing semigroup counting as a problem of counting integer points in rational polytopes, it opens the door to applying powerful tools from discrete geometry to semigroup theory.
Explicit Formulas: The derivation of explicit quasipolynomial formulas for $n_{g,2}$ and $r(\langle a, b \rangle)$ provides concrete data for testing further conjectures and understanding the distribution of semigroups.
Generalization: The work extends the understanding of ordinarization numbers beyond the trivial or 2-generated cases to more complex families (supersymmetric and interval-generated), revealing how the structure of generators influences the depth of the ordinarization tree.

In summary, this paper advances the structural theory of numerical semigroups by quantifying their distribution within the ordinarization tree, utilizing advanced geometric counting techniques to prove monotonicity results and derive precise asymptotic behaviors.