Inductive and injective proofs of log concavity results
From MaRDI portal
Publication:1111553
DOI10.1016/0012-365X(88)90120-3zbMath0658.05003WikidataQ114215634 ScholiaQ114215634MaRDI QIDQ1111553
Publication date: 1988
Published in: Discrete Mathematics (Search for Journal in Brave)
05A10: Factorials, binomial coefficients, combinatorial functions
Related Items
Preservation of log-concavity on summation, On the q-log-concavity of Gaussian binomial coefficients, Reduced matrices and q-log-concavity properties of q-Stirling numbers, Combinatorial proofs of inverse relations and log-concavity for Bessel numbers, Seven (lattice) paths to log-convexity, The average number of block interchanges needed to sort a permutation and a recent result of Stanley, Inductive proofs of \(q\)-log concavity, \(q\)-analogs of the inclusion-exclusion principle and permutations with restricted position, Whitney numbers of some geometric lattices, A combinatorial proof of the log-concavity of the numbers of permutations with \(k\) runs, Proof of conjecture of Ehrenborg and Steingrímsson on excedance statistic, Polynomials with real zeros and Pólya frequency sequences, Inequalities between elementary symmetric functions: Applications to the log-concavity problems, On the log-convexity of combinatorial sequences, Logarithmic behavior of some combinatorial sequences, Unimodal Polynomials Arising from Symmetric Functions, A Unimodality Result in the Enumeration of Subgroups of a Finite Abelian Group, Log Concave Sequences of Symmetric Functions and Analogs of the Jacobi-Trudi Determinants, Expansions of Chromatic Polynomials and Log-Concavity
Cites Work
- Unnamed Item
- On log concavity for order-preserving maps of partial orders
- Binomial determinants, paths, and hook length formulae
- Two combinatorial applications of the Aleksandrov-Fenchel inequalities
- A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
- A Unimodality Result in the Enumeration of Subgroups of a Finite Abelian Group
- A Unified Setting for Selection Algorithms (II)
- Combinatorial applications of an inequality from statistical mechanics
