| |
|
Description: |
In 2011, Renteria, Simis and Villarreal introduced a new class of binomial ideals associated to graphs. One associates to a simple graph, G, the vanishing ideal of a subset of a projective space over a finite field, parameterized by the edges of the graph. Although originally these ideals were defined to study linear codes, they are interesting in themselves as they provide a new link between commutative algebra and combinatorics. The focus of my talk will be on study of the Castelnuovo-Mumford regularity of the ideal and its relation with the combinatorial invariants of G. We will report on recent and ongoing work in which we give explicit formulas for the regularity of certain 2-connected bipartite graphs.
|
|
Date: |
|
| Start Time: |
15:00 |
|
Speaker: |
Jorge Neves (CMUC, Univ. Coimbra)
|
|
Institution: |
CMUC - Universidade de Coimbra
|
|
Place: |
Room 2.4, Department of Mathematics, U.C.
|
| Research Groups: |
-Algebra and Combinatorics
|
|
See more:
|
<Main>
|
|
