15 citations · 63 across the 17 of their papers we have counts for
5 papers · 1 filter
Ranks of linear matrix pencils separate simultaneous similarity orbits
Harm Derksen, Igor Klep, Visu Makam +1
This paper solves the two-sided version and provides a counterexample to the general version of the 2003 conjecture by Hadwin and Larson. Consider evaluations of linear matrix penc…
Symmetries in Directed Gaussian Graphical Models
Visu Makam, Philipp Reichenbach, Anna Seigal
We define Gaussian graphical models on directed acyclic graphs with coloured vertices and edges, calling them RDAG (restricted directed acyclic graph) models. If two vertices or ed…
Polystability in positive characteristic and degree lower bounds for invariant rings
Harm Derksen, Visu Makam
We develop a representation theoretic technique for detecting closed orbits that is applicable in all characteristics. Our technique is based on Kempf's theory of optimal subgroups…
Lower Bounds for Maximally Recoverable Tensor Code and Higher Order MDS Codes
Joshua Brakensiek, Sivakanth Gopi, Visu Makam
An -tensor code consists of matrices whose columns satisfy `' parity checks and rows satisfy `' parity checks (i.e., a tensor code is the tensor produc…
Polynomial time algorithms in invariant theory for torus actions
Peter Bürgisser, M. Levent Doğan, Visu Makam +2
An action of a group on a vector space partitions the latter into a set of orbits. We consider three natural and useful algorithmic "isomorphism" or "classification" problems, name…