Enumeration of pairs of permutations and sequences

DOI10.1090/S0002-9904-1974-13554-8MaRDI QIDQ4041587zbMATH OpenOpenAlexFDO

Authors Richard Scoville, Theresa P. Vaughan, Leonard Carlitz

Publication date 1974

Published in Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0002-9904-1974-13554-8

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Elementary theory of partitions (11P81)

Cites work

• Enumeration of permutations and sequences with restrictions
• Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
• Enumeration of up-down sequences
• Simon Newcomb’s Problem
• Up-down sequences

Cited in

(10)

• Enumeration of arrays by column rises
• Binomial posets, Möbius inversion, and permutation enumeration
• Segre and Rees products of posets, with ring-theoretic applications
• Bijective enumerations of \(\Gamma\)-free \(0\)-\(1\) matrices
• Combinatorics of non-ambiguous trees
• Dual braid monoids, Mikado braids and positivity in Hecke algebras
• Heaps and two exponential structures
• Infinite series involving skew harmonic numbers
• Permutations and words counted by consecutive patterns
• Combinatorics of normal sequences of braids

This page was built for publication: Enumeration of pairs of permutations and sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4041587)