Thanks a lot Simon. Just trying to get my head around it now in order
to compare it to my problem, I need to convert the finite field part into
simple language that I can understand ...
Kind regards
Gary
On Wed, Apr 24, 2013 at 10:53 AM, Simon King simon.k...@uni-jena.de wrote:
Hi Gary,
Hell everybody !!!
I'm sorry to answer this late but I don't always read the sage-combinat
posts ^^;
Well, here's the thing if you did not work it out already :
With Sage's MILP support, you will be able to answer easily those two
questions :
Is there a subcollection
Dear Simon
I kind-of went quiet on this because Nicolas was way ahead of me :)
but (obviously only if you have time) I would be fascinated to hear how you
resolve this because I have some not dissimilar problems in finite field
vector spaces which may benefit from the techniques (see for
On Tue, Apr 16, 2013 at 09:09:19AM +, Simon King wrote:
On 2013-04-16, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote:
For non exact covers, this can be formulated straightforwardly as a
Mixed Integer Linear Program (MILP): take a 0-1 variable y_S for each
set S, and an inequation
Hi Simon
I'm struggling a little to understand what the programming bottleneck is in
all this. Clearly you do not want a completely naive search as you said
above; but are the 'tests' of the f_i on each m expensive in time, and is
the proof of the zero-dimensionality of the ideal also a slow
Hi Simon, Nathann,
On Mon, Apr 15, 2013 at 11:17:14AM +, Simon King wrote:
On 2013-04-15, Simon King simon.k...@uni-jena.de wrote:
I have a finite set X and a set S of subsets of X. I'd like to get a
list (or better: an iterator) of all subsets U of S (i.e., subsets of
subsets)
