𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Quick Combinatorial Proof of Eisenstein Series Identities

✍ Scribed by N.P. Skoruppa

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
222 KB
Volume
43
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A quicker proof of fay's identity
A quicker proof of fay's identity
✍ Henry P. McKean πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 112 KB
A New Proof of Winquist's Identity
A New Proof of Winquist's Identity
✍ Soon-Yi Kang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 217 KB

Elementary proofs for (1.1) and (1.2) due to Ramanujan can be found in , but it was not until 1969 that the first simple proof of (1.3) of the same nature as those for (1.1) and (1.2) was given by Winquist . Winquist found and proved an identity that played an essential role in proving (1.3), as Eul

A Combinatorial Proof of the Effective N
A Combinatorial Proof of the Effective Nullstellensatz
✍ Thomas W. DubΓ© πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 481 KB

Let \(I\) be an ideal in the affine multi-variate polynomial ring \(\mathcal{A}=K\left[x_{1}, \ldots, x_{n}\right]\). Beginning with the work of Brownawell, there has been renewed interest in recent years in using the degrees of polynomials which generate \(I\) to bound the degree \(D\) such that:

Bialgebras of Recursive Sequences and Co
Bialgebras of Recursive Sequences and Combinatorial Identities
✍ Carl A. Futia; Eric F. MΓΌller; Earl J. Taft πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 194 KB

A recursive sequence is an infinite sequence of elements of some fixed ground field which satisfies a recursion relation of finite order. We shall investigate certain bialgebra structures on linear spaces of recursive sequences. By choosing appropriate bases for these bialgebras we show how an expli