Noncrossing partitions, noncrossing graphs, and \(q\)-permanental equations

DOI10.1016/j.laa.2017.11.024zbMath1380.15008OpenAlexW2772301230MaRDI QIDQ1690673

Eduardo Marques de Sá

Publication date: 12 January 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2017.11.024

zbMATH Keywords

permutationsgraphsdigraphspermanentpolynomial identitiesHermitian positive definite matrix

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Directed graphs (digraphs), tournaments (05C20)

Related Items

Linear preservers for the \(q\)-permanent, cycle \(q\)-permanent expansions, and positive crossings in digraphs ⋮ A note on Bapat's q-permanent conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An example of a generalized Brownian motion
• Combinatorially symmetric matrices
• Quantum deformation of flag schemes and Grassmann schemes. I: A \(q\)- deformation of the shape-algebra for \(GL(n)\)
• Analytic combinatorics of non-crossing configurations
• Inequalities for the \(q\)-permanent
• \(q\)-analogues of determinants and symmetric chain decompositions
• Completely positive maps on Coxeter groups, deformed commutation relations, and operator spaces
• Some properties of crossings and partitions
• Enumeration of noncrossing trees on a circle
• Inequalities for the \(q\)-permanent. II
• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• Noncrossing partitions
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Combinatorics of Coxeter Groups
• Extremal Combinatorics
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Research problem