Eulerian polynomials for digraphs

DOI10.5070/C65165026MaRDI QIDQ7006787zbMATH OpenFDO

Authors Kyle Celano, Nicholas Sieger, Sam Spiro

Publication date 27 March 2025

Published in Combinatorial Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.5070/C65165026

zbMATH Keywords

Eulerian polynomialsalternating permutationscombinatorial reciprocity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph polynomials (05C31)

Cites work

• scientific article; zbMATH DE number 3165539 (Why is no real title available?)
• A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem.
• A new graph product and its spectrum
• Chromatic quasisymmetric functions of directed graphs
• Combinatorial Reciprocity Theorems
• Counting acyclic and strong digraphs by descents
• Graphical major indices
• Reducibility among combinatorial problems
• The indices of permutations and the derivation therefrom of functions of a single associated with the permutations of any assemblage of objects.
• The writhe of permutations and random framed knots
• Tutte polynomials for directed graphs
• Weighted inversion numbers, restricted growth functions, and standard Young tableaux
• Weighted-inversion statistics and their symmetry groups

This page was built for publication: Eulerian polynomials for digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7006787)