Enumeration of pairs of permutations and sequences

DOI10.1090/S0002-9904-1974-13554-8zbMATH Open0291.05007OpenAlexW2026607654MaRDI QIDQ4041587FDOQ4041587

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 up-down sequences
• Up-down sequences
• Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
• Simon Newcomb’s Problem
• Enumeration of permutations and sequences with restrictions

Cited In (9)

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