Related papers: Explicit constructions of point sets and sequences…
The $\mathcal{L}_2$ discrepancy is one of several well-known quantitative measures for the equidistribution properties of point sets in the high-dimensional unit cube. The concept of weights was introduced by Sloan and Wo\'{z}niakowski to…
The $LS$-sequences are a parametric family of sequences of points in the unit interval. They were introduced by Carbone, who also proved that under an appropriate choice of the parameters $L$ and $S$, such sequences are low-discrepancy. The…
We give an explicit construction of two-dimensional point sets whose $L_p$ discrepancy is of best possible order for all $1\le p\le \infty$. It is provided by folding Hammersley point sets in base $b$ by means of the $b$-adic baker's…
The process of symmetrization is often used to construct point sets with low $L_p$ discrepancy. In the current work we apply this method to the shifted Hammersley point set. It is known that for every shift this symmetrized point set…
A joint of a set of lines $\mathcal{L}$ in $\mathbb{F}^d$ is a point that is contained in $d$ lines with linearly independent directions. The joints problem asks for the maximum number of joints that are formed by $L$ lines. Guth and Katz…
A sequence is called $C$-finite if it satisfies a linear recurrence with constant coefficients. We study sequences which satisfy a linear recurrence with $C$-finite coefficients. Recently, it was shown that such $C^2$-finite sequences…
We construct simple, explicit matrices with columns having unit $\ell^2$ norm and discrepancy approaching $1 + \sqrt{2} \approx 2.414$. This number gives a lower bound, the strongest known as far as we are aware, on the constant appearing…
Let $\Omega \subset \mathbb{R}^2$ be a bounded, convex set. A set $O \subset \mathbb{R}^2$ is an opaque set (for $\Omega$) if every line that intersects $\Omega$ also intersects $O$. What is the minimal possible length $L$ of an opaque set?…
Quasi-Monte Carlo (QMC) quadrature rules using higher order digital nets and sequences have been shown to achieve the almost optimal rate of convergence of the worst-case error in Sobolev spaces of arbitrary fixed smoothness $\alpha\in…
Explicit Runge--Kutta (RK) methods are susceptible to a reduction in the observed order of convergence when applied to initial-boundary value problem with time-dependent boundary conditions. We study conditions on explicit RK methods that…
We construct finite sets of real numbers that have a small difference set and strong local properties. In particular, we construct a set $A$ of $n$ real numbers such that $|A-A|=n^{\log_2 3}$ and that every subset $A'\subseteq A$ of size…
Let E be an elliptic curve defined over a number field k. In this paper, we define the ``global discrepancy'' of a finite set Z of algebraic points on E which in a precise sense measures how far the set is from being adelically…
Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…
It is proved that the total length of any set of countably many rectifiable curves, whose union meets all straight lines that intersect the unit square U, is at least 2.00002. This is the first improvement on the lower bound of 2…
In this paper we study the geometric discrepancy of explicit constructions of uniformly distributed points on the two-dimensional unit sphere. We show that the spherical cap discrepancy of random point sets, of spherical digital nets and of…
We show that for large enough $n$, the number of non-isomorphic pseudoline arrangements of order $n$ is greater than $2^{c\cdot n^2}$ for some constant $c > 0.2604$, improving the previous best bound of $c>0.2083$ by Dumitrescu and Mandal…
We are interested to bound from below the number of distinct dot products determined by a finite set of points $P$ in the Euclidean plane. In this paper, we build on the work of B. Hanson, O. Roche-Newton, and S. Senger, to obtain the…
Discrepancy is a well-known measure for the irregularity of the distribution of a point set. Point sets with small discrepancy are called low-discrepancy and are known to efficiently fill the space in a uniform manner. Low-discrepancy…
Low-discrepancy points are designed to efficiently fill the space in a uniform manner. This uniformity is highly advantageous in many problems in science and engineering, including in numerical integration, computer vision, machine…
Lipschitz decomposition is a useful tool in the design of efficient algorithms involving metric spaces. While many bounds are known for different families of finite metrics, the optimal parameters for $n$-point subsets of $\ell_p$, for $p >…