A full complexity dichotomy for immanant families

02/08/2021
by   Radu Curticapean, et al.
0

Given an integer n≥ 1 and an irreducible character χ_λ of S_n for some partition λ of n, the immanant imm_λ:ℂ^n× n→ℂ maps matrices A∈ℂ^n× n to imm_λ(A)=∑_π∈ S_nχ_λ(π)∏_i=1^nA_i,π(i). Important special cases include the determinant and permanent, which are the immanants associated with the sign and trivial character, respectively. It is known that immanants can be evaluated in polynomial time for characters that are close to the sign character: Given a partition λ of n with s parts, let b(λ):=n-s count the boxes to the right of the first column in the Young diagram of λ. For a family of partitions Λ, let b(Λ):=max_λ∈Λb(λ) and write Imm(Λ) for the problem of evaluating imm_λ(A) on input A and λ∈Λ. If b(Λ)<∞, then Imm(Λ) is known to be polynomial-time computable. This subsumes the case of the determinant. On the other hand, if b(Λ)=∞, then previously known hardness results suggest that Imm(Λ) cannot be solved in polynomial time. However, these results only address certain restricted classes of families Λ. In this paper, we show that the parameterized complexity assumption FPT ≠ #W[1] rules out polynomial-time algorithms for Imm(Λ) for any computationally reasonable family of partitions Λ with b(Λ)=∞. We give an analogous result in algebraic complexity under the assumption VFPT ≠ VW[1]. Furthermore, if b(λ) even grows polynomially in Λ, we show that Imm(Λ) is hard for #P and VNP. This concludes a series of partial results on the complexity of immanants obtained over the last 35 years.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/24/2022

Approximating the chromatic polynomial is as hard as computing it exactly

We show that for any non-real algebraic number q such that |q-1|>1 or (q...
research
12/17/2018

The Complexity of Factors of Multivariate Polynomials

The existence of string functions, which are not polynomial time computa...
research
11/10/2017

Clustering with Local Restrictions

We study a family of graph clustering problems where each cluster has to...
research
11/09/2018

An output-sensitive polynomial Time Algorithm to partition a Sequence of Integers into Subsets with equal Sums

The well-known PARTITION problem: Given positive integers n, k and t suc...
research
01/17/2019

Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P

We focus our attention onto polynomial-time sub-linear-space computation...
research
02/08/2022

Computing H-Partitions in ASP and Datalog

A H-partition of a finite undirected simple graph G is a labeling of G's...
research
06/02/2023

Socially Aware Coalition Formation with Bounded Coalition Size

In many situations when people are assigned to coalitions the assignment...

Please sign up or login with your details

Forgot password? Click here to reset