Generalizations of Terquem's problem

DOI10.1016/S0021-9800(69)80052-9MaRDI QIDQ5570947zbMATH OpenOpenAlexFDO

Authors W. O. J. Moser, Morton Abramson

Publication date 1969

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0021-9800(69)80052-9

zbMATH Keywords

combinatorics

Cited in

(11)

• The enumeration of generalised alternating subsets with congruences
• Analytic methods applied to a sequence of binomial coefficients
• Parity-alternating permutations and successions
• Parity successions in set partitions
• Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope
• Counting inversion sequences by parity successions and runs
• A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems
• A Formal Calculus for the Enumerative System of Sequences-II. Applications
• A Formal Calculus for the Enumerative System of Sequences-III. Further Developments
• Alternating subsets and permutations
• Alternating subsets modulo m

This page was built for publication: Generalizations of Terquem's problem

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