Symbolic Computation Seminar: Sriram Gopalakrishnan, Sorbonne Université, The arithmetic complexity of computing Grobner bases of determinantal systems
SAS 4201Determinantal systems are systems of polynomial equations which encode a rank deficiency of a given matrix with polynomial entries over the solution set to other polynomial equations. Such systems arise…