Enumeration of pairs of permutations and sequences

DOI10.1090/S0002-9904-1974-13554-8zbMath0291.05007OpenAlexW2026607654MaRDI QIDQ4041587

Theresa P. Vaughan, Richard Scoville, 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) Elementary theory of partitions (11P81) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items

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

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
• Up-down sequences
• Simon Newcomb’s Problem