#17662: Evenly distributed sets
-------------------------------------+-------------------------------------
Reporter: vdelecroix | Owner:
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-6.5
Component: combinatorial | Resolution:
designs | Merged in:
Keywords: | Reviewers:
Authors: Vincent Delecroix | Work issues:
Report Upstream: N/A | Commit:
Branch: public/17662 | 87eea8dce29ccb3e8eda0d35e982ac4352aa5179
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
Hello,
> Yes, easy: $(ax+b) - (ax'+b) = a(x-x')$. So the cosets of the
differences `x-x'` are just permuted by the multiplication by `a`. Because
the condition is "hit each of them twice", it is invariant under
permutation.
Oh, of course `XD`
> Will write it.
Thanks
> - I have a commit with much cleaner/better branch cut, am I free to add
it now?
If it makes the code simpler and easier, yes. If it makes it more
efficient but more complicated, then in another ticket please.
> - I can get rid of `sage.ratio` by reorganizing `self.list_K` into
`[x^i for i in range(self.q-1)]`. That way the ratio would just be
`(x-y)%(q-1)`. Do you think it would be better?
In terms of perf I have no idea. If you do this replacement please comment
such lines with their meaning in term of groups element like `i-j #
x^i/x^j`.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17662#comment:18>
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.
