🔢 mathematics

On combinatorial bounds for the total Tjurina numbers of certain curves and surfaces with isolated singularities

This paper establishes new combinatorial inequalities and sharp quadratic lower bounds for the total Tjurina numbers of free line and conic arrangements with ordinary quasi-homogeneous singularities, and applies these results to construct surfaces in $\mathbb{P}^3$ with arbitrarily large total Tjurina numbers independent of detailed homological data.

Original authors: Piotr Pokora

Published 2026-06-24

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Piotr Pokora

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 you are an architect designing a city made entirely of straight roads (lines) and circular roundabouts (conics). In this mathematical city, the "traffic jams" where these roads and roundabouts cross each other are called singularities.

This paper, written by Piotr Pokora, is essentially a set of rules for counting how "busy" or "complex" these traffic jams can be, specifically when the city is built in a very special, efficient way called a "free arrangement."

Here is a breakdown of the paper's main ideas using simple analogies:

1. The "Traffic Jam" Score (The Tjurina Number)

In this paper, the author uses a score called the Tjurina number to measure the complexity of a traffic jam.

The Analogy: Imagine a single intersection where two roads cross. That's a simple jam. Now imagine a massive intersection where 10 roads, 5 roundabouts, and 3 overpasses all crash into the exact same spot. That is a "high-multiplicity" jam.
The Score: The Tjurina number is like a "stress score" for that intersection. The more roads and shapes meeting at one point, the higher the score. The paper is interested in the Total Tjurina Number, which is the sum of the stress scores for every single intersection in the entire city.

2. The Goal: Finding the Minimum Stress

For a long time, mathematicians knew how to calculate the maximum possible stress a city could have (the worst-case scenario). However, they didn't have a good rule for the minimum stress.

The Question: If I build a city with a specific number of roads and roundabouts, and I make sure the city is "free" (meaning it has a very specific, efficient mathematical structure), what is the lowest possible total stress score I can get?
The Discovery: The author found a new "floor" for this score. He proved that no matter how you arrange your roads and roundabouts, if you follow the "free" rules, the total stress score must be at least a certain amount.

3. The Quadratic Growth (The "Explosion" of Complexity)

One of the most important findings is how this stress score grows as you add more roads.

The Analogy: If you add one more road to a small city, the stress goes up a little. But if you keep adding roads to a "free" city, the stress doesn't just go up by a little bit each time; it explodes.
The Math: The paper shows that the total stress score grows quadratically. Think of it like this: If you double the number of roads, the stress doesn't double; it quadruples (or even more). The author proves that for a city with $d$ lines and $k$ conics, the stress is at least roughly proportional to the square of those numbers.
Why it matters: This means you cannot build a "free" city with a lot of roads and keep the traffic jams simple. The complexity is unavoidable.

4. The "Super-Organized" Cities (Supersolvable Arrangements)

The author also looked at a specific type of city called a "supersolvable" arrangement. These are cities where the traffic jams are organized in a very rigid, hierarchical way (like a tree structure).

The Finding: For these super-organized cities, if you limit the size of the biggest traffic jam (no more than 4 roads meeting at once), there are only a finite number of ways you can build them. You can't just keep adding roads forever and stay within these rules; eventually, the math forces you to stop or break the rules.

5. Building 3D Towers from 2D Cities

Finally, the author took his findings about 2D cities (flat maps) and used them to build 3D towers (surfaces in space).

The Analogy: Imagine taking your flat city map and stacking it up into a 3D tower. The author showed that if your flat city has a high "stress score," the resulting 3D tower will also have a very high stress score.
The Result: This allows mathematicians to create 3D shapes with "isolated" singularities (tiny, specific points of complexity) that have arbitrarily large stress scores. Crucially, this new way of calculating the score doesn't require knowing the deep, hidden "DNA" (homological data) of the shape; it just looks at the visible geometry.

Summary

In short, this paper says:

There is a minimum limit to how simple a "free" arrangement of lines and curves can be.
Complexity grows fast: As you add more components, the total complexity (Tjurina number) shoots up quadratically.
We can predict limits: For certain highly organized arrangements, there are only a few possible ways to arrange them if you keep the intersections small.
2D rules build 3D structures: These flat rules help us understand and build complex 3D shapes with predictable levels of "stress."

The paper provides a new "rule of thumb" for mathematicians to estimate the complexity of these geometric shapes without needing to solve incredibly difficult, hidden equations.

Technical Summary: Combinatorial Bounds for Total Tjurina Numbers of Certain Curves and Surfaces

Problem Statement
The paper addresses the problem of establishing effective lower bounds for the total Tjurina numbers ( $\tau$ ) of projective hypersurfaces, specifically focusing on plane curve arrangements (lines and conics) and their extensions to surfaces in $\mathbb{P}^3$ . While sharp upper bounds for $\tau$ in terms of degree and the minimal degree of Jacobian relations ($mdr$) are well-established (notably by du Plessis and Wall), effective lower bounds for geometrically constrained configurations, such as free arrangements with prescribed singularity types, remain less understood. The work targets arrangements admitting only ordinary quasi-homogeneous singularities, aiming to link combinatorial intersection properties directly to the magnitude of the total Tjurina number.

Methodology
The research employs a synthesis of combinatorial geometry, singularity theory, and the homological properties of Jacobian algebras.

Combinatorial Inequalities: The author utilizes Hirzebruch-type inequalities and naive combinatorial counts of intersection points ( $n_r$ , the number of points of multiplicity $r$ ) to derive structural constraints on line arrangements.
Freeness Conditions: The analysis heavily relies on the definition of "free" arrangements, where the module of Jacobian syzygies is a free graded module. This allows the use of specific characterizations relating the degree, exponents, and total Tjurina number (via the du Plessis-Wall equality for free curves).
Discriminant Analysis: For conic-line arrangements, the proof involves analyzing the discriminant of the quadratic equation governing the minimal degree of Jacobian relations ( $d_1$ ) derived from the freeness condition.
Thom-Sebastiani Principle: To extend results to higher dimensions, the paper constructs surfaces in $\mathbb{P}^3$ by adding a power of a fourth variable to the defining polynomial of a plane curve. The local nature of the Tjurina number allows the application of the Thom-Sebastiani principle to relate the $\tau$ of the surface to that of the underlying curve.

Key Contributions and Results

Structural Bounds for Line Arrangements:
- The paper derives a structural inequality for complex line arrangements with bounded multiplicities. Specifically, for an arrangement of $d \ge 6$ lines with maximal multiplicity $m(L) \le 4$ , the paper establishes tight bounds on the distribution of triple and quadruple points ( $n_3$ and $n_4$ ).
- Theorem 3.5 demonstrates that for supersolvable line arrangements with $m(L)=4$ , the number of lines $d$ is restricted to the finite set $\{6, 7, 8, 9, 10\}$ . Consequently, Corollary 3.6 concludes there are only finitely many combinatorial types of such supersolvable arrangements.
Lower Bounds for Free Conic-Line Arrangements:
- Theorem 4.1 constitutes the main result, providing a sharp lower bound for the total Tjurina number of a free arrangement of $d$ lines and $k$ conics with ordinary quasi-homogeneous singularities:
  $\tau(C_L) \ge \frac{3k(k-1) + 3kd + 3(d-1)^2}{4}$
- The bound is shown to be sharp, with equality achieved in specific cases (e.g., an arrangement of 3 lines and 1 conic).
- As a corollary (Corollary 4.2), for a free arrangement of $d$ lines alone, $\tau(L) \ge \frac{3(d-1)^2}{4}$ . This is illustrated by the Klein arrangement of 21 lines, where the bound predicts $\tau \ge 300$ , and the actual value is 301.
Extension to Surfaces in $\mathbb{P}^3$ :
- Proposition 5.2 applies the planar results to construct a family of surfaces in $\mathbb{P}^3$ with only isolated singularities. By defining a surface $X$ via $F = f(x,y,z) + w^{2k+d} = 0$ (where $f$ defines a free conic-line arrangement), the paper establishes a lower bound for the total Tjurina number of $X$ :
  $\tau(X) \ge (2k + d - 1) \cdot \left( \frac{3k(k-1) + 3kd + 3(d-1)^2}{4} \right)$
- This result provides lower bounds for hypersurfaces that are independent of detailed homological data (specifically the minimal degree of Jacobian relations of the surface itself), relying instead on the combinatorial data of the underlying plane arrangement.

Significance and Claims
The paper claims to bridge the gap between the combinatorial geometry of arrangements and the singularity theory of hypersurfaces. Its primary significance lies in shifting the focus from upper bounds (which characterize maximal Tjurina curves) to effective lower bounds for free arrangements.

The results demonstrate that free arrangements are highly constrained; their combinatorics strongly restrict possible singular configurations, leading to quadratic growth of the total Tjurina number with respect to the number of components.
The construction of surfaces with arbitrarily large total Tjurina numbers offers a new method for generating varieties with controlled singular behavior without requiring explicit calculation of homological invariants for the higher-dimensional object.
The work highlights open problems, such as the classification of geometrically free line arrangements with fixed degree and maximal multiplicity, noting that while the Klein arrangement is known, the realizability of other combinatorial types remains an open question.