Fetching the paper…
Reading the bibliography…
Algebraic Combinatorics originated in Algebra and Representation Theory, studying their discrete objects and integral quantities via combinatorial methods which have since developed independent and self-contained lives and brought us some beautiful formulas and combinatorial interpretations.
Littlewood, D. E., Richardson, A. R. (1934), Group Characters and Algebra, Philosophical Transactions of the Royal Society of London Series A
1934
Earlier work this paper cites.
F. D. Murnaghan, The analysis of the Kronecker product of irreducible representations of the symmetric group, Amer. J. Math. 60
1938
Earlier work this paper cites.
J. S. Frame, G. de B. Robinson and R. M. Thrall, The hook graphs of the symmetric group, Canad. J. Math
1954
Earlier work this paper cites.
F. D. Murnaghan, On the Kronecker product of irreducible representations of the symmetric group, Proc. Natl. Acad. Sci. USA 42
1956
Earlier work this paper cites.
Products and plethysms of characters with orthogonal, symplectic and symmetric groups
Dudley E. Littlewood · 1958
Earlier work this paper cites.
C. Ikenmeyer, The Saxl conjecture and the dominance order, Disc. Math. (11) 6
1975
Earlier work this paper cites.
M. R. Garey and D. S. Johnson, Computers and intractability , Freeman, San Francisco, CA, 1979
1979
Earlier work this paper cites.
Produit de Kronecker des représentations du groupe symétrique
Alain Lascoux · 1979
Earlier work this paper cites.
L. G. Valiant, Completeness classes in algebra. Proc. 11th STOC (1979), 249–261
1979
Earlier work this paper cites.
L. G. Valiant, The complexity of computing the permanent. Theor. Comp. Sci. 8
1979
Earlier work this paper cites.
L. G. Valiant, S. Skyum, S. Berkowitz, C. Rackoff. Fast Parallel Computation of Polynomials Using Few Processors. SIAM Journal on Computing 12
1983
Earlier work this paper cites.
Shuffles of permutations and the Kronecker product,
A. Garsia and J. Remmel, · 1985
Earlier work this paper cites.
A formula for the Kronecker products of Schur functions of hook shapes,
J. Remmel, · 1989
Earlier work this paper cites.
D. Zeilberger, A one-line high school algebra proof of the unimodality of the Gaussian polynomials ( n k ) q \binom{n}{k}_{q} for k < 20 k<20 . (1989) In q-Series and Partitions (pp. 67-72). Springer US
1989
Earlier work this paper cites.
N. Nisan, Lower bounds for non-commutative computation, in Proc. 23rd STOC (1991), ACM, 410–418
1991
Earlier work this paper cites.
J. Remmel, T. Whitehead, On the Kronecker product of Schur functions of two row shapes. Bull. Belg. Math. Soc. Simon Stevin 1
1994
Earlier work this paper cites.
I. G. Macdonald, Symmetric functions and Hall polynomials (Second edition), Oxford University Press, New York, 1995
1995
Earlier work this paper cites.
R. Beals, Quantum computation of Fourier transforms over symmetric groups, Proc. of the twenty-ninth annual ACM symposium on Theory of computing (1997), pp. 48–53
1997
Earlier work this paper cites.
P. Bürgisser, M. Clausen and M. A. Shokrollahi, Algebraic complexity theory , Springer, Berlin, 1997
1997
Earlier work this paper cites.
W. Fulton, Young tableaux , Cambridge Univ. Press, Cambridge, UK, 1997, 260 pp
1997
Earlier work this paper cites.
E. Vallejo, Reductions of additive sets, sets of uniqueness and pyramids, Discrete Math. 173
1997
Earlier work this paper cites.
A. Knutson and T. Tao, The honeycomb model of GL n ( ℂ ) \mathrm{GL}_{n}(\mathbb{C}) tensor products I: Proof of the saturation conjecture, J. AMS
1999
Earlier work this paper cites.
R. P. Stanley, Enumerative Combinatorics
1999
Earlier work this paper cites.
E. Vallejo, Stability of Kronecker products of irreducible characters of the symmetric group, Electron. J. Combin. 6
1999
Earlier work this paper cites.
P. Bürgisser, Completeness and reduction in algebraic complexity theory , Springer, Berlin, 2000, 168 pp
2000
Earlier work this paper cites.
P. Bürgisser, Cook’s versus Valiant’s hypothesis, Theor. Comp. Sci. 235
2000
Earlier work this paper cites.
W. Fulton, Eigenvalues, invariant factors, highest weights, and Schubert calculus, Bull. AMS 37
2000
Earlier work this paper cites.
R. P. Stanley, Positivity problems and conjectures in algebraic combinatorics, in Mathematics: frontiers and perspectivies , AMS, Providence, RI, 2000, 295–319
2000
Earlier work this paper cites.
K. D. Mulmuley and M. Sohoni, Geometric complexity theory. I An approach to the P
2001
Cited alongside, same era.
B. E. Sagan, The symmetric group (Second ed.), Springer, New York, 2001
2001
Cited alongside, same era.
A. Shpilka and A. Wigderson, Depth- 3 3 arithmetic circuits over fields of characteristic zero, Comput. Complexity 10
2001
Cited alongside, same era.
M. Agrawal, N. Kayal and N. Saxena, PRIMES is in P. Annals of mathematics
2004
Cited alongside, same era.
C. Bessenrodt and C. Behns, On the Durfee size of Kronecker products of characters of the symmetric group and its double covers, J. Algebra
2004
Cited alongside, same era.
T. Mignon and N. Ressayre, A quadratic bound for the determinant and permanent problem, Int. Math. Res. Notices 2004
S. Aaronson, P = ? NP {{\rm{\textsf{P}}}}\overset{?}{=}{{\rm{\textsf{NP}}}} , in Open problems in mathematics , Springer, Cham, 2016, 1–122
2016
Later among the works it cites.
P. Bürgisser, C. Ikenmeyer and G. Panova, No occurrence obstructions in geometric complexity theory, J. AMS 32
2016
Later among the works it cites.
C. Ikenmeyer and G. Panova, Rectangular Kronecker coefficients and plethysms in geometric complexity theory, Adv. Math. 319
2016
Later among the works it cites.
I. Pak, G. Panova, E. Vallejo, Kronecker products, characters, partitions, and the tensor square conjectures, Advances in Mathematics 288
2016
Later among the works it cites.
C. Bessenrodt, C. Bowman, Multiplicity-free Kronecker products of characters of the symmetric groups. Adv. Math. 322
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2004
Cited alongside, same era.
C. Ballantine, R. Orellana, A combinatorial interpretation for the coefficients in the Kronecker product s ( n − p , p ) ∗ s λ s_{(n-p,p)}*s_{\lambda} . Sém. Lothar. Combin. 54A
2005
Cited alongside, same era.
J. A. De Loera and T. B. McAllister, On the computation of Clebsch–Gordan coefficients and the dilation effect, Experimental Math. 15
2006
Cited alongside, same era.
H. Narayanan, On the complexity of computing Kostka numbers and Littlewood–Richardson coefficients, J. Algebraic Combin. 24
2006
Cited alongside, same era.
M. Christandl, A. Harrow, G. Mitchison, Nonzero Kronecker coefficients and what they tell us about spectra. Comm. Math. Phys. 270
2007
Cited alongside, same era.
P. Bürgisser, C. Ikenmeyer, The complexity of computing Kronecker coefficients. 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), pp. 357–368
2008
Cited alongside, same era.
K. D. Mulmuley and M. Sohoni, Geometric complexity theory. II Towards explicit obstructions for embeddings among class varieties, SIAM J. Comput
2008
Cited alongside, same era.
Kronecker coefficients for one hook shape
Jonah Blasiak · 2017
Later among the works it cites.
P. Burgisser, M. Christandl, K.D. Mulmuley, M. Walter, Membership in moment polytopes is in NP and coNP. SIAM Journal on Computing (2017), 46
2017
Later among the works it cites.
F. Gesmundo, C. Ikenmeyer and G. Panova, Geometric complexity theory and matrix powering, Diff. Geom. Applications 55
2017
Later among the works it cites.
C. Ikenmeyer, K. D. Mulmuley and M. Walter, On vanishing of Kronecker coefficients, Computational Complexity 26
2017
Later among the works it cites.
A simplified Kronecker rule for one hook shape
Ricky Ini Liu · 2017
Later among the works it cites.
S. Luo,M. Sellke, The Saxl conjecture for fourth powers via the semigroup property. J. Algebraic Combin. 45
2017
Later among the works it cites.
K. Mulmuley, Geometric Complexity Theory V. Efficient algorithms for Noether normalization, J. AMS 30
2017
Later among the works it cites.
I. Pak, G. Panova, Bounds on certain classes of Kronecker and q-binomial coefficients, Journal of Combinatorial Theory, Series A 147
2017
Later among the works it cites.
I. Pak and G. Panova, On the complexity of computing Kronecker coefficients, Comput. Complexity 26
2017
Later among the works it cites.
J. Blasiak, R.I. Liu, Kronecker coefficients and noncommutative super Schur functions. J. Combin. Theory Ser. A 158
2018
Later among the works it cites.
M. Bläser and C. Ikenmeyer, Introduction to geometric complexity theory , Summer school lecture notes, 2018, 148 pp.; https://tinyurl.com/nhe2wxvw
2018
Later among the works it cites.
J. Dörfler, C. Ikenmeyer and G. Panova, On geometric complexity theory: Multiplicity obstructions are stronger than occurrence obstructions in Proc. 46-th ICALP (2019), Art. 51, 14 pp
2019
Later among the works it cites.
S. Melczer, G. Panova and R. Pemantle, Counting partitions inside a rectangle, SIAM J. Discrete Math. 34
2019
Later among the works it cites.
A. Wigderson, Mathematics and Computation , monograph draft, 2019
2019
Later among the works it cites.
N. Fischer and C. Ikenmeyer, The computational complexity of plethysm coefficients, Comput. Complexity 29
2020
Later among the works it cites.
2022
Later among the works it cites.
C. Ikenmeyer and I. Pak, What is in #P
2022
Later among the works it cites.
I. Pak, What is a combinatorial interpretation?, preprint (2022), 58 pp.; to appear in Proc. OPAC , AMS, Providence, RI
2022
Later among the works it cites.
2023
Closest in time.
2023
Closest in time.
C. Ikenmeyer and S. Subramanian, A remark on the quantum complexity of Kronecker coefficients, preprint (2023)
2023
Closest in time.
I. Pak, G. Panova, Durfee squares, symmetric partitions and bounds on Kronecker coefficients, J. of Algebra (2023), 629
2023
Closest in time.