English
Related papers

Related papers: Distinct Distances with $\ell_p$ Spaces

200 papers

It is well known that almost every dilation of a sequence of real numbers, that diverges to $\infty$, is dense modulo~1. This paper studies the exceptional set of points -- those for which the dilation is not dense. Specifically, we…

Number Theory · Mathematics 2024-09-04 Daniel Berend , Michael D. Boshernitzan , Grigori Kolesnik , Rishi Kumar

Data subsampling is one of the most natural methods to approximate a massively large data set by a small representative proxy. In particular, sensitivity sampling received a lot of attention, which samples points proportional to an…

Data Structures and Algorithms · Computer Science 2024-06-04 Alexander Munteanu , Simon Omlor

Defining a divergence between the laws of continuous martingales is a delicate task, owing to the fact that these laws tend to be singular to each other. An important idea, put forward by N. Gantert, is to instead consider a scaling limit…

Probability · Mathematics 2025-07-08 Julio Backhoff-Veraguas , Xin Zhang

Let $\{a_1, . . . , a_n\}$ be a set of positive integers with $a_1 < \dots < a_n$ such that all $2^n$ subset sums are distinct. A famous conjecture by Erd\H{o}s states that $a_n>c\cdot 2^n$ for some constant $c$, while the best result known…

Combinatorics · Mathematics 2022-10-31 Simone Costa , Marco Dalai , Stefano Della Fiore

We consider divergence form elliptic equations $Lu:=\nabla\cdot(A\nabla u)=0$ in the half space $\mathbb{R}^{n+1}_+ :=\{(x,t)\in \mathbb{R}^n\times(0,\infty)\}$, whose coefficient matrix $A$ is complex elliptic, bounded and measurable. In…

Analysis of PDEs · Mathematics 2013-11-04 Steve Hofmann , Svitlana Mayboroda , Mihalis Mourgoglou

The $L_p$-discrepancy is a quantitative measure for the irregularity of distribution modulo one of infinite sequences. In 1986 Proinov proved for all $p>1$ a lower bound for the $L_p$-discrepancy of general infinite sequences in the…

Number Theory · Mathematics 2017-10-25 Josef Dick , Aicke Hinrichs , Lev Markhasin , Friedrich Pillichshammer

We solve the Neumann problem in the half space $\mathbb{R}^{n+1}_+$, for higher order elliptic differential equations with variable self-adjoint $t$-independent coefficients, and with boundary data in the negative smoothness space $\dot…

Analysis of PDEs · Mathematics 2019-07-01 Ariel Barton

Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.

Combinatorics · Mathematics 2025-03-13 Ivan Landjev , Konstantin Vorobev

In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $\Omega\left(n^{7/9}/{\rm polylog}…

Combinatorics · Mathematics 2016-04-07 Micha Sharir , Noam Solomon

The aim of this paper is to study the singular solutions to fractional elliptic equations with absorption $$ \left\{\arraycolsep=1pt \begin{array}{lll} (-\Delta)^\alpha u+|u|^{p-1}u=0,\quad & \rm{in}\quad\Omega\setminus\{0\},\\[2mm]…

Analysis of PDEs · Mathematics 2013-02-07 Huyuan Chen , Laurent Veron

We consider elliptic variational inequalities generated by obstacle type problems with thin obstacles. For this class of problems, we deduce estimates of the distance (measured in terms of the natural energy norm) between the exact solution…

Analysis of PDEs · Mathematics 2018-09-18 Darya E. Apushkinskaya , Sergey I. Repin

We consider a finite fields version of the Erd\H{o}s-Falconer distance problem for two different sets. In a certain range for the sizes of the two sets we obtain results of the conjectured order of magnitude.

Number Theory · Mathematics 2012-11-26 Rainer Dietmann

We consider ILPs, where each variable corresponds to an integral point within a polytope $\mathcal{P}$, i. e., ILPs of the form $\min\{c^{\top}x\mid \sum_{p\in\mathcal P\cap \mathbb Z^d} x_p p = b, x\in\mathbb Z^{|\mathcal P\cap \mathbb…

Computational Complexity · Computer Science 2020-10-20 Sebastian Berndt , Klaus Jansen , Alexandra Lassota

Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…

Commutative Algebra · Mathematics 2024-04-16 John Pawlina , Stefan Tohaneanu

We consider Dirichlet problems for linear elliptic equations of second order in divergence form on a bounded or exterior smooth domain $\Omega$ in $\mathbb{R}^n$, $n \ge 3$, with drifts $\mathbf{b}$ in the critical weak $L^n$-space…

Analysis of PDEs · Mathematics 2018-11-09 Hyunseok Kim , Tai-Peng Tsai

Using a recent result of Batson, Spielman and Srivastava, We obtain a tight estimate on the dimension of $\ell_p^n$, $p$ an even integer, needed to almost isometrically contain all $k$-dimensional subspaces of $L_p$.

Functional Analysis · Mathematics 2010-09-07 Gideon Schechtman

We consider the distances between a line and a set of points in the plane defined by the L^p-norms of the vector consisting of the euclidian distance between the single points and the line. We determine lines with minimal geometric…

Optimization and Control · Mathematics 2011-09-22 Annett Puettmann

We study the question of closeness testing for two discrete distributions. More precisely, given samples from two distributions $p$ and $q$ over an $n$-element set, we wish to distinguish whether $p=q$ versus $p$ is at least $\eps$-far from…

Data Structures and Algorithms · Computer Science 2013-08-20 Siu-On Chan , Ilias Diakonikolas , Gregory Valiant , Paul Valiant

We consider the $L^p$ Hardy inequality involving the distance to the boundary for a domain in the $n$-dimensional Euclidean space. We study the dependence on $p$ of the corresponding best constant and we prove monotonicity, continuity and…

Analysis of PDEs · Mathematics 2015-10-27 Gerassimos Barbatis , Pier Domenico Lamberti

We consider the problem of estimating a $d$-dimensional discrete distribution from its samples observed under a $b$-bit communication constraint. In contrast to most previous results that largely focus on the global minimax error, we study…

Information Theory · Computer Science 2021-11-02 Wei-Ning Chen , Peter Kairouz , Ayfer Özgür