𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Projective Noether Maple Package: Computing the Dimension of a Projective Variety

✍ Scribed by Marc Giusti; Klemens Hägele; Grégoire Lecerf; Joël Marchand; Bruno Salvy

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
359 KB
Volume
30
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

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 dimension of a projective variety. Comparative results on benchmarks for time and space of several families of multivariate polynomial equation systems are given and we point out both weaknesses and advantages of different approaches.

📜 SIMILAR VOLUMES

Connections between the geometry of a pr
Connections between the geometry of a projective variety and of an ample section
✍ Marco Andreatta; Carla Novelli; Gianluca Occhetta 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB 👁 2 views

## Abstract Let __X__ be a smooth complex projective variety and let __Z__ =(__s__ =0) be a smooth submanifold which is the zero locus of a section of an ample vector bundle __E__ of rank __r__ with dim __Z__ =dim __X__ –__r__. We show with some examples that in general the Kleiman–Mori cones NE(_

Computation of the Dual of a Plane Proje
Computation of the Dual of a Plane Projective Curve
✍ Driss Bouziane; Mhammed El Kahoui 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 258 KB

In this paper we describe an algorithm for computing the dual of a projective plane curve. The algorithm requires no extension of the field of coefficients of the curve and runs in polynomial time.

10 Points in Dimension 4 not Projectivel
10 Points in Dimension 4 not Projectively Equivalent to the Vertices of a Convex Polytope
✍ David Forge; Michel Las Vergnas; Peter Schuchert 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 61 KB

Using oriented matroids, and with the help of a computer, we have found a set of 10 points in R 4 not projectively equivalent to the vertices of a convex polytope. This result confirms a conjecture of Larman [6] in dimension 4.

SFA, a Package on Symmetric Functions Co
SFA, a Package on Symmetric Functions Considered as Operators over the Ring of Polynomials for the Computer Algebra System Maple
✍ Vincent Prosper 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 302 KB

Symmetric functions can be considered as operators acting on the ring of polynomials with coefficients in R. We present the package SFA, an implementation of this action for the computer algebra system Maple. As an example, we show how to recover different classical expressions of Lagrange inversion

Topographic Mapping in the Retinotectal
Topographic Mapping in the Retinotectal Projection by Means of Complementary Ligand and Receptor Gradients: a Computer Simulation Study
✍ Hisao Honda 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 339 KB

Based on recent experimental studies of complementary gradients of receptor density (R) on the retinal surface and ligand density (L) on the tectal surface, and mapping of the high point on the receptor gradient to the low point on the ligand and vice versa, the servomechanism model was constructed