On Sunday, April 1, 2012, Minh Nguyen wrote:
> Hi folks,
>
> It is a fact universally acknowledged that an open source developer
> with an idea is in need of a way to effectively implement the idea.
> Distributed version control systems such as Mercurial, Git, etc. form
> the early stage in the ev
On 2012-04-01, Minh Nguyen wrote:
> Hi folks,
>
> It is a fact universally acknowledged that an open source developer
> with an idea is in need of a way to effectively implement the idea.
> Distributed version control systems such as Mercurial, Git, etc. form
> the early stage in the evolution of
Hi folks,
It is a fact universally acknowledged that an open source developer
with an idea is in need of a way to effectively implement the idea.
Distributed version control systems such as Mercurial, Git, etc. form
the early stage in the evolution of processes of software development.
The major
On Mar 31, 5:14 pm, "john.hoebing" wrote:
> sage: a=diff(f,x,x)+diff(f,x)/x
> sage: str(a)
> 'D[0](f)(x, y)/x + D[0, 0](f)(x, y)'
If I understand correctly, you would like to be able to put the above
string into sage and get the expression back? That is of course a very
reasonable goal. The class
After a day spent trying to implement a workaround for a special case
of this issue:
http://trac.sagemath.org/sage_trac/ticket/6480
I thought it would be a good time to review the status of some of the
earlier issues with how we represent ordinary (partial) derivatives.
Most relevant is this old
Now that I look through
http://physics.nist.gov/cuu/Constants/RevModPhys_80_000633acc.pdf, I've
decided not to implement uncertainty (except as an attribute of the
constant object), since taking into account the correlation coefficient
between any two constants is more difficult than I thought
On Sat, Mar 31, 2012 at 9:35 PM, leif wrote:
> On 31 Mrz., 22:13, Volker Braun wrote:
>> On Saturday, March 31, 2012 7:11:23 PM UTC+1, kcrisman wrote:
>>
>> > therefore lack the “structural beauty” of the Mathematica® language.
>>
>> Well-placed irony quotation marks!
>
> :-)
>
> "The core of Mat
At #12787, I have a fix for the R spkg which uses -### instead of -v to
detect the linker options used by gcc/gfortran. Using -### is
recommended by the GCC manual to do this.
This fix allows building a 32-bit version of R on 64-bit operating systems.
More information can be found on the upstrea
On 31 Mrz., 22:13, Volker Braun wrote:
> On Saturday, March 31, 2012 7:11:23 PM UTC+1, kcrisman wrote:
>
> > therefore lack the “structural beauty” of the Mathematica® language.
>
> Well-placed irony quotation marks!
:-)
"The core of Mathics is and shall remain independent of Sage, as it
adds a
On Saturday, March 31, 2012 7:11:23 PM UTC+1, kcrisman wrote:
>
> therefore lack the “structural beauty” of the Mathematica® language.
Well-placed irony quotation marks!
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sa
Granted that it seems to use a lot of Sympy and has a much more Mma-
like syntax, I can see a definite niche for this. The server
currently works fine. Why it isn't called something that makes its
connection with Sympy clearer? I see a lot about Sage, but not too
much about Sympy or mpmath. May
On 2012-03-31, Daniel Krenn wrote:
> At the moment networkx-1.2.p2.spkg is included in Sage. Networkx 1.2 is
> now over 20 month old and networkx 1.6 is available. Does anyone plan
> upgrading this?
>
> Background: I wanted to implement Bellman-Ford algorithm (finding
> (shortest) paths in weighte
On 31 Mrz., 18:44, leif wrote:
> On 31 Mrz., 18:18, Daniel Krenn wrote:
>
> > Am 2012-03-31 18:04, schrieb Daniel Krenn:
>
> > > Am 2012-03-31 17:41, schrieb John Cremona:
> > >> On 31 March 2012 16:36, Jason Grout wrote:
> > >>>http://www.mathics.org/
> > >>> [...]
> > >>> Does anyone know thes
On 31 Mrz., 19:05, Daniel Krenn wrote:
> At the moment networkx-1.2.p2.spkg is included in Sage. Networkx 1.2 is
> now over 20 month old and networkx 1.6 is available. Does anyone plan
> upgrading this?
>
> Background: I wanted to implement Bellman-Ford algorithm (finding
> (shortest) paths in wei
I at least know that the creator of that project has a sage trac account.
--
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 this group at http://groups.google.com
At the moment networkx-1.2.p2.spkg is included in Sage. Networkx 1.2 is
now over 20 month old and networkx 1.6 is available. Does anyone plan
upgrading this?
Background: I wanted to implement Bellman-Ford algorithm (finding
(shortest) paths in weighted graphs which can have negative weights).
Ther
On 31 Mrz., 18:18, Daniel Krenn wrote:
> Am 2012-03-31 18:04, schrieb Daniel Krenn:
>
> > Am 2012-03-31 17:41, schrieb John Cremona:
> >> On 31 March 2012 16:36, Jason Grout wrote:
> >>>http://www.mathics.org/
> >>> [...]
> >>> Does anyone know these people?
> >> Perhaps someone should email him
Am 2012-03-31 18:04, schrieb Daniel Krenn:
> Am 2012-03-31 17:41, schrieb John Cremona:
>> On 31 March 2012 16:36, Jason Grout wrote:
>>> http://www.mathics.org/
>>> [...]
>>> Does anyone know these people?
>> Perhaps someone should email him and ask why he doesn't just join Sage ?
> I know him. H
Am 2012-03-31 17:41, schrieb John Cremona:
> On 31 March 2012 16:36, Jason Grout wrote:
>> I just ran across this project, which provides an online CAS with
>> Mathematica syntax, but says they use sympy and Sage as backends:
>>
>> http://www.mathics.org/
>>
>> Try the demo here:
>>
>> http://www.
On 31 March 2012 16:36, Jason Grout wrote:
> I just ran across this project, which provides an online CAS with
> Mathematica syntax, but says they use sympy and Sage as backends:
>
> http://www.mathics.org/
>
> Try the demo here:
>
> http://www.mathics.net/ (click on the "demo" down at the bottom
I just ran across this project, which provides an online CAS with
Mathematica syntax, but says they use sympy and Sage as backends:
http://www.mathics.org/
Try the demo here:
http://www.mathics.net/ (click on the "demo" down at the bottom to see
some examples)
Does anyone know these people?
Yes, I know. But it's not implemented as Sage objects.
--
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 this group at http://groups.google.com/group/sage-devel
U
Simon,
Many thanks for your patient answers.
> > However if all coercion maps involved are injective then
> > can't I expect == to be preserved?
>
> Why do you think that all coercions are injective? The coercion from ZZ
> to GF(2) is certainly not injective.
I meant not that all coercions were
On 3/31/12 8:31 AM, Simon King wrote:
Hi!
On 2012-03-31, Jason Grout wrote:
On 3/31/12 5:05 AM, William Stein wrote:
The thread started with "For anyone interested in working with the
sage cell server, we've made an experimental spkg ".
I think nobody is talking about standard packages inclu
Hi!
On 2012-03-31, Jason Grout wrote:
> On 3/31/12 5:05 AM, William Stein wrote:
>
>> The thread started with "For anyone interested in working with the
>> sage cell server, we've made an experimental spkg ".
>> I think nobody is talking about standard packages included in Sage here.
>
> That's r
On 3/31/12 5:05 AM, William Stein wrote:
The thread started with "For anyone interested in working with the
sage cell server, we've made an experimental spkg ".
I think nobody is talking about standard packages included in Sage here.
That's right. The motivation for this spkg is two students
Scroll back in this discussion. The math/arithmetic problems, other than
getting good symbolic expression, have been solved in the "uncertainties"
package ( http://pypi.python.org/pypi/uncertainties/) you mentioned before.
Jonathan
On Friday, March 30, 2012 7:11:20 PM UTC-5, Eviatar wrote:
>
>
On Sat, Mar 31, 2012 at 11:00 AM, Simon King wrote:
> Hi!
>
> On 30 Mrz., 07:40, Jason Grout wrote:
>> On 3/30/12 12:28 AM, Dima Pasechnik wrote:
>> > is there any real reason to include MathJax?
>> > MathJax works reasonably well when it pulls
>> > everything needed from the web.
>> > I would ra
Hi!
On 30 Mrz., 07:40, Jason Grout wrote:
> On 3/30/12 12:28 AM, Dima Pasechnik wrote:
> > is there any real reason to include MathJax?
> > MathJax works reasonably well when it pulls
> > everything needed from the web.
> > I would rather see it as an optional package.
>
> Our purpose is to make
Hi!
On 31 Mrz., 09:37, Simon King wrote:
> * I suggest to override the fraction_field() method for polynomial rings.
No, sorry, that was stupid (I had been in a hurry and couldn't think
properly). Of course the Laurent polynomial ring is not isomorphic to
the fraction field of a polynomial ring
Hi Mark,
On 2012-03-31, Mark Shimozono wrote:
> However if all coercion maps involved are injective then
> can't I expect == to be preserved?
Why do you think that all coercions are injective? The coercion from ZZ
to GF(2) is certainly not injective.
Generally, it is required that coercions are
31 matches
Mail list logo
