Generalizations of Terquem's problem

DOI10.1016/S0021-9800(69)80052-9zbMath0181.02103OpenAlexW1991193431MaRDI QIDQ5570947

Morton Abramson, W. O. J. Moser

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

Related Items (11)

Alternating subsets and permutations ⋮ Counting inversion sequences by parity successions and runs ⋮ Parity successions in set partitions ⋮ Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope ⋮ Parity-alternating permutations and successions ⋮ Alternating subsets modulo \(m\) ⋮ The enumeration of generalised alternating subsets with congruences ⋮ Analytic methods applied to a sequence of binomial coefficients ⋮ 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

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