Coxeter factorizations and the matrix tree theorem with generalized Jucys-Murphy weights

zbMath1447.05235MaRDI QIDQ2199883

Theo Douvropoulos, Guillaume Chapuy

Publication date: 14 September 2020

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2020//82.html

zbMATH Keywords

Coxeter groupsLaplacianfactorizationshigher genusmatrix tree theorem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Combinatorial aspects of groups and algebras (05E16)

Related Items (3)

Counting chains in the noncrossing partition lattice via the \(W\)-Laplacian ⋮ Coxeter factorizations with generalized Jucys–Murphy weights and Matrix‐Tree theorems for reflection groups ⋮ A note on fully commutative elements in complex reflection groups

Cites Work

• Unnamed Item
• The probability of long cycles in interchange processes
• Matrix-tree theorems and discrete path integration
• Reflection factorizations of Singer cycles
• Cycle factorizations and 1-faced graph embeddings
• Enumerative properties of generalized associahedra
• Some combinatorial problems associated with products of conjugacy classes of the symmetric group
• On enumerating factorizations in reflection groups
• Finite complex reflection arrangements are \(K(\pi,1)\)
• Deligne-Lusztig theoretic derivation for Weyl groups of the number of reflection factorizations of a Coxeter element
• Counting factorizations of Coxeter elements into products of reflections
• Chains in the Noncrossing Partition Lattice
• Finite Unitary Reflection Groups

This page was built for publication: Coxeter factorizations and the matrix tree theorem with generalized Jucys-Murphy weights