English
Related papers

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

200 papers

Lie algebra $\mathfrak{sl}(2)$ can be realised by vector fields on $\mathbb{R}^1\ni x$ with polynomial coefficients $1$, $-2x$, $-x^2$; their Wronskian determinants yield the Lie bracket. Likewise, the monomials $1$, $\ldots$, $x^k/k!$,…

Rings and Algebras · Mathematics 2026-05-27 Markuss G. Ķēniņš , Arthemy V. Kiselev

Let $\Lambda$ be a uniformly discrete set and $S$ be a compact set in $R$. We prove that if there exists a bounded sequence of functions in Paley--Wiener space $PW_S$, which approximates $\delta-$functions on $\Lambda$ with $l^2-$error $d$,…

Classical Analysis and ODEs · Mathematics 2013-04-03 Alexander Olevskii , Alexander Ulanovskii

We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of $n$ points in the plane can be covered using $k$ lines. Line Cover is known to be NP-hard, and we focus on two natural generalizations. The first is…

Computational Geometry · Computer Science 2026-03-26 Matthias Bentert , Fedor v. Fomin , Petr A. Golovach , Souvik Saha , Sanjay Seetharaman , Kirill Simonov , Anannya Upasana

This paper introduces the Simultaneous assignment problem. Let us given a graph with a weight and a capacity function on its edges, and a set of its subgraphs along with a degree upper bound function for each of them. We are also given a…

Data Structures and Algorithms · Computer Science 2023-01-24 Péter Madarasi

We derive a general upper bound for the number of incidences with $k$-dimensional varieties in ${\mathbb R}^d$. The leading term of this new bound generalizes previous bounds for the special cases of $k=1, k=d-1,$ and $k= d/2$, to every…

Combinatorics · Mathematics 2018-09-13 Thao Do , Adam Sheffer

Suppose we are given two metric spaces and a family of continuous transformations from one to the other. Given a probability distribution on each of these two spaces - namely the source and the target measures - the Wasserstein alignment…

Probability · Mathematics 2025-03-11 Soumik Pal , Bodhisattva Sen , Ting-Kam Leonard Wong

Let $D$ be a disk in $\mathbb{R}^n$ and $f\in C^{r+2}(D, \mathbb{R}^k)$. We deal with the problem of the algebraic approximation of the set $j^{r}f^{-1}(W)$ consisting of the set of points in the disk $D$ where the $r$-th jet extension of…

Differential Geometry · Mathematics 2020-10-29 Antonio Lerario , Michele Stecconi

Let $A,B \subseteq \mathbb{R}^d $ both span $\mathbb{R}^d$ such that $\langle a, b \rangle \in \{0,1\}$ holds for all $a \in A$, $b \in B$. We show that $ |A| \cdot |B| \le (d+1) 2^d $. This allows us to settle a conjecture by Bohn, Faenza,…

Combinatorics · Mathematics 2020-08-18 Andrey Kupavskii , Stefan Weltge

A map $\varphi:K\to R^2$ of a graph $K$ is approximable by embeddings, if for each $\varepsilon>0$ there is an $\varepsilon$-close to $\varphi$ embedding $f:K\to R^2$. Analogous notions were studied in computer science under the names of…

Geometric Topology · Mathematics 2018-10-02 Arkadiy Skopenkov

Consider a host hypergraph $G$ which contains a spanning structure due to minimum degree considerations. We collect three results proving that if the edges of $G$ are sampled at the appropriate rate then the spanning structure still appears…

Combinatorics · Mathematics 2023-05-17 Huy Tuan Pham , Ashwin Sah , Mehtaab Sawhney , Michael Simkin

Strip packing is a classical packing problem, where the goal is to pack a set of rectangular objects into a strip of a given width, while minimizing the total height of the packing. The problem has multiple applications, e.g. in scheduling…

Data Structures and Algorithms · Computer Science 2016-10-26 Anna Adamaszek , Tomasz Kociumaka , Marcin Pilipczuk , Michał Pilipczuk

For a given decreasing positive real function $\psi$, let $\mathcal{A}_n(\psi)$ be the set of real numbers for which there are infinitely many integer polynomials $P$ of degree up to $n$ such that $\left\lvert P(x) \right\rvert \leq…

Number Theory · Mathematics 2020-08-18 Alessandro Pezzoni

A generalization of Lozanovskii's result is proved. Let E be $k$-dimensional subspace of an $n$-dimensional Banach space with unconditional basis. Then there exist $x_1,..,x_k \subset E$ such that $B_E \p \subset \p absconv\{x_1,..,x_k\}$…

Functional Analysis · Mathematics 2016-09-06 Marius Junge

We present an engineered version of the divide-and-conquer algorithm for finding the closest pair of points, within a given set of points in the XY-plane. For this version of the algorithm we show that only two pairwise comparisons are…

Computational Geometry · Computer Science 2015-03-17 José C. Pereira , Fernando G. Lobo

A formal link between regression and classification has been tenuous. Even though the margin maximization term $\|w\|$ is used in support vector regression, it has at best been justified as a regularizer. We show that a regression problem…

Machine Learning · Computer Science 2025-11-07 Jayadeva , Naman Dwivedi , Hari Krishnan , N. M. Anoop Krishnan

For non-negative integers $(d_n(k))_{k \ge 1}$ such that $\sum_{k \ge 1} d_n(k) = n$, we sample a bipartite planar map with $n$ faces uniformly at random amongst those which have $d_n(k)$ faces of degree $2k$ for every $k \ge 1$ and we…

Probability · Mathematics 2020-07-20 Cyril Marzouk

Let $f_1,\...,f_r$ be polynomials in $n$ variables over a finite field $F$ of cardinality $q$ and characteristic $p$. Let $f_i$ have total degree $d_i$ and define $d=d_1+\...+d_r$. Write $Z$ for the set of common zeros of the $f_i$, over…

Number Theory · Mathematics 2016-09-26 D. R. Heath-Brown

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Optimization and Control · Mathematics 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall

The celebrated and famous Weierstrass approximation theorem characterizes the set of continuous functions on a compact interval via uniform approximation by algebraic polynomials. This theorem is the first significant result in…

Classical Analysis and ODEs · Mathematics 2008-05-07 Dilcia Perez , Yamilet Quintana

We consider four related problems. (1) Obtaining dimension estimates for the set of exceptional vantage points for the pinned Falconer distance problem. (2) Nonlinear projection theorems, in the spirit of Kaufman, Bourgain, and Shmerkin.…

Classical Analysis and ODEs · Mathematics 2024-02-27 Orit E. Raz , Joshua Zahl