Next: Khalid El Yassini - Up: Graduate Student Seminar / Previous: Michael Soltys - Boolean
Adam van Tuyl - Computing the spreading and covering numbers
| ADAM VAN TUYL, Queens |
| Computing the spreading and covering numbers |
Let
![$S=k[x_1,\ldots,x_n]$](img86.gif){kind=small}
, d a positive integer, and suppose that
where
is the
set of all monomials of degree d. Let
be a subset
of monomials and define
and
. The numbers
s(n,d) and c(n,d) are called the spreading numbers and
covering numbers, respectively. These numbers are of interest because
of their connection to the Ideal Generation Conjecture. We describe a
new approach to calculate these numbers that uses simplicial complexes.
This is joint work with Tai Ha of Queen's University and Enrico Carlini
of the University of Genova.
