A combinatorial proof of an identity involving Eulerian numbers

Abstract

We give a combinatorial proof of an identity that involves Eulerian numbers and was obtained algebraically by Brenti and Welker (2009). To do so, we study alcoved triangulations of dilated hypersimplices. As a byproduct, we describe the dual graph of the triangulation in the case of the standard simplex, conjecture its structure for general hypersimplices, and prove combinatorially that the Eulerian numbers coincide with the normalized volumes of the hypersimplices.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…