English
Related papers

Related papers: Approximate Carath\'eodory bounds via Discrepancy …

200 papers

We show an elementary method to have (finite time and asymptotic) computer assisted explicit upper bounds on convergence to equilibrium (decay of correlations) and escape rate for systems satisfying a Lasota Yorke inequality. The bounds are…

Dynamical Systems · Mathematics 2015-01-27 Stefano Galatolo , Isaia Nisoli , Benoît Saussol

We prove a Carath\'eodory-type extension of BQS homeomorphisms between two domains in proper, locally path-connected metric spaces as homeomorphisms between their prime end closures. We also give a Carath\'eodory-type extension of geometric…

Metric Geometry · Mathematics 2019-09-25 Joshua Kline , Jeff Lindquist , Nageswari Shanmugalingam

We present a general technique for the analysis of first-order methods. The technique relies on the construction of a duality gap for an appropriate approximation of the objective function, where the function approximation improves as the…

Optimization and Control · Mathematics 2019-12-12 Jelena Diakonikolas , Lorenzo Orecchia

Stents are medical devices designed to modify blood flow in aneurysm sacs, in order to prevent their rupture. Some of them can be considered as a locally periodic rough boundary. In order to approximate blood flow in arteries and vessels of…

Analysis of PDEs · Mathematics 2009-01-20 Eric Bonnetier , Didier Bresch , Vuk Milisic

Let $C_1,\dots,C_{d+1}\subset \mathbb{R}^d$ be $d+1$ point sets, each containing the origin in its convex hull. We call these sets color classes, and we call a sequence $p_1, \dots, p_{d+1}$ with $p_i \in C_i$, for $i = 1, \dots, d+1$, a…

Computational Geometry · Computer Science 2018-08-31 Wolfgang Mulzer , Yannik Stein

The Continuous p-Dispersion Problem (CpDP) with boundary constraints asks for the placement of a fixed number of points in a compact subset of Euclidean space such that the minimum distance between any two points, as well as the points and…

Optimization and Control · Mathematics 2026-03-02 Sanjay Manoj , Melkior Ornik

We show that any $n\times m$ matrix $A$ can be approximated in operator norm by a submatrix with a number of columns of order the stable rank of $A$. This improves on existing results by removing an extra logarithmic factor in the size of…

Functional Analysis · Mathematics 2018-07-19 Omer Friedland , Pierre Youssef

In 1997, Erd\H{o}s asked whether for arbitrarily large $n$ there exists a set of $n$ points in $\mathbb{R}^2$ that determines $O(\frac{n}{\sqrt{\log n}})$ distinct distances while satisfying the local constraint that every 4-point subset…

Combinatorics · Mathematics 2026-01-21 Benjamin Grayzel

A non-homogeneous conormal derivative problem is considered for quasilinear divergence form elliptic equations modeled on the $m$-Laplacian operator. The nonlinear terms are given by Carath\'eodory functions and satisfy controlled growth…

Analysis of PDEs · Mathematics 2025-12-23 Dian K. Palagachev , Lubomira G. Softova

We consider an asynchronous network of $n$ message-sending parties, up to $t$ of which are byzantine. We study approximate agreement, where the parties obtain approximately equal outputs in the convex hull of their inputs. In their seminal…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-01 Mose Mizrahi Erbes , Roger Wattenhofer

In the classical best approximation pair (BAP) problem, one is given two nonempty, closed, convex and disjoint subsets in a finite- or an infinite-dimensional Hilbert space, and the goal is to find a pair of points, each from each subset,…

Optimization and Control · Mathematics 2025-09-09 Daniel Reem , Yair Censor

We examine the possibility of approximating Maximum Vertex-Disjoint Shortest Paths. In this problem, the input is an edge-weighted (directed or undirected) $n$-vertex graph $G$ along with $k$ terminal pairs…

Data Structures and Algorithms · Computer Science 2025-04-23 Matthias Bentert , Fedor V. Fomin , Petr A. Golovach

We study the problem of sub-trajectory nearest-neighbor queries on polygonal curves under the continuous Fr\'echet distance. Given an $n$ vertex trajectory $P$ and an $m$ vertex query trajectory $Q$, we seek to report a vertex-aligned…

Computational Geometry · Computer Science 2024-01-17 Joachim Gudmundsson , John Pfeifer , Martin P. Seybold

We provide a self contained proof of a result of Dudley [Dud64]} which shows that a bounded convex-body in $\Re^d$ can be $\varepsilon$-approximated, by the intersection of $O_d\bigl(\varepsilon^{-(d-1)/2} \bigr)$ halfspaces, where $O_d$…

Computational Geometry · Computer Science 2024-06-12 Sariel Har-Peled , Mitchell Jones

Motivated by the inverse Littlewood-Offord problem for linear forms, we study the concentration of quadratic forms. We show that if this form concentrates on a small ball with high probability, then the coefficients can be approximated by a…

Combinatorics · Mathematics 2011-05-31 Hoi H. Nguyen

Let $\mathcal{A}$ be a finite-dimensional subspace of $C(\mathcal{X};\mathbb{R})$, where $\mathcal{X}$ is a locally compact Hausdorff space, and $\mathsf{A}=\{f_1,\dots,f_m\}$ a basis of $\mathcal{A}$. A sequence $s=(s_j)_{j=1}^m$ is called…

Functional Analysis · Mathematics 2018-04-20 Philipp J. di Dio , Konrad Schmüdgen

We show that learning a convex body in $\RR^d$, given random samples from the body, requires $2^{\Omega(\sqrt{d/\eps})}$ samples. By learning a convex body we mean finding a set having at most $\eps$ relative symmetric difference with the…

Machine Learning · Computer Science 2009-04-09 Navin Goyal , Luis Rademacher

We adapt an argument of Tao and Vu to show that if $\lambda_1\le\cdots\le\lambda_d$ are the successive minima of an origin-symmetric convex body $K$ with respect to some lattice $\Lambda<\mathbb{R}^d$, and if we set…

Metric Geometry · Mathematics 2024-10-02 Matthew Tointon

A simple-to-implement weak-sense numerical method to approximate reflected stochastic differential equations (RSDEs) is proposed and analysed. It is proved that the method has the first order of weak convergence. Together with the Monte…

Numerical Analysis · Mathematics 2024-02-06 B. Leimkuhler , A. Sharma , M. V. Tretyakov

We give a short proof of a result of G. Paouris on the tail behaviour of the Euclidean norm $|X|$ of an isotropic log-concave random vector $X\in\R^n$, stating that for every $t\geq 1$, $P(|X|\geq ct\sqrt n)\leq \exp(-t\sqrt n)$. More…