Related papers: Probabilistic discrepancy bound for Monte Carlo po…

Let $V \subset \mathbb{R}$ be a finite set with $|V| = n $ and suppose we are given each pairwise distance independently with probability $p$. We show that if $p = (1+\epsilon)/n$, for some fixed $\epsilon >0$, then we can reconstruct a…

We provide a new proof of Maurer, Renard, and Pietzak's result that the sum of the nCPA advantages of random permutations $P$ and $Q$ bound the CCA advantage of $P^{-1} \circ Q$. Our proof uses probability directly, as opposed to…

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…

Let $S$ be a 2-colored (red and blue) set of $n$ points in the plane. A subset $I$ of $S$ is an island if there exits a convex set $C$ such that $I=C\cap S$. The discrepancy of an island is the absolute value of the number of red minus the…

The spherical cap discrepancy is a prominent measure of uniformity for sets on the d-dimensional sphere. It is particularly important for estimating the integration error for certain classes of functions on the sphere. Building on a…

Neutron stars are observed to undergo small, abrupt rotational speed-up. This phenomenon is known as glitch. In pulsar timing observations, detection of a neutron star glitch is constrained by the time of occurrence of the event relative to…

We study $k$-star decompositions, that is, partitions of the edge set into disjoint stars with $k$ edges, in the uniformly random $d$-regular graph model $\mathcal{G}_{n,d}$. Using the small subgraph conditioning method, we prove an…

In this paper we extend a result of Levin, who proved a lower bound on the star discrepancy of generalized Halton sequences in positive integer bases, to rational bases.

We characterize the largest point sets in the plane which define at most 1, 2, and 3 angles. For $P(k)$ the largest size of a point set admitting at most $k$ angles, we prove $P(2)=5$ and $P(3)=5$. We also provide the general bounds of $k+2…

A planet orbiting around a star in a binary system can be ejected if it lies too far from its host star. We find that instability boundaries first obtained in numerical studies can be explained by overlap between sub-resonances within…

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 prove a stability inequality associated to the reverse Sobolev inequality on the sphere $\mathbb S^n$, for the full admissible parameter range $s - \frac{n}{2} \in (0,1) \cup (1,2)$. To implement the classical proof of Bianchi and…

We prove that for $c>0$ a sufficiently small universal constant that a random set of $c d^2/\log^4(d)$ independent Gaussian random points in $\mathbb{R}^d$ lie on a common ellipsoid with high probability. This nearly establishes a…

We consider the problem of determining the number of distinct distances between two point sets in $\mathbb{R}^2$ where one point set $\mathcal{P}_1$ of size $m$ lies on a real algebraic curve of fixed degree $r$, and the other point set…

We study solutions to the equation $a+b=c$, where $a,b,c$ form a triple of coprime natural numbers. The $abc$ conjecture asserts that, for any $\epsilon>0$, such triples satisfy $\mathrm{rad}(abc) \ge c^{1-\epsilon}$ with finitely many…

Pinsker's widely used inequality upper-bounds the total variation distance $||P-Q||_1$ in terms of the Kullback-Leibler divergence $D(P||Q)$. Although in general a bound in the reverse direction is impossible, in many applications the…

In a projective plane $\Pi _{q}$ (not necessarily Desarguesian) of order $q,$ a point subset $S$ is saturating (or dense) if any point of $\Pi _{q}\setminus S$ is collinear with two points in$~S$. Using probabilistic methods, the following…

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

It is shown that at least 50% of the probability mass of a sum of independent Rademacher random variables is within one standard deviation from its mean. This lower bound is sharp, it is much better than for instance the bound that can be…

We improve our earlier upper bound on the numbers of antipodal pairs of points among $n$ points in ${\mathbb{R}}^3$, to $2n^2/5+O(n^c)$, for some $c<2$. We prove that the minimal number of antipodal pairs among $n$ points in convex position…