On the mean length of the diagonals of an n-gon

DOI10.4171/EM/215MaRDI QIDQ372504zbMATH OpenFDO

Authors Gábor Lükő

Publication date 8 October 2013

Published in Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4171/EM/215

zbMATH Keywords

\(n\)-gondiagonal

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Review text

In 1965, the author of the paper determined when the average of the diagonals of an \(n\)-gon with given perimeter is maximal and when the average of the diagonals of a \textit{convex} \(n\)-gon with given perimeter is minimal. The paper reviews the solution and poses some open problems.

Recommendations

• Isodiametric problems for polygons
• Midpoints of Diagonals of Convex n-Gons
• Extremal problems for convex polygons
• Inequality between sides and diagonals of a space n-gon and its integral analog
• An isodiametric problem for equilateral polygons

Cites work

• A note on the sum of distances under a diameter constraint
• scientific article; zbMATH DE number 3056661 (Why is no real title available?)
• On the sum of squared distances in the Euclidean plane
• The Sum of Distances Between Vertices of a Convex Polygon with Unit Perimeter

Cited in

(2)

• Midpoints of Diagonals of Convex n-Gons
• scientific article; zbMATH DE number 2111129 (Why is no real title available?)

This page was built for publication: On the mean length of the diagonals of an \(n\)-gon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q372504)