Search arXivSearch

arXiv · 2502.17176

Cookie cutters: Bisections with fixed shapes

Abstract

In a mass partition problem, we are interested in finding equitable partitions of smooth measures in $\mathbb{R}^d$. In this manuscript, we study the problem of finding simultaneous bisections of measures using scaled copies of a prescribed set $K$. We distinguish the problem when we are allowed to use scaled and translated copies of $K$ and the problem when we are allowed to use scaled isometric copies of $K$. These problems have only previously been studied if $K$ is a half-space or a Euclidean ball. We obtain positive results for simultaneous bisection of any $d+1$ masses for star-shaped compact sets $K$ with non-empty interior, where the conditions on the problem depend on the smoothness of the boundary of $K$. Additional proofs are included for particular instances of $K$, such as hypercubes and cylinders, answering positively a conjecture of Soberón and Takahashi. The proof methods are topological and involve new Borsuk--Ulam-type theorems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Patrick Schnider, Pablo Soberón. 2025-02-24. Cookie cutters: Bisections with fixed shapes. https://arxiv.org/abs/2502.17176

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