Fetching the paper…
Reading the bibliography…
Kostka, Littlewood-Richardson, Plethysm and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory, geometric complexity and algebraic combinatorics.
M. Fayers, A note on kostka numbers (2019), arXiv:1903.12499 [math.CO]
1903
Earlier work this paper cites.
E. Wigner, Group Theory: And its Application to the Quantum Mechanics of Atomic Spectra , Pure and applied physics (Elsevier Science, 1931)
1931
Earlier work this paper cites.
H. Weyl, The Theory of Groups and Quantum Mechanics , Dover Books on Mathematics (Dover Publications, 1950)
1950
Earlier work this paper cites.
M. Gell-Mann, The eightfold way: A theory of strong interaction symmetry 10.2172/4008239 (1961)
1961
Earlier work this paper cites.
W. Diffie and M. Hellman, New directions in cryptography, IEEE Transactions on Information Theory 22
1976
Earlier work this paper cites.
J.-P. Serre et al. , Linear representations of finite groups , Vol. 42 (Springer, 1977)
1977
Earlier work this paper cites.
R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Commun. ACM 21
1978
Earlier work this paper cites.
R. Pauncz, Spin Eigenfunctions: Construction and Use (Springer US, 1979)
1979
Earlier work this paper cites.
R. P. Feynman, Simulating physics with computers, International Journal of Theoretical Physics 21
1982
Earlier work this paper cites.
G. D. James, The Representation Theory of the Symmetric Group , Encyclopedia of Mathematics and its Applications (Cambridge University Press, 1984)
1984
Earlier work this paper cites.
M. Clausen, Fast generalized fourier transforms, Theoretical Computer Science 67
1989
Earlier work this paper cites.
J. Stembridge, On the eigenvalues of representations of reflection groups and wreath products, Pacific Journal of Mathematics 140
1989
Earlier work this paper cites.
P. Diaconis and D. N. Rockmore, Efficient computation of the fourier transform on finite groups, Journal of the American Mathematical Society 3
1990
Earlier work this paper cites.
W. Fulton and J. Harris, Representation Theory: A First Course (Springer, 1991)
1991
Earlier work this paper cites.
A. Barvinok, A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed, in Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science (1993) pp. 566–572
1993
Earlier work this paper cites.
P. W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, in Proceedings 35th annual symposium on foundations of computer science (Ieee, 1994) pp. 124–134
1994
Earlier work this paper cites.
R. Beals, Quantum computation of fourier transforms over symmetric groups, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , 48 (1997)
1997
Earlier work this paper cites.
M. Dyer and R. Kannan, On barvinok’s algorithm for counting lattice points in fixed dimension, Mathematics of Operations Research 22
1997
Cited alongside, same era.
R. Stanley, Positivity problems and conjectures in algebraic combinatorics, Mathematics: Frontiers and Perspectives , 295 (1999)
1999
Cited alongside, same era.
A. I. Barvinok and J. Pommersheim, An algorithmic theory of lattice points in polyhedra (1999)
1999
Cited alongside, same era.
Y. Roichman, Characters of the symmetric groups: Formulas, estimates and applications, in Emerging Applications of Number Theory , edited by D. A. Hejhal, J. Friedman, M. C. Gutzwiller, and A. M. Odlyzko (Springer New York, New York, NY, 1999) pp. 525–545
1999
Cited alongside, same era.
B. Sagan, The symmetric group: representations, combinatorial algorithms, and symmetric functions , Vol. 203 (Springer Science & Business Media, 2001)
M. Christandl, B. Doran, and M. Walter, Computing multiplicities of lie group representations, in 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (2012) pp. 639–648
2012
Later among the works it cites.
K. D. Mulmuley, The gct program toward the p vs. np problem, Commun. ACM 55
2012
Later among the works it cites.
M. Christandl, B. Doran, S. Kousidis, and M. Walter, Eigenvalue distributions of reduced density matrices, Communications in Mathematical Physics 332
2014
Later among the works it cites.
Y. Kawano and H. Sekigawa, Quantum fourier transform over symmetric groups — improved result, Journal of Symbolic Computation 75
2014
Later among the works it cites.
J. Haah, A. W. Harrow, Z. Ji, X. Wu, and N. Yu, Sample-optimal tomography of quantum states, IEEE Transactions on Information Theory , 1–1 (2017)
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…
2001
Cited alongside, same era.
J. R. Stembridge, A concise proof of the littlewood-richardson rule, the electronic journal of combinatorics , N5 (2002)
2002
Cited alongside, same era.
A. Klyachko, Quantum marginal problem and representations of the symmetric group (2004), arXiv:quant-ph/0409113 [quant-ph]
2004
Cited alongside, same era.
M. Christandl and G. Mitchison, The spectra of quantum states and the kronecker coefficients of the symmetric group, Communications in Mathematical Physics 261
2005
Cited alongside, same era.
A. W. Harrow, Applications of coherent classical communication and the schur transform to quantum information theory, arXiv preprint quant-ph/0512255 (2005)
2005
Cited alongside, same era.
J. A. D. Loera and T. B. McAllister, On the computation of clebsch-gordan coefficients and the dilation effect (2005), arXiv:math/0501446 [math.RT]
2005
Cited alongside, same era.
J. A. De Loera, The many aspects of counting lattice points in polytopes, Mathematische Semesterberichte 52
2005
Cited alongside, same era.
H. Narayanan, On the complexity of computing kostka numbers and littlewood-richardson coefficients, Journal of Algebraic Combinatorics 24
2006
Cited alongside, same era.
C. Ikenmeyer, K. D. Mulmuley, and M. Walter, On vanishing of kronecker coefficients, computational complexity 26
2017
Later among the works it cites.
I. Pak and G. Panova, On the complexity of computing kronecker coefficients, computational complexity 26
2017
Later among the works it cites.
V. Baldoni, M. Vergne, and M. Walter, Computation of dilated kronecker coefficients, Journal of Symbolic Computation 84
2018
Later among the works it cites.
H. Krovi, An efficient high dimensional quantum schur transform, Quantum 3
2019
Later among the works it cites.
N. Fischer and C. Ikenmeyer, The computational complexity of plethysm coefficients, computational complexity 29
2020
Later among the works it cites.
S. Bravyi, A. Chowdhury, D. Gosset, and P. Wocjan, Quantum hamiltonian complexity in thermal equilibrium, Nature Physics 18
2022
Later among the works it cites.
2022
Later among the works it cites.
G. Panova, Computational complexity in algebraic combinatorics (2023), arXiv:2306.17511 [math.CO]
2023
Later among the works it cites.
S. Bravyi, A. Chowdhury, D. Gosset, V. Havlicek, and G. Zhu, Quantum complexity of the kronecker coefficients, PRX Quantum 5
2024
Closest in time.
2024
Closest in time.