Abstract
We exhibit an analogy between the problem of pushing forward measurable sets under measure preserving maps and linear relaxations in combinatorialoptimization. We show how invariance of hyperfiniteness of graphings under local isomorphism can be reformulated as an infinite version of a natural combinatorial optimization problem, and how one can prove it by extending well-known proof techniques (linear relaxation, greedy algorithm, linear programming duality) from the finite case to the infinite.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.