Related papers: Intersective polynomials and Diophantine approxima…
Let $\zeta$ be a real transcendental number. We introduce a new method to find upper bounds for the classical exponent $\widehat{w}_{n}(\zeta)$ concerning uniform polynomial approximation. Our method is based on the parametric geometry of…
In this paper, we revisit the old problem of compact finite difference approximations of the homogeneous Dirichlet problem in dimension 1. We design a large and natural set of schemes of arbitrary high order, and we equip this set with an…
This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…
We consider a mono-dimensional two-velocities scheme used to approximate the solutions of a scalar hyperbolic conservative partial differential equation. We prove the convergence of the discrete solution toward the unique entropy solution…
A general lattice Boltzmann method for simulation of fluids with tailored transport coefficients is presented. It is based on the recently introduced quasi-equilibrium kinetic models, and a general lattice Boltzmann implementation is…
There are two main interrelated goals of this paper. Firstly we investigate the sums \[ S_N(\alpha,\gamma):=\sum_{n=1}^N\frac{1}{n\|n\alpha-\gamma\|}~~~\text{and}~~~ R_N(\alpha,\gamma):=\sum_{n=1}^N\frac{1}{\|n\alpha-\gamma\|}\,, \] where…
Building on work of Davenport and Schmidt, we mainly prove two results. The first one is a version of Gel'fond's transcendence criterion which provides a sufficient condition for a complex or $p$-adic number $\xi$ to be algebraic in terms…
In a series of recent papers, W. M. Schmidt and L. Summerer developed a new theory by which they recover all major generic inequalities relating exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and find new ones. Given a…
In this paper we prove an existence theorem concerning linear forms of a given Diophantine type and apply it to study the structure of the spectrum of lattice exponents.
We construct a class of multiple Legendre polynomials and prove that they satisfy an Ap\'ery-like recurrence. We give new upper bounds of the approximation measures of logarithms of rational numbers by algebraic numbers of bounded degree.…
We show that the asymptotic properties of the link-wise artificial compressibility method are not compatible with a correct approximation of fluid properties. We propose to adapt the previous method through a framework suggested by the…
We show that the parabola is of strong Khintchine type for convergence, which is the first result of its kind for curves. Moreover, Jarnik type theorems are established in both the simultaneous and the dual settings, without monotonicity on…
The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…
In this paper we developed an integrating factor matrix method to derive conditions for the existence of first integrals. We use this novel method to obtain first integrals, along with the conditions for their existence, for two and three…
We refine a result of the last two Authors of [8] on a Diophantine approximation problem with two primes and a $k$-th power of a prime which was only proved to hold for $1<k<4/3$. We improve the $k$-range to $1<k\le 3$ by combining Harman's…
In this paper we consider a multiparametric version of Wolfgang Schmidt and Leonard Summerer's parametric geometry of numbers. We apply this approach in two settings: the first one concerns weighted Diophantine approximation, the second one…
In 1982, A. K. Lenstra, H. W. Lenstra, and L. Lov\'asz introduced the first polynomial-time method to factor a nonzero polynomial $f \in \mathbb{Q}[x]$ into irreducible factors. This algorithm, now commonly referred to as the LLL Algorithm,…
Some occurrences of $n$ can be replaced by $n-1$ in a special case of the Shapley-Folkman lemma.
In this Letter we show that an arbitrarily good approximation to the propagator e^{itH} for a 1D lattice of n quantum spins with hamiltonian H may be obtained with polynomial computational resources in n and the error \epsilon, and…
In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.