Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given a set Un = {1,..,n}, a collection M of subsets of Un#R##N#that is closed under intersection and contains Un is known as a Moore#R##N#family. The set of Moore families for a fixed n is in bijection with the#R##N#set of Moore co-families (union-closed families containing the empty set)#R##N#denoted itself Mn.  follows the work initiated in [7] and [8]#R##N#about the recursive decomposition of the lattice of Moore co-families.#R##N# first show that each Moore co-family can be represented by a decomposition#R##N#tree and  use this principle to design an original algorithm#R##N#to close under union any given family. Then  discuss about the time#R##N#complexity and give some experimental results.
['Pierre Colomb', 'Alexis Irlande', 'Olivier Raynaud', 'Yoan Renaud']
I am writing a research paper on a idea A closure algorithm using a recursive decomposition of the set of Moore co-families
[{"from": "human", "value": "I am writing a research paper on a idea A closure algorithm using a recursive decomposition of the set of Moore co-families"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given a set Un = {1,..,n}, a collection M of subsets of Un#R##N#that is closed under intersection and contains Un is known as a Moore#R##N#family. The set of Moore families for a fixed n is in bijection with the#R##N#set of Moore co-families (union-closed families containing the empty set)#R##N#denoted itself Mn.  follows the work initiated in [7] and [8]#R##N#about the recursive decomposition of the lattice of Moore co-families.#R##N# first show that each Moore co-family can be represented by a decomposition#R##N#tree and  use this principle to design an original algorithm#R##N#to close under union any given family. Then  discuss about the time#R##N#complexity and give some experimental results."}]