Related papers: Quantum Algorithms for Representation-Theoretic Mu…
We give explicit positive combinatorial interpretations for the plethysm coefficients $\langle s_\mu[s_\nu], s_\lambda\rangle$, when $\lambda$ has at most two rows, as counting certain marked trees. In the special case $\mu=(n)$, this also…
We show that the Littlewood-Richardson coefficients are values at 1 of certain parabolic Kazhdan-Lusztig polynomials for affine symmetric groups. These q-analogues of Littlewood-Richardson multiplicities coincide with those previously…
We report about results revolving around Kostka-Foulkes and parabolic Kostka polynomials and their connections with Representation Theory and Combinatorics. It appears that the set of all parabolic Kostka polynomials forms a semigroup,…
In this paper we apply a method of Robinson and Taulbee for computing Kronecker coefficients together with other ingredients and show that the multiplicity of each component in a Kronecker square can be obtained from an evaluation of a…
If $[\lambda(j)]$ is a multipartition of the positive integer $n$ (a sequence of partitions with total size $n$), and $\mu$ is a partition of $n$, we study the number $K_{[\lambda(j)]\mu}$ of sequences of semistandard Young tableaux of…
We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…
The simulation of large-scale classical systems in exponentially small space on quantum computers has gained attention. The prior work demonstrated that a quantum algorithm offers an exponential speedup over any classical algorithm in…
Generalized Hall-Littlewood polynomials (Macdonald spherical functions) and generalized Kostka-Foulkes polynomials ($q$-weight multiplicities) arise in many places in combinatorics, representation theory, geometry, and mathematical physics.…
Representation theory is shown to be incomplete in terms of enumerating all integrable limits of quantum systems. As a consequence, one can find exactly solvable Hamiltonians which have apparently strongly broken symmetry. The number of…
Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that…
Quantum algorithms for topological data analysis (TDA) seem to provide an exponential advantage over the best classical approach while remaining immune to dequantization procedures and the data-loading problem. In this paper, we give…
Kronecker coefficients encode the tensor products of complex irreducible representations of symmetric groups. Their stability properties have been considered recently by several authors (Vallejo, Pak and Panova, Stembridge). We describe a…
We prove that for all natural numbers k,n,d with k <= d and every partition lambda of size kn with at most k parts there exists an irreducible GL(d, C)-representation of highest weight 2*lambda in the plethysm Sym^k(Sym^(2n) (C^d)). This…
Quantum advantage in computation refers to the existence of computational tasks that can be performed efficiently on a quantum computer but cannot be efficiently simulated on any classical computer. Identifying the precise boundary of…
We present new proofs and generalizations of unimodality of the q-binomial coefficients \binom{n}{k}_q as polynomials in q. We use an algebraic approach by interpreting the differences between numbers of certain partitions as Kronecker…
Motivated by the Saxl conjecture and the tensor square conjecture, which states that the tensor squares of certain irreducible representations of the symmetric group contain all irreducible representations, we study the tensor squares of…
Kostka-Foulkes polynomials are Lusztig's $q$-analogues of weight multiplicities for irreducible representations of semisimple Lie algebras. It has long been known that these polynomials have non-negative coefficients. A statistic on…
Computing topological invariants of 3-manifolds is generally intractable, yet specialized algebraic structures can enable efficient algorithms. For Witten-Reshetikhin-Turaev (WRT) invariants of torus bundles, we exploit the non-commutative…
We present a quantum version of the classical probabilistic algorithms $\grave{a}$ la Rabin. The quantum algorithm is based on the essential use of Grover's operator for the quantum search of a database and of Shor's Fourier transform for…
In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts…