12 citations · 33 across the 15 of their papers we have counts for
4 papers · 1 filter
Constructive noncommutative rank computation is in deterministic polynomial time
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
We extend our techniques developed in our earlier paper appeared in Computational Complexity, 2017 (preprint: arXiv:1508.00690) to obtain a deterministic polynomial time algorithm…
On generating the ring of matrix semi-invariants
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
For a field , let be the ring of invariant polynomials for the action of on tuples of matrices…
Non-commutative Edmonds' problem and matrix semi-invariants
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
In 1967, Edmonds introduced the problem of computing the rank over the rational function field of an matrix with integral homogeneous linear polynomials. In this pa…
Relating tensor structures on representations of general linear and symmetric groups
Upendra Kulkarni, Shraddha Srivastava, K V Subrahmanyam
For polynomial representations of of a fixed degree, H. Krause defined a new internal tensor product using the language of strict polynomial functors. We show that over an a…