相关论文: Polylogarithmic Full-Chord Buffon Discrepancy

Fix $p>2$. We prove that the Euclidean distortion of every $n$-point subset of $L_p$ is $p^3(\log n)^{\frac12+o(1)}$, thus, in particular, demonstrating that all $n$-point subsets of $L_p$ exhibit an asymptotic improvement over the $O(\log…

We establish existence of Stein kernels for probability measures on $\mathbb{R}^d$ satisfying a Poincar\'e inequality, and obtain bounds on the Stein discrepancy of such measures. Applications to quantitative central limit theorems are…

We study the Lorentzian Calder\'on problem, where the objective is to determine a globally hyperbolic Lorentzian metric up to a boundary fixing diffeomorphism from boundary measurements given by the hyperbolic Dirichlet-to-Neumann map. This…

Let A be a bounded subset of IR^d. We give an upper bound on the volume of the symmetric difference of A and f(A) where f is a translation, a rotation, or the composition of both, a rigid motion. The volume is measured by the d-dimensional…

Digital Kronecker-sequences are a non-archimedean analog of classical Kronecker-sequences whose construction is based on Laurent series over a finite field. In this paper it is shown that for almost all digital Kronecker-sequences the star…

We introduce an approach of Riemann--Roch theorem to the boundedness problem of minimal log discrepancies in fixed dimension. After reducing it to the case of a Gorenstein terminal singularity, firstly we prove that its minimal log…

We proved that for every sufficiently large $n$, the complete graph $K_{2n}$ with an arbitrary edge signing $\sigma: E(K_{2n}) \to \{-1, +1\}$ admits a high discrepancy $1$-factor decomposition. That is, there exists a universal constant $c…

A great challenge in the analysis of the discrepancy function D_N is to obtain universal lower bounds on the L-infty norm of D_N in dimensions d \geq 3. It follows from the average case bound of Klaus Roth that the L-infty norm of D_N is at…

Mordechay B. Levin has constructed a number $\lambda$ which is normal in base 2, and such that the sequence $(\left\{2^n \lambda\right\})_{n=0,1,2,\ldots}$ has very small discrepancy $D_N$. Indeed we have $N\cdot D_N = \mathcal{O}…

We consider the problem of finding, for a given quadratic measure of non-uniformity of a set of $N$ points (such as $L_2$ star-discrepancy or diaphony), the asymptotic distribution of this discrepancy for truly random points in the limit…

We initiate the study of quadratic discrepancy for finite point sets on the Heisenberg group $\mathbb H^n$ with respect to upper Ahlfors regular probability measures. For a natural family of test sets given by left translations and…

Given two elliptic operators L and M in nondivergence form, with coefficients A_L(x), A_M(x) and drift terms b_L(x), b_M(x), respectively, satisfying a Carleson measure disagreement condition in a Lipschitz domain Omega in R^{n+1}, then…

In this paper we state a one-to-one connection between the maximal ratio of the circumradius and the diameter of a body (the Jung constant) in an arbitrary Minkowski space and the maximal Minkowski asymmetry of the complete bodies within…

This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…

Chernoff bound is a fundamental tool in theoretical computer science. It has been extensively used in randomized algorithm design and stochastic type analysis. Discrepancy theory, which deals with finding a bi-coloring of a set system such…

We give a construction of an absolutely normal real number $x$ such that for every integer $b $ greater than or equal to $2$, the discrepancy of the first $N$ terms of the sequence $(b^n x \mod 1)_{n\geq 0}$ is of asymptotic order…

Let $\Omega\subset\mathbb{R}^{n+1}$, $n\geq2$, be an open set with Ahlfors-David regular boundary that satisfies the corkscrew condition. We consider a uniformly elliptic operator $L$ in divergence form associated with a matrix $A$ with…

We consider the problem of finding a low discrepancy coloring for sparse set systems where each element lies in at most $t$ sets. We give an algorithm that finds a coloring with discrepancy $O((t \log n \log s)^{1/2})$ where $s$ is the…

We study the problem of $2$-dimensional orthogonal range counting with additive error. Given a set $P$ of $n$ points drawn from an $n\times n$ grid and an error parameter $\eps$, the goal is to build a data structure, such that for any…

In this article we survey recent results on the explicit construction of finite point sets and infinite sequences with optimal order of $\mathcal{L}_q$ discrepancy. In 1954 Roth proved a lower bound for the $\mathcal{L}_2$ discrepancy of…