1 citations · 1 across the 8 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.CO2026
On Counting Independent Sets in Regular Hypergraphs
Michail Sarantis, Prasad Tetali, Zeyu Zheng
Balogh, Bollobás and Narayanan conjectured that among all finite simple -uniform -regular hypergraphs, the number of weak independent sets is maximized by a natural quasi-bip…
math.CO2026
Sampling from the antiferromagnetic Ising model on bipartite, regular expander graphs
Anna Geisler, Mihyun Kang, Michail Sarantis +1
The antiferromagnetic Ising model samples subsets of vertices of a graph with weight decaying exponentially in the number of edges induced. We study the problem of sampling from th…
math.CO2026
On the number of antichains in
Matthew Jenssen, Jinyoung Park, Michail Sarantis
We provide precise asymptotics for the number of antichains in the poset , answering a question of Sapozhenko. Finding improved estimates for this number was also a pr…