2 papers
math.CO2026
A Hypergraph Container Method for Spread SAT: Approximation and Speedup
Zicheng Han, Yupeng Lin, Jie Ma +1
We develop a hypergraph container method for the Boolean Satisfiability Problem (SAT) via the newly developed container results [Campos and Samotij (2026)]. This provides an explic…
math.CO2024
Undecidability of polynomial inequalities in tournaments
Hao Chen, Yupeng Lin, Jie Ma +1
Many fundamental problems in extremal combinatorics are equivalent to proving certain polynomial inequalities in graph homomorphism densities. In 2011, a breakthrough result by Hat…