Event time:
Friday, October 9, 2026 - 10:00am to 11:00am
Location:
Kline Tower 801
Speaker:
Nicholas Ovenhouse
Speaker affiliation:
University of Texas-Dallas
Event description:
Abstract:
Recently, Liang and Sagan introduced a recipe for giving “combinatorial” proofs of log-concavity and log-convexity results using distributive lattices. In current ongoing work with WonMyeong Cho, we show that their method can be applied to a class of number sequences generalizing the classical Stirling numbers (including a “type-B” analog of Stirling numbers). Our method involves showing that these generalized Stirling numbers count certain kinds of P-partitions, and utilizing the associated distributive lattice structure.