𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An effective algorithm for the cohomology ring of symplectic reductions

✍ Scribed by R.F. Goldin

Book ID
105768982
Publisher
Springer
Year
2002
Tongue
English
Weight
216 KB
Volume
12
Category
Article
ISSN
1016-443X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for the divisors of monic p
An algorithm for the divisors of monic polynomials over a commutative ring
✍ Ihsen Yengui πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 147 KB

Gilmer and Heinzer proved that given a reduced ring R, a polynomial f divides a monic polynomial in R[X] if and only if there exists a direct sum decomposition of R = R0 βŠ• . . . βŠ• Rm (m ≀ deg f ), associated to a fundamental system of idempotents e0, . . . , em, such that the component of f in each