#16553: Clean IncidenceStructure
-------------------------------------+-------------------------------------
Reporter: vdelecroix | Owner:
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-6.3
Component: combinatorial | Resolution:
designs | Merged in:
Keywords: | Reviewers:
Authors: Nathann Cohen, | Work issues:
Vincent Delecroix | Commit:
Report Upstream: N/A | a5c4dbc9d1b77315d90dd3dd7a8ccea780f59ecf
Branch: public/16553 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by ncohen):
> Why not? It is well defined as soon as `t` is assumed to be smaller than
the block size. Note that if you have a t-(v,k,lambda) design it is also a
s-(v,k,lambda_s) design with
> {{{
> lambda_s = lambda binomial(v-s,t-s) / binomial(k-s,t-s).
> }}}
> (Handbook theorem II.4.8)
>
> I think that we should forbid lambda=0, that's all.
Hmmmmmm... Makes total sense, sorry `O_o`
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16553#comment:23>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
