David A. Cox
Amherst College
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by David A. Cox.
American Mathematical Monthly | 1997
David A. Cox; John Little; Donal O’Shea
(here, > is the Maple prompt). Once the Groebner package is loaded, you can perform the division algorithm, compute Groebner bases, and carry out a variety of other commands described below. In Maple, a monomial ordering is called a monomial order. The monomial orderings lex, grlex, and grevlex from Chapter 2 are easy to use in Maple. Lex order is called plex (for “pure lexicographic”), grlex order is called grlex, and grevlex order is called tdeg (for “total degree”). Be careful not to confuse tdeg with grlex. Since a monomial order depends also on how the variables are ordered, Maple needs to know both the monomial order you want (plex, grlex or tdeg) and a list of variables. For example, to tell Maple to use lex order with variables x > y > z, you would need to input plex(x,y,z). The Groebner package also knows some elimination orders, as defined in Exercise 5 of Chapter 3, §1. To eliminate the first k variables from x1, . . . , xn, one can use the monomial order lexdeg([x 1,. . .,x k],[x {k+1},. . . ,x n]) (remember that Maple encloses a list inside brackets [. . .]). This order is the elimination order of Bayer and Stillman described in Exercise 6 of Chapter 3, §1. The Maple documentation for the Groebner package also describes how to use certain weighted orders, and we will explain below how matrix orders give us many more monomial orderings. The most commonly used commands in the Groebner package are NormalForm, for doing the division algorithm, and Basis, for computing a Groebner basis. NormalForm has the following syntax:
Duke Mathematical Journal | 1994
Victor V. Batyrev; David A. Cox
This paper generalizes classical results of Griffiths, Dolgachev and Steenbrink on the cohomology of hypersurfaces in weighted projective spaces. Given a
Computer Aided Geometric Design | 1998
David A. Cox; Thomas W. Sederberg; Falai Chen
d
Archive | 2004
David A. Cox
-dimensional projective simplicial toric variety
Journal of Symbolic Computation | 2000
David A. Cox; Ron Goldman; Ming Zhang
P
Journal of Symbolic Computation | 2005
Falai Chen; David A. Cox; Yang Liu
and an ample hypersurface
Compositio Mathematica | 1997
Eduardo Cattani; David A. Cox; Alicia Dickenstein
X
Archive | 2000
David A. Cox
defined by an polynomial
American Mathematical Monthly | 1994
David A. Cox
f
Theoretical Computer Science | 2008
David A. Cox
in the homogeneous coordinate ring