Papers
Topics
Authors
Recent
Search
2000 character limit reached

Eggers–Wall Tree in Plane Curve Singularities

Updated 14 July 2026
  • Eggers–Wall tree is a rooted decorated tree that represents the separation of branches and records characteristic exponents, denominator data, and contact orders.
  • It reconstructs singularity invariants using methodologies based on Newton–Puiseux expansions, semigroups, key polynomials, and lotus constructions.
  • The tree facilitates computational and valuative analyses, enabling recovery of intersection numbers and invariants even in positive characteristic settings.

The Eggers–Wall tree is a rooted decorated tree attached to a reduced plane curve singularity relative to a chosen smooth branch LL. In its classical Newton–Puiseux form, the tree records how the Puiseux expansions of the branches separate from one another, together with numerical functions encoding characteristic exponents, denominator data, and contact orders. In more recent formulations, the same object is reconstructed from semigroups, key polynomials, or from a lotus associated to an embedded resolution, which makes the construction effective in settings where Puiseux series are unavailable or insufficient, notably in positive characteristic (Barroso et al., 2018, Barroso et al., 24 Feb 2025, Felipe et al., 28 Sep 2025).

1. Position in the theory of plane curve singularities

For a plane curve singularity, the combinatorial type may be encoded in several equivalent ways. The standard trio consists of the Eggers–Wall tree, the Enriques diagram, and the weighted dual graph of an embedded resolution. The 2019 survey emphasizes that these three trees contain the same information and that a lotus provides a geometric framework in which they all embed naturally (Barroso et al., 2019).

The construction is always relative to a smooth branch LL through the singular point. In the Newton–Puiseux description, one fixes local coordinates (x,y)(x,y) with L=Z(x)L=Z(x). The Eggers–Wall tree is then a rooted compact R\mathbb R-tree whose root is labeled by LL, whose leaves are labeled by the branches of the curve, and whose additional marked points record the characteristic exponents and mutual contacts of those branches. In the language of the survey, it may be viewed as a Galois quotient of the Kuo–Lu tree; in the valuative interpretation, it becomes a finite subtree of Favre–Jonsson’s valuative tree (Barroso et al., 2018, Barroso et al., 2019).

2. Classical Newton–Puiseux construction

Let CC be a reduced curve germ and ALA\neq L an irreducible branch. Writing the Weierstrass polynomial of AA in coordinates with L=Z(x)L=Z(x), the Newton–Puiseux theorem produces its roots as fractional power series. The characteristic exponents of LL0 relative to LL1 are the numbers

LL2

where LL3 are distinct Newton–Puiseux roots of the defining polynomial of LL4. They form a finite increasing sequence

LL5

The Eggers–Wall segment LL6 is a compact oriented segment with small end labeled by LL7, large end labeled by LL8, an exponent function

LL9

and marked points precisely at the characteristic exponents. Its index function

(x,y)(x,y)0

is defined as the index of the subgroup generated by (x,y)(x,y)1 and the characteristic exponents (x,y)(x,y)2, equivalently as the least common denominator of the exponents in a Puiseux expansion that are (x,y)(x,y)3 (Barroso et al., 2018).

For two distinct branches (x,y)(x,y)4, the order of coincidence is

(x,y)(x,y)5

where (x,y)(x,y)6 range over Newton–Puiseux roots of (x,y)(x,y)7 and (x,y)(x,y)8. The global Eggers–Wall tree (x,y)(x,y)9 is obtained by taking the disjoint union of the branch segments L=Z(x)L=Z(x)0 and gluing their initial parts up to exponent L=Z(x)L=Z(x)1, identifying points with the same exponent. The resulting rooted tree has root L=Z(x)L=Z(x)2, leaves given by the branches of L=Z(x)L=Z(x)3, and marked points consisting of the root, the leaves, the ramification points created by gluing, and the points where the index function jumps (Barroso et al., 2018).

3. Natural functions and the recovery of singularity data

The classical Eggers–Wall tree carries three natural functions: the exponent function L=Z(x)L=Z(x)4, the index function L=Z(x)L=Z(x)5, and the contact complexity function L=Z(x)L=Z(x)6. On a branch segment, contact complexity is defined by

L=Z(x)L=Z(x)7

or equivalently by the explicit piecewise-linear expression obtained by integrating L=Z(x)L=Z(x)8 between consecutive marked points. This function is strictly increasing along each root-to-leaf segment (Barroso et al., 2018).

The key structural identity is the tripod formula. If L=Z(x)L=Z(x)9 and R\mathbb R0 are two branches distinct from R\mathbb R1, and R\mathbb R2 denotes the tripod determined by those three ends, then

R\mathbb R3

Equivalently,

R\mathbb R4

Thus the tree does not merely encode branchwise Puiseux data; it also recovers pairwise intersection numbers (Barroso et al., 2018, Barroso et al., 24 Feb 2025).

The 2025 lotus paper makes this recoverability explicit. From R\mathbb R5 one can recover, for each branch, its characteristic exponents, its Puiseux pairs and semigroup, its multiplicity and the intersection number R\mathbb R6, and, for each pair of branches, the order of coincidence R\mathbb R7 and the intersection number R\mathbb R8 via contact complexity. The same paper also observes that

R\mathbb R9

defines an ultrametric on the set of branches distinct from LL0, and that the Eggers–Wall tree is essentially the corresponding dendrogram (Barroso et al., 24 Feb 2025).

4. Valuative interpretation and change of observer

A canonical embedding of the Eggers–Wall tree into Favre–Jonsson’s valuative tree gives a conceptual reformulation of its numerical decorations. For a reduced curve LL1 and smooth branch LL2, the map

LL3

is an increasing continuous embedding of rooted trees, where LL4 is the normalization of the semivaluation space by the condition LL5. Under this embedding, the Eggers–Wall functions become pullbacks of valuative invariants: LL6 Here LL7, LL8, and LL9 are the relative log-discrepancy, relative multiplicity, and relative self-interaction functions on the valuative tree (Barroso et al., 2018).

This perspective yields an inversion theorem. If CC0 is a second smooth branch of CC1, then the valuative embeddings of CC2 and CC3 identify them canonically, and the corresponding triples of functions are explicitly related. The result generalizes the classical Abhyankar–Zariski inversion theorem from one branch to arbitrary reduced curves containing two smooth branches (Barroso et al., 2018).

The same paper proves a global limit statement: the projectivized valuative tree CC4 is the projective limit of Eggers–Wall trees over all choices of reduced curves CC5. In that sense, individual Eggers–Wall trees are finite approximants of a universal valuative object rather than isolated combinatorial gadgets (Barroso et al., 2018).

5. Lotus constructions and computational reconstruction

The lotus framework recasts Eggers–Wall trees in birational and combinatorial terms. A lotus is a finite contractible simplicial complex built from an active constellation of crosses associated to an embedded resolution. In this setting, the lateral boundary of the lotus is homeomorphic to the Eggers–Wall tree of a suitable completion CC6 of the curve. Marked interior points of the tree correspond to rupture vertices of the lotus, and if a marked point CC7 corresponds to a rupture vertex CC8, then

CC9

On each membrane, the index function is constant and equal to ALA\neq L0 along the terminal segment. With these assignments, the lateral boundary ALA\neq L1 becomes exactly the Eggers–Wall tree ALA\neq L2 (Barroso et al., 24 Feb 2025).

The construction is reversible. For a complete Eggers–Wall tree, one may choose a trunk decomposition, associate an abstract lotus ALA\neq L3 to each trunk via renormalized exponent data, and glue these abstract lotuses along equally labeled marked vertices. Applying the lotus-to-tree reconstruction to the resulting complex returns the original complete Eggers–Wall tree (Barroso et al., 24 Feb 2025).

This makes the Eggers–Wall tree part of a broader computational architecture. On the lotus one can compute log-discrepancies, orders of vanishing, multiplicities of strict transforms at infinitely near points, the semigroup of a branch, the delta invariant, and, in characteristic zero, the Milnor number. The 2019 survey states the same unification in more geometric language: the Eggers–Wall tree, Enriques diagram, and weighted dual graph all embed simultaneously inside the lotus, and the geometry of the lotus captures their numerical decorations (Barroso et al., 24 Feb 2025, Barroso et al., 2019).

6. Positive characteristic and the polar-curve problem

Positive characteristic forces substantial modifications of the classical picture. Puiseux series may fail to exist or may fail to parametrize all branches adequately; irreducible Weierstrass polynomials may have no Puiseux roots in ALA\neq L4. For this reason, recent work replaces the Newton–Puiseux definition by constructions based on blowups, semigroups of values, and key polynomials (Barroso et al., 24 Feb 2025, Felipe et al., 28 Sep 2025).

Two complementary normalizations now coexist in the literature. In the Newton–Puiseux convention, the exponent function is primary and contact complexity is obtained by integrating ALA\neq L5. In the semigroup/key-polynomial convention used for polar curves in arbitrary characteristic, an irreducible branch ALA\neq L6 determines a segment ALA\neq L7 with a primary contact complexity function

ALA\neq L8

marked points coming from key polynomials, a piecewise-constant index function ALA\neq L9, and an exponent function defined by

AA0

For a reducible curve AA1, the global tree is obtained by gluing the segments AA2 along their initial parts using the logarithmic distance

AA3

and the normalization is fixed by the tripod formula

AA4

This gives an Eggers–Wall tree entirely in terms of semigroups, key polynomials, and intersection multiplicities (Felipe et al., 28 Sep 2025).

The most recent development concerns polar curves. For a plane curve germ AA5 over an algebraically closed field of characteristic AA6, the tree controls the factorization of the polar curve AA7. Writing AA8 for the product of the irreducible factors of AA9 above a marked point L=Z(x)L=Z(x)0, the paper defines the Eggers condition at L=Z(x)L=Z(x)1 by

L=Z(x)L=Z(x)2

Its main theorem states that

L=Z(x)L=Z(x)3

In the irreducible case, this condition is equivalent to the arithmetic requirement that all multiplicity jumps L=Z(x)L=Z(x)4 are prime to L=Z(x)L=Z(x)5, which refines the earlier irreducible positive-characteristic results of García Barroso–Płoski. The same 2025 lotus paper adds that when all branches have Newton–Puiseux roots, the lotus-defined Eggers–Wall tree and the Newton–Puiseux Eggers–Wall tree have the same underlying tree and the same contact complexity, although their exponent and index functions may differ (Felipe et al., 28 Sep 2025, Barroso et al., 24 Feb 2025).

The modern picture therefore treats the Eggers–Wall tree simultaneously as a Puiseux-theoretic invariant, a valuative subtree, a boundary of a lotus, and an arithmetic detector for the behavior of polar curves. Its enduring role is to package the combinatorics of branch separation, intersection, and characteristic data into a form stable under translation between these different frameworks.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Eggers-Wall Tree.