t; ---> 23 raise KeyError(key)
> 24 def __setitem__(self, key, item): self.data[key] = item
> 25 def __delitem__(self, key): del self.data[key]
>
> KeyError: 'HOSTNAME'
>
>
> On Sunday, June 2, 2013 1:26:36 PM UTC-7, Volker Braun wrote:
socket.gethostname() returns illegal hostname, thats great. Apple, what the
heck!
On Sunday, June 2, 2013 9:24:01 PM UTC+1, Kuai Yu wrote:
>
> sage: os.environ['KuaiYu's Pro']
>
No, I meant "HOSTNAME" literally (its a Bash variable)
--
You received this message because you are subscribed to t
Your hostname contains an apostrophe, thats totally not allowed ;) This
ends up in the directory path and our shell script doesn't escape it
properly. I wonder where it is coming from, can you post the output of both
sage: import socket; socket.gethostname()
sage: os.environ['HOSTNAME']
On Su
Whats the output of
sage: sage.misc.viewer.png_viewer()
sage: sage.env.DOT_SAGE
sage: sage.misc.misc.SAGE_TMP
On Saturday, June 1, 2013 9:20:58 PM UTC+1, Kuai Yu wrote:
>
> I'm new to Sage.
> When trying to plot a wheelgraph on 5 vertices, I got the following error
> message:
> sh: -c: line 0:
Can you post a link (e.g. pastebin) to the rest of the libgap log?
On Friday, May 31, 2013 8:18:12 AM UTC+1, Sancho McCann wrote:
>
> I'm building sage 5.9 on OpenSuSE 12.3 (x86_64).
>
> I get:
>
> Error building Sage.
>
> The following package(s) may have failed to build:
>
> package: libgap-4.5
Thats a normal #define in object.h. It seems like your toolchain is broken.
Does it work if you compile sage with "SAGE_INSTALL_GCC=yes make"
On Friday, May 31, 2013 8:18:12 AM UTC+1, Sancho McCann wrote:
>
> I'm building sage 5.9 on OpenSuSE 12.3 (x86_64).
>
> I get:
>
> Error building Sage.
>
http://wiki.sagemath.org/SageApplianceInstallation
Which step does not work for you?
On Thursday, May 30, 2013 1:51:35 AM UTC+1, Wade DeGottardi wrote:
>
> Hi,
>
> I just installed Sage-5.9 and Oracle VM VirtualBox for Microsoft Windows
> 7. When I try to import Sage-5.9, it doesn't show up as
s sound reasonable? Any other hints?
>
> Thanks in advance and Greetings
> --
> Ursin Solèr
>
> ETH Zürich
> Institut für Teilchenphysik
> Schafmattstrasse 20 / HPK G29
> CH-8093 Zürich
> Switzerland
>
> Phone: +41 (0) 44 633 2034
> Email: uso...@st
http://en.wikipedia.org/wiki/Mesa_(computer_graphics)
Afaik all Linux distributions use Mesa to provide a OpenGL implementation.
You seem to lack the development packages, on Fedora thats
$ rpm -qa | grep mesa | grep devel
mesa-libGL-devel-9.1-3.fc18.x86_64
mesa-libEGL-devel-9.1-3.fc18.x86_64
If you look at the log then its clear that no OpenGL implementation is
available:
-- Looking for glXGetProcAddressARB - not found
-- Looking for glXGetProcAddress - not found
CMake Error: This project requires some variables to be set,
and cmake can not find them.
Please set the following variabl
The plan would still be to support a search path, just not look at
(undocumented) shell environment variables for it. So you'll still be able
to set a search path via a python function either from init.sage or the
attached source code.
On Tuesday, May 14, 2013 10:41:24 AM UTC+1, leif wrote:
>
Can you open a trac ticket with a minimal testcase? I realize that
"minimal" means pretty lengthy for your problem, but without any way to
reproduce it this is not going to get fixed.
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubs
Both produce the same output (J.vector_space_dimension() == 8) in
Sage-5.10.beta1.
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@goo
13 at 9:51 PM, Felix Wellen
>
> > wrote:
>
>> With "backend='ppl', base_ring=QQ" it works!
>>
>> Thanks again ;)
>>
>> Am Dienstag, 23. April 2013 14:10:26 UTC+2 schrieb Volker Braun:
>>>
>>> This is now http://trac.sagemath.org/
wxMaxima has a lisp script that outputs MathML. I don't think we do
anything along those lines. It would be nice if the output would use a
mathml (perhaps with mathjax) pipeline, I think thats the only way to get
useful line breaking for long equations.
On Friday, April 26, 2013 11:39:15 AM
You mean ascii-art for equations? Clearly the terminal will wrap long lines.
On Friday, April 26, 2013 8:47:25 AM UTC+1, Dmitry Shkirmanov wrote:
>
> Hello, list. I used to use Sage a couple of years ago but moved to the
> Maxima.
> The reason for the moving to the maxima was that Sage could n
sage: m = random_matrix(ZZ, 3)
sage: m.smith_form()
On Thursday, April 25, 2013 8:57:26 PM UTC+1, tvn wrote:
>
> is there something in SAGE that solves integer linear equations ?
> essentially like normal equation solving but the results must be integers.
> Thanks ,
>
--
You received th
I'm pretty sure I removed that in #3416
On Wednesday, April 24, 2013 1:27:58 PM UTC+1, Victor Miller wrote:
>
> E = EllipticCurve_from_cubic(F,(0,0,1))
>>
>>
>> Traceback (most recent call last):
>> File "", line 1, in
>> File "_sage_input_8.py", line 10, in
>> exec compile(u'ope
"who" prints the newly-defined variables, but R is already defined as the
r-system.org interface. You can redefine it as you want, but as far as
Python is concerned that just changes a variable but doesn't add a new one.
On Tuesday, April 23, 2013 10:34:15 PM UTC+1, João Alberto Ferreira wrote
This is now http://trac.sagemath.org/14479 (needs review)
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@googlegroups.com.
To post to
I can confirm this. The problem is that cdd errors out with "*Error:
Numerical inconsistency is found. Use the GMP exact arithmetic.". Gee,
thanks ;)
On Tuesday, April 23, 2013 9:09:08 AM UTC+1, Felix Wellen wrote:
>
> while trying to render the intersection of a 4-cube and a 3-cube (I guess
The first question is, are you actually running out of ram? The garbage
collector seems to have triggered full collections at the 4gb mark, and
memory fragmentation might have left you with 900mb of address space that
is mainly empty. Also, do you really need all 4 million graphs in memory
simu
After compiling from source?
On Friday, April 12, 2013 3:39:01 PM UTC+1, Georgi Guninski wrote:
>
> i have SEGV with some matrices, so you are not the only one.
>
>
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this grou
Just compile Sage from source. Its a problem with your binaries, not with
the Sage source code.
On Friday, April 12, 2013 12:06:15 AM UTC+1, Sure wrote:
>
> Sorry, it is really 81 by 80, quite strange. But it still segfaults at
> m.rank().
> md5: a9619508e02588d23290d63ae6f3ca44 mi.sobj
>
>>
>
Good catch, but the example that Sure posted is 81x80:
sage: m
81 x 80 dense matrix over Rational Field (type 'print m.str()' to see all
of the entries)
On Thursday, April 11, 2013 9:48:50 PM UTC+1, Jeroen Demeyer wrote:
>
> A 80 x 79 matrix of rank 80?
>
--
You received this message because
Works for me:
sage: m.rank()
80
On Thursday, April 11, 2013 9:29:34 PM UTC+1, Sure wrote:
>
> About ATLAS: afaik it is a floating point library, but my matrix is
> rational, can it depend on ATLAS? Maybe people with correct settings would
> check, if the bug happens in their sage.
>
Suprising
You should post the output of sage_input(m) somewhere, then others could
try it out.
Its almost guaranteed that your bug is due to atlas being compiled with the
wrong settings for your cpu. Try installing from source.
On Thursday, April 11, 2013 6:42:36 PM UTC+1, Sure wrote:
>
> Got sigseg
Works for me. I guess the sagenb.org version isn't quite up to speed
sage: Polyhedron([[0.8,-0.5],[0.3,0.3]])
A 1-dimensional polyhedron in RDF^2 defined as the convex hull of 2 vertices
On Wednesday, April 10, 2013 5:29:39 PM UTC+1, Victor Miller wrote:
>
> I've found that if l is a list
Actually that makes sense, the C++ STL sort() is implemented in headers and
not passed down to glibc sort().
On Tuesday, April 9, 2013 2:19:47 PM UTC+1, FalkRichter wrote:
>
> The problem seems also to be compiler related :
> Somebody recently installed SAGE on our (scientific Linux 6.0 ) cluste
Might be fixed in Singular-3.1.6, changelog mentions "several bug fixes in
factorization code". Haven't tried though.
See http://trac.sagemath.org/14333
On Monday, April 8, 2013 10:18:32 AM UTC+1, Georgi Guninski wrote:
>
> Wrong factorization in QQ['x,y']
>
> 5.8 on ubuntu and on sagenb.org.
Thats it, with the non-Dropbox folder everything is as expected. You should
be able to load files from there.
It seems that the Dropbox filesystem is incompatible with VirtualBox shared
folders. I'll add a note to the wiki to that extend.
On Saturday, April 6, 2013 6:00:16 PM UTC+1, Gary McCo
Strange, you do see the sf_Auxiliary_files but somehow it can't be
accessed. It should have worked. Are you using a reasonably recent
VirtualBox version (try Help->Check for updates)? To check permissions,
what is the output of
os.system('ls -alZ /media')
Finally, what is your host OS?
Also,
Some of the docs are out of date (sorry, feel free to update the wiki as
necessary) but the shared folder section should work. And does work for me.
Whats the output of
os.system('ls /media')
os.system('ls /media/sf_Auxiliary_files')
on your machine? You should get a list of files...
On Sat
Time to blacklist gcc-4.8.0 on arch? Its clearly shipped in a broken state.
Can you compile sage with:
export SAGE_INSTALL_GCC=yes
make
On Friday, April 5, 2013 12:11:45 AM UTC+1, Aladin VIRMAUX wrote:
>
> Thanks for you answer, here is the output :
>
> [dadin@bubble .sage-5.8]% ./sage --
On Thursday, April 4, 2013 6:48:32 PM UTC+1, William wrote:
> Cool. I'm teaching an intro course this quarter on Linear Algebra,
> and I'll show your example to the class tomorrow. :-)
Plot twist: Neda is actually enrolled in your class
--
You received this message because you are subscrib
See
http://www.sagemath.org/doc/reference/polynomial_rings/sage/rings/polynomial/toy_d_basis.html
On Thursday, April 4, 2013 6:23:48 PM UTC+1, Neda wrote:
>
> could you please tell me how to write an algorithm for computing S(f,g)
> using any order of two polynomials f and g?
>
--
You received
I think the patches need some rebasing (they also depend on other stuff).
The first question is, does the same happen with your code on a newer glibc?
Mercurial is the version control system that we currently use.
SWO = strict weak order
On Thursday, April 4, 2013 5:08:36 PM UTC+1, FalkRichter
Can you try your code on a more recent linux distro? Newer glibcs are more
forgiving (i.e. don't crash) about sorting with a non-swo.
On Thursday, April 4, 2013 3:17:21 PM UTC+1, FalkRichter wrote:
>
> Thanks for fast reply. I will investigate this.
>
>
--
You received this message because
Most likely this is http://trac.sagemath.org/9880
On Thursday, April 4, 2013 2:52:05 PM UTC+1, FalkRichter wrote:
>
> No symbol table info available.
> #1 0x7f7f4673ac63 in print_enhanced_backtrace () from
> /home/frichter/sage-5.8/local/lib/libcsage.so
> No symbol table info available.
> #
Alternatively, if its a small enough matrix, use sage_input() and
copy&paste:
sage: m = random_matrix(ZZ,3)
sage: m
[ 1 -1 -1]
[ 3 0 6]
[41 2 10]
sage: sage_input(m)
matrix(ZZ, [[1, -1, -1], [3, 0, 6], [41, 2, 10]])
On Thursday, April 4, 2013 5:36:10 AM UTC+1, William wrote:
>
> You could s
gt;
>
> On Tuesday, April 2, 2013 1:47:59 PM UTC+4:30, Volker Braun wrote:
>>
>> Your question is not about elimination theory.
>>
>> Your lex order groebner basis is the solution. g4 determines z. Then g3
>> and g2 determine y. Then g1 determines x.
>>
>
On Tuesday, April 2, 2013 9:32:40 AM UTC+1, Neda wrote:
> Hi Is there any commands for writing affine variety (Let k be a field, and
> let f1,...,fs be polynomials in k[ x1,...,xn]. Then we set V(f1,...,fs)= {
> (a1,...,an) ? k^n : fi (a1,...,an)=0 for all 1 ?i?s } we call V(f1,...,fs)
> the af
Your question is not about elimination theory.
Your lex order groebner basis is the solution. g4 determines z. Then g3 and
g2 determine y. Then g1 determines x.
On Tuesday, April 2, 2013 9:34:00 AM UTC+1, Neda wrote:
>
> Hello
> Could you pleas tell me how can I solve the system of equations
You'll have to use the hold=True argument to not evaluate such expressions
automatically:
sage: x.add(-oo, hold=True) <= 0
x - Infinity <= 0
On Tuesday, March 26, 2013 5:59:47 AM UTC+1, tvn wrote:
>
> In my project I often have inequalities x <= c , x+y <= c, x -y <= c and
> to make things un
On Monday, March 18, 2013 3:23:18 PM UTC-4, Dima Pasechnik wrote:
> well, it's meant to be deployed on a virtualbox running on Windows.
> Not 100% sure it will do the right things on OSX.
The virtual machine also works on OSX and Linux. If you are already
familiar with VirtualBox then I think
Patch is now up at
http://trac.sagemath.org/14014
On Sunday, March 3, 2013 8:28:47 AM UTC-10, Jesús Torrado wrote:
>
> Hey,
>
> On Thursday, February 28, 2013 7:13:17 PM UTC+1, Volker Braun wrote:
>>
>> I'm working on porting the matrix groups in Sage to libGAP cu
I'm working on porting the matrix groups in Sage to libGAP currently. Its
not finished yet, but real soon (TM) you'll be able to convert matrices
between sage and GAP:
sage: M_s = random_matrix(GF(5), 3)
sage: M_s
[2 0 1]
[3 3 4]
[1 1 1]
sage: type(M_s)
sage.matrix.matrix_modn_dense_float.Matrix
I can confirm that. Reported
at https://bugzilla.redhat.com/show_bug.cgi?id=877651
On Sunday, February 24, 2013 6:03:16 AM UTC-5, Jean wrote:
>
> Solution: could you include "ipython" as a dependency of sagemath-core in
> the Fedora 18 package?
>
>
--
You received this message because you are
I've been thinking about a native interface for a while, and I think the
biggest misconception is that one should just write yet another notebook.
What we should develop is a better separation of UI and the business logic
(notebooks holding cells of code and output). I can't really discern any U
IIRC I changed it to run the UI with the same user account. Just log in as
"sage" with password "sage" and follow the instructions.
On Monday, February 4, 2013 5:46:08 AM UTC, mc.hernandez131 wrote:
>
> El jueves, 12 de julio de 2012 07:27:17 UTC-5, jori.ma...@uta.fi escribió:
> > How to change
Search for "r-project". We are trying to add that keyword to all R-related
tickets. As you say, just searching for "R" is pointless ;-)
On Thursday, January 24, 2013 4:38:08 PM UTC, Emmanuel Charpentier wrote:
>
> Since a couple of versions ago, the package installation mechanism in R
> has ch
Can you post the full log of the failed attempt?
On Thursday, January 24, 2013 4:27:30 PM UTC, Emmanuel Charpentier wrote:
>
> I tried to upgrade sage by 1) stopping the notebook server and 2) going
> into my sage-5.5 directory (compiled fro source on debian (mostly) wheezy
> on x86-64) and typ
The bug in our code is that pari does not raise an error, it dies once you
run out of memory but thats not a good thing to wait for.
On Monday, January 21, 2013 4:36:03 PM UTC, Javier López Peña wrote:
>
> On Monday, January 21, 2013 3:28:29 PM UTC, Simon King wrote:
>
>> OK, then we should at
Default should always be to check the input over calling library routines
with potentially undefined behavior.
On Monday, January 21, 2013 2:37:15 PM UTC, Simon King wrote:
>
> Problem: If the "check" option is True by default then the user will
> have to wait for the positive definiteness test
Input really must be positive definite, not just definite with any sign.
Function: qflllgram
Section: linear_algebra
C-Name: qflllgram0
Prototype: GD0,L,
Help: qflllgram(G,{flag=0}): LLL reduction of the lattice whose gram matrix
is G (gives the unimodular transformation matrix). flag is optiona
t; should before calling the pari function? Perhaps allowing a flag to disable
> the check for people who need top-speed and know what they are doing.
>
> Cheers,
> J
>
> On Monday, January 21, 2013 1:52:42 PM UTC, Volker Braun wrote:
>>
>> Its not a bug, its undefi
devel/2480
On Monday, January 21, 2013 1:48:22 PM UTC, Javier López Peña wrote:
>
> Hi Volker,
>
> I think lllgramint() is deprecated, we should call gflllgram(D,1) instead.
> The bug remains the same though.
>
> Cheers,
> J
>
> On Monday, January 21, 2013
On Wednesday, December 19, 2012 11:07:03 PM UTC, William wrote:
>
> > sage: D=Matrix(IntegerModRing(),
> [[-1,1,0,1,1,0],[1,-3,1,0,0,0],[0,1,-2,0,0,0],[1,0,0,-3,0,0],[1,0,0,0,-4,1],[0,0,0,0,1,-5]]);D
>
> > [-1 1 0 1 1 0]
> > [ 1 -3 1 0 0 0]
> > [ 0 1 -2 0 0 0]
> > [ 1 0 0 -3 0 0
On a related note, it is usually a bad idea to create polynomial rings over
polynomial rings if you really want multivariate polynomials. If anything,
the proper multivariate polynomials will be much faster:
sage: R. = GF(5)[]
sage: f = x^10+2*x^6+2*x^5+x+2-t
sage: f = x^10+2*x^6+2*x^5+x+2
Oh yes good point, one would also have to ship the linker :-/
Which is probably not available separately on OSX.
On Tuesday, January 15, 2013 6:06:31 AM UTC, Dima Pasechnik wrote:
>
> /usr/bin/as
> /usr/libexec/gcc/darwin/i386/as
> /usr/bin/ld
> /usr/lib/bundle1.o
>
--
You received this
You can't substitute power series into the symbolic ring, since power
series are not objects of the symbolic ring. It just doesn't make sense in
general.
You can substitute power series into polynomials; This also makes
mathematical sense:
sage: f_symb
(t1, t2) |--> t1*t2
sage: f_symb.polynomi
Lame but easy method: Go though all groups with 2*G.Size() elements and
pick out the ones you want.
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To post to this group, send email to sage-support@googlegroups.com.
To unsubscribe from this gro
Reusing variable names is generally a recipe for confusion:
R.=PowerSeriesRing(SR)
P.=PolynomialRing(QQ)
Now R and P have variables that print as "x1" and "x2", but of course they
are still different variables. Now compare
sage: f
x1*x2 + O(x1, x2)^3
sage: f[2]# the degree-2 part in the
On Saturday, January 12, 2013 6:18:08 PM UTC, Jeroen Demeyer wrote:
> > * replace /usr/include with $SAGE_ROOT/local/include
> It's already there in the include path.
>
Yes but gcc has
local/lib/gcc/x86_64-apple-darwin10.8.0/4.6.3/include-fixed/
after $SAGE_ROOT/local/include. The fixed li
Jeroen, did you every try to build the gcc spkg with
--with-native-system-header-dir=dirname Specifies that dirname is the
directory that contains native system header files, rather than
/usr/include. This option is most useful if you are creating a compiler
that should be isolated from the
Considering that we are shipping a complete gcc install this is somewhat
unsatisfactory...
Of course blame lies squarely on Apple's shoulders for not shipping
headers, nor having any system for installing the platform-dependent
headers, nor having *any* package-management system. Unless you thi
On Saturday, January 12, 2013 12:10:33 PM UTC, Dima Pasechnik wrote:
> looks like this happens with a binary install (I am guessing by looking
> at the path /Applications/sage/...).
>
So you are saying that the Sage OSX binary has never worked on a clean OSX
install (without xcode?)
--
Yo
When you compiled Sage, there was a limits.h somewhere that the bootstrap
compiler used.
The gcc limits.h tries to include that old limits.h at the end, but this
fails in your case. Did you uninstall anything between compiling Sage and
trying to compile the Cython class now? Where else is limit
For starters, 0.24 can't be represented exactly. An oldie but goodie on the
subject:
http://docs.oracle.com/cd/E19957-01/806-3568/ncg_goldberg.html
On Wednesday, January 9, 2013 10:40:21 AM UTC, Daniel Friedan wrote:
>
> Should solve_right() be introducing a numerical error here? The only
> nu
This is now http://trac.sagemath.org/13932
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To post to this group, send email to sage-support@googlegroups.com.
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.c
By default, solve_right() checks that the result is true. This fails due to
numerical errors depending on the precision:
sage: RF= RealField(52)
sage: Y=matrix(RF,2,2,1)
sage: A = matrix(RF,[[0.24,1,0],[1,0,0]])
sage: sol = A.solve_right(Y, check=False)
sage: A*sol
[ 1.00 -5.55111
This is most likely a combination of missing fonts and the firefox security
model not allowing access to Sage's copy of the fonts
(http://docs.mathjax.org/en/v1.1-latest/installation.html#firefox-and-local-fonts).
Apparently the stix fonts are only included from OS X 10.7 onward.
At http://ww
Fixed the version on the trac ticket. GAP-4.5.7 will be part of Sage-5.6,
for the record.
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To post to this group, send email to sage-support@googlegroups.com.
To unsubscribe from this group, send e
A plane is a polyhedron, too:
sage: P = polytopes.n_cube(3)
sage: plane = Polyhedron(eqns=[(0,1,1,1)])
sage: plane.Hrepresentation()
(An equation (1, 1, 1) x + 0 == 0,)
sage: P.intersection(plane).integral_points()
((-1, 0, 1), (-1, 1, 0), (0, -1, 1), (0, 0, 0),
Of course #13540 will on most machines enable internet-using tests. So
somebody needs to fix the finance / stock price interfaces that currently
fail their doctests *hint* *hint* ;-)
On Friday, December 28, 2012 5:55:48 PM UTC, Ivan Andrus wrote:
>
> Of course, the Mathematica interface canno
I'm leaning towards a BSD-licensed C library with a RPC mechanism (tcp/ip
socket or named pipe). That would be pretty minimal and you don't have to
worry about Python stuff when linking on the proprietary side.
On Friday, December 28, 2012 4:47:46 PM UTC, William wrote:
>
>1. Write a stand
On Friday, December 28, 2012 4:19:11 PM UTC, William wrote:
> I disagree. The only reason Sage doesn't have an interface to Mathematica
> written using the MathLink protocol is that nobody has got around to
> writting such an interface. I would like to strongly encourage people to
> write one.
sage: polytope = polytopes.n_cube(4)
sage: G = polytope.restricted_automorphism_group(); G
Permutation Group with generators [(5,9)(6,10)(7,11)(8,12),
(3,5)(4,6)(11,13)(12,14), (2,3)(6,7)(10,11)(14,15),
(2,5)(3,9)(4,13)(7,10)(8,14)(12,15),
(1,2)(3,4)(5,6)(7,8)(9,10)(11,12)(13,14)(15,16),
(1,16)
If the directory is already in the built-in search path (like
/Users/minshall/src/import/sage/sage-5.4.1/local/include if you use the gcc
that Sage compiled) then the -I option is ignored.
-Idir
Add the directory dir to the head of the list of directories to be searched
for header files. This
No its first -I, then *_INCLUDE_PATH, then the path thats hard-wired
into the compiler. But since Sage builds its own compiler you are
effectively overriding the search path.
On Friday, December 14, 2012 3:13:06 PM UTC, Greg Minshall wrote:
> > C_INCLUDE_PATH / CPLUS_INCLUDE_PATH are overriding
C_INCLUDE_PATH / CPLUS_INCLUDE_PATH are overriding the default gcc header
search path. This is why compilation is failing. Did fink put in these
system-wide environment variables? Thats seriously effed up.
--
You received this message because you are subscribed to the Google Groups
"sage-su
See http://trac.sagemath.org/12129
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
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.
Visi
On Saturday, December 8, 2012 7:03:48 PM UTC, Ivan Andrus wrote:
> Or are number theorists just born knowing this stuff. :-)
>
Beats me, I'm just a physicist dabbling in computer programming ;-)
--
You received this message because you are subscribed to the Google Groups
"sage-support" grou
Solving a linear diophantine equation is an application of the Smith form.
A quadratic diophantine equation can be solved with the Hasse-Minkowski
theorem, though thats is definitely more advanced
(http://en.wikipedia.org/wiki/Hasse%E2%80%93Minkowski_theorem)
If its not one of these cases then
I take it you mean polynomial equations:
sage: AA. = AffineSpace(GF(2),2)
sage: S = AA.subscheme(x^2+y^2)
sage: S.point_set().points()
[(0, 0), (1, 1)]
On Saturday, December 8, 2012 6:14:19 AM UTC, Santanu wrote:
>
> I have a system of non linear equations over GF(2). How to solve
> them in Sa
Short answer: I don't know. What are you trying to achieve?
Long answer: I'd use the propositional
calculus http://www.sagemath.org/doc/reference/sage/logic/propcalc.html to
compute the truth table for the statement. Then each row is a system of
equations/negated equations that you can feed int
"or" is just the normal Python boolean operation.
When you evaluate y == 5 or y == 15, the Python interpreter first checks if
the first statement is true:
sage: bool(y==5)
False
Since the first operand is false, the result of "or" is the second operand.
sage: y == 5 or 'second operand'
'secon
I haven't checked this, but I suspect that the naive approach of making a
copy of the zero matrix and then filling in the entries with set_unsafe in
a loop will be faster.
On Wednesday, December 5, 2012 11:24:44 PM UTC, Nils Bruin wrote:
>
> No, list concatenation does not benefit from balanced
On Wednesday, December 5, 2012 5:01:52 PM UTC, John Cremona wrote:
> Thanks for the diagnosis! I had forgotten that there was special code
> for matrices over cyclotomic fields, but it seems strange that the special
> code makes creating such a matrix a lot slower. Perhaps I would be better
All the time is spent in Matrix_cyclo_dense.__init__ where a (nrows*ncols,
Q1092.degree()) rational matrix is constructed by first creating a list of
all nrows*ncols*Q1092.degree() entries:
elif isinstance(entries, list):
# This code could be made much faster using Cython, et
The build script is here if you want to look into the tsc error message:
https://bitbucket.org/vbraun/sage-virtual-appliance-buildscript
Though it seems this error message is bogous and will be downgraded to
devel-level in the kernel soon. So just doing nothing will eventually solve
it ;-)
On
I indeed made some changes to the VM to fix the automatic login issue (or
lack thereof). I haven't updated the wiki page. It would be great if you
could make the changes, since you seem to have figured out what to do ;-)
On Wednesday, December 5, 2012 12:45:10 AM UTC, nerak99 wrote:
>
> Also, a
Really I see the browser running inside the VM as a crutch for those that
can't use their host browser because of a misconfigured firewall.
I understand your frustration being stuck with kiosk mode, but I don't
think that making the environment in the VM more complex is a good idea
either. Not
On Monday, December 3, 2012 6:19:18 AM UTC-5, P Purkayastha wrote:
> I don't know of any nice way of converting the variables to symbolic
> variables.
>
For the record, you can just cast to SR (the symbolic ring):
sage: R. = PolynomialRing(QQ)
sage: g1 = SR(g1)
sage: g2 = SR(g2)
sage: solve_in
Confirmed, this is now http://trac.sagemath.org/13773
On Tuesday, November 27, 2012 7:12:56 PM UTC, Alan wrote:
>
> my first attempt at using the online version was to move from polar to
> cartesian coods. I tried
>
> var('r theta psi x y z')
> (r,theta,psi,x,y,z)
> e1 = r == +sqrt(x^2+y^2+z^2
On Monday, November 26, 2012 2:07:34 PM UTC, john_perry_usm wrote:
> Is it a good idea to patch the matplotlib package with a test of whether
> an object is a sage object?
Definitely not!
If possible, matplotlib should rely on duck-typing:
try:
alpha = float(obj)
except ValueError:
Construct cone and hyperplane:
sage: C = Cone([(1,0),(0,1)])
sage: H = Polyhedron(eqns=[(-2,1,1)])
sage: H.Hrepresentation()
(An equation (1, 1) x - 2 == 0,)
Compute the intersection polyhedron:
sage: P = H.intersection( C.polyhedron() ); P
A 1-dimensional polyhedron in QQ^2 defined as the conv
I guess the build machine had ssl installed and Python hence picked up the
dependency. We should uninstall openssl-devel on the build machines or make
it clear that openssl is a dependency for the binary package. Since the
distro vendor is distributing openssl in this case there is no doubt that
On Saturday, November 24, 2012 12:01:57 PM UTC, kannappan sampath wrote:
> May I know how do the sage-developers decide which patch gets merged in
> what version of Sage?
>
Author writes patch and posts to trac
Reviewer reviews patch
Release manager merges it into Sage
So at least 3 people are
Fixed in http://trac.sagemath.org/13211
On Saturday, November 24, 2012 9:32:22 AM UTC, kannappan sampath wrote:
>
> Hello,
> For some reason, the function gap_console() is broken on my recently
> updates Sage System.
>
> Sage version: 'Sage Version 5.4.1, Release Date: 2012-11-15'
>
> Here
501 - 600 of 841 matches
Mail list logo
