Subsequence numbers and logarithmic concavity

DOI10.1016/0012-365X(76)90140-0MaRDI QIDQ1232409zbMATH OpenFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3777562 (Why is no real title available?)
• A note on concavity properties of triangular arrays of numbers
• Chromatic polynomials and logarithmic concavity
• Logarithmic concavity for edge lattices of graphs
• Longest common subsequences of two random sequences
• On a unimodal sequence of binomial coefficients

Cited in

(5)

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

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

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