sage: R.x,y = QQ[]
sage: (x+y^2+2*x*y).newton_polytope()
A 2-dimensional polyhedron in QQ^2 defined as the convex hull of 3 vertices.
sage: _.Vrepresentation()
[A vertex at (1, 1), A vertex at (0, 2), A vertex at (1, 0)]
--
To post to this group, send email to
I'm pretty sure we have this compile error fixed in Sage-4.7.2.alpha4.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
I'd guess lt_dlexit is a symbol that libtool defines that has something to
do with getting out of a dynamic library. Seems like the mpi4py package
misses some linker flags. You should post some info about your setup (which
mpi, os, versions...)
--
To post to this group, send email to
On Sunday, October 2, 2011 4:25:54 PM UTC+2, juaninf wrote:
My MPI version is 0.6,
I guess thats not OpenMPI, then?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more
I don't know if this particular function is wrapped in Sage. But this
Singular function requires the ideal to be homogeneous or the ring to be
local. You don't mention this in your email, so I just wanted to point it
out.
--
To post to this group, send email to sage-support@googlegroups.com
I'll look into lowering the processor requirements. Though SSE3 has been out
for a looong time...
You can rebuild Sage inside the virtual machine. Just interrupt the notebook
server (Ctrl-C), go to the Sage directory, run make distclean and then
make. Let it run overnight ;-)
--
To post to
Maybe I'm biased :-) but I think the VirtualBox appliance is a great way to
get to know Sage and for students.
But if you want to actively develop for Sage then I would recommend to run
on Unix natively. In principle you can do everything in a virtual machine
but its a bit like learning a
I'd say that if you really want to develop Sage with your students on a
joint computer then you need to have direct access to a Linux machine. Its
not that hard to install, just give it a try. The easiest way to collaborate
is if everybody installs Sage in his own home directory, then does his
The rich comparison operators acting on symbolic ring elements/functions
return symbolic equations/inequalities. Otherwise you wouldn't be able to
construct symbolic relations. Note that the cast to bool is funky: If it
returns False, it means I can't decide.
--
To post to this group, send
Sage has some framework for (really simple) parallel computing, see
http://www.sagemath.org/doc/reference/sage/parallel/decorate.html
Unfortunately, there is no MPI backend. One problem with the openmpi spkg is
that it doesn't build on Solaris, though we probably should use the system
MPI in
b in QQ is (or should be) equivalent to QQ(b) not throwing an error. But if
that fails, it only means that Sage can't convert it to a rational directly,
it is perfectly possible that after a series of (computationally expensive)
steps one could transform b into a rational. But if we would
As Maarten already said, 1 is not prime. Also, note that the empty product
equals one:
sage: prod([])
1
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this
On Sunday, August 7, 2011 7:27:36 AM UTC+1, Rob Beezer wrote:
http://trac.sagemath.org/sage_trac/ticket/11581
That crash was literally in atlas, so its almost certainly due to some isa
extension that the computer doesn't have.
The new atlas-3.8.4 spkg tries to respect the SAGE_FAT_BINARY
On Thursday, August 4, 2011 8:37:38 AM UTC+1, mjs wrote:
That does it thanks. But (a) do those checks not matter? And (b) is
there an easy way to set it on a per-spkg basis?
You can install individual spkgs with sage -f spkg after you finished
installing Sage.
--
To post to this
Don't set SAGE_CHECK.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/sage-support
URL: http://www.sagemath.org
On Friday, July 15, 2011 7:59:33 PM UTC+2, pblelloch wrote:
Unknown error creating VM (VERR_VMX_MSR_LOCKED_OR_DISABLED)
Is there anything in particular that I need to do to allow the virtual
box to run? Is this the only way to run Sage on a Windows computer?
This means that you a) enabled
And starting with sage-4.7.1.alpha4 you can also do
sage: timeit('2**128', seconds=True)
1.4945983886718749e-06
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit
Just to double-check, your md5sum is 3eadcc287c92c5391417b517e01edd9b?
It does work for me. Do you happen to have any umlaut in the directory path?
This can apparently cause this error, see
http://www.virtualbox.org/ticket/6588.
--
To post to this group, send email to
I just realized that the file name is called Sage-4.7.ova but it should be
sage-4.7.ova (lower case!). Virtualbox is unfortunately very picky about the
file name. This is http://www.virtualbox.org/ticket/9033.
Harald: can you fix the file name on the download page?
--
To post to this group,
Kart-Dieter Crisman suggested at SD31 that the virtualbox machine file name
should be lower case to be consistent with the other Sage downloads. I then
implemented this in the newer version of the Sage virtual appliance. So this
is where the confusion comes from. But I agree of course that
Thats
http://trac.sagemath.org/sage_trac/ticket/7496
and its scheduled for sage-4.7.2
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
Thanks for letting us know! We renamed the .ova to conform to the mirror
guidelines but should have tested whether it still works.
Harald: Can you change its name back to the original name? Alternatively I
can build an updated ova but only later this week as I'm currently
travelling...
--
You can use one of the ODE solvers...
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/sage-support
URL:
The comma operator creates tuples in Python (the surrounding braces actually
don't do anything):
sage: 1, 2, 3
(1, 2, 3)
sage: 1,
(1,)
A function that just prints something but doesn't call return() will return
None. That should make the output clear:
sage: def comma():
: print *
I just fixed it in the patch on #7496:
sage: var('2x')
---
ValueErrorTraceback (most recent call last)
/home/vbraun/opt/sage-4.7.1.alpha2/devel/sage-main/ipython console in
module()
For the record, this was solved by serializing the sparse value dictionary
m.dict()
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
Python uses indentation for blocks:
sage: x,y = var('x, y');
sage: A = x+y == 3;
sage: if A.substitute(x=1,y=2):
: print Yes
: else:
: print No
:
Yes
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email
On Thursday, May 5, 2011 1:50:31 PM UTC+1, Dr. David Kirkby wrote:
So anyone writing scripts with a -r option to mv is asking for trouble.
I don't even have an idea of what mv -r is supposed to do. Move recursively?
mv always moves included subdirectories. Maybe it turns off the
Though right now browser support for webgl is still sketchy. Chrome doesn't
have it turned on by default. I would guess that in about a year things will
be better.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
On Thursday, April 21, 2011 6:33:43 PM UTC+2, kuhn wrote:
What should be the safest way against these type of problems?
Install a linux distribution designed for long-term stability like
RHEL/Scientific Linux or Debian.
--
To post to this group, send email to sage-support@googlegroups.com
Most likely you don't have enough ram to store 101^5 temporary values.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
If you want to automatically store stuff automatically on a 3rd party web
service then locking will be a non-trivial issue, especially if you want to
support multiple backends.
If synchronization is client-initiated then locking wouldn't be as much of
an issue. Essentially the server would
It was reported before that this build is mislabeled and probably for F14.
You might want to compile the current version (Sage-4.6.2) from source.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
Startup speed is mostly a function of harddisk performance and does not
depend much on the CPU. If the startuptime recently increased noticeably
then that is most likely your harddisk getting full (fragmentation and inner
tracks rotate slower) or imminent failure (check SMART logs).
--
To
Doctests already set the randoms seed in sage and external programs to a
fixed value before running.
On Sunday, March 6, 2011 3:46:36 AM UTC, kcrisman wrote:
[...] This would massively help with
any eventual doctesting of actual plots, if we ever were to get there.
--
To post to this
MPI is more comparable to Mathematica's underlying MathLink C libraries. We
also have an mpi4py optional spkg that maps the C to a Python API,
essentially one-to-one. Its not pretty, but if you know MPI then you can
immediately use it. There is a mini-introduction and a sample program at
MPI is _the_ standard for passing data between different CPUs and used to
write parallel programs on clusters and supercomputers. Its a rather
low-level C library and you need to spend some time learning it if you want
to use it effectively.
Your random assembly of lab PCs is probably not
On Thursday, March 3, 2011 6:19:01 PM UTC, Benjamin Jones wrote:
You're right, it's not corrupted. I had to manually delete the .spkg
file in $SAGE_ROOT/spkg/optional and then run `./sage -f URL` again.
I consider this to be a bug in addition to a major trap for newcomers to
fall into. If I
One solution would be to compute the volume of P, Q, and intersect(P,Q). All
three are convex, so its easy enough to compute the volumes. Then
Vol(union(P,Q)) = Vol(P) + Vol(Q) - Vol(intersect(P,Q)) = Vol(conv(P,Q))
with equality if and only if union(P,Q) is already convex.
I don't quite
On Tuesday, March 1, 2011 9:55:01 PM UTC, Ursula Whitcher wrote:
This won't always work.
I agree with your example, of course. But I interpreted Dmitri's question
somewhat differently, that he wants to start with some set of lattice points
and find out if they all lattice points of the
On Sunday, February 27, 2011 8:59:25 PM UTC, sm123123 wrote:
I have numerical calculations that need to adhere to significant
digits of the input.
Sage has at least three different real numbers, see
http://www.sagemath.org/doc/reference/rings_numerical.html
Each implementation is a
The integral_points method (which I wrote :-) uses PALP to enumerate the
points. Eventually we should implement Barvinok's *algorithm* for counting
*lattice
points. I think that this could be done in a few days, but I haven't
actually done anything for it. But feel free to send a patch :-)*
*
Singular supports working with floating-point complex numbers (CDF in Sage),
so it should work.
Having said that, floating-point computations with polynomials are often
dangerous because of the limited precision. Its usually better to work with
arbitrary-precision coefficients like QQ or
You can factor it in any field that contains a square root of two. For
example, we can construct a suitable number field over QQ:
sage: z = QQ['z'].0
sage: K = NumberField(z^2 - 2,'sqrt2'); K
Number Field in sqrt2 with defining polynomial z^2 - 2
In this number field, you can (somewhat
Oops posted too quickly. The alternative is to use the symbolic ring, though
strictly speaking that doesn't let you factor only find roots:
sage: var('x')
x
sage: (x^2-2).solve(x)
[x == -sqrt(2), x == sqrt(2)]
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe
On Thursday, February 24, 2011 6:29:11 PM UTC, Dmitri wrote:
I think my problem is actually doing the comparison. So I have this
chosen set of points which I don't know is convex. I compute its
convex hull. Now how do I compare these two objects?
Assuming that we are still talking about
Are you by any chance running a 32-bit Sage? It seems likely that you can't
find 2GB chunk of contiguous empty space in the 4G address space of the Sage
process. This wouldn't be an issue with 64bit...
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from
On Thursday, February 24, 2011 12:12:12 AM UTC, Dmitri wrote:
[...] The intersection of all these equations forms a lattice
polytope (finite and bounded). I want to know if that polytope is
convex or not.
I'm confused. Intersections of convex sets are convex.
[...] One question that
Polyhedron and Polytope (=compact Polyhedron) implies convex. For example:
sage: lp = LatticePolytope(matrix([[-1,-1], [-1,0], [0,0], [1,0],
[1,-1]]).transpose())
sage: lp.points()
[-1 -1 1 1 0 0]
[-1 0 0 -1 -1 0]
sage: lp.vertices()
[-1 -1 1 1]
[-1 0 0 -1]
--
To post to this group,
I also noticed that, sometimes, the incremental document building gets
confused to the point where it falls on its face. Simplest option is to wipe
the doc tree and rebuild the whole documentation.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this
No, delete the output from the doctree. That is, rm -rf doc/output. Then
sage -b sage -docbuild reference html.
Though I didn't quite understand which file you deleted. I don't have a
pushout.rst file anywhere.
--
To post to this group, send email to sage-support@googlegroups.com
To
You can also use the symbolic ring:
sage: var('x,y,z,A,B,k,i,j,m')
(x, y, z, A, B, k, i, j, m)
sage: solve([x == A*i + B*j, y == A*k + B*m, z == B*(j-m) + A*(i-k)],
[z,i,m])
[[z == x - y, i == -(B*j - x)/A, m == -(A*k - y)/B]]
--
To post to this group, send email to
On Sunday, February 6, 2011 7:58:36 AM UTC, Dr. David Kirkby wrote:
If there are not the perquisites to build a particular module, then
the tests for that module are skipped. The failures seen are actually
on parts of Python that build, but fail the tests. It seems everyone
gets a few of
Just tripped over the same issue. Seems to be a incompatibility with
texlive2010. Can you file a trac ticket?
Somebody also wrote this on the matplotlib
mailinglist: http://article.gmane.org/gmane.comp.python.matplotlib.general/26110
Minimal testcase:
sage: from matplotlib.dviread import *
Fix for the SAGE_CHECK issue is in
http://trac.sagemath.org/sage_trac/ticket/9960 and needs review.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group
On Sunday, February 6, 2011 7:19:29 AM UTC, Dr. David Kirkby wrote:
On 5 February 2011 08:17, Mate Kosor mate@gmail.com wrote:
I don't know why the checks don't work for package python, but if I
could make a suggestion maybe it would be better that the check ships
that package because
x^2 != x, even over GF(2). They are the same function but different
polynomials. Even over finite fields there are infinitely many polynomials.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
Works for me on sage-4.6.2.alpha3. Chances are your binary is built for a
different sytem, and some external library segfaults. Next time, please post
working examples like
sage: import numpy
sage: from numpy import linalg, array
sage: A=numpy.random.randn(250,250)
sage:
I agree that $HOME/.local/lib/python2.6/site-packages gets automatically
added to sys.path if it exists:
[vbraun@volker-desktop ~]$ mkdir -p .local/lib/python2.6/site-packages
[vbraun@volker-desktop ~]$ sage
--
| Sage Version
Sage prepends its own directory to the PATH, of course. You are the first
one who managed to break the startup in the CrashHandler import, so it is
definitely not easy to break. My hint is still to use strace, but you'll
have to read the manpage and do some investigation of your own.
Volker
GCC 4.4.1 is broken, and has been fixed a long time ago. Right now we have
4.4.5 and 4.5.2. Do yourself a favor and upgrade.
There is a patched PARI spkg on trac that will avoid the compiler error at
the cost of decreased performance.
Volker
--
To post to this group, send email to
There might be something in ~/.ipythonrc that pulls in your own ipython.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
I mean ~/.ipython/
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/sage-support
URL: http://www.sagemath.org
$HOME/.local/bin is not a standard place to look for executables. It will
only be searched if you put it into the PATH yourself.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For
Do you have $SAGE_LOCALl/lib/python2.6/site-packages/IPython/CrashHandler.py
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
Could be lots of reasons. Permissions? Weird LD_PRELOAD? Borked PYTHONPATH?
You can see where it is seaching with strace.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more
No, Sage comes with its own copy of NTL. I'm just wondering how you managed
to break the build process. The real error is is probably higher up in the
install.log.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
The real error is this:
/usr/local/sage-4.6.1/local/lib/python2.6/site-packages/sage/structure/coerce_maps.so
in sage.structure.coerce_maps.DefaultConvertMap._call_
(sage/structure/coerce_maps.c:2339)()
TypeError: _element_constructor_() takes exactly 2 arguments (3 given)
I'm completely
In my experience and everyone I talked to recently,
setting SAGE_PARALLEL_SPKG_BUILD=yes works correctly. So parallel building
is most likely not the culprit. But having the log cluttered by multiple
compilations in parallel is an issue...
--
To post to this group, send email to
Are you using the gentoo ebuild or are you installing just the Sage source
tarball? The latter is designed to be installed in a users home directory.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
The error looks like it didn't build correctly. Is there anything suspicious
in the install.log? Maybe rebuild the sage library (sage -ba).
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
Can you try the new atlas spkg at
http://trac.sagemath.org/sage_trac/ticket/10226
and let us know if it improves anything?
Cheers,
Volker
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
Fixed in the 4.6.1.rc-series. The 4.6.1 release should be out rather soon...
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
In Sage-4.6 and older, the mpir/gmp libraries erroneously ask for their
stack to be executable. This is a minor security risk and forbidden by
SElinux in Fedora 14. The change in Sage-4.6.1 is that mpir no longer marks
its stack as executable, which it actually doesn't need.
Volker
--
To
The documentation of Sequence.set_immutable() is quite clear. Never means
that there is no way:
Definition: Sequence.set_immutable(self)
Docstring:
Make this object immutable, so it can never again be changed.
EXAMPLES:
sage: v = Sequence([1,2,3,4/5])
The two possible ways are
v = Sequence([1,2,3],immutable=True)
or
v = Sequence([1,2,3])
v.set_immutable()
You should never mess with underscore attributes if you haven't actually
written the code as these implementation details can change without warning.
The documentation is displayed by
There is no official way to un-immutable something as it wouldn't be
immutable then. The only way is to make a new list/Sequence with a copy of
the elements. The new container is then mutable again, since it is only
copy:
v_copy = [ x for x in v_immutable ]
If you modify the copy, the
I'd say that make ptestlong should run without errors before publishing a
live binary build.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
You can even shave off two more key strokes and type:
sage: ZZ.quo(5)
Ring of integers modulo 5
:-)
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group
The recommended way of plotting polyhedra is via p.plot(). The
render_solid() method only gives you the solid part of the plot.
Polyhedron instances can only be defined over QQ (arbitrary precision
rational) and RDF (floating point) fields. Input checking apparently needs
to be improved...
--
Polyhedron(ieqs = [[RDF(2/3), RDF(1/3), RDF(-1/3*sqrt(3))]], field=RDF)
And other fields are hard to implement since there is no implementation of
the double description method for arbitrary fields. Feel free to send a
patch...
I don't remember when I implemented plot() but that was a while
5. Make a symlink /somewhere/in/PATH/sage - $SAGE_ROOT/sage
So if the user has ~/bin already in his path, then this could be done
without administrative rights.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
Note that your command is equivalent to
timeit('identity_matrix(1009).det()')
Things could of course always be faster; Though the different algorithms for
determinants of integral matrices seems to be similarly fast. The only thing
thats really a lot faster is computing with floating point
You are not running out of memory in that computation if you have 3GB of
ram. It seems like something in linbox (which is used for matrices of that
size) dies during the computation. I also recently ran into some issues with
linbox and blas, and was wondering if they are related. Can you run
The fact that this dies somewhere deep in the atlas internals probably means
that your CPU doesn't support one of the SSE instructions that atlas was
compiled with. I'd bet that if you compile Sage from sources on your machine
then it'll work.
--
To post to this group, send email to
I'm getting the somewhat expected result:
sage: i=sqrt(-1)
sage: for k in range(100):
: print k; r1=random(); r2=random()
: try:
: xx=100*r1-i; yy=100*r2
: res=gamma(xx)*gamma(yy)/gamma(xx+yy)
: except:
: pass
:
My guess would be
#8 0x008eef06 in rtodbl (x=0xb7d3d708)
This is where the over flow occurs, raises signal
#7 0x00b49f0e in pari_err (numerr=15) at ../src/language/init.c:980
it is handled by the pari error handler, which attempts to longjmp back into
rtodbl or some cleanup routine (did
Unless you are running precisely 32bit ubuntu 10.04 lts there is nothing
that Sage can do about it.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group
No, it's because your loop is over 1 rather than 1000.
Sharp eyes! :)
So, to summarize, with the improved Cython one should always use isinstance
as it will be optimized to be at least as fast. I guess we should remove the
PY_TYPE_CHECK macro from Sage altogether and replace every
PY_TYPE_CHECK is just a wrapper macro around PyObject_TypeCheck which
dereferences and compares the object type fields. So that part should be
insanely fast.
sage: cython('cpdef t(x):\n for i in range(0,1000):\n
PY_TYPE_CHECK(x,int)'); timeit(t(5000), repeat=100)
625 loops, best of 100:
Aha, with Jason's answer:
Calling isinstance(x,int) on a python x is cheating, because Cython replaces
it with PyInt_Check (no inheritance to check!).
Calling isinstance on a C variable x goes through IS_INSTANCE which builds
an unnecessary python boolean.
--
To post to this group, send
701 - 791 of 791 matches
Mail list logo
