Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.27352

Congruent copies of finite patterns in planar point sets

Shubhrajit Bhattacharya·Ritesh Goenka
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a finite nonempty planar point set $S$, what is the maximum number of congruent copies of $S$ contained in a set of $n$ points in the Euclidean plane? Building on OpenAI's recent breakthrough on the unit distance problem, we construct planar sets consisting of $n$ points that contain $Ω_S(n^{1+δ_S})$ congruent copies of $S$, for some positive constant $δ_S$ depending only on $S$. This answers a question of Brass and Pach in a strong form, and makes progress on questions posed by Erdős and Purdy, and Ábrego and Fernández-Merchant. Our proof uses the number field construction from Sawin's quantitative refinement of OpenAI's result and consequently yields an explicit choice for $δ_S$ for each fixed $S$.

Explore related subjects

math.COmath.MG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shubhrajit Bhattacharya, Ritesh Goenka. 2026-06-25. Congruent copies of finite patterns in planar point sets. https://arxiv.org/abs/2606.27352

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗