Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

3
  • $\begingroup$ "I could eliminate the duplicates, but that still requires calculating the full list of nonunique results as an intermediate step, which I expect to be many orders of magnitude longer than the unique results. Is it possible to get the result I'm after without having to cull a humongously longer list first to get there?" $\endgroup$ Commented Apr 9, 2020 at 6:33
  • $\begingroup$ the second approach does not give the full list of subsets. Take, for example, theSet = {a, a, b, c, c, c, d}. $\endgroup$ Commented Apr 9, 2020 at 8:33
  • $\begingroup$ Yes, I agree. I think in this case one needs in addition to construct some subsets of list of different elements. $\endgroup$ Commented Apr 9, 2020 at 8:42