The Number of Intersection Points Made by the Diagonals of a Regular Polygon

DOI10.1137/S0895480195281246zbMath0913.51005arXivmath/9508209OpenAlexW2066918008MaRDI QIDQ4388984

Bjorn Poonen, Michael O. Rubinstein

Publication date: 11 May 1998

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9508209

zbMATH Keywords

diagonalsroots of unityregular polygonsintersection pointsadventitious quadrangles

Mathematics Subject Classification ID

Elementary problems in Euclidean geometries (51M04) Cyclotomic extensions (11R18)

Related Items (16)

Axial fibrations of the Fermat surfaces and their singular fibers ⋮ Computing the torsion points of a variety defined by lacunary polynomials ⋮ A different approach to the Fraenkel Conjecture for low $n$ values ⋮ Classification of rational angles in plane lattices ⋮ Blocking visibility for points in general position ⋮ Cyclotomic Points and Algebraic Properties of Polygon Diagonals ⋮ On sets defining few ordinary lines ⋮ Graphical Enumeration and Stained Glass Windows, 1: Rectangular Grids ⋮ On quasi Steinberg characters of complex reflection groups ⋮ ``A handbook of Integer sequences fifty years later ⋮ The Green’s function for the Hückel (tight binding) model ⋮ On vanishing sums of roots of unity. ⋮ Cyclotomic integers, fusion categories, and subfactors ⋮ Projective equivalence for the roots of unity ⋮ Intersections and circuits in sets of line segments ⋮ On the proportion of vanishing elements in finite groups

Uses Software

• Unnamed Item
• Unnamed Item

This page was built for publication: The Number of Intersection Points Made by the Diagonals of a Regular Polygon