The LCM-closed sets conjecture

Let NN+\mathcal{N}\subset\mathbb{N}^+ be a finite LCM-closed set, meaning that lcm(m,n)N\operatorname{lcm}(m,n)\in\mathcal{N} whenever m,nNm,n\in\mathcal{N}, and suppose that N\mathcal{N} contains an element different from 11. A divisor larger than 11 is called abundant if it divides at least half of the members of N\mathcal{N}. The LCM-closed sets conjecture. There exists a divisor larger than 11 for a subset of at least half of the members of N\mathcal{N}. This conjecture is equivalent to Frankl's union-closed sets conjecture and has interpretations in graph and lattice theory; it remains open because Frankl's conjecture remains open.

Sources & referencesView supporting material

Primary source

Tom Fischer, “Share at least half the numbers in a nontrivial LCM-closed set a nontrivial divisor?”, arXiv:1808.09247 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.