🔢 mathematics

On arrangements of plane real quartics with respect to three lines

This paper completes the classification of mutual arrangements between a smooth real quartic curve and three lines, identifying a unique configuration that is realizable pseudoholomorphically but not algebraically through combinatorial patchworking on an irregular triangulation.

Original authors: S. Yu. Orevkov

Published 2026-07-23

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: S. Yu. Orevkov

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 shapes aren't just drawn on paper but are built from the very fabric of mathematics, living in a space called the real projective plane. Think of this space as a giant, magical sphere where the top and bottom, left and right, all touch each other, so if you walk off one edge, you pop up on the other. In this world, mathematicians study "curves"—smooth, looping lines that can twist and turn but never cross themselves in a messy way. They are particularly interested in "quartics," which are curves with a specific level of complexity (degree 4), looking a bit like a four-leaf clover or a figure-eight with extra loops.

The big puzzle in this corner of math is figuring out how these curves can arrange themselves alongside straight lines. It's like trying to solve a 3D jigsaw puzzle where the pieces are flexible rubber bands and the grid is made of laser beams. The question is: Can you draw a specific pattern of a wiggly curve and three straight lines that looks mathematically possible, but when you try to build it using the strict rules of algebra (the "algebraic" rules), it simply refuses to exist? This isn't just a game; it helps mathematicians understand the hidden limits of geometry and how different mathematical "universes" (algebraic vs. pseudoholomorphic) can be slightly different from one another.

The Paper's Discovery: The One Pattern That Breaks the Rules

In this paper, mathematician S. Yu. Orevkov acts like a detective solving a massive case of "missing patterns." He is finishing a classification project started by another researcher, Maletto, which was trying to list every possible way a smooth quartic curve and three lines can sit together in this magical space. The specific rule for this case is that every loop (or "oval") of the curve must be touched by at least one of the three lines—no floating loops allowed.

Orevkov proves that out of all the patterns that looked suspiciously possible, almost all of them are actually impossible to build, whether you use the flexible rules of "pseudoholomorphic" geometry or the strict rules of "algebraic" geometry. He uses a clever trick: he imagines squishing the three straight lines together until they become a single curved shape (a conic). When he does this, the impossible patterns turn into shapes that are known to be mathematically forbidden. It's like realizing a certain arrangement of furniture in a room would make the walls collapse if you tried to build it.

The One Weird Exception

However, there is one special arrangement that Orevkov finds which is the star of the show. This pattern is a "shape-shifter." It is realizable if you use the flexible, slightly looser rules of pseudoholomorphic curves (think of it as a shape that can exist in a slightly more magical universe). But, it is strictly impossible to build if you must follow the rigid, classical rules of algebraic curves.

This is a huge deal because it's the first time anyone has found a pattern created by a method called "combinatorial patchworking" that works in the flexible world but fails in the algebraic one. Imagine you have a recipe for a cake. If you follow the recipe using "magic flour" (pseudoholomorphic), you get a delicious cake. But if you try to use "regular flour" (algebraic), the cake turns into a brick. Orevkov shows exactly how to bake this "magic cake" using a specific, irregular grid (a triangulation) and proves that no amount of tweaking with regular flour will ever make it work.

How They Proved It

To prove this one pattern is the only one of its kind, Orevkov uses a few different tools. First, he uses a method involving "braids" (twisting strands) to show that the pattern can indeed be built in the flexible world. Then, he uses a classic technique called the "Hilbert–Rohn–Gudkov method" to show that if you try to build it with algebraic rules, you run into a contradiction—like trying to fit a square peg in a round hole where the hole is actually a triangle.

He also explores a "what if" scenario: what if you add a fourth line? He shows that even with this extra line, the pattern remains a shape-shifter: it exists in the flexible world but not the algebraic one.

The Bottom Line

The paper concludes that we now have a complete list of all the possible arrangements for these curves and lines that can be built with algebraic rules. The list is complete, except for one tiny gap: that one magical, algebraic-impossible arrangement. Orevkov has proven that this specific pattern is the only one that can be made with the flexible "patchworking" method but cannot exist in the strict algebraic world. It's a definitive proof that in the world of math, sometimes the rules of the game change depending on which version of reality you are playing in.

Technical Summary: On Arrangements of Plane Real Quartics with Respect to Three Lines

Problem Statement
This paper addresses the classification of mutual arrangements of a smooth real algebraic (or real pseudoholomorphic) quartic curve ( $C_4$ ) and three lines ( $L_x, L_y, L_z$ ) in the real projective plane $\mathbb{RP}^2$ . The study focuses specifically on "floatless" arrangements, defined as configurations where the union of the three lines intersects every oval of the quartic curve. This work completes a classification initiated by Maletto in a recent preprint [4], which utilized computer programs to establish bounds on the number of realizable arrangements but left 49 floatless arrangements and 39 arrangements involving two lines as open cases regarding their realizability.

Methodology
The author employs a combination of topological constraints, braid theory, and algebraic geometry techniques to determine the realizability of specific arrangements:

Perturbation and Conic Analysis: To disprove realizability, the author perturbs the three lines into a conic. By referencing known classifications of quartic-conic arrangements (specifically those in [10]), the paper demonstrates that certain arrangements of the quartic and three lines would imply the existence of non-realizable quartic-conic configurations.
Braid Theory and Fiberwise Arrangements: For arrangements not excluded by conic perturbations, the author analyzes the arrangement relative to a pencil of lines ( $L_p$ $L_{p}$ -schemes). By computing the associated 6-strand braids, the paper applies the criterion that a pseudoholomorphic arrangement is realizable if and only if all corresponding braids are quasipositive.
- Linking Numbers: Used to exclude arrangements marked "Lk" in the analysis tables.
- Murasugi-Tristram Inequality: Applied to exclude arrangements marked "MT" using the signature of the braid.
Hilbert–Rohn–Gudkov Method: To distinguish between pseudoholomorphic and algebraic realizability, the author utilizes a variant of the Hilbert–Rohn–Gudkov method. This involves analyzing the pencil of quartics $C_t$ defined by $f + tl = 0$ (where $f$ is the quartic and $l$ is the product of the lines). The proof examines the evolution of the curve as $t$ varies, specifically looking for the formation of singularities (nodes) and applying the genus formula to show that certain topological transitions required for algebraic realizability are impossible.
Combinatorial Patchworking: The paper constructs realizations using Viro's combinatorial patchworking on an irregular primitive triangulation of the triangle $[(0, 0), (4, 0), (0, 4)]$ .

Key Contributions and Results

Completion of Classification: The paper proves that all previously unknown arrangements of $(C_4, L_x, L_z)$ and floatless $(C_4, L_x, L_y, L_z)$ listed in [4] are not realizable by real pseudoholomorphic curves, with exactly one exception.
The Exceptional Arrangement: There exists a specific floatless arrangement (depicted in Figure 2 of the paper) that is:
- Pseudoholomorphically Realizable: Proven via the construction of quasipositive braids and explicit patchworking.
- Algebraically Unrealizable: Proven via the Hilbert–Rohn–Gudkov method, which shows that the necessary topological evolution of the curve to form this arrangement cannot occur within the constraints of real algebraic geometry.
First Example of Combinatorial Non-Algebraic Patchworking: The paper identifies that the algebraically unrealizable arrangement can be constructed via combinatorial patchworking on an irregular triangulation. The author notes this is the first known example where a combinatorial patchworking (defined solely by a triangulation and sign distribution) produces a piecewise-linear (PL) curve whose arrangement relative to coordinate axes is not realizable by a real algebraic curve of the same degree.
Rigid Isotopy Distinctions: The paper establishes that the pseudoholomorphic curves realizing the exceptional arrangement via different $L_p$ -schemes (left vs. right in Figure 4) are not rigidly isotopic. This is demonstrated by showing that a continuous deformation between them would violate the Bezout theorem.

Significance and Claims
The paper claims to provide a complete classification of algebraically realizable arrangements for $(C_4, L_x, L_z)$ and floatless $(C_4, L_x, L_y, L_z)$ . The primary significance lies in the discovery of the gap between the sets of pseudoholomorphic and algebraic realizable arrangements for reducible curves.

The author highlights that the algebraically unrealizable arrangement in Figure 2 is realizable by a patchworking along the unique (up to symmetry) irregular primitive triangulation of the relevant triangle. This finding is presented as a counterexample to the intuition that combinatorial patchworking always yields algebraically realizable arrangements, marking the first such instance in $\mathbb{RP}^2$ for degree 4.

The paper concludes modestly, suggesting that while the methods presented could advance the classification of all arrangements (not just floatless) of $(C_4, L_x, L_y, L_z)$ , the remaining 8198 open cases are likely too numerous for manual resolution and would require computational upgrades to the existing software in [4].

More like this