Pages that link to "Item:Q2410690"

The following pages link to Non-commutative Edmonds' problem and matrix semi-invariants (Q2410690):

Displaying 34 items.

• Hilbert series and degree bounds for matrix (semi-)invariants (Q258200) (← links)
• Polynomial degree bounds for matrix semi-invariants (Q520358) (← links)
• Derandomization and absolute reconstruction for sums of powers of linear forms (Q820536) (← links)
• Constructive non-commutative rank computation is in deterministic polynomial time (Q1630376) (← links)
• Polynomial bound for the nilpotency index of finitely generated nil algebras (Q1663074) (← links)
• On rank-critical matrix spaces (Q1679671) (← links)
• Wildness for tensors (Q1736243) (← links)
• Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties) (Q2054204) (← links)
• A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices (Q2061866) (← links)
• Weyl's polarization theorem in positive characteristic (Q2075049) (← links)
• A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices (Q2089763) (← links)
• Information geometry of operator scaling (Q2151570) (← links)
• A cost-scaling algorithm for computing the degree of determinants (Q2159472) (← links)
• The \(G\)-stable rank for tensors and the cap set problem (Q2166199) (← links)
• An exponential lower bound for the degrees of invariants of cubic forms and tensor actions (Q2180892) (← links)
• Algorithms for orbit closure separation for invariants and semi-invariants of matrices (Q2219886) (← links)
• Characteristic free description of semi-invariants of \(2 \times 2\) matrices (Q2301875) (← links)
• Operator scaling: theory and applications (Q2309517) (← links)
• Non-commutative Edmonds' problem and matrix semi-invariants (Q2410690) (← links)
• Tripartite-to-bipartite entanglement transformation by stochastic local operations and classical communication and the structure of matrix spaces (Q2413447) (← links)
• Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing (Q4634059) (← links)
• Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (Q4638110) (← links)
• Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces (Q4959125) (← links)
• Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory (Q4993287) (← links)
• From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces (Q4994986) (← links)
• Maximum Likelihood Estimation for Matrix Normal Models via Quiver Representations (Q5001673) (← links)
• A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 $$\times $$ 2 Submatrices (Q5041746) (← links)
• Maximum likelihood estimation for tensor normal models via castling transforms (Q5093810) (← links)
• The regularity lemma is false over small fields (Q5220638) (← links)
• Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings (Q5234537) (← links)
• Connections between graphs and matrix spaces (Q6074039) (← links)
• A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with \(2 \times 2\) submatrices (Q6120836) (← links)
• Convex analysis on Hadamard spaces and scaling problems (Q6659497) (← links)
• Algebraic algorithms for fractional linear matroid parity via noncommutative rank (Q6670353) (← links)