Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences

2025/03/02 by Leake, Jonathan, Lindberg, Kasper, Gharan, Shayan Oveis · 1 citation
#Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics

paper · doi:10.48550/arxiv.2503.01005

Abstract

Let X be a d-partite d-dimensional simplicial complex with parts T₁,…,T_d and let μ be a distribution on the facets of X. Informally, we say (X,μ) is a path complex if for any i

Cited by

• Trickle-down Theorems via C-Lorentzian Polynomials II: Pairwise Spectral Influence and Improved Dobrushin's Condition

Related

• An Improved Trickle-Down Theorem for Partite Complexes
• Markov chains, CAT(0) cube complexes, and enumeration: monotone paths in a strip mix slowly
• Trickle-down Theorems via C-Lorentzian Polynomials II: Pairwise Spectral Influence and Improved Dobrushin's Condition
• Distributions of bounded real sequences and Astorg-Boc Thaler's question
• Log-concave polynomials II: High-dimensional walks and an FPRAS for counting bases of a matroid