CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
On vanishing of Kronecker coefficients
Authors
Christian Ikenmeyer
Ketan D. Mulmuley
Michael Walter
Publication date
1 January 2017
Publisher
'Springer Science and Business Media LLC'
Doi
Cite
View
on
arXiv
Abstract
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
(
λ
,
μ
,
Ï€
)
(\lambda, \mu, \pi)
(
λ
,
μ
,
Ï€
)
such that the Kronecker coefficient
k
μ
,
Ï€
λ
=
0
k^\lambda_{\mu, \pi} = 0
k
μ
,
Ï€
λ
​
=
0
but the Kronecker coefficient
k
l
μ
,
l
Ï€
l
λ
>
0
k^{l \lambda}_{l \mu, l \pi} > 0
k
l
μ
,
l
Ï€
l
λ
​
>
0
for some integer
l
>
1
l>1
l
>
1
. 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
0
<
ϵ
≤
1
0<\epsilon\leq1
0
<
ϵ
≤
1
, there exists
0
<
a
<
1
0<a<1
0
<
a
<
1
such that, for all
m
m
m
, there exist
Ω
(
2
m
a
)
\Omega(2^{m^a})
Ω
(
2
m
a
)
partition triples
(
λ
,
μ
,
μ
)
(\lambda,\mu,\mu)
(
λ
,
μ
,
μ
)
in the Kronecker cone such that: (a) the Kronecker coefficient
k
μ
,
μ
λ
k^\lambda_{\mu,\mu}
k
μ
,
μ
λ
​
is zero, (b) the height of
μ
\mu
μ
is
m
m
m
, (c) the height of
λ
\lambda
λ
is
≤
m
ϵ
\le m^\epsilon
≤
m
ϵ
, and (d)
∣
λ
∣
=
∣
μ
∣
≤
m
3
|\lambda|=|\mu| \le m^3
∣
λ
∣
=
∣
μ
∣
≤
m
3
. The proof of the last result illustrates the effectiveness of the explicit proof strategy of GCT.Comment: 43 pages, 1 figur
Similar works
Full text
Available Versions
MPG.PuRe
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:pure.mpg.de:item_2506147
Last time updated on 15/06/2019
MPG.PuRe
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:escidoc.org:escidoc:250614...
Last time updated on 08/12/2017