Related papers: Sharp density discrepancy for cut and project sets…
We study the variance in the number of points contained within a window $\Omega$ of arbitrary size, and to further illuminate our understanding of {\it hyperuniform} systems, i.e., point patterns that do not possess long-wavelength…
Current methods aggregate multi-level features or introduce edge and skeleton to get more refined saliency maps. However, little attention is paid to how to obtain the complete salient object in cluttered background, where the targets are…
Accurate probabilistic predictions can be characterized by two properties -- calibration and sharpness. However, standard maximum likelihood training yields models that are poorly calibrated and thus inaccurate -- a 90% confidence interval…
If $c, \overline c\colon [a,b]\to \mathbb R^2$ are two convex planar curve parameterized by affine arc length and $A\colon [a,b]\to [0,\infty)$ is the area bounded by the restriction $c\big|_{[a,s]}$ and the segment between $c(a)$ and…
Deep-learning has proved in recent years to be a powerful tool for image analysis and is now widely used to segment both 2D and 3D medical images. Deep-learning segmentation frameworks rely not only on the choice of network architecture but…
Point counting estimates are a key stepping stone to various results in metric Diophantine approximation. In this paper we use the quantitative non-divergence estimates originally developed by Kleinbock and Margulis to improve lower bounds…
We prove that the diffraction formula for regular model sets is equivalent to the Poisson Summation Formula for the underlying lattice. This is achieved using Fourier analysis of unbounded measures on locally compact abelian groups as…
In this paper, we consider the so-called "Furstenberg set problem" in high dimensions. First, following Wolff's work on the two dimensional real case, we provide "reasonable" upper bounds for the problem for $\mathbb{R}$ or $\mathbb{F}_p$.…
We consider an affine Euclidean lattice and record the directions of all lattice vectors of length at most $T$. Str\"ombergsson and the second author proved in [Annals of Math.~173 (2010), 1949--2033] that the distribution of gaps between…
The present paper analyzes the discrepancy of distribution of rational points on general semisimple algebraic group varieties. The results include mean-square, almost sure, and uniform discrepancy estimates with explicit error bounds, which…
Subset-sum problems belong to the NP class and play an important role in both complexity theory and knapsack-based cryptosystems, which have been proved in the literature to become hardest when the so-called density approaches one. Lattice…
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…
We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the…
Change detection, i.e. identification per pixel of changes for some classes of interest from a set of bi-temporal co-registered images, is a fundamental task in the field of remote sensing. It remains challenging due to unrelated forms of…
Machine learning is increasingly used to guide branch-and-cut (B&C) for mixed-integer linear programming by learning score-based policies for selecting branching variables and cutting planes. Many approaches train on local signals from…
We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}^{n}$ that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure…
A matching cut is a partition of the vertex set of a graph into two sets $A$ and $B$ such that each vertex has at most one neighbor in the other side of the cut. The MATCHING CUT problem asks whether a graph has a matching cut, and has been…
We approximately compute the correspondence degree (as defined by Lazarsfeld and Martin) between two unbalanced complete intersections. This is accomplished by showing that the procedure of taking a subvariety of a product $Y \times Y'$ and…
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…
In the present paper we prove several results concerning the existence of low-discrepancy point sets with respect to an arbitrary non-uniform measure $\mu$ on the $d$-dimensional unit cube. We improve a theorem of Beck, by showing that for…