There is no policy. Fee free to do so :-).
On 5 Dez., 10:59, Ralf-Philipp Weinmann [EMAIL PROTECTED]
darmstadt.de wrote:
On Dec 4, 2007, at 19:57 , Burcin Erocal wrote:
Note that this is for comments and testing only, and is not at all
complete. I know one way of crashing it, try to use
Hi!
Just as background:
Nearly every path in Singular is adjustable by environment variables.
See:
kernel/feResource.cc
Best regards,
Michael
On 10 Dez., 15:57, Martin Albrecht [EMAIL PROTECTED]
wrote:
SINGULAR (very serious):
Several Singular-related files in SAGE_ROOT/local/bin/ have
)).divisors()
Out[2]:{{x(1),x(2)}, {x(1)}, {x(2)}, {}}
In [3]:f.zeroesIn((x(1)*x(2)).divisors())
Out[3]:{{x(1),x(2)}, {}}
The set of zeroes immediately gives you the canonical DNF
x(1)^x(2) or (not x(1)) and (not x(2))
Best regards,
Michael Brickenstein
Hi!
You might want to look for the zeroesIn method to the
new section Reinterpretation of Boolean sets as subsets of the vector
space
in the PolyBoRi tutorial.
http://polybori.sourceforge.net/doc/tutorial/index.html
Best regards,
Michael
On 7 Mrz., 10:14, Chris Gorecki [EMAIL PROTECTED] wrote:
Hi!
I think, multivariate gcd is a neverending topic, discussed very often
in many communities.
Actually, I never tried to implement that and hopefully I never will.
But I *enjoyed* ;-) many discussions about it.
So, I think, if you want to have success, the first task is, what
Roman said:
Hi!
Suprise, there exists a tutorial for PolyBoRi.
http://polybori.sourceforge.net/doc/tutorial/index.html
It is available in tex-format under
doc/tutorial/tutorial.tex
in our source distribution.
think it would be nice, to include it in the SAGE documentation in
some way.
I started this
Hi William!
It is pure latex (I have chosen this format, as I wanted to reuse it
at some day for SAGE).
Michael
On 1 Apr., 23:53, William Stein [EMAIL PROTECTED] wrote:
On Tue, Apr 1, 2008 at 12:39 AM, Michael Brickenstein
[EMAIL PROTECTED] wrote:
Hi!
Suprise, there exists
Hi!
Without saying anything about the quality of Romans work (I can't
judge that without a deeper look):
I don't find it very impressive, posting some benchmark for just one
example.
Note, that the example is dense.
If he is using fast (Strassen-like) algorithms, then it is quite
natural, to
that the leading term of g is not normalized during pseudo
division, but that would have to be checked.
Best regards.
Michael
On 2 Apr., 09:39, Roman Pearce [EMAIL PROTECTED] wrote:
On Apr 1, 11:36 pm, Michael Brickenstein [EMAIL PROTECTED] wrote:
I don't find it very impressive, posting some benchmark
I haven't used it yet, but it has an excellent reputation.
In particular it is said to be able to compete with Magma over the
rationals.
Michael
On 4 Apr., 16:16, Martin Albrecht [EMAIL PROTECTED]
wrote:
Hi there,
I made an SPKG for Ginv.
http://wwwb.math.rwth-aachen.de/Janet/ginv.html
* unknown number of external library users: I am not away of anybody
external using giac as a library. From my experience with libSingular
I am not too optimistic that we will not run into a number of issues
here. Look at #2822: PolyBoRi is designed as a library to be used from
Python. But
here :-).
On 19 Apr., 06:49, William Stein [EMAIL PROTECTED] wrote:
Hi,
Does anybody here use the OS X TextMate programmer's editor?
http://macromates.com/
This is a closed source but cheap editor that is evidently popular
with professional programmers. Anyway, a student in my class
Hi!
Actually, regarding online databases.
There exists RUM.
http://python-rum.org/
Guess, who is co-lead developer of that package...
Using an SA model, you can set up an online frontend to your database.
For your application, the following feature's can help:
- it is possible to feed it with
Hello!
Thanks for your efforts.
The problem is, that for CXX then SUN-compiler was used.
You can pass the CXX
scons CXX='g++'
custom.py
CXX='g++'
At the moment, we don't know, why Suns compiler is used for C++, while
gcc is used for C.
Michael
On 15 Jul., 08:22, Minh Nguyen
Hi Martin!
This is an example for open culture, to discuss talks in advance in
public mailing lists :-).
It would become more emotionally, if you use the heart of mathematics
for plotting.
f=(2*x^2+y^2+z^2-1)^3-(1/10)*x^2*z^3-y^2*z^3 == 0
Regarding the benchmarks with polybori multiplication:
Maybe not everybody here reads python-announce.
So I hope, that's interesting for at least some of you.
Michael
Anfang der weitergeleiteten E-Mail:
Von: Christian Tismer tis...@stackless.com
Datum: 17. Juli 2009 04:26:02 MESZ
An: undisclosed-recipients: ;
Betreff: ANN: psyco V2
Antwort an:
If you don't need formatting, just use CSV.
The tools around it are very mature.
Michael
On 28 Jul., 13:39, Ahmed Fasih wuzzyv...@gmail.com wrote:
Hi, I'm using Sage to analyze some financial data
(fromhttp://www.econ.yale.edu/~shiller/data.htm) that's only available in
XLS. I installed xlrd
I just tried a new clean Sage 4.1.0 installation, everything
unmodified
using your 64 bit Mac OS X intel binary.
The same error as before (I always used your binary,
I don't have difficulties to make use of my laptops CPU cycles).
gcc --version
i686-apple-darwin9-gcc-4.0.1 (GCC) 4.0.1 (Apple
Hi!
Maintaining these lookup tables and other tricks is a lot of work,
which could be invested elsewhere, e.g. your PHD.
Even for me, the difference between these orderings is pure subtility
from a users perspective.
However the ascending variant is far more efficient with ZDDs.
Michael
On 4
Well, if you want an degree ordering, which is descending for the
variables, we have
degree lexicographical ordering in PolyBoRi fully supported.
Michael
--~--~-~--~~~---~--~~
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from
We strongly recommend to use exact types for Groebner bases
computations in Singular.
Michael
--~--~-~--~~~---~--~~
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
Hmm, poles are not so bad.
We can imagine, that you do something like with rational functions:
define two expressions are equal, if they are equal on some open and
dense subset.
If you have something like
sin[x] and cos[x-Pi/2]
you should add a relation, that they are equal.
And I suppose, there
Hi!
I use PIL for a long time.
It is good documented and feels Pythonic.
It is pure fun.
+1
Michael
--~--~-~--~~~---~--~~
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
Hi!
IMHO, it would be a good start and a big step forward to collect these
entries here:
http://wiki.sagemath.org/Publications_using_SAGE
Michael
--~--~-~--~~~---~--~~
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this
I forwarded it to our team list.
I suppose, that your homomorphism uses Singulars map internally.
That should be a good solution for more than two parallel
substitutions.
Michael
On 3 Sep., 08:18, William Stein wst...@gmail.com wrote:
Hi Martin (and Sage-devel),
I discovered that polynomial
Hi Martin!
sage: A = random_matrix(ZZ,3,3)
sage: TermOrder(A)
It looks very natural to me.
Michael
--~--~-~--~~~---~--~~
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
Hi Simon!
It is in fact one of the things that I miss in Sage's polynomial rings
(the other thing are supercommutative rings),
Burcin will visit KL in octobre to work on
the integration of
noncommutative algebras in Singular.
Maybe, you can give use a list, what you need.
Cheers,
Michael
Hi!
* AFAIK, free non-commutative rings are only experimental in
Singular, and probably not yet ready for being wrapped in libSingular
AFAIK (and I hope, that's more) free algebras in Singular are only an
emulation on top of our existing rings and only work up to some
degree.
I think, this
Hi!
- sort out coercion
- wrap various functions defined by Singular:
http://www.singular.uni-kl.de/Manual/latest/sing_390.htm#SEC431
This part won't require hard Singular knowledge.
We probably will have to add some missing pieces to LibSingularFunction
to make the wrapping really easy.
Hi!
More importantly: if Sage accesses the Singular kernel directly -
these Singular interpreter markers cannot help Sage...
Independent from what is the right solution, I would like to mention,
that I worked with Martin on using the same interface to the kernel
functions as the Singular
Hi!
Am 07.09.2009 um 14:34 schrieb Oleksandr:
Hi Martin,
What about Sage implementation for
1. weighting vector(s) a(w1, w2...wn),
2. free module orderings (e.g. c/C) mixed somewhere in between? Does
Sage have such a concept?
I suppose, that the answer is no.
In Sage i'd imagine
Hi Oleksandr!
Am 08.09.2009 um 15:25 schrieb Oleksandr:
Hi,
On Sep 7, 3:17 pm, Michael Brickenstein brickenst...@mfo.de wrote:
Am 07.09.2009 um 14:34 schrieb Oleksandr:
What about Sage implementation for
1. weighting vector(s) a(w1, w2...wn),
2. free module orderings (e.g. c/C) mixed
Hi!
It seems to me, that restricted to rings and ideals,
the ordering looks like
2 5
-1 -2
So, the Matrix M(1,1,0,-1) is probably useless in this example.
Michael
Am 09.09.2009 um 12:56 schrieb Martin Albrecht:
Hi there,
I have to say that I don't like the
WeightVector(2,5) +
[1] Other libraries *may* have more choices:
http://developer.yahoo.com/yui/http://www.extjs.com/deploy/dev/examples/samples.html
I don't know how difficult it is to mix and match.
JQuery (in the compatibility mode) and dojo have a good reputation for
mixing with other libraries.
Other
Hi!
I had a small look at it.
Of course, there is a lot of Sage code in it and it looks, as if you
have a lot
of partial problems, that will be specific to Sage/... .
So it seems, you will need some component architecture like
that we are using in RUM.
It is completely light weight.
The goal
config).
Cheers,
Michael
On 22 Sep., 10:42, Michael Brickenstein brickenst...@mfo.de wrote:
Hi William!
Many thanks for pointing that out! You're exactly right that I'll
need a lightweight component architecture, and I'm glad that I don't
have to write it.
Actually, I am not so very deep
voila, here it is.
http://bitbucket.org/brickenstein/rumcomponent/src/tip/rumcomponent/
See test_component.py for examples.
Cheers,
Michael
On 22 Sep., 17:33, Michael Brickenstein brickenst...@mfo.de wrote:
I am just in the progress of seratating the component architecture.
I still have a test
Hi!
On 23 Sep., 11:07, mmarco mma...@unizar.es wrote:
I have to do some computations in an exterior algebra, and i have seen
that it is not yet implemented in sage, but there is some work in that
direction. My question is: will this feature be implemented in sage
4.1.2? If so, how complete
Hi!
I have small doubts, whether libjpeg is delivered with Mac OS X:
locate libjpeg
gives me the following
Third Party App.:
/Applications/Gimp.app/Contents/Resources/lib/libjpeg.62.0.0.dylib
/Applications/Gimp.app/Contents/Resources/lib/libjpeg.62.dylib
I would be interested in real word use cases, which demonstrate, why
such a system is needed.
E.g., I think Simon king did some cool
things involving at least Singular, GAP, Cython...
On 30 Apr., 12:00, Roman Pearce [EMAIL PROTECTED] wrote:
BTW, asking for contributors is the surest way to get
Hi Simon!
Do you call the computation of cohomology rings of finite p-groups a
real world application??
Sorry, I used the wrong terms.
I meant something like: nothing synthetic, just composing a few
features,
but demonstrating, how SAGE can be used to compute an
actual research problem.
I was
By the way, for me it matters most
that Python is a *beautiful* language.
Michael
On 30 Apr., 14:02, Michael Brickenstein [EMAIL PROTECTED] wrote:
Hi Simon! Do you call the computation of cohomology rings of finite p-groups
a
real world application??
Sorry, I used the wrong terms.
I
Hi!
If there is bigger interest in monomial ideals,
they can represented very efficiently in the case of Boolean
polynomials, by a single decision diagram.
Operations between monomial ideals can be implemented by single, very
efficient ZDD operations.
If you don't have degree bound one per
No, it seems to be a computation over a finite field (else you
shouldn't call npPower). So
0x2 is just 2 mod p.
Michael
On 31 Mai, 14:38, Martin Albrecht [EMAIL PROTECTED]
wrote:
On Saturday 31 May 2008, mabshoff wrote:
Hello folks,
I am sure the subject line will make sure that next to
What about
re.search(\.,str(n))
?
Michael
On 14 Jun., 19:18, Ondrej Certik [EMAIL PROTECTED] wrote:
On Sat, Jun 14, 2008 at 6:25 PM, Ondrej Certik [EMAIL PROTECTED] wrote:
On Sat, Jun 14, 2008 at 5:44 PM, Ondrej Certik [EMAIL PROTECTED] wrote:
Hi,
how can I distinguish Sage Integers and
He asked about floats. 1/2 is no float ...
But you can do:
re.search(\.|/,1/2)
Ondrej asked how to distinguish Sage Integers from floats without
knowing about Sage. I don't know exactly what this means. But,
Ondrej, would it be an acceptable solution for you to check whether
He didn't
Uh, I don't know what you are complaining about
the GAP to Mathematica could widen?
I work heavily on exactly that goal!!!
- increasing the distance to their Gröbner bases implementations ;-).
I would make myself ridiculous, if I would do benchmarks against it.
Just for conformity, I enter the
Btw. shouldn't that be
sage: a == b
not for *formulas*, since say also involve the syntax.
In terms of polynomials
(a+b)*c==a*b+b*c
But they are different formulas.
Anyway: I recommend to
multiply the the prop. calc. formulas by converting them to
Boolean polynomials (in the quotient
- About half the PolyBoRi doctests fail.
We had some API changes for 0.5. Burcin knows about that.
Michael
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For
Regarding the fastest in the world statement on the slides, GINV
unfortunately can't beat magma. I haven't timed it myself yet, but
Vladimir Gerdt claims that it's faster than maple.
Actuallly he was very modest and used the term not slower than
maple.
I am also very interested in
It's probably just a function pointer.
void(*nNormalize)(number a);
But I am not sure about side effects.
Michael
On 10 Sep., 15:54, John Cremona [EMAIL PROTECTED] wrote:
2008/9/10 Martin Albrecht [EMAIL PROTECTED]:
On Wednesday 10 September 2008, mabshoff wrote:
This is double plus
ok, it isn't normalize, but a very small function called npWrite
void npWrite (number a)
{
if ((long)a (npPrimeM 1)) StringAppend(-%d,(int)(npPrimeM-
((long)a)));
else StringAppend(%d,(int)((long)a));
}
This is set to the current ring
in numbers.cc
n-nWrite =
I made good experiences with TinyMCE in two projects.
So a
+1
Michael
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
That's what I was about to ask. Interesting! How much faster?
William
I think the very first reason is, that the Singular scripting language
is strictly inferior to Python
(this is why I support Sage).
Nevertheless. I just uploaded some nice example to the wiki, for
testing your F5
By the way, I would be interested to know, I they get a result at all
with F5 in this example (this would already be great, but no
pizza ;-) ).
Michael
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this
Hi Simon!
Am 23.10.2008 um 10:53 schrieb Simon King:
Dear Michael,
On Oct 23, 7:47 am, Michael Brickenstein [EMAIL PROTECTED] wrote:
Nevertheless. I just uploaded some nice example to the wiki, for
testing your F5 implementation.
I was originally provided by Gema Diaz
realize this isn't worth a pizza, but I wasn't gunning for one
either. If you want, I'll try the homogenized system on the basic F5
at work.
regards
john perry
On Oct 23, 4:14 am, Michael Brickenstein [EMAIL PROTECTED] wrote:
Hi Simon!
Am 23.10.2008 um 10:53 schrieb Simon King:
Dear
Do you consider 139 minutes to be reasonable time for a toy
implementation?
Absolutely, we are in the double exponential case, where differences
are quite big and
benchmarking is doomed.
Similarly, do you have a toy implementation of slimgb we could run
for comparison? By this I mean an
Even, if that bug wouldn't exist, I can only recommend
to do such computation over the rationals, if possible.
Gröbner bases and similar computations (like syzygies) over floating
point numbers are
very problematic: What is the leading term of a polynomial, where you
can't exactly determine,
http://m4ri.sagemath.org/performance.html
On 12 Nov., 11:07, Michel [EMAIL PROTECTED] wrote:
If the equations are really linear, then it's trivial.
Ah, can you tell me more?
Regards,
Michel
--~--~-~--~~~---~--~~
To post to this group, send email to
Hi!
What do you mean by the word linear:
x+y+z+1 (which is the normally considered as linear and
inhomogeneous).
or
something like deg bound 1 per variable:
x*y*z+1
If the equations are really linear, then it's trivial.
On 12 Nov., 09:03, Michel [EMAIL PROTECTED] wrote:
Hmm this question is
On 15 Nov., 00:41, William Stein [EMAIL PROTECTED] wrote:
* Industrial-strengthBooleancomputation
I wonder if this is similar to PolyBoRi? Or if it is some formal
logic think.
I wondered until today,
but now I got the answer:
Hi Martin!
I think, some parts are a little bit boring.
I hope, it is okay, to suggest some German formulations:
Personally, I don't find the Python-section very convincing.
- The Cython example seems a little bit boring
- it is completely unclear to most readers, that it is quite cool to
be
Hi!
I would like to see that in Sage too.
The combination of Gröbner bases and DPLL is very interesting (also
from a verification point of view).
I can only recommend to read the following paper.
C. Condrat and P. Kalla, A Groebner Basis Approach to CNF formulae
Preprocessing
I think, using
Hi Martin!
I am not an expert for imap.
But look at iparith.cc.
if ((w=r-idroot-get(v-Name(),myynest))!=NULL){
...}
else
{
Werror(identifier %s not found in %s,v-Fullname(),u-Fullname());
}
First we have to understand, what imap does...
pure Singular.
ring r=0,(x,y,z),dp;
poly f=x+y*z;
+1 for consistency.
However, you should really get rid of these evil coefficients,
then you can use term as synonym for monomial ;-).
Cheers,
Michael
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
I don't know the lib,
but there exists homolog.lib in Singular:
http://www.singular.uni-kl.de/Manual/latest/sing_763.htm#SEC822
(Link is assumed to break, when docs are updated)
Michael
--~--~-~--~~~---~--~~
To post to this group, send email to
Hi Alexander!
I think, you forgot to mention, that you are interested in arithmetic
modulo some power power of 2, so maybe 2^512.
Additionally, I want to mention, that upto 2^512 is not so large, but
just doesn't fit into single words.
Michael
On 26 Jan., 11:06, Alexander Dreyer
Probably, for numbers with 512 BITs (8 64 BIT words) (in particular
with a hard, small bound),
I could imagine, that is appropriate to store the data in place,
instead of using dynamically allocated memory, as it increases the
locality of reference and
doesn't use extra memory for pointers/space
Actually, denoting the ideals with braces:
(4)+(5)=(1)=(5),
as every uneven element is a unit.
but e.g.
(14)+(4)=(2)!=(1)
as 2 is a zero divisor.
Michael
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from
Even four times as slow as Magma is still fantastic (for GCDs).
While gcd's are not my personal interest, I keep an eye on the
subject.
I am interested in progresses, and would be willing to promote some
cooperation ideas to the Singular
group, if you have a good plan.
Michael
On 5 Feb., 01:09,
Hi!
It seems possible to cooperate on two levels:
- level 1: I can try to write a paper where I describe some of the
ideas I have put in my implementation of the modular multivariate gcd
algorithm, in order to help singular or flint implement them, maybe
better than I did myself in giac
I
Actually, from my perspective overloading malloc is a constant source
of pain.
This makes developers fighting malloc implementation, instead of
writing algorithms.
I would prefer Singular not doing so and I hope, that Sage doesn't
follow our bad example.
I think, the problem omalloc solves
Hi!
It's true, that redSB might have some influence on the code run inside
Singular.
In my slimgb test files, usually I do the following:
- normalize the leading coefficient to 1
- consider only the leading terms
- sort the list
If the algorithm gives back not necessarily a reduced GB, but a
On 26 Feb., 09:02, Alexander Dreyer
jan.alexander.dre...@googlemail.com wrote:
Hello! There is no direct interface to CUDD, at least not in the PolyBoRi
wrappers. You can see the code for the wrappers in the files:
c_lib/include/pb_wrap.h
sage/libs/polybori/decl.pxi
I think the web page is very nice.
By the way: If there are problems with cross browser CSS,
then a CSS framework like tripoli
might help.
Michael
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this
Well, if you want to know, what's possible look:
http://www.csszengarden.com/
Michael
On 27 Mai, 11:42, Dr. David Kirkby david.kir...@onetel.net wrote:
ahmet alper parker wrote:
Anyone know any technical paper about ergonomic and/or
functional/aesthetic development/design of a web sites?
I use SA on a daily basis and its feature set is awesome.
I recommend to you using the declarative layer
http://www.sqlalchemy.org/docs/05/ormtutorial.html#creating-table-class-and-mapper-all-at-once-declaratively
This makes it easier to you, to jump into SA.
Moreover, the declarative
Singular includes all necessary stuff, see #4539.
Cheers,
Michael
On 24 Mrz., 00:31, javier vengor...@gmail.com wrote:
Somebody wrote [1] a Reduce (cf. [2]) interface some time ago. If it
works properly one could try to load Bergmann [3] from it. That would
give access to plenty of Groebner
Hi!
For the simple case of exterior algebras
there exists already ring creation code in
the track ticket.
It might be a little bit hacky, but it works for now.
What is mainly needed, is cleaning the construction for Sage
class hierarchies and coercions.
Cheers,
Michael
Am 25.03.2010 um 10:10
Maybe EggFreezer can help.
http://pypi.python.org/pypi/EggFreezer/0.1.6
Cheers,
Michael
On 5 Mai, 18:57, Ondrej Certik ond...@certik.cz wrote:
On Tue, May 4, 2010 at 10:14 PM, Nils Bruin nbr...@sfu.ca wrote:
On May 4, 5:08 pm, Ondrej Certik ond...@certik.cz wrote:
I was bitten by this too in
Hi!
Sorry to post about that subject.
And I am sure, that you have already analyzed
the trac performance problems quite much and tried everything
(also the ideas of this mail).
In general, I have the usual bad experiences with trac performance.
But I noticed, that trac performance is quite good.
Hi!
Hmm, costs depend, can be quite extrem in corner cases:
- many terms
- many variables
- few bits per variables
- low degree
maximal exponent size depends on the ring.
I do not know at the moment how to find out.
Regarding exponentiation, there is a function
pPower(poly p, int i);
it uses the
Hi William!
For HTML parsing I recommend
http://www.crummy.com/software/BeautifulSoup/
Cheers,
Michael
On Jul 9, 12:02 am, William Stein wst...@gmail.com wrote:
Hi,
I just spent a few hours and wrote a Sage Nagbot. You may have
received an email from it.
It analyzes each ticket on trac
Hi William!
Thanks. I wanted to ask you for them, as I will arrive after 11am.
I have an remark:
IMHO, Singulars Groebner basis computation is already more than
competetive to Maple
in general and to Magma over finite fields.
Cheers,
Michael
On Jul 14, 3:13 am, William Stein wst...@gmail.com
,
which is the noncommutative part of
Singular:http://trac.sagemath.org/sage_trac/ticket/4539
During SD10 in Nancy, Michael Brickenstein and Burcin Erocal started
working on making Plural (the non-commutative extension of Singular)
accessible from Sage.
Oleksandr Motsak and Alexander Dreyer
SINGULAR /
Development
A Computer Algebra System for Polynomial Computations / version
3-1-0
0
by: G.-M. Greuel, G. Pfister, H. Schoenemann\ Mar 2009
FB Mathematik der
, Michael Brickenstein brickenst...@mfo.de wrote:
I just tried it and the standard library functions also use that
optimization.
In [1]: from copy import copy
In [2]: l=slkl
In [3]: copy(l) is l
Out[3]: True
Cheers,
Michael
Perhaps my knowledge of Python isn't strong enough, but I
is the identity on str.
Cheers,
Michael
Am 02.08.2010 um 11:08 schrieb Sebastian Pancratz:
On 2 Aug, 09:57, Michael Brickenstein brickenst...@mfo.de wrote:
I just tried it and the standard library functions also use that
optimization.
In [1]: from copy import copy
In [2]: l=slkl
In [3]: copy
---
Michael Brickenstein
Mathematisches Forschungsinstitut Oberwolfach gGmbH
Schwarzwaldstr. 9 - 11
77709 Oberwolfach
Tel.: 07834/979-31
Fax: 07834/979-38
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel
to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
---
Michael Brickenstein
Mathematisches Forschungsinstitut Oberwolfach gGmbH
Schwarzwaldstr. 9 - 11
77709
Hello!
You have to build a bundle.
Example:
if env['PLATFORM']==darwin:
pypb=env.LoadableModule('Singular/polybori_module',
wrapper_files,
LINKFLAGS=-bundle_loader + SINGULAR_HOME+Singular/
Singular,
LIBS=LIBS,LDMODULESUFFIX=.so,
,
CPPPATH=CPPPATH)
On 24 Aug., 11:58, Michael Brickenstein [EMAIL PROTECTED]
wrote:
Hello!
You have to build a bundle.
Example:
if env['PLATFORM']==darwin:
pypb=env.LoadableModule('Singular/polybori_module',
wrapper_files,
LINKFLAGS=-bundle_loader
contact
Michael Brickenstein and/or Alexander Dreyer directly.
Martin
--
name: Martin Albrecht
_pgp:http://pgp.mit.edu:11371/pks/lookup?op=getsearch=0x8EF0DC99
_www:http://www.informatik.uni-bremen.de/~malb
_jab: [EMAIL PROTECTED
Hi!
Actually we have really plenty of ideas and possible applications
left from my thesis.
And Alexander is cleaning up the PolyBoRi framework ;-) which will be
a huge benefit to the candidate.
Cheers,
Michael
On Sep 2, 3:58 pm, Alexander Dreyer
alexander.dre...@itwm.fraunhofer.de wrote:
On Sep 2, 3:58 pm, Alexander Dreyer
alexander.dre...@itwm.fraunhofer.de wrote:
Hello everybody,
I'm looking for a suitable PhD candidate for a position at the
Fraunhofer ITWM in Kaiserslautern, Germany.
Actually I suppose that good *intuition* for computational algebra and
*creativity* in
Hi!
On Oct 27, 3:44 am, William Stein wst...@gmail.com wrote:
The above is already how the ecosystem with Python
(http://pypi.python.org/pypi), Perl (http://www.cpan.org/), R, etc.,
work. Fortunately, Python has reasonably good support already for
this.
I think that going into this
Since bitbuckets tagline is Free code hosting for 5 users. Unlimited
private or public repositories., I would say Google code is vastly
better, since it is free for arbitrarily many users.
Nothing against google, but the five user limit on bitbucket only
affects private repositories.
Cheers,
I reported it to the Singular list.
I hope that the interest of the Singular group on libSingular will
increase.
http://code.google.com/p/convex-singular/wiki/libSingular
Cheers,
Michael
On Nov 5, 10:36 am, François Bissey f.r.bis...@massey.ac.nz wrote:
Hi,
I have toyed with
. rer. nat. Michael Brickenstein
Mathematisches Forschungsinstitut Oberwolfach gGmbH
Schwarzwaldstr. 9 - 11
77709 Oberwolfach
Tel.: 07834/979-31
Fax: 07834/979-38
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel
1 - 100 of 102 matches
Mail list logo
