𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Structure of Cohomology of Projective Varieties

✍ Scribed by Edoardo Ballico


Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
346 KB
Volume
155
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The Cohomology of the Regular Semisimple
✍ G.I Lehrer πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 265 KB

We use the equivariant cohomology of hyperplane complements and their toral counterparts to give formulae for the Poincare polynomials of the varieties of Ε•egular semisimple elements of a reductive complex Lie group or Lie algebra. As a result, we obtain vanishing theorems for certain of the Betti n

The Cohomology Ring of Weight Varieties
✍ R.F. Goldin πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 251 KB

We use a theorem of S. Tolman and J. Weitsman (The cohomology rings of Abelian symplectic quotients, math. DGΓ‚9807173) to find explicit formul$ for the rational cohomology rings of the symplectic reduction of flag varieties in C n , or generic coadjoint orbits of SU(n), by (maximal) torus actions. W

On the X-rank with respect to linear pro
✍ Edoardo Ballico; Alessandra Bernardi πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 135 KB πŸ‘ 1 views

## Abstract In this paper we improve the known bound for the __X__‐rank __R~X~__(__P__) of an element \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$P\in {\mathbb {P}}^N$\end{document} in the case where \documentclass{article}\usepackage{amssymb}\begin{document}\pagest

The Projective Noether Maple Package: Co
✍ Marc Giusti; Klemens HΓ€gele; GrΓ©goire Lecerf; JoΓ«l Marchand; Bruno Salvy πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 359 KB

Recent theoretical advances in elimination theory use straight-line programs as a data structure to represent multivariate polynomials. We present here the Projective Noether Package which is a Maple implementation of one of these new algorithms, yielding as a byproduct a computation of the dimensio

Algorithmic Computation of de Rham Cohom
✍ Uli Walther πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 493 KB

Let X = C n . In this paper we present an algorithm that computes the de Rham cohomology groups H i dR (U, C) where U is the complement of an arbitrary Zariski-closed set Y in X. Our algorithm is a merger of the algorithm given in Oaku and Takayama (1999), who considered the case where Y is a hyper