Explicit expressions for the extremal excedance set statistics

The excedance set of a permutation π = π 1 π 2 ⋯ π k is the set of indices i for which π i > i . We give explicit formulas for the number of permutations whose excedance set is the initial segment { 1 , 2 , … , m } and also of the form { 1 , 2 , … , m , m + 2 } . We provide two proofs. The first is an explicit combinatorial argument using rook placements. The second uses the chromatic polynomial and two variable exponential generating functions. We then recast these explicit formulas as L D U -decompositions of associated matrices and show that these matrices are totally non-negative.