129 citations · 546 across the 54 of their papers we have counts for
66 papers
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…
Faster Mixing for Triangulations via Transport Flows
Vedat Levi Alev, Daniel Frishberg, Michail Sarantis +1
We prove an bound for the relaxation time and the log-Sobolev time (inverse log-Sobolev constant) of the classical triangulation flip chain on a convex -…
Note on the number of antichains in generalizations of the Boolean lattice
Jinyoung Park, Michail Sarantis, Prasad Tetali
We give a short and self-contained argument that shows that, for any positive integers and with , the number of antichains of t…
On the zeroes of hypergraph independence polynomials
David Galvin, Gwen McKinley, Will Perkins +2
We study the locations of complex zeroes of independence polynomials of bounded degree hypergraphs. For graphs, this is a long-studied subject with applications to statistical phys…
Multi Purpose Routing: New Perspectives and Approximation Algorithms
Majid Farhadi, Jai Moondra, Prasad Tetali +1
The cost due to delay in services may be intrinsically different for various applications of vehicle routing such as medical emergencies, logistical operations, and ride-sharing. W…
Determinant Maximization via Matroid Intersection Algorithms
Adam Brown, Aditi Laddha, Madhusudhan Pittu +2
Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics \cite{pukelsheim2006optimal}, convex geometry \cite{Khach…