Related papers: CM Method and Expansion of Numbers
In order to prove irrationality of \sqrt{2} by using only decimal expansions (and not fractions), we develop in detail a model of real numbers based on infinite decimals and arithmetic operations with them.
Let $q\in(1,2)$; it is known that each $x\in[0,1/(q-1)]$ has an expansion of the form $x=\sum_{n=1}^\infty a_nq^{-n}$ with $a_n\in\{0,1\}$. It was shown in \cite{EJK} that if $q<(\sqrt5+1)/2$, then each $x\in(0,1/(q-1))$ has a continuum of…
A general quantum many-body theory in configuration space is developed by extending the traditional coupled cluter method (CCM) to a variational formalism. Two independent sets of distribution functions are introduced to evaluate the…
In longitudinal data analysis, observation points of repeated measurements over time often vary among subjects except in well-designed experimental studies. Additionally, measurements for each subject are typically obtained at only a few…
We outline some simple prescriptions to define a distribution on the set $\mathbb{Q}_0$ of all the rational numbers in $[0,1]$, and we then explore both a few properties of these distributions, and the possibility of making these rational…
The Factorial Basis method, initially designed for quasi-triangular, shift-compatible factorial bases, provides solutions to linear recurrence equations in the form of definite-sums. This paper extends the Factorial Basis method to its…
Monte Carlo (MC) and Quasi-Monte Carlo (QMC) methods are classical approaches for the numerical integration of functions $f$ over $[0,1]^d$. While QMC methods can achieve faster convergence rates than MC in moderate dimensions, their…
Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…
Mayer cluster expansion is an important tool in statistical physics to evaluate grand canonical partition functions. It has recently been applied to the Nekrasov instanton partition function of $\mathcal{N}=2$ 4d gauge theories. The…
While the numerical methods which utilizes partitions of equal-size, including the box-counting method, remain the most popular choice for computing the generalized dimension of multifractal sets, two mass- oriented methods are investigated…
The fast computation of large kernel sums is a challenging task, which arises as a subproblem in any kernel method. We approach the problem by slicing, which relies on random projections to one-dimensional subspaces and fast Fourier…
Using a general $q$-series expansion, we derive some nontrivial $q$-formulas involving many infinite products. A multitude of Hecke--type series identities are derived. Some general formulas for sums of any number of squares are given. A…
We introduce techniques to analyze unitary operations in terms of quadratic form expansions, a form similar to a sum over paths in the computational basis when the phase contributed by each path is described by a quadratic form over…
We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.
In a base phi representation a natural number is written as a sum of powers of the golden mean $\varphi$. There are many ways to do this. How many? Even if the number of powers of $\varphi$ is finite, then any number has infinitely many…
I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a…
We are interested in the asymptotic behavior of orthogonal polynomials of the generalized Jacobi type as their degree $n$ goes to $\infty$. These are defined on the interval $[-1,1]$ with weight function…
Up-down permutations are counted by tangent resp. secant numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all…
Quasi-Monte Carlo (qMC) methods are a powerful alternative to classical Monte-Carlo (MC) integration. Under certain conditions, they can approximate the desired integral at a faster rate than the usual Central Limit Theorem, resulting in…
Generalized Polynomial Chaos (gPC) expansions are well established for forward uncertainty propagation in many application areas. Although the associated computational effort may be reduced in comparison to Monte Carlo techniques, for…