AbstractThe number of alternating permutations with specified peak set is calculated. A recent result of J. Rosen (J. Comb. Theory, Ser. A 20 (1976), 377) on the tangent numbers is shown to be a simple consequence of this calculation. Furthermore, the companion result for the secant numbers is proved
AbstractA permutation is called parity alternating if its entries assume even and odd integers alter...
AbstractWe introduce the notion of crossings and nestings of a permutation. We compute the generatin...
AbstractWe give simple combinatorial proofs of some formulas for the number of factorizations of per...
AbstractThe number of alternating permutations with specified peak set is calculated. A recent resul...
Dedicated to Reza Khosrovshahi on the occasion of his 70th birthday.A permutation a1a2 · · · an of 1...
Permutations as combinatorial objects will be the basis for this paper. Two of their most basic attr...
AbstractWe use the theory of symmetric functions to enumerate various classes of alternating permuta...
AbstractLet a=(α1, α2, α3, …) be a sequence of positive integers. The sequence (c1, c2, …, c3) is a-...
AbstractA classical result of Euler states that the tangent numbers are an alternating sum of Euleri...
AbstractIt is shown that a collection of circular permutations of length three on an n-set generates...
AbstractWe find a formula for the number of permutations of [n] that have exactly s runs up and down...
AbstractUp-down permutations, introduced many years ago by André under the name alternating permutat...
AbstractWe show that a number of problems involving the enumeration of alternating subsets of intege...
AbstractThe Baxter permutations who are alternating and whose inverse is also alternating are shown ...
International audienceA classical result of Euler states that the tangent numbers are an alternating...
AbstractA permutation is called parity alternating if its entries assume even and odd integers alter...
AbstractWe introduce the notion of crossings and nestings of a permutation. We compute the generatin...
AbstractWe give simple combinatorial proofs of some formulas for the number of factorizations of per...
AbstractThe number of alternating permutations with specified peak set is calculated. A recent resul...
Dedicated to Reza Khosrovshahi on the occasion of his 70th birthday.A permutation a1a2 · · · an of 1...
Permutations as combinatorial objects will be the basis for this paper. Two of their most basic attr...
AbstractWe use the theory of symmetric functions to enumerate various classes of alternating permuta...
AbstractLet a=(α1, α2, α3, …) be a sequence of positive integers. The sequence (c1, c2, …, c3) is a-...
AbstractA classical result of Euler states that the tangent numbers are an alternating sum of Euleri...
AbstractIt is shown that a collection of circular permutations of length three on an n-set generates...
AbstractWe find a formula for the number of permutations of [n] that have exactly s runs up and down...
AbstractUp-down permutations, introduced many years ago by André under the name alternating permutat...
AbstractWe show that a number of problems involving the enumeration of alternating subsets of intege...
AbstractThe Baxter permutations who are alternating and whose inverse is also alternating are shown ...
International audienceA classical result of Euler states that the tangent numbers are an alternating...
AbstractA permutation is called parity alternating if its entries assume even and odd integers alter...
AbstractWe introduce the notion of crossings and nestings of a permutation. We compute the generatin...
AbstractWe give simple combinatorial proofs of some formulas for the number of factorizations of per...
DOI
Add to ORKG