Combinatorics of reductions between equivalence relations
Dan Hathaway, Scott Schneider
TL;DR
This paper explores the combinatorial criteria necessary for different types of reductions between equivalence relations, focusing on conditions for the existence of injective reductions.
Contribution
It provides necessary and sufficient combinatorial conditions for the existence of injective reductions between equivalence relations.
Findings
Identifies combinatorial conditions for reductions
Establishes criteria for injective reductions
Advances understanding of equivalence relation reductions
Abstract
We discuss combinatorial conditions for the existence of various types of reductions between equivalence relations, and in particular identify necessary and sufficient conditions for the existence of injective reductions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · semigroups and automata theory