Extends the symbolic method to infinite series and applies it to generalize Pólya's theorem on random walk visit probabilities to the weighted complete graph K_N.
The transcendence of $\mathrm{e}$ via formal power series
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We review Hilbert's classical analytical proof of the transcendence of the number $\mathrm{e}$. Then, we show how this result can be obtained algebraically by means of formal power series (FPS). We give two proofs of the transcendence of $\mathrm{e}$ based on FPS. The first of them is a specialization of the 1990 proof by Beukers, B\'ezivin and Robba of the Lindemann-Weierstrass theorem. The second proof is due to this author and is an adaptation of Hilbert's argument to FPS.
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Extending the symbolic method in enumerative combinatorics. I
Extends the symbolic method to infinite series and applies it to generalize Pólya's theorem on random walk visit probabilities to the weighted complete graph K_N.