Date
Fri, 21 May 2021
Time
14:00 - 15:00
Location
Virtual
Speaker
Finn Wiersig
Organisation
University of Oxford

How to calculate the minimal number of summands of a nonzero polynomial in a given polynomial ideal? In this talk, we first discuss the roots of this question in computational algebra. Afterwards, we switch to the viewpoint of a commutative algebraist. In particular, we see that classical tools from this field, such as primary decomposition or the Castelnuovo–Mumford regularity, fail to provide a solution to this problem. Finally, we discuss a concrete example: A standard determinantal ideal generated by $t$-minors does not contain any polynomials with fewer than $t!/2$ terms.

Last updated on 29 Jan 2025, 10:55am. Please contact us with feedback and comments about this page.