Hello all-
Anne and I are working on merging some code that implements the
Lenart--Postnikov alcove path model into sage. The algorithm needed a
few features that aren't available in the root_system package, so I
implemented (very basic) versions of what I needed in a temporary file
called
By the way, there is now a package for the chromium browser, and it runs
sage nicely, including jmol applets.
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit
In my own experience, coding with an univariate polynomial is not
efficient especially if the polynomial is sparse. I'm using heapmult
or Lagrange interpolation in giac for polynomials represented as
sparse distributed polynomials, with monomials coded as integers if
they fit. I also experienced
On 12 mei, 01:11, Jason Grout jason-s...@creativetrax.com wrote:
I was wondering if there is any interest in a Sage package to compute
with differential forms.
I am interested. I'm particularly interested in applications to
teaching multivariable calculus.
This raises the interesting
Hi Joris,
Waldek just pointed me to a package by Seiler:
http://axiom-wiki.newsynthesis.org/JetBundles
is that more in line of what you'd like to have?
Martin
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
Hi Bill,
in my own experience Kronecker substitution can be effective in a
number of situations. It would also automatically handle the case you
mention about working only on a subset of variables (i.e., the ones
involved in the multiplication).
I have the description of my implementation and
The registration for
EuroScipyhttp://www.euroscipy.org//conference/euroscipy2010is
finally open.
To register, go to the
websitehttp://www.euroscipy.org//conference/euroscipy2010,
create an account, and you will see a *‘register to the conference’* button
on the left. Follow it to a page which
Hi all,
This is just a short me too note. I am also interested in exterior algebras
and differential forms in Sage, but am wondering how to incorporate these with
Clifford algebras, Dirac operators, and the functional calculus of operators,
especially in relation to the algebraic user
On May 13, 2:45 am, parisse bernard.pari...@ujf-grenoble.fr wrote:
In my own experience, coding with an univariate polynomial is not
efficient especially if the polynomial is sparse.
There must be some kind of inefficiency. If you use word
operations
for all monomial operations then it should
Since this is turning into an all purpose post, I'm going to crosspost
to sci.math.symbolic. I want to start by saying that the heap
method
should be called Johnson's algorithm. See
http://portal.acm.org/citation.cfm?id=1086847
We've made contributions to improve it, but our actual work has
10 matches
Mail list logo
