Log-concavity and strong $q$-log-convexity for some generalized triangular arrays
Rezig Boualam, Moussa Ahmia

TL;DR
This paper establishes criteria for log-concavity and strong q-log-convexity in generalized triangular arrays, and proves that the bi^s-nomial transformation preserves these properties, advancing understanding of their combinatorial structures.
Contribution
It introduces new criteria for log-concavity and strong q-log-convexity in generalized triangles and shows the bi^s-nomial transformation preserves these properties.
Findings
Criteria for log-concavity of rows in generalized triangles
Criteria for strong q-log-convexity of generating functions
Bi^s-nomial transformation preserves both properties
Abstract
In this paper, we provide criteria for the log-concavity of rows and the strong -log-convexity of the generating functions of rows in more generalized triangles. Additionally, we prove that the binomial transformation not only preserves the strong -log-convexity property but also preserves the strong -log-concavity property.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · graph theory and CDMA systems · Optimization and Packing Problems
