Related papers: Sharp density discrepancy for cut and project sets…
Object counting aims to estimate the number of objects in images. The leading counting approaches focus on the single category counting task and achieve impressive performance. Note that there are multiple categories of objects in real…
Finite difference schemes are the method of choice for solving nonlinear, degenerate elliptic PDEs, because the Barles-Sougandis convergence framework [Barles and Sougandidis, Asymptotic Analysis, 4(3):271-283, 1991] provides sufficient…
We investigate the limiting behavior of discrete determinantal point processes (DPPs) towards continuous DPPs when the size of the set to sample from goes to infinity. We propose a non-asymptotic characterization of this limit in terms of…
We solve the isoclinic Deligne--Simpson problem for exceptional groups, completing a program initiated by Sage et al. and Jakob--Yun. As a by-product, we obtain new examples of physically rigid irregular connections on the projective line.…
We develop a new family of linear programs, that yield upper bounds on the rate of binary linear codes of a given distance. Our bounds apply {\em only to linear codes.} Delsarte's LP is the weakest member of this family and our LP yields…
Recent results of Grepstad and Lev are used to show that weighted cut-and-project sets with one-dimensional physical space and one-dimensional internal space are bounded distance equivalent to some lattice if the weight function $h$ is…
We give an improved lower bound for the $L_2$-discrepancy of finite point sets in the unit square.
We analyze the coordinate descent method with a new coordinate selection strategy, called volume sampling. This strategy prescribes selecting subsets of variables of certain size proportionally to the determinants of principal submatrices…
We consider the classical minimum and maximum cut problems: find a partition of vertices of a graph into two disjoint subsets that minimize or maximize the sum of the weights of edges with endpoints in different subsets. It is known that if…
In class-agnostic object counting, the goal is to estimate the total number of object instances in an image without distinguishing between specific categories. Existing methods often predict this count without considering class-specific…
Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…
This paper studies the lattice agreement problem and proposes a stronger form, $\varepsilon$-bounded lattice agreement, that enforces an additional tightness constraint on the outputs. To formalize the concept, we define a quasi-metric on…
Sketch-and-project is a framework which unifies many known iterative methods for solving linear systems and their variants, as well as further extensions to non-linear optimization problems. It includes popular methods such as randomized…
Learning and selecting important points on a point cloud is crucial for point cloud understanding in various applications. Most of early methods selected the important points on 3D shapes by analyzing the intrinsic geometric properties of…
Precision weak gravitational lensing experiments require measurements of galaxy shapes accurate to <1 part in 1000. We investigate measurement biases, noted by Voigt and Bridle (2009) and Melchior et al. (2009), that are common to shape…
On the circle of radius $R$ centred at the origin, consider a ``thin'' sector about the fixed line $y = \alpha x$ with edges given by the lines $y = (\alpha \pm \epsilon) x$, where $\epsilon = \epsilon_R \rightarrow 0$ as $ R \to \infty $.…
Let $\Lambda\subseteq\mathbb{R}^n$ be a lattice and let $Z\subseteq\mathbb{R}^{m+n}$ be a definable family in an o-minimal expansion of the real field, $\overline{\mathbb{R}}$. A result of Barroero and Widmer gives sharp estimates for the…
Given a linear ordering of the vertices of a graph, the cutwidth of a vertex $v$ with respect to this ordering is the number of edges from any vertex before $v$ (including $v$) to any vertex after $v$ in this ordering. The cutwidth of an…
We show that given a lattice $\Gamma \subset \mathbb{R}^m \times \mathbb{R}^n$, and projections $p_1$ and $p_2$ onto $\mathbb{R}^m$ and $\mathbb{R}^n$ respectively, cut-and-project sets obtained using Jordan measurable windows $W$ and $W'$…
Gardner, Gronchi and Zong posed the problem to find a discrete analogue of M. Meyer's inequality bounding the volume of a convex body from below by the geometric mean of the volumes of its slices with the coordinate hyperplanes. Motivated…