OpenAlex ·
On the nonnegativity of monomial immanants for hook partitions
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.36665
- Original
- Read it at the publisher
- Topics
Abstract
Let $A=(a_{ij})$ be an $n\times n$ real matrix and let $λ$ be a partition of $n$. Let $ϕ^λ$ be the class function dual to the Young permutation character, and let $$ ϕ^λ[A] = \sum_{σ\in\mathfrak{S}_n}ϕ^λ(σ) \prod_{i=1}^{n}a_{iσ(i)} $$ be the corresponding monomial immanant. Stembridge [Canad. J. Math. 44 (1992), pp. 1079-1099] posed the following open problem: If all minors of $A$ of order at most $r$ are nonnegative, and the partition $λ$ has length at most $r$, is it true that $ϕ^λ[A]\ge 0$? This paper solves the problem for all hook partitions.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
The Reach of Abelian Covers in Hypergraphs
MultiTable: A Faster Hash Table at any Physical Load Factor up to and Including One
Order-Optimal Systematic Permutation Codes for Correcting t Deletions
Quantum State Routing and Perfect State Transfer on Signed Graphs under Environmental Noise
Submodularity of entropy under quantum convolution
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.