1993 Joint Mathematics Meetings, Program by Special Session
Joint Mathematics Meetings Program by Special Session
Current as of Tuesday, April 12, 2005 15:09:01
1993 Joint Mathematics Meetings
San Antonio, TX, January 13-16, 1993
W Wistar Comfort, AMS email@example.com
Kenneth A Ross, MAA firstname.lastname@example.org
AMS Special Session on Combinatorial Methods in Computational Algebraic Geometry
Wednesday January 13, 1993, 8:00 a.m.-10:50 a.m.
AMS Special Session on Combinatorial Methods in Computational Algebraic Geometry, I
Maximal minors of a generic matrix form a universal Grobner basis.
Andrei Zelevinsky*, Northeastern University
Grobner bases for algebras related to minors.
Rosa Huang, Virginia Polytechnic Institute and State University
Edward L. Green*, Virginia Polytechnic Institute and State University
Graded modules of group representations.
S. Onn*, Rutgers University, Piscataway
Computation of polynomial invariants for finite groups.
L. C. Grove*, University of Arizona
J. M. McShane, Northern Arizona University
Young straightening rule and the flag variety.
Helene Barcelo*, Arizona State University
Sums of powers of complex linear forms.
Bruce Reznick*, University of Illinois, Urbana-Champaign
Wednesday January 13, 1993, 2:15 p.m.-5:35 p.m.
AMS Special Session on Combinatorial Methods in Computational Algebraic Geometry, II
Free and supersolvable arrangements between A_n-1 and B_n.
Paul H. Edelman, University of Minnesota, Minneapolis
Victor Reiner*, University of Minnesota, Minneapolis
Computing with exponential sums over finite fields.
Despina Polemis*, State University of New York Agricultural and Technical College, Farmingdale
Representations of bond matroids and Picard groups of graph curves.
Rick Miranda*, Colorado State University
Maximum Betti numbers and a generalization of Macaulay's theorem.
Heather Hulett*, University of Illinois, Urbana-Champaign
Frobenius Borel ideals.
Keith Pardue*, Brandeis University
On the component structure of the Hilbert scheme.
Alyson Reeves*, Brandeis University
Hook differences of a partition, and families of graded ideals in k[x,y].
A. Iarrobino*, Northeastern University
Thursday January 14, 1993, 8:00 a.m.-10:50 a.m.
AMS Special Session on Combinatorial Methods in Computational Algebraic Geometry, III
The sparse nullstellensatz.
Paul Pedersen*, Cornell University
Algorithms for the Quillen-Suslin theorem for monoid rings.
Cynthia Woodburn*, New Mexico State University, Las Cruces
Barycentric coordinates for convex polytopes.
Joe Warren*, Rice University
A convex geometric approach to counting the roots of a polynomial system.
J. Maurice Rojas*, University of California, Berkeley
An efficient algorithm for computing the sparse polynomial resultant.
Ioannis Z. Emiris*, University of California, Berkeley
Homogeneous coordinates for toric varieties.
David A. Cox*, Amherst College