I found all the old cpp stuff I had and put it at
https://sourceforge.net/projects/egut/files/oldCppStuff.tar.gz/download
It's less than I thought. Either I've lost some files or just didn't
remember correctly the stage the project was at when my former student
convinced me we ought to switch o
Aah. Well, some of this stuff was actually written in C++ and then
rewritten in Java. It might make more sense to just look for the old C++
implementation instead.
On Wednesday, January 11, 2017 at 3:11:36 AM UTC-5, Travis Scrimshaw wrote:
>
>
>>
>>
It's not clear that this desire to do s
>
>
>>> It's not clear that this desire to do something general is that well
>>> grounded in practical applications. In my old java project I implemented
>>> only the five simply connected exceptional groups and mostly got by just
>>> fine. Still, that was the idea. I noticed that reductive Ka
On Sunday, January 8, 2017 at 3:43:27 AM UTC-5, Travis Scrimshaw wrote:
>
> Hey Joe,
>Sorry for the delayed response (I've been traveling the past few days).
>>
>>
>> Sorry for posting and then disappearing for a bit. Thanks for your
>> answers. I will be very happy to have your help with th
On Wednesday, January 4, 2017 at 9:00:19 PM UTC, Joseph Hundley wrote:
>
> Hi Travis and David,
>
> Sorry for posting and then disappearing for a bit. Thanks for your
> answers. I will be very happy to have your help with the project to the
> extent that you have time, and even just any quick
Hey Joe,
Sorry for the delayed response (I've been traveling the past few days).
>
>
> Sorry for posting and then disappearing for a bit. Thanks for your
> answers. I will be very happy to have your help with the project to the
> extent that you have time, and even just any quick suggestions a
Hi Travis and David,
Sorry for posting and then disappearing for a bit. Thanks for your answers.
I will be very happy to have your help with the project to the extent that
you have time, and even just any quick suggestions and advice.
My thinking was to do something that would cover arbitrary
Hey Joseph,
There is currently a fair amount implemented with root systems:
sage: Phi = RootSystem(['A',2])
sage: P = Phi.root_lattice()
sage: Q = Phi.root_lattice()
sage: P = Phi.weight_lattice()
sage: al = Q.simple_roots()
sage: al[1]
alpha[1]
sage: al[1].weyl_action([1,2,1])
-alpha[2]
sage:
I'm interested in helping out with this project. Julian Rüth, Xavier
Caruso and I are working on p-adics on the Sage IRC channel (
http://www.sagemath.org/help-irc.html) at 4pm EST (10pm CET) today. If you
want to log in and chat about character lattices for a bit I'd be happy to
share ideas.
I'
I'm playing around with implementing Based Root Data, with an eye towards
eventually implementing groups attached to them.
So, I need to instantiate the character and cocharacter lattices; they need
to be free Z-modules with an action of the relevant Weyl group. In other
words they are Z[W]-mod
10 matches
Mail list logo
