๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some wonderful rings in algebraic geometry

โœ Scribed by George R Kempf


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
149 KB
Volume
134
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Four Counterexamples in Combinatorial Al
โœ Bernd Sturmfels ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 104 KB

We present counterexamples to four conjectures which appeared in the literature in commutative algebra and algebraic geometry. The four questions to be studied are largely unrelated, and yet our answers are connected by a common thread: they are combinatorial in nature, involving monomial ideals and

Applications of Some Properties of the C
โœ Marc Chardin ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 308 KB

We here develop some new algorithms for computing several invariants attached to a projective scheme (dimension, Hilbert polynomial, unmixed part,... ) that are based on liaison theory and therefore connected to properties of the canonical module. The main features of these algorithms are their simp

Some external problems in geometry
โœ George Purdy ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 805 KB

The question of how uften the same dzstance can occur between k distinct points in n-dimensional Euclidean space E, ;~a: been exteasively studied by Paul Erdijs and others. Sir Alexander Oppenheim posed the somewhat simi:ar problem of investigating how many triangle:; with vertices chosen from ar$Io

Constructions in Finite Geometry Using C
โœ G.L. Ebert ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 271 KB

One way of using a computer algebra system to do research in finite geometry is to use the system to construct "small" order examples of various constructions, and then hope to recognize a pattern that can be generalized and eventually proven. Of course, initially one does not know if the "small" or