Mixed Eulerian numbers and beyond
Abstract
We derive explicit formulas for the matroidal mixed Eulerian numbers. We resolve a question posed by Berget, Spink, and Tseng, demonstrating that the invariant defined by matroidal mixed Eulerian numbers is precisely equivalent to Derksen's G-invariant. As an application, we provide the first explicit, non-recursive formula for mixed Eulerian numbers. Our combinatorial approach draws inspiration from the classical work of Schubert and incorporates the cutting-edge contributions of Huh.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.