[sage-devel] Stochastic matrices and Markov processes

Hi, It seems that SAGE does not yet have an implementation for modeling stochastic matrices and Markov processes. Am I right ? Is there a possible SAGE extension which can do that ? Does anybody planned to work on it ? Cheers, Vincent --~--~-~--~~~---~--~~ To post

[sage-devel] For french developpers

Hi, I just propose a SAGE notice on the french platform of the promotion of free software Framasoft (http://www.framasoft.net/). Do not hesitate do modify or complete it: http://wiki.framasoft.info/PropositionNotice/SAGE Cheers, Vincent --~--~-~--~~~---~--~~

[sage-devel] sqrt(2) is real or not

Hello, I'm just in trouble with the behavior of sqrt(n) when n is an integer, because of the following: {{{ sage: x = sqrt(2) sage: x in RR True sage: x > 1 # a boolean expected x > 1 # a symbolic expression obtained }}} It could be avoided by forcing the interpretation of the boolean expr

[sage-devel] Re: sqrt(2) is real or not

Hi, I agree that sqrt(2) > 1 ;) the problem is the one Jason has developed : the comparison returns a symbolic expression ! Morever, It works well for min and max functions : {{{ sage: max(sqrt(2), 1) sqrt(2) sage: min(sqrt(2), 1) 1 }}} Why max(sqrt(2), 1) not a symbolic expression ? Vincent

[sage-devel] Sage registered trademark

Hi, As you probably knows, Sage is also a company (http://www.sage.com). It provides financial or buisness software solution. In particular, the name "Sage" is a registered trademark at the Patent Office (UK) under the number 2387 (?). It concerns any software dealing with comptability and financ

[sage-devel] A notebook frontend for (secondary) school

Hello, I continue a preceeding thread opened on the sage-days group. It is better placed here, it concerns more developers than organizers. http://groups.google.com/group/sage-combinat-days/browse_thread/thread/faf13e9077eebf0d For SAGE days in Marseille (France), we aim to develop an elementar

[sage-devel] Re: A notebook frontend for (secondary) school

you would replace them with non-object-oriented > versions? > > Rob > > On Nov 1, 4:37 pm, Vincent Delecroix <20100.delecr...@gmail.com> > wrote: > > > Hello, > > > I continue a preceeding thread opened on the sage-days group. It is > >

[sage-devel] sage package construction howto ?

Hi sage-developers, I need objects in Sage that not yet totally exist (a combinatoric one, and another derived from oriented graph). So I write some python files (pure python for the moment) to create those new objects. My problem is that I didn't find any place on the web where it's said how to

[sage-devel] Re: sage package construction howto ?

On 13 jan, 18:46, "David Joyner" wrote: > On Tue, Jan 13, 2009 at 12:38 PM, Vincent Delecroix > > <20100.delecr...@gmail.com> wrote: > > > Hi sage-developers, > > > I need objects in Sage that not yet totally exist (a combinatoric one, > > and

[sage-devel] Re: sage package construction howto ?

On 13 jan, 20:27, Jason Grout wrote: > Simon King wrote: > > Dear Vincent, > > > On Jan 13, 6:38 pm, Vincent Delecroix <20100.delecr...@gmail.com> > > wrote: > >> I need objects in Sage that not yet totally exist (a combinatoric one, > >> and

[sage-devel] Re: sage package construction howto ?

On 13 jan, 22:43, mabshoff wrote: > A couple remarks: > > * spkgs usually install software into $SAGE_ROOT/local or in local/ > lib/python/site-packages (via standard distutils mechanism, i.e. > "python setup.py install") and not into the Sage library and I would > highly discourage anyone to

[sage-devel] C++ bool and Cython

Hi, I'm interfacing a C++ class with cython. Because my C++ class inherit from a std::basic_string class I inherit some tests method like : bool My_class :: test_function() It seems that Cython do not know the C++ bool type and, consequently, there is no direct conversion between C++ boolean

[sage-devel] building sage-3.3 from source fails

Hi, I try to compile the sage-3.3 sources on my : Linux iml88 2.6.11-6mdk #1 Tue Mar 22 16:04:32 CET 2005 i686 Intel(R) Pentium(R) 4 CPU 2.80GHz unknown GNU/Linux The m4ri tests fails due to Segmentation fault. Here is the corresponding part of the install.log : creating test_solve make[3]: Lea

[sage-devel] Re: building sage-3.3 from source fails

; On Feb 22, 5:57 am, mabshoff wrote: > > > On Feb 22, 5:49 am, Vincent Delecroix <20100.delecr...@gmail.com> > > wrote: > > > > > > libm4ri testsuite failed, please report upstream! > > > sage: An error occurred while installing libm4ri-20090128 >

[sage-devel] Re: building sage-3.3 from source fails

> Hmm, something strange is going on here. I am surprised boehmgc runs > make check, but it isn't a good sign. I launch myself the make check. That's not a part of the compilation (If it's what your questioning about). --~--~-~--~~~---~--~~ To post to this group,

[sage-devel] Re: building sage-3.3 from source fails

Hi, Even with gcc-3.4.6 the compilation fails exactly at the same point (with exactly the same errors). I will ask help tomorrow from the network engineer. I will post if I find a solution still using Mandriva 10.2. Cheers, Vincent > > Hi Vincent, > > > > Hmm, something strange is going on he

[sage-devel] rebuild the live cd HOWTO

Hi, The live CD works well on my laptop and is really intuitive/simple/quick to use ! We would distribute some live-CDs during the Sage education days in Marseille. But we need to enhance few features. Is the procedure to rebuild the live cd is written anywhere? Can somebody help on the following

Re: [sage-combinat-devel] Re: [sage-devel] fractals in sage

2010/3/2 Florent Hivert : >      Hi William, > >> A student of mine is going to add to sage the capability of plotting >> lots and lots of fractals easily.  E.g., > [...] >> The point of this email: if you like plotting fractals, and have some >> potentially useful code to contribute, then please p

[sage-devel] error with mercurial for the sage-combinat repository

Hello, Does anybody get the same kind of error as below and manage to solve it ? Otherwise, I will send a mail to the mercurial team to figure out what's up. Best, Vincent pushing to http://combinat.sagemath.org/patches/ searching for changes ** unknown exception encountered, details follow ** r

[sage-devel] Parent with facade

Hello, There is a weirdness in the initialization of Parent with a facade. Consider the following example class MySet(Parent): def __init__(self): Parent.__init__(self, category=(FiniteEnumeratedSets(), Monoids())) The category of an instance of MySet is just a join of the two catego

[sage-devel] comparisons of Sage integer and numpy integer (trac 13386)

Hi, I propose a tiny patch ([1]) to solve several problems that appear on that list about comparisons of Sage integer with numpy.integer (namely [2] and [3]). The main problem is for me {{{ sage: import numpy sage: numpy.int32(1) == 1 True sage: 1 == numpy.int32(1) False }}} The issue was to modif

[sage-devel] facade initialisation

Dear facade lovers, I just upload on trac a patch about the initialisation of facade sets at #13801. One of the smallest patch I never write... which corrects two errors. Please, send comments. Best, Vincent -- You received this message because you are subscribed to the Google Groups "sage-de

Re: [sage-devel] Should RR coerce into RIF?

2013/8/26 Jeroen Demeyer > It's hard to define what "coercion" would even mean in this case. The > manual mentions that it must be a ring homomorphism, but in this case (RLF, > RR, RIF) the mathematical ring is all the same, namely "the real numbers". > It is only the implementation of the ring w

Re: [sage-devel] Should RR coerce into RIF?

I am strongly against conversion from floating-point to interval field. Floatting point arithmetic is approximate whereas interval arithmetic is guaranteed. Moreover, the conversion between non exact rings in Sage are always from "more precision" to "less precision". For these reasons the conversio

Re: [sage-devel] Re: Hashing elements from the same ring

Hello, The following is I guess for the symbolic ring and is what we want sage: cmp((x+1)^2, x^2 + 2*x + 1) 1 while the following is in a polynomial ring and is also what we want sage: cmp((c+1)^2, c^2 + 2*c+1) 0 The only issue is about hashing and not == vs cmp, right ? Note that there are oth

Re: [sage-devel] Graph neighbors slowdown - could it be caused by wrapping objects?

For a quick summary, the current implementation of graphs is as follows: - there is a C backend which uses only integers as vertices. This version uses B-tree (which are written from scratch with some non optimizes routines, see in particular #14690) which allows dynamical graphs (ie adding/remov

Re: [sage-devel] Magma

2013/8/30, William Stein : > On Fri, Aug 30, 2013 at 11:07 AM, XXX wrote: >> Hi William, >> >> I know you have had a long and interesting "history" with Magma. >> >> You're probably already aware of this but if you're not, apparently the >> Simons Foundation is now funding the distribution of Magma

Re: [sage-devel] Re: Flooved

Note that Flooved is sponsored by Wolfram alpha [1] and they intend to integrate their platform with it [2]... [1] http://www.flooved.com/about-us [2] "What future features are you going to implement? " in the FAQ 2013/8/31 kcrisman : >> >> So did they contact you directly, or did you run acro

Re: [sage-devel] SageManifolds v0.2

Hi Eric, > We have just posted a new version (0.2) of SageManifolds at > http://sagemanifolds.obspm.fr > SageManifolds is an attempt to include differential geometry and tensor > calculus in Sage (cf. the initial > postand the > trac

Re: [sage-devel] Re: Parsing XML in Sage

Here is an answer {{{ sage: class A(object): : def __getattribute__(self, name): : return name : sage: a = A() sage: a.b 'b' sage: a.nathann 'nathann' }}} Actually, the tab completion looks really funny on this object! 2013/9/17, Nathann Cohen : >> I would suggest that you

Re: [sage-devel] imag(CC(infinity)) is 0?

>> I guess my follow up question would be do we want infinity to be real in >> this sense or is that just a byproduct of its implementation? I don't >> know >> all the uses for infinity that other sage users have, but certainly from >> the perspective of the Riemann sphere it's a bit odd since >>

Re: [sage-devel] vtk installation issues

I also failed to install it in Sage. But on the other hand it was trivial to install it with the package manager on Debian/Ubuntu (and any Unix I guess)... does anyone know how far the GSoC project of having the builtin Python instead of the one shipped with Sage has gone ? Vincent 2013/10/7, Jer

Re: [sage-devel] in cython, int C[SIZE][SIZE][SIZE] will cause Segmentation Fault when SIZE>146

Hi Sébastien, Even in pure C you can not declare too large static arrays (it also results in SEGFAULT). Dynamical allocation (with malloc or calloc) is more flexible for huge chunks of memory. My comment is just empirical... Vincent 2013/10/10, Sébastien Labbé : > Hi sage-devel, > > It took me

Re: [sage-devel] Should the Sage manual mention SageMathCloud?

Hi all, 2013/10/12, William Stein : > On Sat, Oct 12, 2013 at 4:02 AM, Thierry > wrote: >> On Fri, Oct 11, 2013 at 06:08:15AM -0700, William Stein wrote: >>> On Oct 11, 2013 12:00 AM, "Jeroen Demeyer" >>> wrote: >>> > Should we mention in the Sage manual (for example, here: >>> http://www.sagema

Re: [sage-devel] ask down ?

Great! Thanks William! 2013/10/20 William Stein : > On Oct 20, 2013 6:44 AM, "vdelecroix" <20100.delecr...@gmail.com> wrote: >> >> Hi, >> >> I am not able to connect to ask.sagemath.org. I was using the service >> which becomes suddenly unavailable (around 1:30pm GMT). >> >> Vincent > > It was ind

Re: [sage-devel] How could I use a general connection with SageManifold?

Hi, There is a dedicated list for the package [1]. I am not yet an intensive user so I can not answer. Best, Vincent [1] https://sympa.obspm.fr/wws/info/sagemanifolds.list 2013/10/28, Dox : > Hi dear community: > > I've seen the examples given in the homepage of > sagemanifolds

Re: [sage-devel] SetPartitions output as sets?

I forwarded your e-mail to sage-combinat as it might be of interest there. Isn't there a problem of Element (a set partition) which want at the same time to be a Parent here (ie a set) ?I guess it would be impossible to cleanly solve the issue in the actual state of the Parent/Element implementati

[sage-devel] pygtk

Hi, I would like to use pygtk in Sage. It is trivial to install it on Ubuntu but none of the following work within Sage 1) use the package system "sage -i pygtk". The C compiler complains checking for C compiler default output file name... configure: error: C compiler cannot create executables 2

Re: [sage-combinat-devel] Re: [sage-devel] SetPartitions output as sets?

Why is a set partition not a set of sets ? It would be much more natural than an other layer with .to _set_of_sets(). The two levels version imply that in order to access all operations you need two identical copy of the same object. And by a set of sets I mean inherit from Parent and having catego

Re: [sage-devel] Re: Faster interval arithmetic

I do not see why RIF might be slower than RR. By construction, RIF is a pair of real numbers. For arithmetic involving only +,-,*,/ we should get a ratio of 2 for the execution time because all rounding are implemented in the CPU (is that true ? perhaps changing the rounding often makes it slower).

Re: [sage-devel] Re: Faster interval arithmetic

2013/10/29, Jean-Pierre Flori : > > > On Tuesday, October 29, 2013 1:48:55 PM UTC+1, vdelecroix wrote: >> >> I do not see why RIF might be slower than RR. By construction, RIF is >> a pair of real numbers. For arithmetic involving only +,-,*,/ we >> should get a ratio of 2 for the execution time be

[sage-devel] action/coercion question

Hi, I do want implement an action of matrices on polygons. But I want to store in which field the coordinates belong to (typically a number field). Now consider a concrete example with the field QQ and K = QQ[sqrt(2)]. By definition QQ embedds in QQ[sqrt(2)]. Let - p and m are respectively a pol

[sage-devel] Embedded number fields

Hi, I am working with number fields that I consider as subfields of RR. I want (relatively fast) exact computations and at the same time being able to compare elements for the order induced by RR (see for example #13123 going in that direction). These fields are naturally embedded in AA but it see

Re: [sage-devel] Re: Creating the (Z/5Z)^2 group in Sage : Hell among groups, parent/elements, Cartesian Products ...

2013/11/6, John H Palmieri : > in sage.groups.additive_abelian.all? I wonder if we should have a > meta-ticket about cleaning up top-level imports... +1 But how do we do this ? It is fairly easy to list the names in the global namespace but how do we select the ones which should stay and the ones

[sage-devel] Fp algebraic closure and eigenvalues of matrices

Hi, (from sage days 55) I would like to fix .eigenvalues() for matrices in order to work over finite fields. Currently {{{ sage: K = GF(3) sage: m = MatrixSpace(K,5).random_element() sage: m.eigenvalues() Traceback: most recent call (last) ... NotImplementedError: eigenvalues() is not implemented

[sage-devel] SchemeMorphism inherits from Element ?!

Hi, I was working with #15378 and I wondered why SchemeMorphism inherits from Element and not from Morphism as they should. I just discovered that this is because points on a scheme are special kind of SchemeMorphism. So in order to make it a group law for example, they need to be Element... I am

Re: [sage-devel] Re: Fp algebraic closure and eigenvalues of matrices

Hi Darij, Great news! I will play with it today and see what I can do (for the review and eigenvalues). Thanks, Vincent 2013/11/7, Darij Grinberg : > Hi Vincent, > > trac ticket #14990 has just been updated this week. Not reviewed, though. > > Best regards, > Darij (from sage days 54) > > --

Re: [sage-devel] Re: SchemeMorphism inherits from Element ?!

Thank you Robert, Jean-Pierre and Simon. I see what I can do from your suggestions. 2013/11/8, Simon King : > Hi Vincent, > > On 2013-11-08, Vincent Delecroix <20100.delecr...@gmail.com> wrote: >> I was working with #15378 and I wondered why SchemeMorphism inherits >>

Re: [sage-devel] compile sage from github

Hi, The part of the log you paste is not long enough. I guess you need to install msgfmt which is not part of standard debain. The name of the package is gettext. Does anybody know why git is a standard spkg ? It is likely that anybody has his/her own git... Vincent 2013/11/10, Ralf Hemmecke :

Re: [sage-devel] compile sage from github

2013/11/10, Felix Salfelder : > On Sun, Nov 10, 2013 at 04:56:58PM +0100, Ralf Hemmecke wrote: >> What actually surprises me is that Sage must build git at all. Wouldn't >> it make sense to restrict build and development scripts to use features >> of a git version number that is usually satisfied b

Re: [sage-devel] compile sage from github

Hi, I definitely think that aim of Felix is good and needed. For example, it is hard to incorporate python module into Sage distribution (I recently went into troubles with pygtk). I guess that having Sage working with the builtin Python would solve the problem. Could someone confirm ? It is har

[sage-devel] cartesian products

Hi, For me it is a bug: the behavior of cartesian_product (not CartesianProduct) is not symmetric... {{{ sage: C1 = cartesian_product([FiniteEnumeratedSet('abc'),ZZ]) The cartesian product of ({'a', 'b', 'c'}, Integer Ring) sage: C1 sage: C1.an_element() ('a', 1) }}} but {{{ sage: cartesian_produc

Re: [sage-combinat-devel] Re: [sage-devel] cartesian products

. Thiery : > Salut Vincent, > > On Thu, Nov 14, 2013 at 10:43:19PM -0500, Vincent Delecroix wrote: >> For me it is a bug: the behavior of cartesian_product (not >> CartesianProduct) is not symmetric... >> {{{ >> sage: C1 = cartesian_product([FiniteEnumeratedSet(&#x

Re: [sage-devel] Re: Gray code

Hi, FXT [1] that Nathan mentioned seems very nice... and GPL... but is not yet a standard spkg of Sage! Does it make sense to create a spkg for it ? It is mentionned on trac only in #7656 about bitsets. Best Vincent [1] http://www.jjj.de/fxt/fxtpage.html 2013/12/6, Nathann Cohen : > Yo

Re: [sage-devel] Re: SymbolicPolynomial class

Users of polynomials should worry about the coefficient ring. What do someone should expect of sage: (6*x^2 - 12).factor() The answers are different in ZZ[x], QQ[x] and RR[x]. For a symbolic polynomial there is no way to make it coherent... Moreover, I feel very uncomfortable having an extra

Re: [sage-devel] Re: SymbolicPolynomial class

And meromorphic functions are not stable under composition... 2013/12/19, Nils Bruin : > On Wednesday, December 18, 2013 11:04:22 PM UTC-10, maldun wrote: >> >> What I mean is that we should only allow expressions of meromorphic >> functions in the symbolic field, i.e. we would only allow variable

Re: [sage-devel] Polynomials over non-commutative rings

Does polynomial over non-commutative ring make sense ? Because in that context axbx is not abx^2. Depending on what you call polynomial, they may or may not form a ring. 2013/12/21, Marc Mezzarobba : > According to the docstring of PolynomialRing(), the base ring of a > polynomial ring has to be c

Re: [sage-devel] numbers in numpy fight sage

See #13386 for a related problem. I do not see how we can make the coercion numpy int/Sage Integer works if numpy is not loaded at startup time... and it seems that we do not want it because it takes too much time. There might be a hack using the hash of the numpy int type. That way we can check e

Re: [sage-devel] numbers in numpy fight sage

Hi Bernhard, First of all, the command 1j in Sage produces a Sage complex number {{{ sage: type(1j) }}} In order to get a Python complex, one way is to use the suffix r (like raw) {{{ sage: type(1jr) }}} I mentionned Integer whereas the thread was about float but the problem is the same: Sage n

Re: [sage-devel] sage crashes when current working directory is $SAGE_ROOT/src/sage !?

I do have the problem. 2014/1/7, Niles Johnson : > Am I confused? My sage root directory is /Applications/sage. I cd to > > /Applications/sage/src/sage > > and then attempt to start sage with either > > /Applications/sage/sage > > or > > ../../sage > > Either of these results in a crash which lo

Re: [sage-devel] Precision problems in taking determinant?

Hi, {{{ sage: C = A.change_ring(QQ) sage: C.det().n() # numerical approximation of an exact computation 16801.7979988279 }}} The algorithm for RDF is implemented in scipy which is more serious for linear algebra than Sage (for floating point numbers). My answer would be: if you are dealing with

[sage-devel] Re: [sage-combinat-devel] Volunteers for a Sage presentation/tutorial at CARI 2014?

Hello, Is the conference in french ? (the title is in english but most information are in french) I am interested but the themes of the conference looks far from Sage capabilities: theme 1: Complex Systems Modelling theme 2: Scientific Computing and Parallelism theme 3: Signal, Image, Speec

Re: [sage-devel] Coercion problem ?

Salut Aladin ! Words currently do not fit well with category... (for example they do not inherit from parent). But there is #12224 that I hope to finish at Sage days 57. By the way do you plan to come ? For your problem, a stupid strategy of the conversion mechanism in Sage from X to Y is to ask

Re: [sage-devel] Re: Numerical Methods in Sage

Hi there, As far as I know there is no arbitrary precision within scipy/numpy. On the other hand scipy/numpy is shipped with Sage and if you do for example sage: m = matrix(RDF, [[2,0],[1,0]]) the matrix m is (in the backend) a numpy matrix stored under m._numpy_matrix. Sadly you can not access

Re: [sage-devel] arcsec(float(.1)) throws error

2014-02-13 0:38 UTC+01:00, William Stein : > On Wed, Feb 12, 2014 at 2:50 PM, Jason Grout > wrote: >> David Smith just pointed this out: arcsec(float(.1)) throws an error that >> doesn't make much sense. Yes, it's outside of the domain, but it should >> probably deal with this by returning NaN or

Re: [sage-devel] Re: Interactive plots for Sage Notebook

2014-02-21 15:17 UTC+01:00, Jason Grout : > On 2/21/14 6:00 AM, Inderpreet Singh wrote: >> Hi, I am a computer engineering student, a freelance web developer and >> also a part time math teacher. The 2d plots that notebook draw are not >> interactive. So I was thinking if sagemath would like that f

Re: [sage-devel] Re: Sage accepted for GSoC 2014

eded I could also possibly do part of the mentoring. In any case do not start from scratch implementing knots in Sage. It would be a waste of time. All best, Vincent Delecroix (from France) [1] http://www.math.uic.edu/t3m/SnapPy/ [2] http://legacy.earlham.edu/~peters/knotlink.htm#softw

Re: [sage-devel] Re: Interactive plots for Sage Notebook

Hi Nathan, > On Saturday, February 22, 2014 2:33:19 AM UTC+11, vdelecroix wrote: >> >> * the matplotlib widgets: Sage right now uses matplotlib for main >> graphics capabilities. matplpotlib comes with a very complete and >> useful library for making interactive graphics in native windows (with >

Re: [sage-devel] How to define a new ring class ?

Hi Eric, My first guess would be to modify the initialization of CommutativeRing to authorize None as a valid input for base_ring. Now, the base_ring should be the ring with which you will describe your functions. As functions are defined through coordinates in charts, a natural candidate for the

Re: [sage-devel] Re: How to define a new ring class ?

I do not agree with Miguel: it makes sense to have a Parent modeling the set of all real numbers (even if it has no element). And the natural name for it would be RR. Now, concerning concrete computation, what you can do is either : - use floating points (ie approximate operations +, x, -, / and

Re: [sage-devel] Re: How to define a new ring class ? [We need a class representing genuine real field]

Salut Thierry, I did not see your post before posting mine ! I mostly agreed but I would love to have something better. There are two kinds of approximation that one can have when dealing with computations : - approximate operations +, -, x, / (that allows for example to deal with a finite subset

Re: [sage-devel] Re: Re: How to define a new ring class ? [We need a class representing genuine real field]

2014-03-13 9:28 UTC+01:00, Marc Mezzarobba : > Thierry wrote: >> - rename RR as RFF (for "real floating field"), so that this >> representation is not preferred than the others (especially RDF which >> is faster and allows using more libraries, with the same 53 bits of >> precision). The current na

Re: [sage-devel] Re: Re: How to define a new ring class ? [We need a class representing genuine real field]

2014-03-13 12:59 UTC+01:00, Thierry : > On Thu, Mar 13, 2014 at 10:07:23AM +0100, Vincent Delecroix wrote: >> 2014-03-13 9:28 UTC+01:00, Marc Mezzarobba : >> > Thierry wrote: >> >> - rename RR as RFF (for "real floating field"), so that this >> >

Re: [sage-devel] Re: How to define a new ring class ? [We need a class representing genuine real field]

2014-03-13 21:32 UTC+01:00, Volker Braun : > On Wednesday, March 12, 2014 8:45:57 PM UTC-4, Thierry > (sage-googlesucks@xxx) wrote: >> >> - create RSF (for "real symbolic field") to isolate pi and sqrt(2) from >> cos(x) in the symbolic ring. >> > > Thats essentially what RLF does. > Nope, pi bel

Re: [sage-devel] Re: How to define a new ring class ? [We need a class representing genuine real field]

2014-03-14 10:45 UTC+01:00, mmarco : > >> I would advocate that RLF is a very good approximation of what should >> be RR. Perhaps one good direction to take is to try to make RLF >> smarter and contains all constants from pi to cos(42^e). >> >> Somehow, it already does (i.e. internally it keeps tra

Re: [sage-devel] Re: How to define a new ring class ? [We need a class representing genuine real field]

2014-03-14 14:24 UTC+01:00, mmarco : > > >> >> >> This is half good, I am happy that RLF wraps symbolic constants. But, >> first of all there can not be any reasonable coercion from SR to RLF >> as SR is much bigger. Secondly, SR is not consistent with evaluation >> >> sage: cos(1.).parent() >> Rea

[sage-devel] solving numerically polynomial equations

Hi, Going through the web I just discovered a new software called Bertini [1]. One of its capability is to get arbitrary precision numerical solutions of a set of polynomial equations. I do not think that Sage is already able to do that, right ? Does any developer of Bertini on that list ? Does an

[sage-devel] get source code of given sage module

Dear Sage introspecters, I am on my way to improve import_statements (trac #15351) but I have a problem with sage introspection. I am able to list all submodules of the Sage library with the pkgutil library but then I somehow need to read some of their source code (in order to avoid loading them).

Re: [sage-devel] Compilation of 6.2.beta0 - 6.2.beta4 fails

Could you be more precise on which command did you use? It might be that you rebuild sage source code ("sage -b") instead of rebuild everything ("make"). 2014-03-16 19:32 UTC+01:00, Christian Stump : > Hi -- > > [ disclaimer: I am not quite sure that I did everything right, git still > doesn't fee

Re: [sage-devel] Compilation of 6.2.beta0 - 6.2.beta4 fails

2014-03-16 19:57 UTC+01:00, Christian Stump : >> >> Could you be more precise on which command did you use? It might be >> > that you rebuild sage source code ("sage -b") instead of rebuild >> everything ("make"). >> > > That is right, I did use "sage -b". Should I have used "make" instead? (At > s

Re: [sage-devel] Compilation of 6.2.beta0 - 6.2.beta4 fails

No idea... You can try to rebuild doc from scratch with "make doc-clean" and then "make doc-html". Anyway, even not doing that you should have a working Sage version (without docs) 2014-03-16 22:48 UTC+01:00, Christian Stump : >> >> The thing is that between two versions some of the spkg might hav

Re: [sage-devel] bug: ell_point.py/_add_()

Hi, The fix is to *remove* the line 708 where there is an import statement. The problem is about how Python guess local/global variables. Best Vincent 2014-03-17 13:39 UTC+01:00, John Cremona : > There is something I do not understand here. In that same file there > is a doctest (see lines 82++

Re: [sage-devel] Re: get source code of given sage module

Hi Simon, Thanks for your answer. > On 2014-03-16, Vincent Delecroix <20100.delecr...@gmail.com> wrote: >> I am able to list all submodules of >> the Sage library with the pkgutil library but then I somehow need to >> read some of their source code (in order

Re: [sage-devel] "Graph??" produces a crash ?... O_o

Did you try "sage -syncbuild" ? You might have some garbage from previous Sage compilation. 2014-03-26 10:36 UTC+01:00, Daniel Krenn : > Am 2014-03-26 10:14, schrieb Nathann Cohen: >> When I type "Graph??" in Sage then "q" I get a crash. I tried on two >> computers. Am I just cursed or is there

Re: [sage-devel] "Graph??" produces a crash ?... O_o

Sorrry It was the option -sync-build 2014-03-26 16:31 UTC+01:00, Nathann Cohen : > ~$ sage -syncbuild > sage-run received unknown option: -syncbuild > usage: sage [options] > Try 'sage -h' for more information. > > Never head of syncbuild btw O_O > > Nathann > > On Wednesday, Marc

Re: [sage-devel] How to obtain the sources

Hi, > [...] > > It would be very great if the documentation could outline the basic steps > required to get the latest (or suggested) version up and running. That > could include pointers at how to build sage from source, together with the > URL of the git repository and the command needed to clon

Re: [sage-devel] Re: How to obtain the sources

Not everything is in there !!! * nothing about the develop branch * nothing about the subtle difference between "sage -b" and "make" 2014-03-26 18:15 UTC+01:00, Volker Braun : > There is this: http://sagemath.org/doc/developer/manual_git.html > > -- > You received this message because you are s

Re: [sage-devel] Re: charpoly of sparse matrix

You compute powers but *not* of the matrix itself ! You just compute iteration of a single vector. Here is a rough implementation of what you should do sage: A = matrix([[1,2,3],[1,1,1],[1,0,1]]) sage: s = 0. sage: v = random_vector(RDF,3) sage: v /= v.norm() sage: for i in xrange(100): :

Re: [sage-devel] Re: charpoly of sparse matrix

Do you have an idea of the expecting degree of the number field in which your eigenvalue belongs to ? If yes you can use pari/GP otherwise I do not see what you mean by exact value. 2014-03-27 11:17 UTC+01:00, Paul Mercat : > OK, thank you, I see. > It's an efficient method to compute a approximat

[sage-devel] error while building the documentation: where?

Hello, I am working on my favorite branch and try to build the documentation. It fails with the error below with no information about which file causes it! How can I find which file triggers the error? Traceback (most recent call last): File "/opt/sage/src/doc/common/builder.py", line 83, in f

[sage-devel] Re: error while building the documentation: where?

Even better: Traceback (most recent call last): ... OSError: [dynamics ] Exception occurred: 2014-03-27 22:54 UTC+01:00, Vincent Delecroix <20100.delecr...@gmail.com>: > Hello, > > I am working on my favorite branch and try to build the documentation. > It fails with the e

Re: [sage-devel] Bug with max

Dear Paul, It would be much better if your questions were asked on ask.sagemath.org or the sage-support googlegroups. The topic of the devel list is about development (and of course include bug reports). In particular your question and the previous one about eigenvalues are off topic. Moreover, us

Re: [sage-devel] Quotient ring over cyclotomic polynomial very slow

Hi François, Might be related to the ticket #16116 on trac (http://trac.sagemath.org/ticket/16116). Note that for performance, it is possible to use multivariate polynomials as described in the ticket. Best Vincent 2014-04-15 18:30 UTC+02:00, François Colas : > Hello group, > > I am playing with

Re: [sage-devel] moved wiki.sagemath.org to vm

Got a problem, do not know if it is because of me """ Surge protection Warning: You triggered the wiki's surge protection by doing too many requests in a short time. Please make a short break reading the stuff you already got. When you restart doing requests AFTER that, slow down or you might g

Re: [sage-devel] moved wiki.sagemath.org to vm

More precisely, any request to wiki.sagemath.org ends with a 503 error "Service Unavailable". 2014-04-16 7:15 UTC+02:00, Vincent Delecroix <20100.delecr...@gmail.com>: > Got a problem, do not know if it is because of me > > """ > Surge protection &g

Re: [sage-devel] moved wiki.sagemath.org to vm

Great! Thanks. 2014-04-16 19:50 UTC+02:00, Keith Clawson : > I believe I fixed the problem, let me know if it happens again. > > -Keith > > On Wednesday, April 16, 2014 4:05:54 AM UTC-7, William wrote: >> >> >> On Apr 16, 2014 2:19 AM, "Volker Braun" > >> >> wrote: >> > >> > I just visited the new

Re: [sage-devel] Re: Directions for idioms of free objects and free abelian groups

2014-04-20 17:28 UTC+02:00, John H Palmieri : > > > On Friday, April 18, 2014 4:22:59 PM UTC-7, Travis Scrimshaw wrote: >> >> Hey everyone, >>On http://trac.sagemath.org/ticket/15289 I'm implementing monoids and >> groups indexed by an arbitrary set of generators and Nicolas and I would >> like

Re: [sage-devel] String returned by NumberField

Hello François, This kind of question would rather go to the sage-support mailing list or ask.sagemath.org. To answer your question: Yes. As you can see the output says "over its base field" which means that you built an extension of a number field. You can check sage: K. = NumberField([cyclotom

Re: [sage-devel] Problems in the computation of hyperbolicity.

Hello Miguel, If you need support in Sage you should use the sage-support googlegroups or ask.sagemath.org. The sage-devel mailing list is about development and bug report. To answer your question, if you want to compute all distances in a graph with more than 65535 vertices then your RAM must be

Re: [sage-devel] Problems in the computation of hyperbolicity.

architecture). This was made for economy of space... if you want to compute all distances for a graphs you still have this memory issue (you will need 16Go of RAM). Best Vincent 2014-04-22 12:56 UTC+02:00, Vincent Delecroix <20100.delecr...@gmail.com>: > Hello Miguel, > > If you

  1   2   3   4   5   6   7   8   9   10   >