On the monotone hook hafnian conjecture
We investigate a conjecture of Haglund that asserts that certain graph polynomials have only real roots. We prove a multivariate generalization of this conjecture for the special case of threshold graphs.
Main Author: | Mirkó Visontai |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2011-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2965/pdf |
Similar Items
-
On the Monotone Column Permanent conjecture
by: James Haglund, et al.
Published: (2009-01-01) -
(k − 2)-linear connected components in hypergraphs of rank k
by: Florian Galliot, et al.
Published: (2023-11-01) -
On Kerov polynomials for Jack characters (extended abstract)
by: Valentin Féray, et al.
Published: (2013-01-01) -
Monotone Boolean Functions with s Zeros Farthest from Threshold Functions
by: Kazuyuki Amano, et al.
Published: (2005-01-01) -
Staircase Macdonald polynomials and the $q$-Discriminant
by: Adrien Boussicault, et al.
Published: (2008-01-01)