15 citations · 63 across the 17 of their papers we have counts for
5 papers · 1 filter
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings
Ankit Garg, Christian Ikenmeyer, Visu Makam +3
We consider the problem of computing succinct encodings of lists of generators for invariant rings for group actions. Mulmuley conjectured that there are always polynomial sized su…
Singular tuples of matrices is not a null cone (and, the symmetries of algebraic varieties)
Visu Makam, Avi Wigderson
The following multi-determinantal algebraic variety plays a central role in algebra, algebraic geometry and computational complexity theory: , consisting of all $…
Invariant theory and wheeled PROPs
Harm Derksen, Visu Makam
We study the category of wheeled PROPs using tools from Invariant Theory. A typical example of a wheeled PROP is the mixed tensor algebra , whe…
More barriers for rank methods, via a "numeric to symbolic" transfer
Ankit Garg, Visu Makam, Rafael Oliveira +1
We prove new barrier results in arithmetic complexity theory, showing severe limitations of natural lifting (aka escalation) techniques. For example, we prove that even optimal ran…
An exponential lower bound for the degrees of invariants of cubic forms and tensor actions
Harm Derksen, Visu Makam
Using the Grosshans Principle, we develop a method for proving lower bounds for the maximal degree of a system of generators of an invariant ring. This method also gives lower boun…