Isomorphism in Union-Closed Sets
Combinatorics
2025-09-22 v3
Abstract
We prove that for any isomorphism between pure union-closed families, there exists a hyperisomorphism such that , for all . Since every union-closed family forms a lattice under inclusion, this result establishes a strong connection between the two frameworks. More precisely, any such family can be uniquely reconstructed from its lattice up to isomorphism. Hence, the lattice representation provides a faithful encoding, offering a perspective that may yield new insights into problems on union-closed families, including Frankl's union-closed sets conjecture.
Cite
@article{arxiv.2501.02637,
title = {Isomorphism in Union-Closed Sets},
author = {M. J. Moghaddas Mehr},
journal= {arXiv preprint arXiv:2501.02637},
year = {2025}
}
Comments
12 pages, 1 figures