Subsequence numbers and logarithmic concavity

DOI10.1016/0012-365X(76)90140-0zbMath0344.05004MaRDI QIDQ1232409

K. Appert

Publication date: 1976

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10)

Related Items (5)

Algorithms for subsequence combinatorics ⋮ Computing orbits of the automorphism group of the subsequence poset \(B_{ m, n }\) ⋮ On posets of \(m\)-ary words ⋮ Total nonnegativity and (3+1)-free posets ⋮ Subsequence frequency in binary words

Cites Work

• Unnamed Item
• Logarithmic concavity for edge lattices of graphs
• On a unimodal sequence of binomial coefficients
• A note on concavity properties of triangular arrays of numbers
• Chromatic polynomials and logarithmic concavity
• Longest common subsequences of two random sequences

This page was built for publication: Subsequence numbers and logarithmic concavity