🔢 mathematics

Deletion-addition of a smooth conic for free curves

This paper investigates how the freeness of a reduced plane projective curve is affected by the deletion or addition of a smooth conic, extending known results from line arrangements to conic-line configurations and establishing new geometric and combinatorial obstructions.

Original authors: Anca Macinic

Published 2026-03-25

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Anca Macinic

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 roads (lines) and roundabouts (smooth circles/conics). In the mathematical world of this paper, these cities are called arrangements.

Some of these cities have a special property called "Freeness." Think of "Freeness" as the city having a perfect, efficient traffic flow. If you know the rules of the roads, you can predict exactly how traffic moves everywhere without getting stuck. It's a very stable, elegant structure.

The author of this paper, Anca Măcinic, is asking a very specific question: What happens to this perfect traffic flow if we suddenly remove a roundabout, or if we add a brand new one?

Here is the breakdown of the paper using simple analogies:

1. The Setup: The City and the Roundabout

The City ( $C$ ): A collection of lines and smooth circles (conics) drawn on a flat plane.
The "Free" City: A city where the traffic rules (mathematical equations) are perfectly balanced.
The Operation: The author studies two moves:
1. Deletion: Taking a smooth roundabout out of the city.
2. Addition: Dropping a new smooth roundabout into the city.

2. The Big Discovery: It's Not Just "Free" or "Broken"

In the past, mathematicians thought that if you took a piece out of a perfect city, the result would either:

Still be a Perfect City (Free).
Or be a Messy City (Not Free).

This paper proves that there is actually a third option, a "Middle Ground."

When you add or remove a roundabout, the resulting city can be:

Free: The traffic is still perfectly balanced.
Plus-One Generated: The traffic is almost perfect. It has a tiny, specific glitch that makes it slightly more complex, but it's still very organized. Think of it as a city that needs one extra traffic light to run smoothly.
Type 2 (The "Neither" Case): The city is now a bit chaotic. The traffic flow is broken in a way that requires a much more complex description. It's neither perfectly free nor just "almost free."

3. The "Magic Count" (How to Predict the Outcome)

The most exciting part of the paper is that the author found a simple way to predict which of the three outcomes will happen. You don't need to solve complex equations; you just need to count.

Imagine the roundabout you are adding or removing is a giant rubber band.

The Count: Count how many times this rubber band touches the other roads in the city.
The Rule:
- If the count matches a specific number related to the city's current "exponents" (its traffic complexity), the city stays Free.
- If the count is just one step away from that number, the city becomes Plus-One Generated (the "almost perfect" state).
- If the count is too high or too low, the city becomes Type 2 (the messy state).

The paper provides a precise formula: Count the intersections + a small correction factor for "bumpy" spots (singularities). If the total matches the magic numbers, you know exactly what kind of city you will get.

4. Why This Matters

Building New Cities: This gives mathematicians a "Lego guide." If they want to build a new "Free" city or a "Plus-One" city, they can start with an existing one and simply add or remove a roundabout, knowing exactly what the result will be.
Solving Old Puzzles: There was a long-standing mystery (Terao's Conjecture) about whether the shape of the roads determines the traffic flow. This paper helps clarify the rules of that game, showing that while the shape matters, the specific way roads intersect is the key to unlocking the traffic secrets.
Generalizing: The author shows these rules work not just for simple cities made of lines and circles, but for any complex shape made of curves, as long as we adjust the "count" for bumpy spots.

Summary Analogy

Think of a Free Curve as a perfectly tuned orchestra.

Deletion/Addition is like removing or adding a violinist.
The Paper tells us: "If you remove a violinist, the orchestra will either:
1. Still sound perfect (Free).
2. Sound perfect but with one slightly different note (Plus-One).
3. Sound a bit off-key (Type 2).
And here is the secret: You can predict the result just by counting how many other musicians the violinist was playing with!"

This paper essentially gives us the "instruction manual" for predicting the musical harmony of these mathematical cities when we change their lineup.

1. Problem Statement and Context

The paper addresses the freeness property of reduced plane projective curves, specifically focusing on Conic-Line (CL) arrangements (unions of lines and smooth conics) and general reduced curves.

Background: In the theory of hyperplane arrangements, the "freeness" of an arrangement (defined by the freeness of its module of logarithmic derivations) is a central concept. Terao's Conjecture posits that freeness is a combinatorial property. While this remains open for line arrangements, the situation is more complex for curves.
The Gap: Previous work (e.g., Schenck-Tohăneanu) established addition-deletion results for curves under strict quasihomogeneity assumptions, primarily focusing on cases where the resulting curve remains free.
The Objective: The author investigates the behavior of a free reduced curve when a smooth conic is either deleted from it or added to it. The goal is to characterize the resulting curve completely: determining whether it remains free, becomes plus-one generated, or falls into a third category (neither free nor plus-one generated), without necessarily restricting to quasihomogeneous cases.

2. Methodology

The paper employs a combination of algebraic geometry, homological algebra, and combinatorial techniques:

Logarithmic Derivations: The core object of study is the module of logarithmic derivations $D_0(C)$ associated with a curve $C$ . The curve is free if this module is free; it is plus-one generated if it admits a specific minimal resolution of length 2 with a specific structure.
Exact Sequences: The proofs rely heavily on short exact sequences of sheaves relating the derivations modules of the original curve ( $C$ $C$ ), the curve with the conic removed/added ( $C'$ $C^{'}$ ), and the intersection ( $C''$ $C^{''}$ ).
- For quasihomogeneous triples, the author utilizes the sequence:
  $0 \to E_{C'}(-2) \xrightarrow{\cdot f_C} E_C \to i_* \mathcal{O}_{\mathbb{P}^1}(-k) \to 0$
  where $k = |C' \cap C|$ .
- For non-quasihomogeneous cases, the author generalizes this using a sequence involving the defect from quasihomogeneity ( $\epsilon$ ):
  $0 \to E_{C'}(-2) \xrightarrow{\cdot f_C} E_C \to i_* \mathcal{O}_{\mathbb{P}^1}(-k - \epsilon(C', C)) \to 0$
  where $k = |C' \cap C| + \epsilon(C', C)$ .
Hilbert Series Analysis: By computing the Hilbert series of the derivations modules using the exact sequences, the author determines the degrees of the generators (exponents) of the resulting modules.
Generalized Exponents: The paper uses the concept of generalized exponents $(d_1, d_2, \dots)$ $(d_{1}, d_{2}, \dots)$ derived from the minimal free resolution of $D_0(C)$ $D_{0} (C)$ . The classification of the curve depends on the relationship between the sum of the first two exponents and the degree of the curve:
- Free: $d_1 + d_2 = \deg(C) - 1$
- Plus-one generated: $d_1 + d_2 = \deg(C)$
- Neither: $d_1 + d_2 > \deg(C)$

3. Key Contributions and Results

A. Complete Classification of Deletion and Addition

The paper provides necessary and sufficient conditions to determine the nature of the resulting curve after adding or deleting a smooth conic.

1. Deletion of a Conic (Theorem 3.2 & 3.14):
Given a free curve $C$ with exponents $(a, b)$ and a smooth conic component $C_{conic}$ , let $k$ be the weighted intersection count (intersection points + defect $\epsilon$ ).

Free: Occurs if $k$ matches specific values related to $a$ or $b$ (e.g., $k=2m$ with $m \in \{a, b\}$ ). The new exponents are $(a-2, b)$ or $(a, b-2)$ .
Plus-one Generated: Occurs if $k$ is slightly smaller (e.g., $m = a-1$ ). The new exponents are $(a, b-1)$ .
Neither: Occurs if $k$ is too small ( $m \le a-2$ ). The paper explicitly describes the minimal resolution for this case, showing the curve is of a specific "Type 2" (a term later formalized in related literature).

2. Addition of a Conic (Theorem 3.7 & 3.16):
Given a free curve $C'$ and adding a smooth conic $C_{conic}$ not in $C'$ :

Free: Occurs if the intersection count $k$ matches the exponents of $C'$ (e.g., $m \in \{a', b'\}$ ).
Plus-one Generated: Occurs if $k$ is slightly larger (e.g., $m = b' + 1$ ).
Neither: Occurs if $k$ is too large ( $m \ge b' + 2$ ). The paper provides the precise minimal resolution for the resulting module.

B. Generalization to Non-Quasihomogeneous Curves

A significant contribution is the removal of the quasihomogeneity assumption.

Theorems 3.14 and 3.16 extend the results to arbitrary reduced curves by incorporating the defect from quasihomogeneity ( $\epsilon$ ) into the intersection count $k$ .
This allows the application of these deletion-addition rules to curves with non-quasihomogeneous singularities, which was previously a limitation in the literature.

C. Geometric and Combinatorial Obstructions

The paper generalizes known obstructions for line arrangements (Abe's Theorems) to free reduced curves (Theorems 2.6, 2.8, 3.11, 3.18).

Restriction to Lines/Conics: It establishes bounds on the number of intersection points between a free curve and an arbitrary line or conic (whether part of the arrangement or external).
Significance: These results provide combinatorial constraints that must be satisfied for a curve to be free, generalizing Terao's conjecture-related constraints to the curve setting.

D. Connection to "Type 2" Curves

The author notes (Remark 3.19) that the "neither free nor plus-one generated" cases identified in the theorems correspond to the recently introduced notion of Type 2 curves (from reference [7]). This unifies the paper's findings with the broader classification of curve singularities and freeness.

4. Significance

Inductive Tools: The results provide powerful inductive tools (addition-deletion theorems) for constructing new examples of free and plus-one generated curves, as well as identifying non-free curves.
Resolution of Open Questions: The paper answers an open question from [14] regarding the type of CL-arrangement resulting from deleting a conic from a free CL-arrangement.
Unification: It unifies the theory of hyperplane arrangements and plane curves by showing that while the behavior of addition is more complex in higher dimensions (producing non-free/non-plus-one curves), the deletion operation and the specific "plus-one generated" property behave symmetrically and predictably in the context of plane curves with conics.
Computational Verification: The theoretical results are supported by concrete examples (Section 4) computed using Macaulay2 and Singular, demonstrating the application of the theorems to both quasihomogeneous and non-quasihomogeneous cases.

In summary, Măcinic's work extends the classical addition-deletion theory of Terao and Abe to the realm of conic-line arrangements and general reduced curves, providing a complete classification of the freeness properties of the resulting curves and removing the restrictive quasihomogeneity hypothesis.