🔢 mathematics

Representability of systems of proportionally modular numerical semigroups

This paper proves that every system of proportionally modular numerical semigroups is representable by a canonical equivariant resolution of a weighted homogeneous surface singularity with a rational homology sphere link, achieved by constructing and gluing two-legged resolution graphs derived from quotient descriptions.

Original authors: Zsolt Baja, Tamás László, Zsuzsa Nagy

Published 2026-07-16

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Zsolt Baja, Tamás László, Zsuzsa Nagy

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine a world where numbers aren't just tools for counting, but characters in a grand, invisible dance. In the realm of mathematics, there is a special club called "numerical semigroups." Think of these as exclusive parties where the only guests allowed are non-negative integers (0, 1, 2, 3...) that follow a strict rule: if you invite two guests, you must also invite their sum. If 3 and 5 are at the party, 8 must be there too. But some numbers, like 1 or 2, might be locked out forever. Mathematicians love these parties because they hide deep secrets about shapes, patterns, and even the structure of the universe.

Now, picture these number parties happening inside a strange, twisted geometric landscape called a "surface singularity." It's like a crumpled piece of paper where the crease is so sharp it breaks the rules of normal geometry. When you zoom in on this sharp point, the way the numbers behave is governed by a "Seifert structure," which is essentially a blueprint of how the space is twisted and wrapped. The big question mathematicians have been asking is: Can we build a specific blueprint (a graph) for any given number party? If we have a list of rules for a number party, can we always find a geometric shape that produces exactly those rules? This paper dives into a particularly tricky type of number party called a "system of proportionally modular numerical semigroups" and asks if these complex gatherings can always be matched with a geometric blueprint.

The authors of this paper, Zsolt Baja, Tamás László, and Zsuzsa Nagy, have proven that the answer is a resounding yes. They show that every single one of these complex number systems can be represented by a specific, canonical geometric blueprint.

To understand how they did it, imagine you have a recipe for a cake (the number system) that is actually a combination of several simpler recipes mixed together. In math terms, these "systems" are formed by taking the intersection of several simpler "proportionally modular" (PM) semigroups. It's like saying, "I only want the numbers that are in Party A and Party B and Party C." The authors knew that each individual simple party (PM semigroup) could be represented by a geometric blueprint with just two "legs" (like a simple fork). However, when you try to combine them, the blueprints don't just stack neatly; they interfere with each other in messy ways.

The team's breakthrough was to treat these geometric blueprints like building blocks that can be glued together, but with a very specific twist: they had to glue them with the right "multiplicities." Think of it like stacking Lego towers. If you just stack them randomly, the structure collapses. But if you calculate exactly how many copies of Tower A you need to balance Tower B, you can build a stable, towering structure that represents the whole complex system. The authors developed a precise formula to determine these "multiplicities" (how many copies of each blueprint to use) based on the "orbifold Euler numbers" (a measure of the shape's curvature and complexity).

They proved that by taking the sum of these weighted blueprints, the resulting shape perfectly mimics the rules of the combined number system. In their own words, they constructed a "canonical equivariant resolution graph" for any such system. This means that no matter how complicated the system of inequalities defining the numbers is, there is always a corresponding geometric shape that generates it.

The paper also explores the limits of this method. While they showed that every such system can be built this way, they also demonstrated that the reverse isn't always true: not every geometric shape built from these specific rules will result in a system of this type. It's a one-way street: you can always find a shape for the number rules, but not every shape you build will fit those specific rules.

In a playful example, they took a specific set of numbers (11, 14, 15, 18, 19, 21) and showed how to break it down into simpler parts, calculate the necessary "weights" for the blueprints, and glue them together to form a single, complex graph that perfectly reproduces the original set. They even provided a counter-example to show that if you try to use the wrong weights (or if the shapes are too complex with too many legs), the math breaks down, proving that their specific method of calculating multiplicities is essential.

Ultimately, this work bridges the gap between the abstract world of number theory and the tangible world of geometry. It confirms that these intricate number patterns are not just random collections of integers but are deeply rooted in the geometry of singular surfaces. The authors didn't just guess; they provided a rigorous mathematical proof, constructing the exact graphs needed for any system of proportionally modular numerical semigroups, effectively solving the "representability" problem for this specific class of number parties.

Technical Summary: Representability of Systems of Proportionally Modular Numerical Semigroups

Problem Statement
The paper addresses the "representability question" within the intersection of algebraic geometry, low-dimensional topology, and combinatorics. Specifically, it investigates whether every System of Proportionally Modular (SPM) numerical semigroups can be realized as the numerical semigroup associated with a canonical equivariant resolution graph of a normal weighted homogeneous surface singularity with a rational homology sphere link.

While individual Proportionally Modular (PM) semigroups were previously established as representable by two-legged canonical equivariant resolution graphs (associated with cyclic quotient singularities), the representability of their intersections (SPM semigroups) remained an open problem. The core difficulty lies in the fact that the intersection of representable semigroups is not generally known to be representable, as the interplay between the quasi-linear functions governing different Seifert structures can be highly non-trivial.

Methodology
The authors construct a representation for any SPM semigroup by leveraging its combinatorial structure and the geometric properties of resolution graphs:

Toms Decomposition: The authors utilize the Toms decomposition theorem, which states that any SPM semigroup $S$ can be expressed as an intersection of PM semigroups sharing a unified denominator $n$ :
$S = \frac{1}{n} \bigcap_{i=1}^r \langle \alpha_{i1}, \alpha_{i2} \rangle$
where each block $\langle \alpha_{i1}, \alpha_{i2} \rangle/n$ is a PM semigroup.
Quotient Representations: For each PM block $P_i = \langle \alpha_{i1}, \alpha_{i2} \rangle/n$ , the authors select a specific two-legged canonical equivariant resolution graph $\Gamma_i$ . Crucially, they ensure that the determinant of the graph $\Gamma_i$ corresponds exactly to the denominator $n$ of the quotient representation.
Graph Summation with Multiplicities: To represent the intersection $S = \bigcap P_i$ , the authors construct a new graph $\Gamma$ by taking a weighted sum of the individual graphs $\Gamma_i$ :
$\Gamma = \sum_{i=1}^r q_i \Gamma_i$
The multiplicities $q_i$ are not arbitrary; they are calculated recursively based on the orbifold Euler numbers $|e_i|$ of the individual graphs. Specifically, if the graphs are ordered such that $|e_1| \le |e_2| \le \dots \le |e_r|$ , the multiplicities are defined to control the behavior of the combined quasi-linear function $N_\Gamma(\ell) = \sum q_i N_{\Gamma_i}(\ell)$ .
Verification via Quasi-Linear Functions: The proof relies on analyzing the quasi-linear function $N(\ell)$ , which counts the dimension of homogeneous pieces of the graded ring. The authors demonstrate that for the constructed graph $\Gamma$ , the condition $N_\Gamma(\ell) \ge 0$ holds if and only if $N_{\Gamma_i}(\ell) \ge 0$ for all $i$ , thereby proving $S_\Gamma = S$ .

Key Contributions and Results

Main Theorem (Theorem 1.1): The paper proves that every system of proportionally modular numerical semigroups is representable. This is achieved by explicitly constructing a canonical equivariant resolution graph (specifically, a star-shaped graph with $2r$ legs) that realizes the given SPM semigroup.
Explicit Construction Algorithm: The authors provide a concrete algorithm to determine the Seifert invariants of the representing graph. This involves:
- Decomposing the SPM semigroup into a Toms decomposition.
- Constructing the two-legged graphs for the individual PM blocks.
- Calculating the specific multiplicities $q_i$ required to sum these graphs.
Refinement of Intersection Properties: The work clarifies the relationship between the intersection of semigroups and the sum of their graphs. It shows that for SPM semigroups, the inclusion $S_{\Gamma_1} \cap S_{\Gamma_2} \subset S_{\Gamma_1 + \Gamma_2}$ (established in prior literature) can be made an equality through the careful assignment of multiplicities, though the authors note this specific argument relies on the two-legged nature of the representations and may not generalize to arbitrary graphs.
Counter-Examples and Limitations: The paper demonstrates that the converse is not true: not every numerical semigroup associated with a star-shaped graph of this type is an SPM semigroup (Example 4.4). This highlights that the class of SPM semigroups is a specific subset of representable semigroups.

Significance and Claims
The paper claims to bridge a significant gap in the theory of representable numerical semigroups. By proving that the intersection of PM semigroups (which are individually representable) remains representable within the context of weighted homogeneous surface singularities, the authors extend the scope of semigroups that can be studied via topological Seifert structures.

The significance lies in:

Unification: It connects the combinatorial definition of SPM semigroups (via Diophantine inequalities) directly to the geometric topology of surface singularities.
Constructive Proof: Unlike existential proofs, this work provides a method to explicitly generate the resolution graph for any given SPM semigroup.
Foundational Step: The authors frame this as a step toward understanding the Frobenius problem and genus formulas for these semigroups through topological invariants, though they do not derive new formulas for these specific problems in this note.

The authors remain modest regarding the scope, noting that their method relies on the specific "two-legged" structure of PM representations and that the general question of whether all intersections of representable semigroups are representable remains open. They conclude by posing questions regarding the topological characterization of the specific class of star-shaped graphs that yield SPM semigroups.

More like this