Le cerf-volant d'une constellation
Patrick Popescu-Pampu

TL;DR
This paper introduces a geometric simplicial complex called a kite to represent constellations of infinitely near points on complex surfaces, unifying various graph representations and linking them to the valuative tree.
Contribution
It constructs a geometric kite that contains both Enriques diagrams and dual graphs, providing a clear geometric interpretation of their relations and connections to the valuative tree.
Findings
The kite encodes the combinatorics of constellations.
It reveals geometric relations between different graph representations.
The structure links to continued fractions and lattice complexes.
Abstract
Consider a smooth point O of a complex analytic surface S. A constellation based at O is a set of infinitely near points of O, centers of a sequence of blow-ups above O. Finite constellations are usually encoded in two ways: either using an Enriques diagram, or using the dual graph of the divisor obtained by blowing-up the points of the constellation. Both are decorated trees which encode completely the combinatorics of the constellation. Algorithms of passage from one to the other are known, but they do not allow to get a geometrical picture of their relation. We associate to a constellation a geometrical simplicial complex of dimension two, called its kite, endowed with an affine structure, and we prove that it contains canonically both the Enriques diagram and the dual graph. Moreover, the decorations of the two trees may be read very easily on the affine geometry of the kite. This…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · Advanced Combinatorial Mathematics · Algebraic Geometry and Number Theory
