Related papers: CM Method and Expansion of Numbers
In recent decades, a number of profound theorems concerning approximation of hard counting problems have appeared. These include estimation of the permanent, estimating the volume of a convex polyhedron, and counting (approximately) the…
We extend the generalized D-dimensional unitarity method for numerical evaluation of one-loop amplitudes by incorporating massive particles. The issues related to extending the spinor algebra to higher dimensions, treatment of external…
We present a recursive procedure, which is based on the small time expansion of the propagator, in order to generate a semi-classical expansion of the \textit{quantum action} for a quantum mechanical potential in arbitrary dimensions. In…
In this work we discuss the possibility to reduce the computational complexity of modal methods, i.e. methods based on eigenmodes expansion, from the third power to the second power of the number of eigenmodes. The proposed approach is…
We study the probabilistic behaviour of the continued fraction expansion of a quadratic irrational number, when weighted by some "additive" cost. We prove asymptotic Gaussian limit laws, with an optimal speed of convergence. We deal with…
Let $q$ be a power of a prime $p$, let $k$ be a nontrivial divisor of $q-1$ and write $e=(q-1)/k$. We study upper bounds for cyclotomic numbers $(a,b)$ of order $e$ over the finite field $\mathbb{F}_q$. A general result of our study is that…
We give explicit and asymptotic lower bounds for the quantity $|e^{s/t}-M/N|$ by studying a generalized continued fraction expansion of $e^{s/t}$. In cases $|s|\geq 3$ we improve existing results by extracting a large common factor from the…
Throughout history, recreational mathematics has always played a prominent role in advancing research. Following in this tradition, in this paper we extend some recent work with crazy sequential representations of numbers- equations made of…
A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…
Given a sequence of integers $a_j, j\ge 1,$ a multiset is a combinatorial object composed of unordered components, such that there are exactly $a_j$ one-component multisets of size $j.$ When $a_j\asymp j^{r-1} y^j$ for some $r>0$, $y\geq…
We propose an iterative estimating equations procedure for analysis of longitudinal data. We show that, under very mild conditions, the probability that the procedure converges at an exponential rate tends to one as the sample size…
We study totally positive, additively indecomposable integers in a real quadratic field $\mathbb Q(\sqrt D)$. We estimate the size of the norm of an indecomposable integer by expressing it as a power series in $u_i^{-1}$, where $\sqrt D$…
Recently, a novel method based on coding partitions [1]-[4] has been used to derive power series expansions to previously intractable problems. In this method the coefficients at $k$ are determined by summing the contributions made by each…
We present a calculation of the masses of the isovector mesons ( vector, scalar and pseudoscalar including the established recurrences) using a new method of finite energy QCD sum rules. The method is based on the idea of choosing a…
A specific family of point processes are introduced that allow to select samples for the purpose of estimating the mean or the integral of a function of a real variable. These processes, called quasi-systematic processes, depend on a tuning…
We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states. Diagonalising a Hamiltonian in a given…
Usually, the study of city population distribution has been reduced to power laws. In such analysis, a common practice is to consider cities with more than one hundred thousand inhabitants. Here, we argue that the distribution of cities for…
The generating series of a radix-rational sequence is a rational formal power series from formal language theory viewed through a fixed radix numeration system. For each radix-rational sequence with complex values we provide an asymptotic…
We introduce a general scheme for sequential one-way quantum computation where static systems with long-living quantum coherence (memories) interact with moving systems that may possess very short coherence times. Both the generation of the…
We put forward a new method of constructing the complete ordered field of real numbers from the ordered field of rational numbers. Our method is a generalization of that of A. Knopfmacher and J. Knopfmacher. Our result implies that there…