Related papers: Approximation of points in the plane by generic la…
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…
Consider a point process in Euclidean space obtained by perturbing the integer lattice with independent and identically distributed random vectors. Under mild assumptions on the law of the perturbations, we construct a translation-invariant…
Accurate modeling of gravitational interactions is fundamental to the analysis, prediction, and control of space systems. While the Newtonian point-mass approximation suffices for many preliminary studies, real celestial bodies exhibit…
We study the problem of Diophantine approximation on lines in $\mathbb{R}^d$ under certain primality restrictions.
We describe an extremal property of the hexagonal lattice $\Lambda \subset \mathbb{R}^2$. Let $p$ denote the circumcenter of its fundamental triangle (a so-called deep hole) and let $A_r$ denote the set of lattice points that are at…
In this paper, we give a definition of Diophantine points of type $\gamma$ for $\gamma\geq0$ in a homogeneous space $G/\Gamma$, and compute the Hausdorff dimension of the subset of points which are not Diophantine of type $\gamma$ when $G$…
The model problem of a plane angle for a second-order elliptic system subject to Dirichlet, mixed, and Neumann boundary conditions is analyzed. For each boundary condition, the existence of solutions of the form $r^\lambda v$ is reduced to…
We discuss some easy statements dealing with linear inhomogeneous Diophantine approximation. Surprisingly, we did not find some of them in the literature.
Consider the vanishing locus of a real analytic function on $\mathbb{R}^n$ restricted to $[0,1]^n$. We bound the number of rational points of bounded height that approximate this set very well. Our result is formulated and proved in the…
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 present a new perspective on error analysis of Legendre approximations for differentiable functions. We start by introducing a sequence of Legendre-Gauss-Lobatto polynomials and prove their theoretical properties, such as…
Suppose we put an $\epsilon$-disk around each lattice point in the plane, and then we rotate this object around the origin for a set $\Theta$ of angles. When do we cover the whole plane, except for a neighborhood of the origin? This is the…
We investigate the number of integer solutions to a multiplicative Diophantine approximation problem and show that the associated counting function converges in distribution to a normal law. Our approach relies on the analysis of…
In this article, we consider the problem of approximating a finite set of data (usually huge in applications) by invariant subspaces generated through a small set of smooth functions. The invariance is either by translations under a…
We investigate similarity classes of arithmetic lattices in the plane. We introduce a natural height function on the set of such similarity classes, and give asymptotic estimates on the number of all arithmetic similarity classes,…
We provide a "soft" proof for non-trivial bounds on spherical, hyperbolic and unipotent Fourier coefficients of a fixed Maass form for a general co-finite lattice $\Gamma$ in $PGL(2,R)$. We use the amplification method based on the Airy…
We develop an analytical Hamiltonian formalism adapted to the study of the motion of two planets in co-orbital resonance. The Hamiltonian, averaged over one of the planetary mean longitude, is expanded in power series of eccentricities and…
Gallagher's theorem describes the multiplicative diophantine approximation rate of a typical vector. We establish a fully-inhomogeneous version of Gallagher's theorem, a diophantine fibre refinement, and a sharp and unexpected threshold for…
Using an elementary argument, we prove new fixed point theorems for classical elliptic complexes. We obtain new results for conformal relations and coisotropic intersections. We obtain theorems for the average intersections of families of…
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…