14 research outputs found
The Saxl Conjecture and the Dominance Order
In 2012 Jan Saxl conjectured that all irreducible representations of the
symmetric group occur in the decomposition of the tensor square of the
irreducible representation corresponding to the staircase partition. We make
progress on this conjecture by proving the occurrence of all those irreducibles
which correspond to partitions that are comparable to the staircase partition
in the dominance order. Moreover, we use our result to show the occurrence of
all irreducibles corresponding to hook partitions. This generalizes results by
Pak, Panova, and Vallejo from 2013.Comment: 11 page
Some unimodal sequences of Kronecker coefficients
We conjecture unimodality for some sequences of generalized Kronecker
coefficients and prove it for partitions with at most two columns. The proof is
based on a hard Lefschetz property for corresponding highest weight spaces. We
also study more general Lefschetz properties, show implications to a
higher-dimensional analogue of the Alon--Tarsi conjecture on Latin squares and
give related positivity results
On vanishing of Kronecker coefficients
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 coefficients. Our result establishes in a formal way that
Kronecker coefficients are more difficult than Littlewood-Richardson
coefficients, unless P=NP.
We also show that there exists a #P-formula for a particular subclass of
Kronecker coefficients whose positivity is NP-hard to decide. This is an
evidence that, despite the hardness of the positivity problem, there may well
exist a positive combinatorial formula for the Kronecker coefficients. Finding
such a formula is a major open problem in representation theory and algebraic
combinatorics.
Finally, we consider the existence of the partition triples such that the Kronecker coefficient but the
Kronecker coefficient for some integer
. Such "holes" are of great interest as they witness the failure of the
saturation property for the Kronecker coefficients, which is still poorly
understood. Using insight from computational complexity theory, we turn our
hardness proof into a positive result: We show that not only do there exist
many such triples, but they can also be found efficiently. Specifically, we
show that, for any , there exists such that, for all
, there exist partition triples in the
Kronecker cone such that: (a) the Kronecker coefficient
is zero, (b) the height of is , (c) the height of is , and (d) . The proof of the last result
illustrates the effectiveness of the explicit proof strategy of GCT.Comment: 43 pages, 1 figur
Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials: The Regular Case
Let and be
two sets of nonlinear polynomials over
( being a field). We consider the computational problem of finding
-- if any -- an invertible transformation on the variables mapping
to . The corresponding equivalence problem is known as {\tt
Isomorphism of Polynomials with one Secret} ({\tt IP1S}) and is a fundamental
problem in multivariate cryptography. The main result is a randomized
polynomial-time algorithm for solving {\tt IP1S} for quadratic instances, a
particular case of importance in cryptography and somewhat justifying {\it a
posteriori} the fact that {\it Graph Isomorphism} reduces to only cubic
instances of {\tt IP1S} (Agrawal and Saxena). To this end, we show that {\tt
IP1S} for quadratic polynomials can be reduced to a variant of the classical
module isomorphism problem in representation theory, which involves to test the
orthogonal simultaneous conjugacy of symmetric matrices. We show that we can
essentially {\it linearize} the problem by reducing quadratic-{\tt IP1S} to
test the orthogonal simultaneous similarity of symmetric matrices; this latter
problem was shown by Chistov, Ivanyos and Karpinski to be equivalent to finding
an invertible matrix in the linear space of matrices over and to compute the square root in a matrix
algebra. While computing square roots of matrices can be done efficiently using
numerical methods, it seems difficult to control the bit complexity of such
methods. However, we present exact and polynomial-time algorithms for computing
the square root in for various fields (including
finite fields). We then consider \\#{\tt IP1S}, the counting version of {\tt
IP1S} for quadratic instances. In particular, we provide a (complete)
characterization of the automorphism group of homogeneous quadratic
polynomials. Finally, we also consider the more general {\it Isomorphism of
Polynomials} ({\tt IP}) problem where we allow an invertible linear
transformation on the variables \emph{and} on the set of polynomials. A
randomized polynomial-time algorithm for solving {\tt IP} when
is presented. From an algorithmic point
of view, the problem boils down to factoring the determinant of a linear matrix
(\emph{i.e.}\ a matrix whose components are linear polynomials). This extends
to {\tt IP} a result of Kayal obtained for {\tt PolyProj}.Comment: Published in Journal of Complexity, Elsevier, 2015, pp.3
On Vanishing of {K}ronecker Coefficients
It is shown that: (1) The problem of deciding positivity of Kronecker coefficients is NP-hard. (2) There exists a positive ()-formula for a subclass of Kronecker coefficients whose positivity is NP-hard to decide. (3) For any , there exists such that, for all , there exist partition triples in the Kronecker cone such that: (a) the Kronecker coefficient is zero, (b) the height of is , (c) the height of is , and (d) . The last result takes a step towards proving the existence of occurrence-based representation-theoretic obstructions in the context of the GCT approach to the permanent vs. determinant problem. Its proof also illustrates the effectiveness of the explicit proof strategy of GCT
Two classes of minimal generic fundamental invariants for tensors
Motivated by the problems raised by B\"{u}rgisser and Ikenmeyer, we discuss
two classes of minimal generic fundamental invariants for tensors of order 3.
The first one is defined on , where . We study
its construction by obstruction design introduced by B\"{u}rgisser and
Ikenmeyer, which partially answers one problem raised by them. The second one
is defined on . We study its evaluation on the matrix multiplication
tensor and unit tensor when
. The evaluation on the unit tensor leads to the definition of Latin
cube and 3-dimensional Alon-Tarsi problem. We generalize some results on Latin
square to Latin cube, which enrich the understanding of 3-dimensional
Alon-Tarsi problem. It is also natural to generalize the constructions to
tensors of other orders. We illustrate the distinction between even and odd
dimensional generalizations by concrete examples. Finally, some open problems
in related fields are raised.Comment: Some typos were changed.New publication information has been update