Related papers: Numbers with three close factorizations and centra…
We find tight estimates for the minimum number of proper subspaces needed to cover all lattice points in an n-dimensional convex body symmetric about the origin. We also find the order of magnitude of the number of (n-1)-dimensional…
We consider the lattice point problem corresponding to a family of elliptic paraboloids in $\mathbb{R}^d$ with $d\ge3$ and we prove the expected to be optimal exponent, improving previous results. This is especially noticeable for $d=3$…
Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear. The problem is known to be ${\rm…
We study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…
We give an alternative argument to the application of the so-called Maurey- Nikishin-Pisier factorisation in Fourier restriction theory. Based on an induction-on-scales argument, our comparably simple method applies to any compact quadratic…
We show that for those lattices of Voronoi's first kind with known obtuse superbasis, a closest lattice point can be computed in $O(n^4)$ operations where $n$ is the dimension of the lattice. To achieve this a series of relevant lattice…
We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set $S$ of $s$ points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in…
We consider ILPs, where each variable corresponds to an integral point within a polytope $\mathcal{P}$, i. e., ILPs of the form $\min\{c^{\top}x\mid \sum_{p\in\mathcal P\cap \mathbb Z^d} x_p p = b, x\in\mathbb Z^{|\mathcal P\cap \mathbb…
We consider the problem of finding the closest lattice point to a vector in n-dimensional Euclidean space when each component of the vector is available at a distinct node in a network. Our objectives are (i) minimize the communication cost…
In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…
We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…
We propose and study a generalization to the well-known problem of polyline simplification. Instead of a single polyline, we are given a set of $\ell$ polylines possibly sharing some line segments and bend points. Our goal is to minimize…
We discuss some examples of equations of the three-body problem with the oscillating asymptotics at large momentum: (i) the fixed-center approximation, (ii) the unitarized equation in the fixed-center approximation, (iii)…
We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameterization to study the number, the greatest minimal norm, and the highest…
We investigate in this paper the distribution of the discrepancy of various lattice counting functions. In particular, we prove that the number of lattice points contained in certain domains defined by products of linear forms satisfies a…
The $k$-center problem is a central optimization problem with numerous applications for machine learning, data mining, and communication networks. Despite extensive study in various scenarios, it surprisingly has not been thoroughly…
In this paper we present a new version of the second author's factorization theorem for perfect matchings of symmetric graphs. We then use our result to solve four open problems of Propp on the enumeration of trimer tilings on the hexagonal…
We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…
We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…
We propose a geometric explanation for the observation that generic quadratic polynomials over split quaternions may have up to six different factorizations while generic polynomials over Hamiltonian quaternions only have two. Split…