Polygons of unit area with vertices in sets of infinite planar measure

Abstract Paul Erdős and R. Daniel Mauldin asked a series of questions on certain types of polygons of area $1$ , the vertices of which can be found in every planar set of infinite Lebesgue measure. We address two of these questions, one on cyclic quadrilaterals and the other on convex polygons with congruent sides, with, respectively, positive and negative answers.

Authors

Institutions

Publication Details

Journal
Canadian Mathematical Bulletin
Published
2025-12-01
DOI
https://doi.org/10.4153/s0008439525101537
Citations
1
Primary Topic
Point processes and geometric inequalities
Type
article
Field-Weighted Citation Impact
3.73

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Polygons of unit area with vertices in sets of infinite planar measure

Vjekoslav Kovač, Bruno Predojević
1 citations
Canadian Mathematical Bulletin
Point processes and geometric inequalities
3.73
article

Polygons of unit area with vertices in sets of infinite planar measure

Vjekoslav Kovač, Bruno Predojević
article en
1 citations

Abstract

Abstract Paul Erdős and R. Daniel Mauldin asked a series of questions on certain types of polygons of area $1$ , the vertices of which can be found in every planar set of infinite Lebesgue measure. We address two of these questions, one on cyclic quadrilaterals and the other on convex polygons with congruent sides, with, respectively, positive and negative answers.

Canadian Mathematical Bulletin
University of Zagreb (HR)
Hrvatska Zaklada za Znanost
Openalex Percentile: Top 6%
Point processes and geometric inequalities
3.73
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.