On the quadratic length of plane Cremona maps of degree 4

summary

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>.

In short

This research studies the quadratic length of plane Cremona maps of degree 4, which is defined by the minimum number of quadratic maps needed to decompose them. The study classifies these maps based on their homaloidal type and enriched weighted proximity graphs, establishing that the quadratic lengths are typically 3, 4, or 5 depending on the map's structure.

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 used across episodes

This episode discusses

The paper

On the quadratic length of plane Cremona maps of degree 4 · Read on arXiv

ALBERTO CALABRI, NGUYEN THI NGOC GIAO

University of Ferrara · Tokyo University of Science · Vietnam Institute for Advanced Studies in Mathematics

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.

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?

More episodes

← Home