4 papers
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…
Counting cliques with prescribed intersection sizes
Yuhao Zhao, Xiande Zhang
We study the generalized Turán problem regarding cliques with restricted intersections, which highlights the motivation from extremal set theory. Let $L=\{\ell_1,\dots,\ell_s\}\su…
On low-power error-correcting cooling codes with large distances
Yuhao Zhao, Xiande Zhang
A low-power error-correcting cooling (LPECC) code was introduced as a coding scheme for communication over a bus by Chee et al. to control the peak temperature, the average power c…
Focal-free uniform hypergraphs and codes
Xinqi Huang, Chong Shangguan, Xiande Zhang +1
Motivated by the study of a variant of sunflowers, Alon and Holzman recently introduced focal-free hypergraphs. In this paper, we show that there is an interesting connection betwe…