On 23 Mai, 08:15, Rob Beezer goo...@beezer.cotse.net wrote:
Based on some limited testing - just editing the text version of a
worksheet - would indicate that jsMath does not want to deal with
\newline or \\ to break lines. With no better idea, I was able to use
HTML paragraph tags to get two
On 22 Mai, 13:17, Dr. David Kirkby david.kir...@onetel.net wrote:
On 05/22/10 03:24 AM, Nathan O'Treally wrote:
On 21 Mai, 19:42, Robert Bradshawrober...@math.washington.edu
wrote:
Please let us know if you run into *any* examples of this--our goal is
to always produce standard compliant
On 22 Mai, 14:08, geep999 peter.graham.gard...@googlemail.com wrote:
Hi,
1/ Trying to build Sage from source fails on Slackware 13.0 x86_64.
Linux 2.6.29.6 #3 SMP Mon Dec 7 15:01:06 CST 2009 x86_64 Intel(R)
Core(TM)2 Duo CPU E6550 @ 2.33GHz GenuineIntel GNU/Linux
gcc (GCC) 4.3.3. 4GB RAM.
Oops, try building without -j4 (i.e., sequential)
-Leif
--
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
On 21 Mai, 19:42, Robert Bradshaw rober...@math.washington.edu
wrote:
Please let us know if you run into *any* examples of this--our goal is
to always produce standard compliant C89 or C++ code (or C99 if the
user has requested C99 complex support). Of course most Cython users
are using
On 18 Mai, 14:48, Paul Leopardi paul.leopa...@iinet.net.au wrote:
Hi all,
OK. I have now run make again, this time with
unset SAGE_CHECK
unset SAGE64
The build apparently completes, but dochtml.log still has much the same error
messages:
---
sphinx-build -b html -d
On 19 Mai, 22:59, Nathan O'Treally not.rea...@online.de wrote:
On 18 Mai, 14:48, Paul Leopardi paul.leopa...@iinet.net.au wrote:
(sage/rings/padics/padic_capped_relative_element.c:17903)
ImportError: /home/leopardi/src/Sage/sage-4.4.1/local/lib/python2.6/site-
packages/sage/rings/padics
On 19 Mai, 23:22, Mike Hansen mhan...@gmail.com wrote:
On Wed, May 19, 2010 at 2:19 PM, Nathan O'Treally not.rea...@online.de
wrote:
__gmpz_cmp is just the *first* symbol (from libgmp) that can't be
resolved.
(The reason this though works on other systems is just how/where the
linker
On 20 Mai, 02:59, Paul Leopardi paul.leopa...@iinet.net.au wrote:
Thanks Nathan, Mike,
I appliedhttp://trac.sagemath.org/sage_trac/attachment/ticket/8844/trac_8844-
module_list.patch to $SAGE_ROOT/devel/sage-main/module_list.py.
What do I now need to do to re-build sage without starting from
On 16 Mai, 14:37, Georg S. Weber georgswe...@googlemail.com wrote:
2. Symmetrica
Having a look at an install log of a successful build of the
Symmetrica spkg shows that some of the warnings are to be expected,
some not. From the logs (gcc -v Using built-in specs. Target: x86_64-
suse-linux
On 15 Mai, 19:52, Dr. David Kirkby david.kir...@onetel.net wrote:
I think the biggest thing this proves is just how poorly that NIST table was
put
together.
Ask them for founding a better one compiled by you... ;-)
I think a huge table of Mathematica/MATLAB/Sage/Magma equivalent functions
On 15 Mai, 21:21, Dr. David Kirkby david.kir...@onetel.net wrote:
On 05/15/10 08:03 PM, Nathan O'Treally wrote:
I think a huge table of Mathematica/MATLAB/Sage/Magma equivalent functions
would
be useful.
Especially for people who want to use Sage and are already familiar
On 15 Mai, 22:10, Simon King simon.k...@nuigalway.ie wrote:
[...] I find
it relatively easy to ignore posts about topics that I am not
interested in. And occasionally it happens that I start to be
interested in a topic because of a thread.
+1
-Leif
--
To post to this group, send an email
On 16 Mai, 05:03, Jason Grout jason-s...@creativetrax.com wrote:
In fixing #8756, I've upgraded the graph planarity code to the most
recent rewrite of John Boyer's planarity code. Unfortunately, the C
code has several instances of:
#include malloc.h
I just found out that OSX does not like
On 16 Mai, 06:43, Jason Grout jason-s...@creativetrax.com wrote:
On 5/15/10 11:32 PM, Justin C. Walker wrote:
Surely this is not the first time this problem has been run into among
this crowd. How is this typically dealt with when compiling a C file?
Should I make a new include directory
On 11 Mai, 06:14, Minh Nguyen nguyenmi...@gmail.com wrote:
[...]
The following documentation tickets could also go into Sage 4.4.2, but
they require reviewers who are fluent in the German language:
*http://trac.sagemath.org/sage_trac/ticket/8821--- Adding a section
on coercion to the
On 7 Mai, 08:40, Jan Groenewald j...@aims.ac.za wrote:
The following tests failed:
sage -t devel/sage/sage/rings/polynomial/symmetric_ideal.py # File
not found
sage -t
devel/sage/sage/schemes/hyperelliptic_curves/hyperelliptic_padic_field.py #
File not found
On 7 Mai, 12:08, Dr. David Kirkby david.kir...@onetel.net wrote:
William Stein wrote:
On Thu, May 6, 2010 at 4:09 PM, Dr. David Kirkby
david.kir...@onetel.net wrote:
I know gcc 4.5 has bought some issues. Note however gcc 4.5 is not the
latest release. There may be some argument for not
On 7 Mai, 03:20, Gonzalo Tornaria torna...@math.utexas.edu wrote:
On Thu, May 6, 2010 at 7:58 PM, Dr. David Kirkby
david.kir...@onetel.net wrote:
...
The recent case of gcc accepting the macro INFINITY even when code was not
compiled in C99 mode was just one example. INFINITY was not
On 7 Mai, 17:47, William Stein wst...@gmail.com wrote:
On Fri, May 7, 2010 at 8:31 AM, Nathan O'Treally not.rea...@online.de wrote:
2. The port of Sage to GCC-4.5.0 is complete. All known issues have
been fixed.
I hope work-arounds related to 4.5.0 bugs get out again once they've
On 5 Mai, 14:31, William Stein wst...@gmail.com wrote:
There might have been a time (maybe a few weeks in 2006) when __imul__
did indeed call _imul_ in Sage, so the name might be a historical
remnant.
Personally, I think the best thing would be:
(1) Rename _imul_ and _iadd_ to something
On 4 Mai, 17:30, William A. Stein wst...@gmail.com wrote:
On May 4, 2010, at 8:21 AM, Jason Grout jason-s...@creativetrax.com wrote:
Does anyone object to me changing float(CDF(1.0)) to behave like
float(CC(1.0)) (i.e., a float conversion will succeed if the imaginary part
is 0). Note
On 5 Mai, 22:18, William Stein wst...@gmail.com wrote:
On Wed, May 5, 2010 at 12:33 PM, Nathan O'Treally not.rea...@online.de
wrote:
sage: int(1.1) # pretty valid; this is neither implicit *nor* meaning-
preserving
I hate the above too. Which is one reason why we have:
sage: ZZ(1.1
On 5 Mai, 23:15, rjf fate...@gmail.com wrote:
I disagree with much of the above sentiments.
Not that precise... (or is the following meant to be a complete
enumeration?)
If you are using a number which might be complex and your intention is
to drop the imaginary part if it is very small, then
On 5 Mai, 23:20, Fidel fidel.barr...@gmail.com wrote:
Given a graph G, with a loop at vertex j. What is the convention
followed in sage for entry j,j of the adjacency matrix?
sage: G=Graph({0:[0],1:[1]},allow_loops=True);G.am()
[1 0]
[0 1]
Just wandering if it is a bug or a feature.
What
On 1 Mai, 14:13, Ross Kyprianou ros...@gmail.com wrote:
I just upgraded to Ubuntu 10.4
I downloaded the Sage 32 bit Ubuntu 9.10 version to see how it will go
What processor are you on?
(Afaik the 32bit binaries aren't built for too old CPUs.)
-Leif
and got the error at the end of the email
On 1 Mai, 15:58, ross kyprianou ros...@gmail.com wrote:
Guys
Thanks for your feedback
Certainly dont mind building from source and I will
You can try (or might want) to build on a newer (and faster) x86
machine with SAGE_FAT_BINARY=YES (see README.txt).
(The binary you downloaded seems to not
On 27 Apr., 18:23, Bill Hart goodwillh...@googlemail.com wrote:
What are the major differences in GCC 4.5.0 which seem to be affecting
Sage? Is there something new that we should be aware of when writing
code for this compiler?
From GCC NEWS:
* On x86 targets, code containing
On 26 Apr., 19:23, Robert Bradshaw rober...@math.washington.edu
wrote:
On Apr 25, 2010, at 9:26 AM, Nathan O'Treally wrote:
On 25 Apr., 17:11, Gonzalo Tornaria torna...@math.utexas.edu wrote:
Also, the == doesn't fail part seems to force this, since it would
be even more awkward to hide
On 25 Apr., 08:10, Robert Bradshaw rober...@math.washington.edu
wrote:
On Apr 23, 2010, at 7:07 PM, Nathan O'Treally wrote:
Though e.g. C and C++ do have automatic (or implicit) conversion, it
is usually referred to as (different kinds of) type *casts*.
C++ does have additional explicitly
On 25 Apr., 08:10, Robert Bradshaw rober...@math.washington.edu
wrote:
On Apr 23, 2010, at 7:07 PM, Nathan O'Treally wrote:
The Tutorial (http://www.sagemath.org/doc/tutorial/
programming.html#loops-functions-control-statements-and-comparisons)
gives another example:
sage: GF(5)(1) == QQ
On 25 Apr., 09:30, Simon King simon.k...@nuigalway.ie wrote:
* Other users may believe that a rose is a rose is a rose, and 1 is 1
is 1. Such users would find it gross that GF(2)(1)==1 and 1==GF(3)(1),
but GF(3)(1)!=GF(2)(1).
Btw, a rose might be a rose in Python, but not in Sage:
1 is 1 #
On 25 Apr., 17:11, Gonzalo Tornaria torna...@math.utexas.edu wrote:
Also, the == doesn't fail part seems to force this, since it would
be even more awkward to hide the coercion failure.
See my last two posts. In addition, Sage behaves different to Python
in many other cases.
(I'd say it is
On 25 Apr., 03:30, John H Palmieri jhpalmier...@gmail.com wrote:
On Apr 24, 3:20 pm, John H Palmieri jhpalmier...@gmail.com wrote:
On Apr 24, 9:46 am, Nathan O'Treally not.rea...@online.de wrote:
What about
- tickets *not* merged though reviewed positive [since N days/
weeks
On 25 Apr., 19:07, Gonzalo Tornaria torna...@math.utexas.edu wrote:
For starters, it means that compilation meant to create a -bdist
should be done on a *randomly named* directory which is moved away
after the compilation/bdist is finished. Otherwise, we risk that the
user has old stuff in a
On 25 Apr., 20:26, Gonzalo Tornaria torna...@math.utexas.edu wrote:
I hope that somebody has a better idea of how to fix this bug.
At least chmod og-r on all binaries, too (on a multiuser/open system).
I don't see how that fixes anything (that isn't fixed by just moving
away the build
On 25 Apr., 21:53, Georg S. Weber georgswe...@googlemail.com
wrote:
Hi Gonzalo,
quick answer:
this is known, and short-term, few to nothing will be done about it.
Long answer:
The usage of dynamic libraries has its advantages --- and the one
disadvantage, that parts of the code have to be
On 24 Apr., 05:30, John Palmieri jhpalmier...@gmail.com wrote:
Please test and report all other issues.
Ubuntu 9.04 x86_64:
build: SUCCESS (on 2 machines; serial build)
testall: SUCCESS
Closed tickets:
#6245 make a custom infix operator decorator
#8043 #7544 breaks #7355: sage -i foo does
On 23 Apr., 17:00, Simon King simon.k...@nuigalway.ie wrote:
Hi!
Sage's coercion makes life easier (allowing to do arithmetic without
too much fuzz), but is not easy and may give rise to confusion.
1. I find coercion is not properly addressed by the tutorial and the
Sage constructions. Do
On 23 Apr., 08:37, Nathann Cohen nathann.co...@gmail.com wrote:
For undirected graph, we settled recently on saying that the degree of
a single vertex with a loop is equal to 2, because we do not want the
inequality (sum of the degrees) = 2* (number of edges) broken.
Equality, I guess :-)
On 23 Apr., 11:10, Simon King simon.k...@nuigalway.ie wrote:
On Apr 22, 10:46 pm, Georg S. Weber georgswe...@googlemail.com
wrote:
I think I like Wandlung as the common umbrella term for both
coercion (Umwandlung, I like that, too) and conversion (for the
latter I'd propose: Verwandlung
On 21 Apr., 21:37, Simon King simon.k...@nuigalway.ie wrote:
I am trying to translate coercion to German. In dictionaries and
Wikipedia, I only found the legal notion of a coercion, but I doubt
that kanonische Nötigung and Nötigungsmodell are good translations
for canonical coercion and
On 22 Apr., 10:52, Nathann Cohen nathann.co...@gmail.com wrote:
In Sage, the degree of a vertex in a directed graph is the degree of
the same vertex in the undirected version of the graph. It is the
number of edges touching this vertex. If you just want the out-
degree (number of edges leaving
On 18 Apr., 20:54, Dr. David Kirkby david.kir...@onetel.net wrote:
I do wonder if the whole of the Sage library should be built C99. I'm not sure
how it works if some parts are, and other parts are not. I could imagine that
might have the potential to have some undesirable side effects. Perhaps
On 23 Apr., 04:28, Minh Nguyen nguyenmi...@gmail.com wrote:
[...] The above demonstrates a bug in
the implementation of degree() as it doesn't handle self-loops
consistently. I understand that the total degree of any graph is twice
the number of edges.
If we only consider directed or
I'm not happy with brute-force converting *any* tab to space(s), and
it would be better to have a tool that (conditionally) does this
rather than supplying patches to lots of files converted by Emacs. The
same tool could be used just to check for illegal tabs. As I
understand this, these are *tabs
The following is copied from comments on ticket #8679 (http://
trac.sagemath.org/sage_trac/ticket/8679#comment:6):
Funny thing. I'd rather change *the code* to reflect the common
practice of using dashes in package names, i.e. taking the leftmost
substring that *starts with a digit* (and of
47 matches
Mail list logo
