Related papers: Barycentric Pad\'e approximation
In this paper, I present three closed-form approximations of the two-sample Pearson Bayes factor, a recently developed index of evidential value for data in two-group designs. The techniques rely on some classical asymptotic results about…
Two-body matrix elements of arbitrary local interactions are written as the sum of separable terms in a way that is well suited for the exchange and pairing channels present in mean-field calculations. The expansion relies on the…
We consider the question of approximating any real number $\alpha$ by sums of $n$ rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2} + ... + \frac{a_n}{q_n}$ with denominators $1 \leq q_1, q_2, ..., q_n \leq N$. This leads to an inquiry on…
It is shown that there is an absolute constant $C$ such that any rational $\frac bq\in]0, 1[, (b, q)=1$, admits a representation as a finite sum $\frac bq=\sum_\alpha\frac {b_\alpha}{q_\alpha}$ where $\sum_\alpha\sum_ia_i(\frac…
Let $q$ be a perfect power of a prime number $p$ and $E({\mathbb F}_q)$ be an elliptic curve over ${\mathbb F}_q$ given by the equation $y^2=x^3+Ax+B$. For a positive integer $n$ we denote by $ \# E({\mathbb F}_{q^n})$ the number of…
A representation of finite-dimensional probabilistic models in terms of formally real Jordan algebras is obtained, in a strikingly easy way, from simple assumptions. This provides a framework in which real, complex and quaternionic quantum…
A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-shift operators. We present a theorem that describes the…
For regular continued fraction, if a real number $x$ and its rational approximation $p/q$ satisfying $|x-p/q|<1/q^2$, then, after deleting the last integer of the partial quotients of $p/q$, the sequence of the remaining partial quotients…
Power series are introduced that are simultaneously convergent for all real and p-adic numbers. Our expansions are in some aspects similar to those of exponential, trigonometric, and hyperbolic functions. Starting from these series and…
Computing the probability of a formula given the probabilities or weights associated with other formulas is a natural extension of logical inference to the probabilistic setting. Surprisingly, this problem has received little attention in…
We show that on most of the hyperbolic simply connected domains the weighted bounded rational approximation in a natural sup norm is possible only for a very sparse set of holomorphic functions (in contrast to integral approximation). The…
We describe a way to approximate the matrix elements of a real power $\alpha$ of a positive (for $\alpha \ge 0$) or non-negative (for $\alpha \in \mathbb{R}$), infinite, bounded, sparse and Hermitian matrix $W$. The approximation uses only…
Lattice QCD simulations offer the possibility of determining the potential between three static quarks from first principles. We review the status of such simulations, and the relative standing of the two theoretical proposals for the…
We relate a previous result of ours on families of Diophantine equations having only trivial solutions with a result on the approximation of an algebraic number by products of rational numbers and units. We compare this approximation with a…
We discuss the validity of replacing the complicated three-body confinement operator of the Y string junction type by three kinds of approximation which are numerically much simpler to handle: a one-body operator with the junction point at…
We show that a simple and straightforward rational approximation to the Thomas-Fermi equation provides the slope at origin with unprecedented accuracy and that relatively small Pad\'e approximants are far more accurate than more elaborate…
We compute the constant of approximation for an arbitrary rational point on an arbitrary smooth cubic hypersurface $X$ over a number field $k$, provided that there is a $k$-rational line somewhere on $X$. In the process, we verify the Coba…
In coding theory, constructing codes with good parameters is one of the most important and fundamental problems. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes equal to prime powers.…
Field experiments are often difficult and expensive to make. To bypass these issues, industrial companies have developed computational codes. These codes intend to be representative of the physical system, but come with a certain amount of…
We propose higher-order generalizations of Jacobsthal's $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $\binom{ip}{p}$ ($i=1,2,\dots$) that are…