scispace - formally typeset
Book ChapterDOI

Determinant versus Permanent: Salvation via Generalization?

TLDR
It is demonstrated that the immanant of any family of Young diagrams with bounded width and at least n e boxes at the right of the first column is \(\textsc{VNP}\)-complete.
Abstract
The fermionant \({\rm Ferm}^k_n(\bar x) = \sum_{\sigma \in S_n} (-k)^{c(\pi)}\prod_{i=1}^n x_{i,j}\) can be seen as a generalization of both the permanent (for k = − 1) and the determinant (for k = 1). We demonstrate that it is \(\textsc{VNP}\)-complete for any rational k ≠ 1. Furthermore it is #P-complete for the same values of k. The immanant is also a generalization of the permanent (for a Young diagram with a single line) and of the determinant (when the Young diagram is a column). We demonstrate that the immanant of any family of Young diagrams with bounded width and at least n e boxes at the right of the first column is \(\textsc{VNP}\)-complete.

read more

Citations
More filters
Posted Content

Determinant versus Permanent: salvation via generalization? The algebraic complexity of the Fermionant and the Immanant.

TL;DR: It is demonstrated that the immanant of any family of Young diagrams with bounded width and at least n boxes at the right of the first column is VNP-complete.
Proceedings ArticleDOI

A full complexity dichotomy for immanant families

TL;DR: In this paper, it was shown that the assumption FPT≠ #W from parameterized complexity rules out polynomial-time algorithms for Imm(Λ) for any computationally reasonable family of partitions Λ with b(λ)=∞.
Posted Content

A full complexity dichotomy for immanant families

TL;DR: In this paper, it was shown that the parameterized complexity assumption FPT #P and VNP #W rules out polynomial-time algorithms for Imm$(Lambda)$ for any computationally reasonable family of partitions.
Posted Content

#P-hardness proofs of matrix immanants evaluated on restricted matrices.

TL;DR: In this paper, the hardness of computing matrix immanants is characterized for a broad class of shapes and restricted sets of matrices, and hardness results for these shapes and matrices are shown for the case where the edges have small positive integer weights.
Journal ArticleDOI

Undirected Determinant and Its Complexity

TL;DR: In this paper , it was shown that computing the undirected permanent is #P-complete for planar graphs with vertices having degree at most 4. But the permanents can be computed in polynomial time on planar 3-regular graphs.
References
More filters
Book

The Theory of Group Characters and Matrix Representations of Groups

TL;DR: The Frobenius algebra of the symmetric group is studied in this article, where the characters of the group characters and the structure of continuous matrix groups and invariant matrices of unitary matrices are discussed.
Book

Completeness and Reduction in Algebraic Complexity Theory

TL;DR: The structure of Valiant's Algebraic Model of NP-Completeness is illustrated with some Complete Families of Polynomials and the Complexity of Immanants.
Journal ArticleDOI

A Rational-Function Identity Related to the Murnaghan–Nakayama Formula for the Characters of S n

TL;DR: The Murnaghan-Nakayama formula for the characters of Sn is derived from Young's seminormal representation, by a direct combinatorial argument as discussed by the authors, and the main idea is a rational function identity which when stated in a more general form involves Mobius functions of posets whose Hasse diagrams have a planar embedding.
Posted Content

Complexity and Completeness of Immanants

TL;DR: The theorem proves a conjecture of Buergisser for a large variety of families, and in particular the author recovers with new proofs his VNP-completeness results for hooks and rectangles.
Book ChapterDOI

A dichotomy theorem for homomorphism polynomials

TL;DR: A dichotomy theorem for the complexity of polynomial evaluation is shown, which shows that this family of graphs is computable by arithmetic circuits in constant depth if H has a loop or no edges and that it is hard otherwise.
Related Papers (5)