2 citations · 3 across the 9 of their papers we have counts for
5 papers · 1 filter
Two-Cut Coherence of Quintic Forms: Lifting Separations and Second-Derivative Completeness
Karthik Sheshadri
For a homogeneous polynomial f of degree d, the degree-k restricted strength C_k(f) is the least number of products needed to write f with factor degrees k and d-k. We introduce a…
Trellis State Complexity as an Exact Tropical Factorization Rank
Karthik Sheshadri
Let $C\subseteq\F_2^m$ be a binary linear code and let be a bipartition of its coordinates. The \emph{conditional decoding matrix} of at this cut is the matrix…
Conormal Lower Bounds for Determinantal Complexity: Fermat Slices, Tight Bounds, and a Ceiling
Karthik Sheshadri
The determinantal complexity of a polynomial is the smallest size of a matrix of affine linear forms whose determinant is ; the border version only asks for determinants con…
A fully Lean-verified quadratic lower bound on the border determinantal complexity of over , including the symmetric and exact models
Karthik Sheshadri
We present the first end-to-end Lean-verified superlinear lower bound on border determinantal complexity. Let . We prove, over , that the border…
A short proof of a quadratic lower bound on the border determinantal complexity of over : A simple human exposition
Karthik Sheshadri
I give a short proof that the border determinantal complexity of over is at least , and at least in the symmetric…