Related papers: A streamlined proof of Goodwillie's n-excisive app…
We show how rational function approximations to the logarithm, such as $\log z \approx (z^2 - 1)/(z^2 + 6z + 1)$, can be turned into fast algorithms for approximating the determinant of a very large matrix. We empirically demonstrate that…
A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994). Realistic bounds for the error with…
Suppose that $\ff \in \reals^{n}$ is a vector of $n$ error-contaminated measurements of $n$ smooth values measured at distinct and strictly ascending abscissae. The following projective technique is proposed for obtaining a vector of smooth…
In this paper I consider the applications of several kinds of approximations of real functions to the problem of verified computation (reliable computing) of the range of implicitly defined real function $x_{n+1} = G(x_{1}, ..., x_{n}),$…
In this paper, we introduce a new type of $ pq $-calculus. The $ pq $-derivative and $ pq $-integration are investigated and various properties of these concepts are given. The fundamental theorem of $ pq $-calculus and formulas of $ pq…
A very useful fact in additive combinatorics is that analytic expressions that can be used to count the number of structures of various kinds in subsets of Abelian groups are robust under quasirandom perturbations, and moreover that…
A thorough analysis is made of the Fourier coefficients for vector-valued modular forms associated to three-dimensional irreducible representations of the modular group. In particular, the following statement is verified for all but a…
In this paper we consider some rational approximations to the fractional powers of self-adjoint positive operators, arising from the Gauss-Laguerre rules. We derive practical error estimates that can be used to select a priori the number of…
We show Goodwillie's calculus of functors and $n$-geometric $D^{-}$-stacks share similar features by starting to focus on the convergence of Taylor towers for homotopy functors and the fact that $\mathbb{R} F(A) \cong \text{holim}…
This paper deals with a proof theory for a theory of $\Pi_{N}$-reflecting ordinals using a system of ordinal diagrams. This is a sequel to the previous one(APAL 129)in which a theory for $\Pi_{3}$-reflection is analysed proof-theoretically.
In this article, we present a geometrical proof of sum of $\cos n\varphi$ where $n$ goes from $1$ up to $m$. Although there exist some summation forms and the proofs are simple, they use complex numbers. Our proof comes from a geometrical…
We prove three strong approximation theorems for the `supermarket' or `join the shortest queue' model -- a law of large numbers, a jump process approximation and a central limit theorem. The estimates are carried through rather explicitly.…
In this paper we give another proof of the Chudnovsky formula for calculating $\pi$ - a proof in detail with means of basic complex analysis. With the exception of the tenth chapter, the proof is self-contained, with proofs provided for all…
A new simple proof of Stirling's formula via the partial fraction expansion for the tangent function is presented.
In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…
We describe a systematic expansion for full QCD. The leading term in the expansion gives the valence approximation. The expansion reproduces full QCD if an infinite number of higher terms are included.
We introduce a proximal subdifferential and develop a calculus for nonsmooth functions defined on any Riemannian manifold $M$. We give several applications of this theory, concerning: 1) differentiability and geometrical properties of the…
We examine how closely a multiplicative function resembles an additive function. Given a multiplicative function $g$ and an additive function $f$, we examine the size of the quantity $E(f,g;x)=\# \{n\leq x:f(n)=g(n)\}$. We establish a lower…
A detailed NNLO QCD analysis of new CCFR data on the $xF_3$ structure function including the target mass, higher twist and nuclear corrections was performed and parametrizations of the perturbative and power terms of the structure function…
We describe an explicit algorithm to factorize an even antisymmetric N^2 matrix into triangular and trivial factors. This allows for a straight forward computation of Pfaffians (including their signs) at the cost of N^3/3 flops.