𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithmic approach to Ramanujan’s congruences

✍ Scribed by Silviu Radu

Publisher
Springer US
Year
2009
Tongue
English
Weight
755 KB
Volume
20
Category
Article
ISSN
1382-4090

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithmic approach to Schmüdgen's P
An algorithmic approach to Schmüdgen's Positivstellensatz
✍ Markus Schweighofer 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 117 KB

We present a new proof of Schm udgen's Positivstellensatz concerning the representation of polynomials f ∈ R[X1; : : : ; X d ] that are strictly positive on a compact basic closed semialgebraic subset S of R d . Like the two other existing proofs due to Schm udgen and W ormann, our proof also applie

An algorithmic approach to simultaneous
An algorithmic approach to simultaneous triangularization
✍ C. Dubi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 120 KB

We present and prove the validity of an algorithm constructing a simultaneous triangularization of a set on N matrices in C n×n . To do so, we first prove that if a set of matrices has a common block decomposition, then the set of matrices has a simultaneous triangularization if and only if the bloc

An algorithmic approach to combining bel
An algorithmic approach to combining belief functions
✍ Bruce E. Tonn 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 913 KB

Methods of combination are used to synthesize pieces of evidence of equal standing that represent different aspects of a specific system about which a diagnosis is to be made. Combination is distinct from consensus, when complete diagnoses rendered by different knowledge sources require synthesis, a