Implementing Florian Hess' article in Sage would be vey
welcome, and I'm sure that Florian (or I for that matter)
would be happy to given input.
--David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this
Dear Francisco,
On 28 Feb., 19:38, Francisco Veach wrote:
...
> I'm of course still interested in hearing more
> suggestions, and I appreciate the ones that have already come in so
> far.
There is something that I would like to use in my work: Symmetric
Ideals in a polynomial ring R with counta
Thanks very much for this article. The implementation of this
algorithm is a good candidate for the semester project, and the other
recommendations look like excellent mini-projects to acquaint myself
with the system. I'm of course still interested in hearing more
suggestions, and I appreciate the
On Sat, Feb 28, 2009 at 1:08 AM, Kwankyu wrote:
>
> Regarding (2), you may start with Florian Hess' paper "Computing
> Riemann-Roch spaces in algebraic function fields and related topics"
> in the Journal of Symbolic Computation, vol 11, 2001, which describes
> an algorithm, which, I guess, is i
Regarding (2), you may start with Florian Hess' paper "Computing
Riemann-Roch spaces in algebraic function fields and related topics"
in the Journal of Symbolic Computation, vol 11, 2001, which describes
an algorithm, which, I guess, is implemented in Magma.
--~--~-~--~~~-
I'm not a mathematician, but a good idea could be improving Piecewise functions.
Ronan
Em Qua, 2009-02-25 às 14:38 -0600, Francisco Veach escreveu:
> I'm planning a semester-long project for the fall that will involve
> implementing/improving algebra related functions of Sage. I'm taking
> this
On Wed, Feb 25, 2009 at 4:34 PM, Rob Beezer wrote:
>
> Francisco,
>
> When I work with undergraduate students, I stick to permutation groups
> in Sage since they are more concrete. When you compute a quotient
> group what you get back is a permutation group that is isomorphic to
> the quotient,
Francisco,
When I work with undergraduate students, I stick to permutation groups
in Sage since they are more concrete. When you compute a quotient
group what you get back is a permutation group that is isomorphic to
the quotient, e.g.
G=SymmetricGroup(5)
H=AlternatingGroup(5)
G.quotient_group
A couple of ideas:
(1) I think group rings are only partially implemented. In other words,
if R is a commutative ring, such as ZZ or a finite field say, and
G is a finite group, implement more methods for R[G]. There aren't
many methods implemented for it yet (these would be useful for coding
the
On Wed, Feb 25, 2009 at 12:38 PM, Francisco Veach wrote:
>
> I'm planning a semester-long project for the fall that will involve
> implementing/improving algebra related functions of Sage. I'm taking
> this time now and in the summer to familiarize myself with the
> internals so that I can have a
10 matches
Mail list logo
