Related papers: Finding simultaneous Diophantine approximations wi…
In 1982, Lagarias showed that solving the approximate Shortest Vector Problem also solves the problem of finding good simultaneous Diophantine approximations. Here we provide a deterministic, dimension-preserving reduction in the reverse…
Recently in joint work with E. Sert, we proved sharp boundedness results on discrete fractional integral operators along binary quadratic forms. Present work vastly enhances the scope of those results by extending boundedness to bivariate…
We give an algorithm to compute a one-dimensional shape-constrained function that best fits given data in weighted-$L_{\infty}$ norm. We give a single algorithm that works for a variety of commonly studied shape constraints including…
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
In a previous paper, we studied certain sequences of simultaneous rational approximations in ${\bf R}^2$ which present some analogy with the continued fractions. We got results around the Littlewood conjecture by using such approximations.…
Longest common subsequence ($\mathsf{LCS}$) is a classic and central problem in combinatorial optimization. While $\mathsf{LCS}$ admits a quadratic time solution, recent evidence suggests that solving the problem may be impossible in truly…
In this paper we consider a reduced order method for the approximation of the eigensolutions of the Laplace problem with Dirichlet boundary condition. We use a time continuation technique that consists in the introduction of a fictitious…
We study the problem of Diophantine approximation on lines in $\mathbb{R}^d$ under certain primality restrictions.
We consider continuous linear programs over a continuous finite time horizon $T$, with a constant coefficient matrix, linear right hand side functions and linear cost coefficient functions, where we search for optimal solutions in the space…
We describe the first strongly subquadratic time algorithm with subexponential approximation ratio for approximately computing the Fr\'echet distance between two polygonal chains. Specifically, let $P$ and $Q$ be two polygonal chains with…
In this paper, we extend the theory of simultaneous Diophantine approximation to infinite dimensions. Moreover, we discuss Dirichlet-type theorems in a very general framework and define what it means for such a theorem to be optimal. We…
We prove analogues of some classical results from Diophantine approximation and metric number theory (namely Dirichlet's theorem and the Duffin--Schaeffer theorem) in the setting of diagonal Diophantine approximation, i.e. approximating…
We study finite element approximations of the nonhomogeneous Dirichlet problem for the fractional Laplacian. Our approach is based on weak imposition of the Dirichlet condition and incorporating a nonlocal analogous of the normal derivative…
We generalize Dirichlet's diophantine approximation theorem to approximating any real number $\alpha$ by a sum of two rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2}$ with denominators $1 \leq q_1, q_2 \leq N$. This turns out to be…
Let $E\subset [0,1]$ be a set that supports a probability measure $\mu$ with the property that $|\widehat{\mu}(t)|\ll (\log |t|)^{-A}$ for some constant $A>2.$ Let $\mathcal{A}=(q_n)_{n\in \N}$ be a positive, real-valued, lacunary sequence.…
We give upper and lower bounds for Diophantine exponents measuring how well a point in the plane can be approximated by points in the orbit of a lattice $\Gamma<\mathrm{SL}_2(\mathbb{R})$ acting linearly on $\mathbb{R}^2$. Our method gives…
We consider the fractional elliptic problem with Dirichlet boundary conditions on a bounded and convex domain $D$ of $\mathbb{R}^d$, with $d \geq 2$. In this paper, we perform a stochastic gradient descent algorithm that approximates the…
This brief survey deals with multi-dimensional Diophantine approximations in sense of linear form and with simultaneous Diophantine approximations. We discuss the phenomenon of degenerate dimension of linear subspaces generated by the best…
Lattice reduction-aided decoding features reduced decoding complexity and near-optimum performance in multi-input multi-output communications. In this paper, a quantitative analysis of lattice reduction-aided decoding is presented. To this…
As a typical application, the Lenstra-Lenstra-Lovasz lattice basis reduction algorithm (LLL) is used to compute a reduced basis of the orthogonal lattice for a given integer matrix, via reducing a special kind of lattice bases. With such…