Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 29 min ago
PreprintCC BY-NC-ND 4.0arXiv

Symmetry breaking in the polygonal Szegö-Weinberger inequality as p→1+: the longest shortest-fence quadrilateral

  • Beniamin Bogosel
  • Dorin Bucur
  • Ilaria Fragalà
Open at sourcePDFDOICite

Abstract

We consider Pólya's problem of finding, among convex sets of prescribed area, the one with the longest shortest fence, in the polygonal setting, namely when the class of competitors is restricted to polygons with a prescribed number of sides. While it is straightforward to show that, among triangles, the optimal shape is the equilateral one, we prove that symmetry breaking occurs in the case of quadrilaterals: the optimal quadrilateral is not the square. More precisely, we identify it as a specific isosceles trapezium, which is uniquely determined, up to homotheties and rigid motions, by an elementary equation for its base angle. The proof combines analytical arguments and rigorous interval-arithmetic computations.

Related

  1. A Payne-Weinberger inequality for quantum dot Dirac operators
    Joaquim Duran, Albert Mas, Tomás Sanz-Perela
    arXivPreprintarXiv licenceFull textAnalysis & PDEsMathematical physicsarXiv
  2. Dimension-dependent symmetry breaking in a diffusive nonlocal interaction model
    Dohyun Kim, Hansol Park, Woojoo Shim
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  3. Full replica symmetry breaking in the Sherrington-Kirkpatrick model
    Patrick Lopatto
    arXivPreprintarXiv licenceFull text10 citedProbabilityarXivOpenAlex
  4. Uniqueness and Symmetry Breaking for Singular Q-curvature Equations in Rn
    Haoyu Li, Tuoxin Li, Juncheng Wei +1
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  5. Symmetry breaking differential operators and Discrete Series
    Bent Ørsted, Jorge A. Vargas
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv

Cite

BibTeXRIS
BibTeX
@misc{bogosel2026symmetry,
  title = {{Symmetry breaking in the polygonal Szegö-Weinberger inequality as $p\to1^+$: the longest shortest-fence quadrilateral}},
  author = {Beniamin Bogosel and Dorin Bucur and Ilaria Fragalà},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.07929},
  eprint = {2609.07929},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.07929},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Symmetry breaking in the polygonal Szegö-Weinberger inequality as p→1^+: the longest shortest-fence quadrilateral
AU  - Beniamin Bogosel
AU  - Dorin Bucur
AU  - Ilaria Fragalà
PY  - 2026
DA  - 2026/09/07
PB  - arXiv
DO  - 10.48550/arxiv.2609.07929
UR  - https://arxiv.org/abs/2609.07929
AB  - We consider Pólya's problem of finding, among convex sets of prescribed area, the one with the longest shortest fence, in the polygonal setting, namely when the class of competitors is restricted to polygons with a prescribed number of sides. While it is straightforward to show that, among triangles, the optimal shape is the equilateral one, we prove that symmetry breaking occurs in the case of quadrilaterals: the optimal quadrilateral is not the square. More precisely, we identify it as a specific isosceles trapezium, which is uniquely determined, up to homotheties and rigid motions, by an elementary equation for its base angle. The proof combines analytical arguments and rigorous interval-arithmetic computations.
ER  -