The area of cyclic polygons: Recent progress on Robbins' conjectures

  title={The area of cyclic polygons: Recent progress on Robbins' conjectures},
  author={Igor Pak},
  journal={Adv. Appl. Math.},
  • I. Pak
  • Published 9 August 2004
  • Mathematics, Computer Science
  • Adv. Appl. Math.
In his works [Discrete Comput. Geom. 12 (1994) 223-236; Amer. Math. Monthly 102 (1995) 523-530] David Robbins proposed several interrelated conjectures on the area of the polygons inscribed in a circle as an algebraic function of its sides. Most recently, these conjectures have been established in the course of several independent investigations. In this note we give an informal outline of these developments. 
Comments on generalized Heron polynomials and Robbins' conjectures
  • R. Connelly
  • Computer Science, Mathematics
  • Discret. Math.
  • 2009
Heron's formula for a triangle gives a polynomial for the square of its area in terms of the lengths of its three sides, and David Robbins showed that for any cyclic polygon with n edges, (4A)^2 satisfies aPolynomial whose coefficients are themselves polynomials in the edge lengths. Expand
Computations of the Area and Radius of Cyclic Polygons Given by the Lengths of Sides
  • P. Pech
  • Mathematics, Computer Science
  • Automated Deduction in Geometry
  • 2004
Some properties of inscribed polygons, i.e., such plane polygons whose vertices lie on a circle, are investigated and the area and radius of its circumcircle is explored. Expand
Rigidity and polynomial invariants of convex polytopes
We present an algebraic approach to the classical problem of constructing a simplicial convex polytope given its planar triangulation and lengths of its edges. We introduce polynomial invariants of aExpand
On Circumradius Equations of Cyclic Polygons
In a masterfully written (in german language) thirty pages long paper (and published in 1828 in Crelle’s Journal ) A. F. Möbius studied some properties of the polynomial equations for theExpand
Cyclic polygons as critical points
We describe a nonconventional setting for studying cyclic polygons which provides a new point of view at the conjectures formulated in 90-s by D.Robbins and studied by R.Connelly, I.Pak, I.SabitovExpand
Computing Explicit Formulae for the Radius of Cyclic Hexagons and Heptagons
This paper describes computations of the circumradius of cyclic polygons given by the lengths of the sides. Extending the results of Robbins (1994) and Pech (2006), for the first time we succeeded inExpand
  • 2013
We deal with convex cyclic polygons with even order, that is, with inscribed n-gons where n is even. We prove that these polygons are in general not constructible with compass and ruler, provided nExpand
Geometric constructibility of cyclic polygons and a limit theorem
We study convex cyclic polygons, that is, inscribed $n$-gons. Starting from P. Schreiber's idea, published in 1993, we prove that these polygons are not constructible from their side lengths withExpand
Spaces of Polygonal Triangulations and Monsky Polynomials
It is shown that the areas of the triangles in a generalized triangulation of a square must satisfy a single irreducible homogeneous polynomial relation depending only on the combinatorics of ${\mathcal {T}}$. Expand
The geometry of cyclic hyperbolic polygons
A hyperbolic polygon is defined to be cyclic, horocyclic, or equidistant if its vertices lie on a metric circle, horocycle, or a component of the equidistant locus to a hyperbolic geodesic,Expand


On the areas of cyclic and semicyclic polygons
The ''generalized Heron polynomial'' that relates the squared area of an n-gon inscribed in a circle to the squares of its side lengths is investigated, and some mysterious features of Robbins' formulas for the areas of cyclic pentagons and hexagons are illuminated. Expand
Rigidity and polynomial invariants of convex polytopes
We present an algebraic approach to the classical problem of constructing a simplicial convex polytope given its planar triangulation and lengths of its edges. We introduce polynomial invariants of aExpand
A generalized Heron-Tartaglia formula and some of its consequences
The well-known formula for finding the area of a triangle in terms of its sides is generalized to volumes of polyhedra in the following way. It is proved that for a polyhedron (with triangular faces)Expand
The Bellows conjecture.
Cauchy’s rigidity theorem states: If P and P’ are combinatorially equivalent convex polyhedra such that the corresponding facets of P and P’ are congruent, then P and P’ are congruent polyhedra. ForExpand
Galois groups of the Heron-Sabitov polynomials for inscribed pentagons
The Galois groups of the d-, the r-, and the S-polynomials over fields of rational functions of the sides of a pentagon are calculated. These polynomials have the zeros at the diagonals, the radii ofExpand
The Volume as a Metric Invariant of Polyhedra
  • I. K. Sabitov
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 1998
A proof of the ``bellows conjecture'' affirming the invariance of the volume of a flexible polyhedron in the process of its flexion. Expand
In Handbook of Convex Geometry
convexity. A box in U is a product of d intervals of the real line. Since every intersection of boxes is a box, boxes define a convexity structure. Consider three points x, y, and z in U: x is saidExpand
Handbook of Convex Geometry
This handbook should be useful for mathematicians working in other areas, as well as for econometrists, computer scientists, crystallographers, physicists and engineers who are looking for geometric tools for their own work. Expand
Areas of polygons inscribed in a circle
  • D. P. Robbins
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 1994
AbstractHeron of Alexandria showed that the areaK of a triangle with sidesa,b, andc is given by % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn%Expand