English
Related papers

Related papers: From Tarski's plank problem to simultaneous approx…

200 papers

We prove a structural result for degree-$d$ polynomials. In particular, we show that any degree-$d$ polynomial, $p$ can be approximated by another polynomial, $p_0$, which can be decomposed as some function of polynomials $q_1,...,q_m$ with…

Probability · Mathematics 2012-08-17 Daniel M. Kane

A family of $k$ point sets in $d$ dimensions is well-separated if the convex hulls of any two disjoint subfamilies can be separated by a hyperplane. Well-separation is a strong assumption that allows us to conclude that certain kinds of…

Computational Geometry · Computer Science 2022-09-07 Helena Bergold , Daniel Bertschinger , Nicolas Grelier , Wolfgang Mulzer , Patrick Schnider

Given $mp$ different $p$-planes in general position in $(m+p)$-dimensional space, a classical problem is to ask how many $p$-planes intersect all of them. For example when $m = p = 2$, this is precisely the question of "lines meeting four…

Algebraic Topology · Mathematics 2022-06-03 Thomas Brazelton

We study a natural geometric variant of the classic Knapsack problem called 2D-Knapsack: we are given a set of axis-parallel rectangles and a rectangular bounding box, and the goal is to pack as many of these rectangles inside the box…

Data Structures and Algorithms · Computer Science 2023-07-21 Michal Pilipczuk , Mathieu Mari , Timothe Picavet

The following ``Key Lemma'' plays an important role in Parusinski's work on the existence of Lipschitz stratifications in the class of semianalytic sets: For any positive integer n, there is a finite set of homogeneous symmetric polynomials…

Algebraic Geometry · Mathematics 2007-05-23 Zinovy Reichstein , Boris Youssin

We survey developments, over the last thirty years, in the theory of Shape Preserving Approximation (SPA) by algebraic polynomials on a finite interval. In this article, "shape" refers to (finitely many changes of) monotonicity, convexity,…

Classical Analysis and ODEs · Mathematics 2011-09-06 K. A. Kopotun , D. Leviatan , A. Prymak , I. A. Shevchuk

We prove a common generalization to several mass partition results using hyperplane arrangements to split $\mathbb{R}^d$ into two sets. Our main result implies the ham-sandwich theorem, the necklace splitting theorem for two thieves, a…

Combinatorics · Mathematics 2024-04-30 Alfredo Hubard , Pablo Soberón

We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…

Combinatorics · Mathematics 2026-03-09 Yewen Sun

One of our result is that 5 measurable sets in $R^8$ always admit an equipartition by 2 hyperplanes. This is an instance of a general equipartition problem (formulated by B. Gr{\" u}nbaum and H. Hadwiger) which can be reduced to the…

Combinatorics · Mathematics 2007-05-23 Peter Mani-Levitska , Sinisa Vrecica , Rade Zivaljevic

Given $k$ collections of 2SAT clauses on the same set of variables $V$, can we find one assignment that satisfies a large fraction of clauses from each collection? We consider such simultaneous constraint satisfaction problems, and design…

Data Structures and Algorithms · Computer Science 2014-07-30 Amey Bhangale , Swastik Kopparty , Sushant Sachdeva

Persistence diagrams (PD)s play a central role in topological data analysis. This analysis requires computing distances among such diagrams such as the $1$-Wasserstein distance. Accurate computation of these PD distances for large data sets…

Computational Geometry · Computer Science 2025-05-13 Tamal K. Dey , Simon Zhang

Let $P$ be a $d$-dimensional $n$-point set. A partition $T$ of $P$ is called a Tverberg partition if the convex hulls of all sets in $T$ intersect in at least one point. We say $T$ is $t$-tolerant if it remains a Tverberg partition after…

Computational Geometry · Computer Science 2015-05-28 Wolfgang Mulzer , Yannik Stein

We introduce the problem Synchronized Planarity. Roughly speaking, its input is a loop-free multi-graph together with synchronization constraints that, e.g., match pairs of vertices of equal degree by providing a bijection between their…

Data Structures and Algorithms · Computer Science 2021-07-23 Thomas Bläsius , Simon D. Fink , Ignaz Rutter

Answering Tarski's plank problem, Bang showed in 1951 that it is impossible to cover a convex body $K \subset \mathbb{R}^d$ with $d \geq 1$ by planks whose total width is less than the minimal width $w(K)$ of $K$. In 2003, A. Bezdek asked…

Metric Geometry · Mathematics 2025-11-24 Gergely Ambrus , Julian Huddell , Maggie Lai , Matthew Quirk , Elias Williams

Assume that a linear space of real polynomials in $d$ variables is given which is translation and dilation invariant. We show that if a sequence in this space converges pointwise to a polynomial, then the limit polynomial belongs to the…

Classical Analysis and ODEs · Mathematics 2015-12-02 J. M. Almira , L. Székelyhidi

As a first step towards a general set-theoretic counterpart of the remarkable Bernstein-Walsh-Siciak Theorem concerning the rapidity of polynomial approximation of a holomorphic function on polynomially convex compact sets in…

Complex Variables · Mathematics 2019-01-03 Anna Denkowska , Maciej P. Denkowski

Let $D = d_1, d_2, \ldots, d_n$ and $F = f_1, f_2,\ldots, f_n$ be two sequences of positive integers. We consider the following decision problems: is there a $i)$ multigraph, $ii)$ loopless multigraph, $iii)$ simple graph, $iv)$ connected…

Combinatorics · Mathematics 2021-09-28 Uroš Čibej , Aaron Li , István Miklós , Sohaib Nasir , Varun Srikanth

We prove that the distribution density of any non-constant polynomial $f(\xi_1,\xi_2,\ldots)$ of degree $d$ in independent standard Gaussian random variables $\xi$ (possibly, in infinitely many variables) always belongs to the…

Probability · Mathematics 2016-05-03 Vladimir I. Bogachev , Egor D. Kosov , Georgii I. Zelenov

We aim to fill a gap in the proof of an inequality relating two exponents of uniform Diophantine approximation stated in a paper by Bugeaud. We succeed to verify the inequality in several instances, in particular for small dimension.…

Number Theory · Mathematics 2024-12-11 Johannes Schleischitz

Given two points $p,q$ in the real plane, the signed area of the rectangle with the diagonal $[pq]$ equals the square of the Minkowski distance between the points $p,q$. We prove that $N>1$ points in the Minkowski plane $\R^{1,1}$ generate…

Combinatorics · Mathematics 2013-03-18 Oliver Roche-Newton , Misha Rudnev