Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0704.3424

A New Proof of Pappus's Theorem

Jeremy J. Carroll
View original source ↗Read source document ↗Export metadata ↓

Abstract

Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its angles. These constraints cannot be satisfied by any projection of the initial arrangement. This is sufficient to prove Pappus's theorem. The derivation of the constraint is via systems of inequalities arising from the polar coordinates of the lines. These systems are linear in r for any given theta, and their solubility can be analysed in terms of the signs of determinants. The evaluation of the determinants is via a normal form for sums of products of sines, giving a powerful system of trigonometric identities. The particular result is generalized to arrangements derived from three edge connected totally cyclic directed graphs, conjectured to be sufficient for a complete analysis of angle constraining arrangements of lines, and thus a full response to Ringel's slope conjecture. These methods are generally applicable to the realizability problem for rank 3 oriented matroids.

Explore related subjects

math.COmath.MG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeremy J. Carroll. 2007-04-25. A New Proof of Pappus's Theorem. https://arxiv.org/abs/0704.3424

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Maximal number of mixed Nash equilibria in generic games where each player has two pure strategies

The number of Nash equilibria of the mixed extension of a generic finite game in normal form is finite and odd. This raises the question how large the number can be, depending on the number of players and the numbers of their pure strategies. Here we present a lower bound for the maximal possible number in the case of m-player games where each player has two pure strategies. It is surprisingly close to a known upper bound.

math.CO↗
arXiv2026

Simultaneous avoidance of length-4 patterns in ascent sequences

Ascent sequences form a central class of combinatorial objects, as they are in bijection with several important families such as (2+2)-free posets, Stoimenow matchings, and other Fishburn objects, and are enumerated by the Fishburn numbers. We study pattern avoidance in ascent sequences for the five patterns of length 4: $0101$, $0102$, $0112$, $0120$, and $0121$. These patterns arise naturally from recent work on pattern avoidance in related families of Fishburn objects, including Stoimenow matchings and (2+2)-free posets. We enumerate ascent sequences avoiding any subset of these patterns, with the exception of the sets $\{0120\}$, $\{0121\}$, and $\{0120,0121\}$, for which the enumeration remains open. Our results reveal that the corresponding avoidance classes fall into $16$ Wilf equivalence classes and exhibit a wide range of enumerative behaviour, including connections to classical sequences such as the Catalan and Fibonacci numbers, as well as polynomial formulas and rational generating functions; several of the sequences we obtain appear to be new. Our methods combine structural decompositions with generating-tree techniques and, in several cases, rely on reductions to shorter patterns via restricted growth functions. This work contributes to the broader study of pattern avoidance across Fishburn families and highlights further connections between ascent sequences and other combinatorial structures.

math.CO↗