Searcharxiv⌕ Search

arXiv · 2610.38864

All-even sets in $\mathbb{R}^2$ and $\mathbb{R}^3$

Abstract

Call a finite nonempty point set $S\subset\mathbb{R}^d$ all-even if for every direction $\ell \in \mathbb{P}(\mathbb{R}^d)$, the number of hyperplanes perpendicular to $\ell$ that intersect $S$ is even. In 2026, Francisco Santos presented a question of Juan Benigno Seoane-Sepúlveda on the existence of all-even sets in dimensions $3$ and higher, together with examples of such sets in dimension $2$. Call a set $S\in\mathbb{R}^d$ line-all-even if for every direction $\ell \in \mathbb{P}(\mathbb{R}^d)$ the number of lines parallel to $\ell$ that intersect $S$ is even. As Santos pointed out, every all-even set in $\mathbb{R}^3$ is line-all-even. We conjecture that there exist no line-all-even sets in $\mathbb{R}^3$ that affinely span $\mathbb{R}^3$ We show that our conjecture is equivalent to the statement that every planar all-even set satisfies a certain property, which we call height-rigidity. This property has a natural interpretation in linear algebra terms. Furthermore, we present a hierarchy of properties of planar point sets that imply height-rigidity. We construct several all-even sets in the plane, including some infinite families, and show that all the sets we constructed are height-rigid. In addition, we prove that every all-even set in the plane that can be covered by six or fewer parallel lines is height-rigid.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel Kalmanovich, Gabriel Nivasch. 2026-10-28. All-even sets in $\mathbb{R}^2$ and $\mathbb{R}^3$. https://arxiv.org/abs/2610.38864

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

KEEP EXPLORING

Related papers

Quantifying displacement: an urban expansion consequence via persistent homology

Population displacement is a housing-related involuntary residential dislocation. It has become increasingly widespread in many cities, particularly in neighbourhoods undergoing rapid economic and demographic change, and measuring it is essential to assess the social consequences of urban transformation and housing market pressures. Despite its relevance, quantifying displacement presents difficulties due to limited replicability across cities and time periods and the need to analyse long time spans: displacement is a gradual process, impossible to capture in one data snapshot. We introduce a novel tool to overcome these difficulties. Using publicly available address change data, we construct four cubical complexes simultaneously incorporating geographical and temporal information of people moving, and analyse using Topological Data Analysis tools. Finally, we demonstrate this method through a 20-year case study in Madrid, Spain. The results demonstrate its ability to reveal patterns consistent with population displacement and identify the neighbourhoods and years potentially affected--patterns not observable from yearly maps of the raw address change data.

cs.CG↗

Certified Small Well-Separated Pair Decompositions in Practice

Given n points and $ε>0$, a well-separated pair decomposition (WSPD) is a collection of dumbbells {X,Y}, where X and Y have diameter at most $ε$ times their distance, such that every pair of points has one point in X and the other in Y for some dumbbell. A partition WSPD covers every pair exactly once, and a cover WSPD at least once. Callahan and Kosaraju give a partition WSPD with $O(n/ε^d)$ dumbbells in $R^d$, but many point sets have far smaller WSPDs of both kinds. For $d\ge2$, the known $O(1)$-approximations of the minimum size WSPD that preserve the separation $ε$ have unspecified factors, above $10^7$ for $d=2$ by our estimates. For cover WSPDs, we give an $O(n^2\log n)$-time sweep approximation algorithm with a factor 40 in the plane for $ε\le1/16$. It extends to $R^d$ with a factor $2^{O(d)}$. The sweep is also a lower-bound tool: its number of steps is a lower bound on the WSPD size. For partition WSPDs, we analyze quadtree and fair split tree constructions: in the plane and for $ε\le1/5$, they give constant approximation factors, the smallest of which is 252 for a randomly shifted and scaled quadtree. In experiments with $ε=1/20$, the number of sweep steps is at least 0.91 OPT for n = 500, where the optimum OPT is known, and a local search raises it to a lower bound of 0.99 OPT. A greedy variant of the sweep, which is still a certified 40-approximation, is at most 1.28 times the lower bound for n = 10000. Followed by a new local-search heuristic that shrinks the WSPD, it is within 0.02% of the optimum on every instance with n = 500, and at most 1.10 times the lower bound for n = 10000. We then show how to convert the cover WSPDs into partition WSPDs. For n = 10000, the conversion gives on average 1.13 times the lower bound, against 1.05 for the cover WSPD itself and 1.55 for the Callahan-Kosaraju partition WSPD.

cs.CG↗

Witnessed Boolean Contracts: Sound Local Distance Guarantees for Approximate Implicit CSG

Hard min/max operations preserve the sign of exact implicit solids but generally destroy signed-distance semantics. Arbitrarily small, sign-preserving value perturbations can rotate the normalized gradient by nearly a right angle and displace a gradient-projected boundary witness by a finite amount. We formalize this as the absence of a value-only stability modulus for witness projection. We introduce a witnessed Boolean contract checking value and gradient errors, positive reach, active-branch separation, and a Lipschitz visibility margin at the approximate witness. A sharp normalization lemma bounds the normal-direction error. An enlarged neighborhood permits transfer of the inactive operand's bound between the approximate witness and the true foot point. Under the stated analytic and domain assumptions, passing the checks identifies a true point on the union boundary and bounds distance deficiency by the active operand's pointwise value error. Failed or unavailable checks return Unknown. The argument extends to finite hard unions by testing every inactive operand. An executable proof-chain audit finds no violations on 75,738 certified samples. A broader analytic stress test covers spheres, capsules, ring tori, three Boolean operators, and a four-leaf union. Of 96,000 narrow-band samples, 87,469 pass with zero oracle violations; per-case coverage ranges from 72.67% to 98.30%. Removing visibility admits 75 truly invalid witnesses, showing that branch separation alone is insufficient. Non-union cases remain empirical tests, not new theorems.

cs.CG↗