On the quadratic length of plane Cremona maps of degree 4
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "On the quadratic length of plane Cremona maps of degree 4".
Emmy: Here's the gist of the paper. Every non-linear plane Cremona map can be decomposed into quadratic maps, and the minimum number of quadratic maps required is called its quadratic length<ref:2609.39943#pg6>.
Ada: This paper studies the quadratic length of plane Cremona maps of degree 4<ref:2609.39943#pg2>.
Emmy: The paper introduces the concept of quadratic length, defined as the minimum number of quadratic maps needed to decompose a plane Cremona map<ref:2609.39943#pg2> Recall that in
2: , Blanc and Furter defined and studied the length of φ as the minimum number of de Jonqui'eres maps needed to decompose φ<ref:2609.39943#pg2>.
Ada: The quadratic length is related to the homaloidal type of a plane Cremona map, which is denoted by (d; m1,..., mr)<ref:2609.39943#pg2> For degree 4 maps, they are either de Jonqui'eres or their homaloidal type is (4; 23, 1 3)<ref:2609.39943#pg2> In the former case, they have length 1, while in the latter case, they have length 2<ref:2609.39943#pg2>.
Paper summary: Ada: So, looking at the conclusion of "On the quadratic length of plane Cremona maps of degree four", we see that they've systematically investigated these maps by linking their structure to these enriched weighted proximity graphs <ref:2609.39943#pg1,On the quadratic length of plane Cremona maps of degree 4>. The main finding is that for a degree four map, the quadratic length is either three, four, or five depending on its underlying structure <ref:2609.39943#pg2>.
Emmy: And they've shown that this classification comes from analyzing the ninety possible enriched weighted proximity graphs for degree four maps of length one <ref:2609.39943#pg2>. This means there is a finite set of geometric configurations that determine the quadratic length <ref:2609.39943#pg2>.
Kolya: So, what does this mean for the world? It means we've established a concrete way to calculate these decomposition numbers by classifying these graphs, which helps us understand the underlying geometry more deeply <ref:2609.39943#pg2>. We can use this to probe the structure of transformations that are beyond simple quadratic maps.
Ada: Right. It's about moving from a general property, like "every map decomposes into quadratics", to knowing the exact number for specific degrees and types <ref:2609.39943#pg2>. This gives us a more precise toolkit for understanding these birational transformations.
Emmy: And it connects the algebraic geometry—the homaloidal type—to the combinatorial structure of these proximity graphs <ref:2609.39943#pg2>. It shows how the way points are arranged on the plane dictates how many quadratic maps you need to break it down.
Kolya: And they confirm that this entire classification process is sound because they rule out possibilities by showing contradictions, like assuming a length of four leads to a map type that we already know contradicts the initial setup <ref:2609.39943#pg2>. The systematic elimination process confirms the derived quadratic lengths are correct <ref:2609.39943#pg2>.
Ada: So, in short, for degree four maps, we have a complete picture of the quadratic length being three, four, or five based on their structure <ref:2609.39943#pg2>. This is a solid result derived from classifying ninety geometric configurations <ref:2609.39943#pg2>.
Emmy: And the implications are that we've found a way to relate the abstract algebraic properties of Cremona maps to very concrete, countable geometric objects like proximity graphs <ref:2609.39943#pg2>. That connection is what makes this work interesting for us as algebraic geometers.
Kolya: And for probabilists, it means we can use these structural constraints to understand the tails of the distribution governed by these maps <ref:2609.39943#pg2>. We are looking at how these specific structural limits govern the behavior of the system <ref:2609.39943#pg2>.
Ada: So we've got a solid result for degree four maps, which is that the quadratic length is bounded by three and five based on their structure <ref:2609.39943#pg2>. We've done the work to classify all ninety of those possibilities <ref:2609.39943#pg2>.
Emmy: And it provides a framework for understanding how these maps decompose, tying the algebraic definition of quadratic length to the combinatorial arrangements of base points on the plane <ref:2609.39943#pg2>. That's what we wanted to see.
Conclusion: Ada: So we've been looking at how to measure these plane Cremona maps using quadratic length, and now we're getting to the conclusion of this paper, "On the quadratic length of plane Cremona maps of degree four."
Emmy: Yeah, it lays out that for these degree four maps, the quadratic length will always be three or four or five. It’s a classification based on their structure.
Kolya: That means there are only a finite number of ways these maps can break down into simpler quadratic ones, which is pretty concrete.
Ada: Exactly. The authors show that this length depends entirely on the map's homaloidal type and its enriched weighted proximity graph—basically the geometric arrangement of base points.
Emmy: And they tie all those geometric arrangements back to these specific numbers, like a map with a particular graph always having a quadratic length of five. It’s like finding an exact counting rule for these transformations.
Kolya: From my side, it suggests that for the tail behavior of these maps, we have some definite bounds on how complicated they can be in terms of their decomposition.
Ada: Right. It moves us from just knowing *that* a map decomposes into quadratics to knowing exactly *how many* quadratics you need.
Emmy: And this classification is based on analyzing ninety different possible proximity graphs for degree four maps of length one, which gives us a really tight constraint on the possible outcomes.
Kolya: It's interesting how these structural constraints limit the possibilities so much, especially when you start looking at the inverse maps later in their work.
Ada: Absolutely. Understanding this fundamental structure is key because it shows that even these complex birational transformations have predictable limits on their complexity when measured by this length.
Emmy: So, we've established the possible lengths for degree four maps now, but what happens when we look at maps of different degrees?
ALBERTO CALABRI, NGUYEN THI NGOC GIAO
University of Ferrara · Tokyo University of Science · Vietnam Institute for Advanced Studies in Mathematics
math.AG
Submitted: 2026-09-30
Updated: 2026-11-08
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
Importance score: 81/100
The gist: Every non-linear plane Cremona map can be decomposed into quadratic maps, and the minimum number of quadratic maps required is called its quadratic length<ref:2609.39943#pg6>.
Key concepts
- Quadratic Length
- This is a measure of complexity for a plane Cremona map. It represents the smallest number of quadratic maps required to break down or decompose that specific map into simpler components.
- Enriched Weighted Proximity Graph
- This graph captures geometric information about the base points used in the Cremona map. It includes details like lines passing through three or four base points and conics passing through six base points, which helps classify the maps.
- Homaloidal Type
- For degree 4 maps, this type describes a specific structural property of the map. The paper uses it to distinguish between different categories of these maps, which in turn dictates whether they have a quadratic length of 1 or 2.
Terminology
Summary
Every non-linear plane Cremona map can be decomposed into quadratic maps, and the minimum number of quadratic maps required is called its quadratic length<ref:2609. p. 0 ON THE QUADRATIC LENGTH OF
PLANE CREMONA MAPS OF DEGREE 4
ALBERTO CALABRI∗ AND NGUYEN THI NGOC GIAO†‡
Abstract. Every non-linear plane Cremona map can be decomposed into quadratic maps,
and the minimum number of quadratic maps required is called its quadratic length. It is
known that plane Cremona maps of degree 3 have quadratic length either 2 or 3. In this paper, we study the quadratic length of plane Cremona maps φ of degree 4.Where the paper says it
Where the paper says it
Introduction to Quadratic Length
The paper introduces the concept of quadratic length, defined as the minimum number of quadratic maps needed to decompose a plane Cremona map<ref:2609.39943#pg2> Recall that in [2], Blanc and Furter defined and studied the length of φ as the minimum number of de Jonqui'eres maps needed to decompose φ<ref:2609.39943#pg2>. The quadratic length is related to the homaloidal type of a plane Cremona map, which is denoted by (d; m1,. p. 0 In particular, φ has quadratic length 3 if and only if φ is equivalent to the
following map
P
2
99K P
2
, [x : y : z] 7→ [xz2 + y
3
: yz2
: z
3
]. (1)
Recall that plane Cremona maps of degree 4 either are de Jonqui`eres or their homaloidal
type is (4; 23
, 1
3
). In Section 2 we recall the definition and properties of infinitely near points and we review
the definition of standard coordinates that we introduced in [3] to describe them. 1
arXiv:2609. (1)
Recall that plane Cremona maps of degree 4 either are de Jonqui`eres or their homaloidal
type is (4; 23
, 1
3
). In the former case, they have length 1, while in the latter case, they have
length 2.Where the paper says it
Where the paper says it
Where the paper says it
Decomposition of Degree 4 Maps
The main result established is Theorem 1.2: Let φ be a plane Cremona map of degree 4 and de Jonqui'eres, then the quadratic length of φ is 3, 4 or 5<ref:2609.39943#pg2> In particular, φ has quadratic length 5 if and only if it is equivalent to one of two specific maps<ref:2609. p. 0 Then, the
quadratic length of φ is 3, 4 or 5. In particular, φ has quadratic length 5 if and only if φ is
equivalent to one of the following two maps
P
2
99K P
2
, [x : y : z] 7→ [xz3 + y
4 + ky2
z
2
: yz3
: z
4
]. It is
known that plane Cremona maps of degree 3 have quadratic length either 2 or 3. In this paper, we study the quadratic length of plane Cremona maps φ of degree 4.Where the paper says it
Where the paper says it
Classification via Enriched Weighted Proximity Graphs
The authors define the enriched weighted proximity graph of a plane Cremona map of degree 4 and length 1, which includes a list of lines passing through three or four base points and conics passing through six base points<ref:2609.39943#pg2> There are exactly 90 weighted proximity graphs of plane Cremona maps of degree 4 and length 1, up to isomorphism<ref:2609. p. 5 Let us call this object the enriched weighted proximity graph of φ. In [9], the second author proved that:
• there are exactly 90 weighted proximity graphs of plane Cremona maps of degree 4
and length 1, up to isomorphism;
• there are exactly 449 enriched weighted proximity graphs of plane Cremona maps of
degree 4 and length 1, up to isomorphism. In [9], the second author proved that:
• there are exactly 90 weighted proximity graphs of plane Cremona maps of degree 4
and length 1, up to isomorphism;
• there are exactly 449 enriched weighted proximity graphs of plane Cremona maps of
degree 4 and length 1, up to isomorphism. In this paper we are interested in computing lower and upper bounds for the quadratic
length of plane Cremona maps of degree 4, so we do not put here the whole list of 449
enriched weighted proximity graphs.Where the paper says it
Where the paper says it
Quadratic Length Bounds for Specific Graphs
The quadratic length of certain maps is determined by their enriched weighted proximity graphs<ref:2609.39943#pg2> For example, if a map has enriched weighted proximity graph (8), then its quadratic length is 5<ref:2609. p. 9 The quadratic length of φ3 is ql(φ3) = 4. The inverse map φ
−1
3
of the map φ3 is the following map
φ
−1
3
([x : y : z]) = [−k y3
z + x z3 − y
4
: y z2
(kz + y) : (kz + y) z
3
]
where k is either 0 or 1, and it has enriched weighted proximity graph
3 1 1 1 1 1 1 The quadratic length of φ3 is ql(φ3) = 4. The inverse map φ
−1
3
of the map φ3 is the following map
φ
−1
3
([x : y : z]) = [−k y3
z + x z3 − y
4
: y z2
(kz + y) : (kz + y) z
3
]
where k is either 0 or 1, and it has enriched weighted proximity graph
3 1 1 1 1 1 1 The quadratic length of φ3 is ql(φ3) = 4. The inverse map φ
−1
3
of the map φ3 is the following map
φ
−1
3
([x : y : z]) = [−k y3
z + x z3 − y
4
: y z2
(kz + y) : (kz + y) z
3
]
where k is either 0 or 1, and it has enriched weighted proximity graph
3 1 1 1 1 1 1Where the paper says it
Where the paper says it
Where the paper says it
Conclusion on Quadratic Lengths
The paper concludes by stating the quadratic lengths for specific maps, such as ql(φ2) = 4 and ql(φ3) = 4<ref:2609.39943#pg2> Furthermore, it proves that the quadratic length of a plane Cremona map with enriched weighted proximity graph (8) is 5<ref:2609. p. 8 ON THE QUADRATIC LENGTH OF PLANE CREMONA MAPS OF DEGREE 4 9
• p7 ≻1 p6 has standard coordinates (p1, 0,∞, −1, 0, 0, 0). It suffices to show that, if φ has enriched weighted proximity graph (9), then there exists
an automorphism of P
2 mapping the base points q1, . ON THE QUADRATIC LENGTH OF PLANE CREMONA MAPS OF DEGREE 4 9
• p7 ≻1 p6 has standard coordinates (p1, 0,∞, −1, 0, 0, 0). It suffices to show that, if φ has enriched weighted proximity graph (9), then there exists
an automorphism of P
2 mapping the base points q1, . ON THE QUADRATIC LENGTH OF PLANE CREMONA MAPS OF DEGREE 4 9
• p7 ≻1 p6 has standard coordinates (p1, 0,∞, −1, 0, 0, 0). It suffices to show that, if φ has enriched weighted proximity graph (9), then there exists
an automorphism of P
2 mapping the base points q1, . ON THE QUADRATIC LENGTH OF PLANE CREMONA MAPS OF DEGREE 4 9
• p7 ≻1 p6 has standard coordinates (p1, 0,∞, −1, 0, 0, 0). It suffices to show that, if φ has enriched weighted proximity graph (9), then there exists
an automorphism of P
2 mapping the base points q1, . ON THE QUADRATIC LENGTH OF PLANE CREMONA MAPS OF DEGREE 4 9
• p7 ≻1 p6 has standard coordinates (p1, 0,∞, −1, 0, 0, 0). It suffices to show that, if φ has enriched weighted proximity graph (9), then there exists
an automorphism of P
2 mapping the base points q1, . ON THE QUADRATIC LENGTH OF PLANE CREMONA MAPS OF DEGREE 4 9
• p7 ≻1 p6 has standard coordinates (p1, 0,∞, −1, 0, 0, 0). It suffices to show that, if φ has enriched weighted proximity graph (9), then there exists
an automorphism of P
2 mapping the base points q1, . ON THE QUADRATIC LENGTH OF PLANE CREMONA MAPS OF DEGREE 4 9
• p7 ≻1 p6 has standard coordinates (p1, 0,∞, −1, 0, 0, 0). It suffices to show that, if φ has enriched weighted proximity graph (9), then there exists
an automorphism of P
2 mapping the base points q1, . ON THE QUADRATIC LENGTH OF PLANE CREMONA MAPS OF DEGREE 4 9
• p7 ≻1 p6 has standard coordinates (p1, 0,∞, −1, 0, 0, 0). It suffices to show that, if φ has enriched weighted proximity graph (9), then there exists
an automorphism of P
2 mapping the base points q1, . Accordingly, we also prove that the
corresponding inverse map has quadratic length of 4. The quadratic length of φ3 is ql(φ3) = 4. 10 ALBERTO CALABRI∗ AND NGUYEN THI NGOC GIAO†‡
Example 5. A decomposition of (11) into 5 quadratic maps is
φ1 = [8k(z − y) + x − 8y + 6z : −8y + 4z : −8y] ◦ ρ ◦ [2k(z − 2y) − x − 2y + z : 2y − z : y] ◦
◦ ρ ◦ [−x − 2z : −2x + 2y : x] ◦ τ ◦ [z : y + 2z : −x + z + y] ◦ ρ ◦
◦ [x + 2z − y : z : y − z] ◦ ρ ◦ [x − y : z : y]
where k is either 0 or 1. ON THE QUADRATIC LENGTH OF PLANE CREMONA MAPS OF DEGREE 4 9
• p7 ≻1 p6 has standard coordinates (p1, 0,∞, −1, 0, 0, 0). It suffices to show that, if φ has enriched weighted proximity graph (9), then there exists
an automorphism of P
2 mapping the base points q1, . ON THE QUADRATIC LENGTH OF PLANE CREMONA MAPS OF DEGREE 4 9
• p7 ≻1 p6 has standard coordinates (p1, 0,∞, −1, 0, 0, 0). It suffices to show that, if φ has enriched weighted proximity graph (9), then there exists
an automorphism of P
2 mapping the base points q1, . ON THE QUADRATIC LENGTH OF PLANE CREMONA MAPS OF DEGREE 4 9
• p7 ≻1 p6 has standard coordinates (p1, 0,∞, −1, 0, 0, 0). It suffices to show that, if φ has enriched weighted proximity graph (9), then there exists
an automorphism of P
2 mapping the base points q1, . ON THE QUADRATIC LENGTH OF PLANE CREMONA MAPS OF DEGREE 4 9
• p7 ≻1 p6 has standard coordinates (p1, 0,∞, −1, 0, 0, 0). It suffices to show that, if φ has enriched weighted proximity graph (9), then there exists
an automorphism of P
2 mapping the base points q1, . ON THE QUADRATIC LENGTH OF PLANE CREMONA MAPS OF DEGREE 4 9
• p7 ≻1 p6 has standard coordinates (p1, 0,∞, −1, 0, 0, 0). It suffices to show that, if φ has enriched weighted proximity graph (9), then there exists
an automorphism of P
2 mapping the base points q1, . Next, we will find the quadratic lengths of all such maps. The quadratic length of φ2 is ql(φ2) = 4. Next, we will find the quadratic lengths of all such maps. The quadratic length of φ2 is ql(φ2) = 4. Next, we will find the quadratic lengths of all such maps. The quadratic length of φ2 is ql(φ2) = 4. Accordingly, we also prove that the
corresponding inverse map has quadratic length of 4. The quadratic length of φ3 is ql(φ3) = 4. Clearly, one has that lgth(φ) ≤ ql(φ) and two
equivalent plane Cremona maps have the same length and the same quadratic length. Taking the inverse maps, a decomposition (7) of a plane Cremona map φ
determines a decomposition of the inverse map φ
−1
, and conversely. In Section 2 we recall the definition and properties of infinitely near points and we review
the definition of standard coordinates that we introduced in [3] to describe them. 1
arXiv:2609. However, with ρ1 having base points at p1, p2 and p3, the
composition map φ
−1
2 ◦ ρ
−1
1
is a plane Cremona map of degree 3 of type 1 in our classification
in [3], which has been shown in Theorem 1. 1 that its quadratic length is 3, a contradition. However, with ρ1 having base points at p1, p2 and p3, the
composition map φ
−1
2 ◦ ρ
−1
1
is a plane Cremona map of degree 3 of type 1 in our classification
in [3], which has been shown in Theorem 1. 1 that its quadratic length is 3, a contradition. However, with ρ1 having base points at p1, p2 and p3, the
composition map φ
−1
2 ◦ ρ
−1
1
is a plane Cremona map of degree 3 of type 1 in our classification
in [3], which has been shown in Theorem 1. 1 that its quadratic length is 3, a contradition. Recall that in [3] we enriched the weighted proximity graphs of plane
Cremona maps of degree 3 by adding the line passing through three base points: we found
exactly 31 enriched weighted proximity graphs of plane Cremona maps of degree 3. The weighted proximity graph of a plane Cremona map of degree 4 and length
1 has one vertex of multiplicity 3 and six vertices of multiplicity 1. 10 ALBERTO CALABRI∗ AND NGUYEN THI NGOC GIAO†‡
Example 5. A decomposition of (11) into 5 quadratic maps is
φ1 = [8k(z − y) + x − 8y + 6z : −8y + 4z : −8y] ◦ ρ ◦ [2k(z − 2y) − x − 2y + z : 2y − z : y] ◦
◦ ρ ◦ [−x − 2z : −2x + 2y : x] ◦ τ ◦ [z : y + 2z : −x + z + y] ◦ ρ ◦
◦ [x + 2z − y : z : y − z] ◦ ρ ◦ [x − y : z : y]
where k is either 0 or 1. 10 ALBERTO CALABRI∗ AND NGUYEN THI NGOC GIAO†‡
Example 5. A decomposition of (11) into 5 quadratic maps is
φ1 = [8k(z − y) + x − 8y + 6z : −8y + 4z : −8y] ◦ ρ ◦ [2k(z − 2y) − x − 2y + z : 2y − z : y] ◦
◦ ρ ◦ [−x − 2z : −2x + 2y : x] ◦ τ ◦ [z : y + 2z : −x + z + y] ◦ ρ ◦
◦ [x + 2z − y : z : y − z] ◦ ρ ◦ [x − y : z : y]
where k is either 0 or 1. Clearly, one has that lgth(φ) ≤ ql(φ) and two
equivalent plane Cremona maps have the same length and the same quadratic length. Taking the inverse maps, a decomposition (7) of a plane Cremona map φ
determines a decomposition of the inverse map φ
−1
, and conversely. Clearly, one has that lgth(φ) ≤ ql(φ) and two
equivalent plane Cremona maps have the same length and the same quadratic length. Taking the inverse maps, a decomposition (7) of a plane Cremona map φ
determines a decomposition of the inverse map φ
−1
, and conversely.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
How the training signal is built
The structure of the base points and their proximity relations are crucial for determining the quadratic length<ref:2609.39943#pg2> The paper uses standard coordinates to describe infinitely near points, which are defined through a sequence of blowing-ups<ref:2609. p. 0 In Section 2 we recall the definition and properties of infinitely near points and we review
the definition of standard coordinates that we introduced in [3] to describe them. 1
arXiv:2609. In Section 2 we recall the definition and properties of infinitely near points and we review
the definition of standard coordinates that we introduced in [3] to describe them. 1
arXiv:2609. In such a way, we are able to define the standard coordinates for each point of B(P
2
) as
given by a point in P
2 and a sequence of points of P
1
. The following lemma has been proved in [3]. In such a way, we are able to define the standard coordinates for each point of B(P
2
) as
given by a point in P
2 and a sequence of points of P
1
. The following lemma has been proved in [3]. 4 ALBERTO CALABRI∗ AND NGUYEN THI NGOC GIAO†‡
Then, there exists a unique irreducible plane conic passing through p1, . Plane Cremona maps and their lengths
Recall that a plane Cremona map φ: P
2 99K P
2
can be written as
φ([x : y : z]) = [f0(x, y, z) : f1(x, y, z) : f2(x, y, z)]
where fi ∈ K[x, y, z], i = 0, 1, 2, are homogeneous polynomials of the same degree, say d,
that is called the degree of φ if f0, f1, f2 have no common factor of positive degree. 4 ALBERTO CALABRI∗ AND NGUYEN THI NGOC GIAO†‡
Then, there exists a unique irreducible plane conic passing through p1, . Plane Cremona maps and their lengths
Recall that a plane Cremona map φ: P
2 99K P
2
can be written as
φ([x : y : z]) = [f0(x, y, z) : f1(x, y, z) : f2(x, y, z)]
where fi ∈ K[x, y, z], i = 0, 1, 2, are homogeneous polynomials of the same degree, say d,
that is called the degree of φ if f0, f1, f2 have no common factor of positive degree. Let us add to the weighted proximity graph Gφ of a plane Cremona map φ
of degree 4 and length 1 the following data about lines and conics:
• the list of lines passing through three or four base points of φ;
• the list of conics passing through six base points of φ. Let us call this object the enriched weighted proximity graph of φ.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the gains come from
The gains in understanding the quadratic length come from relating decompositions to specific types of quadratic maps<ref:2609.39943#pg2> The proof for ql(φ) = 5 involves showing that ql(φ) cannot be 3 or 4 by analyzing the resulting maps after composition with a quadratic map<ref:2609. p. 6 Note that p1, p2, p3 cannot be collinear. Therefore, there exists an involutory quadratic
map ψ based at p1, p2, p3 and we may conclude as in the proof of the previous lemma. 6 ALBERTO CALABRI∗ AND NGUYEN THI NGOC GIAO†‡
Let us recall how a quadratic map acts on the homaloidal types of plane Cremona maps. Proposition 3. 6 ALBERTO CALABRI∗ AND NGUYEN THI NGOC GIAO†‡
Let us recall how a quadratic map acts on the homaloidal types of plane Cremona maps. Proposition 3. 2 ALBERTO CALABRI∗ AND NGUYEN THI NGOC GIAO†‡
In Section 3 we recall the basic definitions regarding plane Cremona maps, their homaloidal
type and their lengths. In Section 4 we define the enriched weighted proximity graphs for a plane Cremona map
of degree 4 and length 1.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Pruning redundant reasoning tokens
The paper systematically rules out possibilities for the quadratic length by showing contradictions with known theorems<ref:2609.39943#pg2> For instance, assuming ql(φ1) = 4 leads to a contradiction because the resulting composition map is a de Jonqui'eres map with enriched weighted proximity graph (8), contradicting the hypothesis<ref:2609.39943#pg2>. This systematic elimination process confirms that the derived quadratic lengths are correct<ref:2609. p. 9 A decomposition of (13) into 4 quadratic maps is
φ3 = [−kz + x : −ky − z : y] ◦ ρ ◦ [ky + x − y + z : −ky − y + z : y] ◦ ρ ◦
◦ [y + z : x − y : x] ◦ τ ◦ [−z : y − z : −x] ◦ ρ ◦ [−x : −z : y − z]
where k is either 0 or 1. Next, we will find the quadratic lengths of all such maps. A decomposition of (13) into 4 quadratic maps is
φ3 = [−kz + x : −ky − z : y] ◦ ρ ◦ [ky + x − y + z : −ky − y + z : y] ◦ ρ ◦
◦ [y + z : x − y : x] ◦ τ ◦ [−z : y − z : −x] ◦ ρ ◦ [−x : −z : y − z]
where k is either 0 or 1. Next, we will find the quadratic lengths of all such maps. In [9], the second author proved that:
• there are exactly 90 weighted proximity graphs of plane Cremona maps of degree 4
and length 1, up to isomorphism;
• there are exactly 449 enriched weighted proximity graphs of plane Cremona maps of
degree 4 and length 1, up to isomorphism. In this paper we are interested in computing lower and upper bounds for the quadratic
length of plane Cremona maps of degree 4, so we do not put here the whole list of 449
enriched weighted proximity graphs. In [9], the second author proved that:
• there are exactly 90 weighted proximity graphs of plane Cremona maps of degree 4
and length 1, up to isomorphism;
• there are exactly 449 enriched weighted proximity graphs of plane Cremona maps of
degree 4 and length 1, up to isomorphism. In this paper we are interested in computing lower and upper bounds for the quadratic
length of plane Cremona maps of degree 4, so we do not put here the whole list of 449
enriched weighted proximity graphs. However, with ρ1 having base points at p1, p2 and p3, the
composition map φ
−1
2 ◦ ρ
−1
1
is a plane Cremona map of degree 3 of type 1 in our classification
in [3], which has been shown in Theorem 1. 1 that its quadratic length is 3, a contradition. However, with ρ1 having base points at p1, p2 and p3, the
composition map φ
−1
2 ◦ ρ
−1
1
is a plane Cremona map of degree 3 of type 1 in our classification
in [3], which has been shown in Theorem 1. 1 that its quadratic length is 3, a contradition.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
The structure of the base points and their proximity relations are crucial for determining the quadratic length<ref:2609.39943#pg2> The paper uses standard coordinates to describe infinitely near points, which are defined through a sequence of blowing-ups<ref:2609.39943#pg2> Lemma 2.3 provides conditions under which there exists a unique irreducible plane conic passing through five base points<ref:2609.39943#pg2> The enriched weighted proximity graph captures geometric information about the base points, such as lines and conics passing through them<ref:2609. p. 5 Let us add to the weighted proximity graph Gφ of a plane Cremona map φ
of degree 4 and length 1 the following data about lines and conics:
• the list of lines passing through three or four base points of φ;
• the list of conics passing through six base points of φ. Let us call this object the enriched weighted proximity graph of φ.Where the paper says it
The paper systematically rules out possibilities for the quadratic length by showing contradictions with known theorems<ref:2609.39943#pg2> For instance, assuming ql(φ1) = 4 leads to a contradiction because the resulting composition map is a de Jonqui'eres map with enriched weighted proximity graph (8), contradicting the hypothesis<ref:2609.39943#pg2>. This systematic elimination process confirms that the derived quadratic lengths are correct<ref:2609.39943#pg2>. The analysis of the inverse maps also confirms these bounds, showing ql(φ−1 2) = 4 and ql(φ−1 3) = 4<ref:2609.39943#pg2>. The quadratic length of φ is shown to be either 3, 4 or 5 depending on its structure<ref:2609.39943#pg2>. The quadratic length of a plane Cremona map with enriched weighted proximity graph (8) is 5<ref:2609.39943#pg2>. The quadratic length of a plane Cremona map with enriched weighted proximity graph (10) is 4<ref:2609.39943#pg2>.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Improved understanding of plane Cremona map decomposition by allowing systems to classify quadratic length based on de Jonquières vs non-de Jonquières types for degree 4 maps. This allows the system to predict if a degree 4 map has quadratic length 2 (if it is not de Jonquières) or whether it belongs to the set with quadratic lengths 3, 4, or 5 (if it is de Jonquières).
-
Enhanced ability to classify plane Cremona maps of degree 4 by mapping their enriched weighted proximity graphs to known equivalent maps. The system can determine if a map corresponds to graph (8), (9), or (10) and consequently identify the specific algebraic form of the map, such as those given in equations (11), (12), or (13).
-
Precise determination of the quadratic length for degree 4 de Jonquières maps by analyzing their enriched weighted proximity graphs. The system can use Lemma 5.15 to conclude that ql(phi) is either 5, based on the graph structure, avoiding incorrect assignments of lengths 3 or 4.
-
Accurate prediction of the quadratic length for degree 4 maps with enriched weighted proximity graph (9). Based on Corollary 5.12, the system can definitively state that ql(phi) equals 4 for any map possessing this specific graph structure.
-
Correct identification of the quadratic length for maps corresponding to enriched weighted proximity graphs (8) and (10). The system can conclude that ql(phi) is exactly 5 when these graphs are present, as stated in Corollary 5.16.
Abstract
Every non-linear plane Cremona map can be decomposed into quadratic maps, and the minimum number of quadratic maps required is called its quadratic length. It is known that plane Cremona maps of degree 3 have quadratic length either 2 or 3. In this paper, we study the quadratic length of plane Cremona maps φ of degree 4. Recall that either φ is de Jonquières, i.e. it has a base point of multiplicity 3, or it is not de Jonquières. In the latter case, φ has quadratic length 2, whereas in the former case we prove that φ has quadratic length 3, 4, or 5, and we classify those maps that reach the upper bound.
Related papers
- K-unstable Toric Varieties and Secondary Polytopes
- The commuting scheme of g 2 and a degree formula for commuting schemes
- Stacky geometry and logarithmic topology of transversely affine foliations
- Monodromy and vanishing cycles for complete intersection curves
- Characteristic cycles and Gevrey irregularity in hypergeometric families
- Tautological classes on KSBA spaces