Abstract In 1950, John Nash sent a remarkable letter to the National Security Agency, in
which—seeking to build theoretical foundations for cryptography—he all but formulated what …

In this paper, Schur polynomials are used to provide a bidiagonal decomposition of
polynomial collocation matrices. The symmetry of Schur polynomials is exploited to analyze …

Solid solution strengthening effect by oxygen (O) and nitrogen (N) atoms of α-titanium (Ti)
materials was quantitatively evaluated using Labusch model by consideration of the …

We show that the problem of deciding positivity of Kronecker coefficients is NP-hard.
Previously, this problem was conjectured to be in P, just as for the Littlewood–Richardson …

For several classical nonnegative integer functions we investigate if they are members of the
counting complexity class# P or not. We prove# P membership in surprising cases, and in …

The permanent versus determinant conjecture is a major problem in complexity theory that is
equivalent to the separation of the complexity classes $\mathrm {VP} _ {\mathrm {ws}} $ and …

We study a basic algorithmic problem in algebraic geometry, which we call NNL, of
constructing a normalizing map as per Noether's Normalization Lemma. For general explicit …

We prove that the computation of the Kronecker coefficients of the symmetric group is
contained in the complexity class# BQP. This improves a recent result of Bravyi, Chowdhury …

arxiv:2406.06217v1 [cs.CC] 10 Jun 2024 Page 1 COMPLETENESS CLASSES IN
ALGEBRAIC COMPLEXITY THEORY PETER BÜRGISSER Abstract. The purpose of this …

Kostka, Littlewood-Richardson, Kronecker, and plethysm coefficients are fundamental
quantities in algebraic combinatorics, yet many natural questions about them stay …