Related papers: Delone sets associated with badly approximable tri…

We apply Diophantine analysis to classify edge-to-edge tilings of the sphere by congruent almost equilateral quadrilaterals (i.e., edge combination a3b). Parallel to a complete classification by Cheung, Luk and Yan, the method implemented…

This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…

Linearizing two partial orders to maximize the number of adjacencies and minimize the number of breakpoints is APX-hard. This holds even if one of the two partial orders is already a linear order and the other is an interval order, or if…

Exponential-time approximation has recently gained attention as a practical way to deal with the bitter NP-hardness of well-known optimization problems. We study for the first time the $(1 + \varepsilon)$-approximate min-sum subset…

In the last few years, the notion of optimal polynomial approximant has appeared in the mathematics literature in connection with Hilbert spaces of analytic functions of one or more variables. In the 70s, researchers in engineering and…

We investigate an analytical treatment of bifurcations of families of resonant `thin' tubes in axisymmetric galactic potentials. We verify that the most relevant bifurcations are due to the (1:1) resonance producing the `inclined' orbits…

We present a new insight into the systematic generation of minimal solvers in computer vision, which leads to smaller and faster solvers. Many minimal problem formulations are coupled sets of linear and polynomial equations where image…

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

Spatially resolving two incoherent point sources whose separation is well below the diffraction limit dictated by classical optics has recently been shown possible using techniques that decompose the incoming radiation into orthogonal…

In this paper, we study the polynomial optimization problem of multi-forms over the intersection of the multi-spheres and the nonnegative orthants. This class of problems is NP-hard in general, and includes the problem of finding the best…

One frequently needs to interpolate or approximate gradients on simplicial meshes. Unfortunately, there are very few explicit mathematical results governing the interpolation or approximation of vector-valued functions on Delaunay meshes in…

We consider a framework for the construction of iterative schemes for operator equations that combine low-rank approximation in tensor formats and adaptive approximation in a basis. Under fairly general assumptions, we obtain a rigorous…

We present a construction of non-rectifiable, repetitive Delone sets in every Euclidean space $\mathbb{R}^d$ with $d \geq 2$. We further obtain a close to optimal repetitivity function for such sets. The proof is based on the process of…

Consider an arrangement of $k$ lines intersecting the unit square. There is some minimum scaling factor so that any placement of a rectangle with aspect ratio $1 \times p$ with $p\geq 1$ must non-transversely intersect some portion of the…

Let $v$ be an odd real polynomial (i.e. a polynomial of the form $\sum_{j=1}^\ell a_jx^{2j-1}$). We utilize sets of iterated differences to establish new results about sets of the form $\mathcal…

We consider algebraic Delone sets $\varLambda$ in the Euclidean plane and address the problem of distinguishing convex subsets of $\varLambda$ by X-rays in prescribed $\varLambda$-directions, i.e., directions parallel to nonzero interpoint…

We develop the theory of Diophantine approximation for systems of simultaneously small linear forms, which coefficients are drawn from any given analytic non-degenerate manifolds. This setup originates from a problem of Sprind\v{z}uk from…

The Bj\"orling problem amounts to the construction of a minimal surface from a real-analytic curve with a given real-analytic normal vector field. We approximate that solution locally by discrete minimal surfaces as special discrete…

Let $\theta\in\mathbb{R}^d$. We associate three objects to each approximation $(p,q)\in \mathbb{Z}^d\times \mathbb{N}$ of $\theta$: the projection of the lattice $\mathbb{Z}^{d+1}$ to the hyperplane of the first $d$ coordinates along the…

This note summarizes the steps to computing the best-fitting affine reflection that aligns two sets of corresponding points.