New bounds on simplex-avoiding sets in two dimensions

We study extremal densities of measurable subsets of metric spaces avoiding prescribed finite geometric configurations. We prove two new upper bounds for three-point avoidance problems: a measurable subset of $S^2$ containing no orthonormal basis has normalized spherical measure at most $7/11$, and a measurable subset of $\mathbb{R}^2$ containing no unit equilateral triangle has upper Banach density at most $9/16$. The first bound appears to be the first improvement over the trivial averaging bound for this problem, while the second improves the previously best known upper bound. The proofs are applications of the geometric fractional chromatic number method introduced by Ambrus et al. For this purpose, we formulate the method in a framework that applies both to compact homogeneous spaces and to Euclidean spaces with upper Banach density.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-17
DOI
https://doi.org/10.48550/arxiv.2611.23097
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

New bounds on simplex-avoiding sets in two dimensions

Péter Madarasi, Domonkos Czifra, Dániel Varga, Pál Zsámboki et al.
arXiv (Cornell University)
Limits and Structures in Graph Theory
preprint

New bounds on simplex-avoiding sets in two dimensions

Péter Madarasi, Domonkos Czifra, Dániel Varga, Pál Zsámboki, Ákos Dúcz
preprint en

Abstract

We study extremal densities of measurable subsets of metric spaces avoiding prescribed finite geometric configurations. We prove two new upper bounds for three-point avoidance problems: a measurable subset of $S^2$ containing no orthonormal basis has normalized spherical measure at most $7/11$, and a measurable subset of $\mathbb{R}^2$ containing no unit equilateral triangle has upper Banach density at most $9/16$. The first bound appears to be the first improvement over the trivial averaging bound for this problem, while the second improves the previously best known upper bound. The proofs are applications of the geometric fractional chromatic number method introduced by Ambrus et al. For this purpose, we formulate the method in a framework that applies both to compact homogeneous spaces and to Euclidean spaces with upper Banach density.

arXiv (Cornell University)
Limits and Structures in Graph Theory
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.

Laika access coming soon