Related papers: Finding simultaneous Diophantine approximations wi…
For large $N$, we consider the ordinary continued fraction of $x=p/q$ with $1\le p\le q\le N$, or, equivalently, Euclid's gcd algorithm for two integers $1\le p\le q\le N$, putting the uniform distribution on the set of $p$ and $q$s. We…
We estimate the lattice sums arising in the context of the integer point counting in polyhedra.
In this short paper we prove a quantitative version of the Khintchine-Groshev Theorem with congruence conditions. Our argument relies on a classical argument of Schmidt on counting generic lattice points, which in turn relies on a certain…
This work develops algorithms for non-parametric confidence regions for samples from a univariate distribution whose support is a discrete mesh bounded on the left. We generalize the theory of Learned-Miller to preorders over the sample…
We present a collection of algorithms which utilize dimensional reduction to perform mesh refinement and study possibly singular solutions of time-dependent partial differential equations. The algorithms are inspired by constructions used…
We prove $L_p$ estimates of solutions to a conormal derivative problem for divergence form complex-valued higher-order elliptic systems on a half space and on a Reifenberg flat domain. The leading coefficients are assumed to be merely…
This paper is concerned with the Dirichlet eigenvalue problem for Laplace operator in a bounded domain with periodic perforation in the case of small volume. We obtain the optimal quantitative error estimates independent of the spectral…
Lattice reduction is a combinatorial optimization problem aimed at finding the most orthogonal basis in a given lattice. The Lenstra-Lenstra-Lov\'asz (LLL) algorithm is the best algorithm in the literature for solving this problem. In light…
By analogy with the program of McKinnon-Roth, we define and study approximation constants for points of a projective variety X defined over K the function field of an irreducible and non-singular in codimension 1 projective variety defined…
We consider the homogeneous Dirichlet problem for the integral fractional Laplacian $(-\Delta)^s$. We prove optimal Sobolev regularity estimates in Lipschitz domains provided the solution is $C^s$ up to the boundary. We present the…
We introduce and study the \emph{Lattice Distortion Problem} (LDP). LDP asks how "similar" two lattices are. I.e., what is the minimal distortion of a linear bijection between the two lattices? LDP generalizes the Lattice Isomorphism…
A convergence result for a discontinuous Galerkin multiscale method for a second order elliptic problem is presented. We consider a heterogeneous and highly varying diffusion coefficient in $L^\infty(\Omega,\mathbb{R}^{d\times d}_{sym})$…
Given a parametric lattice with a basis given by polynomials in Z[t], we give an algorithm to construct an LLL-reduced basis whose elements are eventually quasi-polynomial in t: that is, they are given by formulas that are piecewise…
In this paper, we consider the problem of counting Diophantine inequalities with multiple natural constraints. We prove a very general result in this setting using dynamical techniques. More precisely, we consider the joint asymptotic…
DeepLLL algorithm (Schnorr, 1994) is a famous variant of LLL lattice basis reduction algorithm, and PotLLL algorithm (Fontein et al., 2014) and $S^2$LLL algorithm (Yasuda and Yamaguchi, 2019) are recent polynomial-time variants of DeepLLL…
We introduce incremental variational inference and apply it to latent Dirichlet allocation (LDA). Incremental variational inference is inspired by incremental EM and provides an alternative to stochastic variational inference. Incremental…
We address the problem of evaluating an $L$-function when only a small number of its Dirichlet coefficients are known. We use the approximate functional equation in a new way and find that is possible to evaluate the $L$-function more…
Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…
In this paper we give a new aggregation framework for linear Diophantine equations. In particular, we prove that an aggregated system of minimum size can be built in polynomial time. We also derive an analytic formula that gives the number…
Solving linear diophantine equations in two variables have applications in computer science and mathematics. In this paper, we revisit an algorithm for solving linear diophantine equations in two variables, which we refer as DEA-R…