Springer Numbers and Arnold Families Revisited

Abstract

For the calculation of Springer numbers (of root systems) of type Bn and Dn, Arnold introduced a signed analogue of alternating permutations, called βn-snakes, and derived recurrence relations for enumerating the βn-snakes starting with k. The results are presented in the form of double triangular arrays (vn,k) of integers, 1 |k| n. An Arnold family is a sequence of sets of such objects as βn-snakes that are counted by (vn,k). As a refinement of Arnold's result, we give analogous arrays of polynomials, defined by recurrence, for the calculation of the polynomials associated with successive derivatives of x and x, established by Hoffman. Moreover, we provide some new Arnold families of combinatorial objects that realize the polynomial arrays, which are signed variants of Andr\'e permutations and Simsun permutations.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…