Related papers: Intersective polynomials and Diophantine approxima…
In this paper we adapt parametric geometry of numbers developed by Wolfgang Schmidt and Leonard Summerer to a multiplicative setting, and derive a chain of inequalities for the corresponding exponents which splits the transference…
We propose and investigate two new methods to approximate $f({\bf A}){\bf b}$ for large, sparse, Hermitian matrices ${\bf A}$. The main idea behind both methods is to first estimate the spectral density of ${\bf A}$, and then find…
We obtain variants of the classical Minkowski Theorem on inhomogeneous approximation where we require moreover that the solutions $p, q$ be coprime integers. We link the subject with density exponents of lattice orbits in the real plane.
We prove that the Littlewood conjecture is satisfied for a restricted class of pairs $(\alpha,\beta)$ of badly approximable numbers. We use the localization of the roots of a cubic equation with coefficients depending on the diophantine…
We propose a new second-order accurate lattice Boltzmann formulation for linear elastodynamics that is stable for arbitrary combinations of material parameters under a CFL-like condition. The construction of the numerical scheme uses an…
We introduce two classes of discrete polynomials and construct discrete equations admitting a Lax representation in terms of these polynomials. Also we give an approach which allows to construct lattice integrable hierarchies in its…
We prove central limit theorems for Diophantine approximations with congruence conditions and for inhomogeneous Diophantine approximations following the approach of Bj\"{o}rklund and Gorodnik. The main tools are the cumulant method and…
We provide a multidimensional extension of previous results on the existence of polynomial progressions in dense subsets of the primes. Let $A$ be a subset of the prime lattice - the d-fold direct product of the primes - of positive…
We prove a theorem about approximation to an irrational number by rational numbers whose denominator n is free of prime factors bigger than a power of log n. We strengthen the result in version 1 by using an exponential sum over smooth…
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…
We demonstrate how connections between graph theory and Diophantine approximation can be used in conjunction to give simple and accessible proofs of seemingly difficult results in both subjects.
In this article, I provide significant mathematical evidence in support of the existence of short-time approximations of any polynomial order for the computation of density matrices of physical systems described by arbitrarily smooth and…
We survey classical and recent results on exponents of Diophantine approximation. We give only a few proofs and highlight several open problems.
We investigate the integer solutions of Diophantine equations related to Lehmer's totient conjecture. We give an algorithm that computes all nontrivial spoof Lehmer factorizations with a fixed number of factors, and enumerate all nontrivial…
We prove a Khintchine result for convergence of a multiplicative Diophantine set with restricted denominators on an arbitrary non-degenerate line. Specifically, given sequences of real numbers $\{a_n\}_{n\in\mathbb{N}},\,…
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…
A non-perturbative algebraic theory of lattice Boltzmann method is developed based on a symmetry of a product. It involves three steps: (i) Derivation of admissible lattices in one spatial dimension through a matching condition which…
Let $\F$ be a family of $r$ integral forms of degree $k\geq 2$ and $\LL=(l_1,\ldots,l_m)$ be a family of pairwise linearly independent linear forms in $n$ variables $\x=(x_1,...,x_n)$. We study the number of solutions $\x\in[1,N]^n$ to the…
This paper analyzes a method to approximate the first passage time probability density function which turns to be particularly useful if only sample data are available. The method relies on a Laguerre-Gamma polynomial approximation and…
A new class of non-monotone finite difference (FD) approximation methods for approximating solutions to non-degenerate stationary Hamilton-Jacobi problems with Dirichlet boundary conditions is proposed and analyzed. The new FD methods add a…