[GAP Forum] minimal members with respect to inclusion

[Benjamin Sambale]

Dear Alexander,

yes, M is a list of sets. Imagine for example a "large" subset of 
Combinations([1..30]). Moreover, M and its elements are mutable.

Meanwhile, I circumvented the problem. However, I guess it would be nice 
to have such a function nevertheless.

Best wishes,
Benjamin

Am 08.08.2013 21:44, schrieb Alexander Konovalov:
> Dear Benjamin,
>
> Could you please tell more details about elements of M? Are they
> lists of integers, or are they actually sets of integers (sorted,
> dense, no duplicates)? Are they immutable? What are the sizes of
> data sets with which you're operating?
>
> Thanks,
> Alexander
>
>
> On 7 Aug 2013, at 12:30, Benjamin <benjamin.sambale at gmail.com> wrote:
>
>> Dear GAP users,
>>
>> suppose we have a list M of lists of integers. Is there a command which computes the set of minimal members of M with respect to inclusion? Of course I could implement such a function, but it would certainly not be very fast.
>>
>> Thanks,
>> Benjamin
>>
>> _______________________________________________
>> Forum mailing list
>> Forum at mail.gap-system.org
>> http://mail.gap-system.org/mailman/listinfo/forum
>