Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2103.04934 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- We establish the $\#P$-hardness of computing a broad class of immanants, even when restricted to specific categories of matrices. Concretely, we prove that computing $λ$-immanants of $0$-$1$ matrices is $\#P$-hard whenever the partition~$λ$ contains a sufficiently large domino-tileable region, subject to certain technical conditions. We also give hardness proofs for some $λ$-immanants of weighted adjacency matrices of planar directed graphs, such that the shape $λ= (\mathbf{1} + λ_d)$ has size $n$ such that $|λ_d| = n^\varepsilon$ for some $0 < \varepsilon < \frac{1}{2}$, and such that for some $w$, the shape $λ_d/(w)$ is tileable with $1 \times 2$ dominos.