arXiv (All)
open access
A unified approach to infinite log-concavity of combinatorial sequences
We establish a sufficient condition for infinite log-concavity and apply it to five families of combinatorial sequences. We give a new proof of infinite log-concavity for the Boros--Moll coefficient sequences $(d_k(n))_{k=0}^n$ for fixed $n$. For the transposed sequences $(d_\ell(\ell+k))_{k\ge0}$,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Caged subsequences in permutations#793843
- Caged subsequences in permutations#789836
- A combinatorial interpolation between the hypercube and the associahedron#1143057
- Greedy queens and the golden ratio#1106035
- Recursive overlap Bernoulli distributions and an entropy concavity conjecture#972605
Record · ID 1249661
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive