Computer Science/Discrete Mathematics

Given a hypergraph with edges of size at most $3$, the $3$-set cover problem asks to determine the minimum size of a family of edges that covers the vertex set. As the problem is NP-hard, it is natural to consider its fractional (linear programming)...

Random walks on a graph, and Markov chains in general, provide endless fascination and myriad applications (for example, in sampling and approximation algorithms.)  A nearly trivial but endlessly useful tool in this theory is the "harmonic lemma for...