Search arXivSearch

arXiv · 2609.16757

Counterexamples and symmetry for uneven orthogonal mass partitions in the plane

Abstract

Grünbaum asked whether every planar convex body admits, for every $0\leq t\leq 1/4$, two orthogonal lines cutting it into pieces with cyclically ordered areas $t,t,1/2-t,1/2-t$. Bárány posed the analogous question for well-behaved planar measures and conjectured that the answer there is negative. We confirm Bárány's conjecture in a particularly robust form: for every fixed $0<t<1/4$ we construct smooth, strictly positive, centrally symmetric, strongly log-concave measures arbitrarily close to the standard Gaussian for which the prescribed partition does not exist. In contrast, we prove that the partition exists for every $t$ whenever the measure is invariant under an orientation-reversing affine involution. We also exhibit a $96$-point counterexample for which no pair of perpendicular lines produces cyclic counts $8,8,40,40$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Leonardo Martínez-Sandoval. 2026-09-15. Counterexamples and symmetry for uneven orthogonal mass partitions in the plane. https://arxiv.org/abs/2609.16757

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO