Hi Nicolas,
The list sage-nt was set up to have a lower volume and lower noise
forum
for sage-devel issues with mathematical (number theoretic) interest.
I also don't track sage-combinat for similar reasons as John, and
miss
most of what passes on sage-devel due to the high volume. Maybe
there
On 12 March 2010 14:01, David Kohel drko...@gmail.com wrote:
Hi Nicolas,
The list sage-nt was set up to have a lower volume and lower noise
forum
for sage-devel issues with mathematical (number theoretic) interest.
I also don't track sage-combinat for similar reasons as John, and
miss
On Fri, Mar 12, 2010 at 9:14 AM, John Cremona john.crem...@gmail.com wrote:
On 12 March 2010 14:01, David Kohel drko...@gmail.com wrote:
Hi Nicolas,
The list sage-nt was set up to have a lower volume and lower noise
forum
for sage-devel issues with mathematical (number theoretic) interest.
On 12-Mar-10, at 6:14 AM, John Cremona wrote:
On 12 March 2010 14:01, David Kohel drko...@gmail.com wrote:
Hi Nicolas,
The list sage-nt was set up to have a lower volume and lower noise
forum
for sage-devel issues with mathematical (number theoretic) interest.
I also don't track
Thanks for the pointers everyone.
I was wondering as well about subobjects and quotient objects.
As Rob asks, what does it mean to do them right?
My expectation would be to have a subgroup be the subset with the
same
operation. So if I define P a permutation group in S_n and then
create a
Shameless plug: there is some work in progress in that direction,
providing a standard architecture for implementing a quotient or
subobject A of an existing parent B. I can't promise when it will be
ready for integration into Sage, but we will be using it intensively
soon. In short, the idea
On Mar 9, 4:43 am, Rob Beezer goo...@beezer.cotse.net wrote:
An implementation of finite abelian groups would be at the top of my
list. Folklore has it many have tried - not sure just where it gets
hard.
Just a remark on this: I was one of the ones who tried, at Sage Days
16 last summer
On Wed, Mar 10, 2010 at 09:59:41AM +, John Cremona wrote:
To me combinat is short for combinatorics, which is different from
what I do (number theory, and more generally algebra). I certainly
did not realise when the combinat people joined Sage how useful they
and what they do would be
Hi!
First a quick note: all work on groups and integration with gap
(especially libgap) will be very much appreciated!
On Mon, Mar 08, 2010 at 08:43:25PM -0800, Rob Beezer wrote:
An implementation of finite abelian groups would be at the top of my
list. Folklore has it many have tried
Hi Mike,
First, thanks for your work on this.
An implementation of finite abelian groups would be at the top of my
list. Folklore has it many have tried - not sure just where it gets
hard. Then build the group of units mod n on top of that for its own
sake and as a demonstration of the more
10 matches
Mail list logo