Pages that link to "Item:Q2404629"
From MaRDI portal
The following pages link to Rectangular Kronecker coefficients and plethysms in geometric complexity theory (Q2404629):
Displaying 18 items.
- Breaking down the reduced Kronecker coefficients (Q784225) (← links)
- On vanishing of Kronecker coefficients (Q1686840) (← links)
- Obstructions to combinatorial formulas for plethysm (Q1753006) (← links)
- On the complexity of the permanent in various computational models (Q2013543) (← links)
- Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science (Q2672320) (← links)
- Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783) (← links)
- On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions (Q3295878) (← links)
- No occurrence obstructions in geometric complexity theory (Q4961749) (← links)
- On Various Multiplicity-Free Products of Schur Functions (Q5018534) (← links)
- The classification of multiplicity-free plethysms of Schur functions (Q5082386) (← links)
- (Q5091206) (← links)
- (Q5092463) (← links)
- Counting Partitions inside a Rectangle (Q5139658) (← links)
- Maximal lexicographic spectra and ranks for states with fixed uniform margins (Q5223162) (← links)
- Polynomial total positivity and high relative accuracy through Schur polynomials (Q6053015) (← links)
- Splitting Kronecker squares, 2-decomposition numbers, Catalan combinatorics, and the Saxl conjecture (Q6088377) (← links)
- Interview with Greta Panova (Q6098002) (← links)
- Schur polynomials do not have small formulas if the determinant does not (Q6113104) (← links)