Sriram Gopalakrishnan

activity

20202024

most citedTRIP-PAL: Travel Planning with Guarantees by Combining Large Language Models and Automated Planners

8 citations · 17 across the 8 of their papers we have counts for

collaborators

Showing cs.SCShow all

3 papers · 1 filter

cs.SC2024★ 1 cited

On the arithmetic complexity of computing Gröbner bases of comaximal determinantal ideals

Sriram Gopalakrishnan

Let $M$ be an $n \times n$ matrix of homogeneous linear forms over a field $k$ . If the ideal $I_{n - 2} (M)$ generated by minors of size $n - 1$ is Cohen-Macaulay, then the…

cs.SC2024

Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations

Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din

Given polynomials $g$ and $f_{1}, \dots, f_{p}$ , all in $k [x_{1}, \dots, x_{n}]$ for some field $k$ , we consider the problem of computing the critical points of the restriction of $g$ …

cs.SC2023

Refined $F_{5}$ Algorithms for Ideals of Minors of Square Matrices

Sriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din

We consider the problem of computing a grevlex Gröbner basis for the set $F_{r} (M)$ of minors of size $r$ of an $n \times n$ matrix $M$ of generic linear forms over a field of charact…

On the arithmetic complexity of computing Gröbner bases of comaximal determinantal ideals

Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations

Refined F5​ Algorithms for Ideals of Minors of Square Matrices

Refined $F_{5}$ Algorithms for Ideals of Minors of Square Matrices