相关论文: Corrigenda to "Interesting Series Involving the Ce…
Part A: A revised version of the guide in "Cardinal Arithmetic" ([Sh:g]), with corrections and expanded to include later works. Part B: Corrections to [Sh:g]. Part C: Contains some revised proof and improved theorems. Part D: Contains a…
Comment on ``Gibbs Sampling, Exponential Families, and Orthogonal Polynomials'' [arXiv:0808.3852]
We evaluate in closed form several alternating infinite series involving the binomial coefficients $C(4n,2n)$ and $C(4n+2,2n+1)$ in the denominator. One of our results generalizes an identity that was obtained experimentally by Sprugnoli in…
We derive inversion formulas involving orthogonal polynomials which can be used to find coefficients of differential equations satisfied by certain generalizations of the classical orthogonal polynomials. As an example we consider special…
In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain information about the matrix orthogonal polynomials and functions of second kind associated with a weight matrix. We deduce properties for the…
We provide elementary proofs of Lemmas 7.1 and 7.4 appearing in "The Cartan-Hadamard conjecture and the Little Prince", by B. Kloeckner and G. Kuperberg. The Lemmas play an important role in the derivation of novel isoperimetric…
In this paper we present the formal, computer-supported verification of a functional implementation of Buchberger's critical-pair/completion algorithm for computing Gr\"obner bases in reduction rings. We describe how the algorithm can be…
In this paper we present a special formula for transforming integrals to series. The resulting series involves binomial transforms with the Taylor coefficients of the integrand. Five applications are provided for evaluating challenging…
There were some errors in paper hep-th/9303018 in formulas 6.1, 6.6, 6.8, 6.11. These errors have been corrected in the present version of this paper. There are also some minor changes in the introduction.
This is an introductory document surveying several results in polynomial approximation, known as the Bramble-Hilbert lemma.
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues,…
Rejoinder of "Calibrated Bayes, for Statistics in General, and Missing Data in Particular" by R. Little [arXiv:1108.1917]
The two reference lists contain 54/22 references of papers and preprints concerned with the theory and/or various applications of Hilbert modules over Hilbert $*$-algebras and over (non-self-adjoint) operator algebras. They are far from…
Comment on ``Gibbs Sampling, Exponential Families and Orthogonal Polynomials'' [arXiv:0808.3852]
In the article titled "Branching-Coalescing Particle Systems" published in Probability Theory and Related Fields 131(3), pages 376-414, (2005), Theorem 7 as stated there is incorrect. Indeed, we show by counterexample that the equality that…
The Annals of Applied Probability 16 (2006) 984--1033 [URL: http://projecteuclid.org/euclid.aoap/1151592257]
We evaluate some types of infinite series with balancing and Lucas-balancing polynomials in closed form. These evaluations will lead to some new curious series for $\pi$ involving Fibonacci and Lucas numbers. Our findings complement those…
New version of my 1998 article. The method of proof of the main results follows the original, but there are many simplifications/streamlining of arguments, especially Lemma 3.6 (new Lemma 3.7). Fixed small error in proof of lower bound for…
After the publication of [Compos. Math. 156 (2020), no. 4, 822-861], Andrew Putman pointed out a mistake in our paper and helped us fix it. In this note, we will explain what this mistake is and how to fix it.
Given the first 20-100 coefficients of a typical generating function of the type that arises in many problems of statistical mechanics or enumerative combinatorics, we show that the method of differential approximants performs surprisingly…