You can make a caching function that returns a decorator depending on your
condition, that you subsequently apply to your function:
def conditional_caching(condition):
def decorator(f):
cache = {}
def cached_f(n):
if n in cache:
return cache[n]
If an method is *extremely* performance critical, one might want to give it
its own custom cache to avoid as much overhead as possible. I don't think
the utility cached_function and cached_method can be expected to have
shining performance for all types of functions and inputs.
Also, if one
did you ever resolve this? i am facing the same problem.
thx
jm
On Tuesday, January 28, 2014 5:41:57 AM UTC-8, Jeremy McFarland wrote:
Hello,
I am very impressed with sage, and would love to use it on my Ubuntu
server. I attempted to install sagecell, but that was a huge mess and I
gave
On Sunday, January 12, 2014 2:20:03 AM UTC, William wrote:
Thanks for reminding people of conda. One issue is that Sage's build
system is far more than just for installing Python package -- it's
much, much more (e.g., Gap, Singular, etc.).
conda started off as a python package manager,
On Saturday, January 11, 2014 4:37:56 PM UTC, William wrote:
Andrew's main argument is that there is strong interesting in writing
a nontrivial new build system that solves our unique set of problems
with Sage (since no existing build system does).
I am not qualified to discuss the
On Thursday, November 21, 2013 1:50:07 PM UTC, Volker Braun wrote:
... but there is very little that we currently can do to replace R
functionality. Having said that, there is a serious lack of statistics in
Sage.
In my personal experience the pandas package [1] is capable of doing most
On Wednesday, May 22, 2013 7:30:07 AM UTC+1, Snark wrote:
Is there a non-default and easy way to get a working
matplotlib-on-bare-python?
Depending on your operating system getting matplotlib working over system
python can be quite a tricky task, IIRC on Mac OSX 10.6 you must install
some
On Wednesday, March 20, 2013 5:09:40 AM UTC, Nils Bruin wrote:
On Mar 19, 9:10 pm, Robert Bradshaw rober...@math.washington.edu
wrote:
Sounds good. What if we called this foo.uncached(args) instead (which
is more verbose but much clearer, and tab completion shouldn't make
that too
With latest stable sage 5.7 (running under Mac OS 10.6.8) I have observed a
new behavior with tab-completion.
Trying to launch the notebook, tab completion keeps showing me two choices,
one of them a magic one:
sage: note
%notebook notebook
Is this a new intended behavior? I would only
I'll give it a look
Cheers,
J
On Tuesday, February 19, 2013 12:40:16 AM UTC, Keshav Kini wrote:
Hi,
If there are any Spanish speaking Sage devs who have a little time,
could you please review this Spanish translation of the sagenb UI?
https://github.com/sagemath/sagenb/pull/133
On Friday, February 1, 2013 1:03:55 PM UTC, jori.ma...@uta.fi wrote:
Should Sage aim to efficient code whenever something is added, or should
we just put in something that works and lock user interface, i.e.
command or function name, order of arguments etc?
I don't think we have to chose.
On Friday, February 1, 2013 11:41:40 AM UTC, jori.ma...@uta.fi wrote:
If I understand correctly, after conjugacy_class(self, g) is done it needs
only say conjugacy_class(self, g1)==conjugacy_class(self, g2) to check if
two groups are conjugates. (But still, for convenience there should be
for fallback methods and a more specific one containing GAP-specific
algorithms.
My patches don't merge anymore, but I will try to rebase them over the
weekend.
Thanks for working on this!
Javier
PS: Due to a new work situation I haven't been following recent
developments very closely.
Is libGAP
Hi Nathan,
What do you mean by calling absolute value or norm of a polynomial? Why
should these methods even be defined?
Cheers,
J
On Friday, January 4, 2013 1:50:14 PM UTC, Nathann Cohen wrote:
Hell everybody !!!
Of course I do not know if what I do has any meaning, but I still
You think you have it bad? Look at who the other Javier López Peña is:
http://en.wikipedia.org/wiki/Francisco_Javier_L%C3%B3pez_Pe%C3%B1a
when this guy hit the news I received hate mail on a daily basis for almost
a year :-/
On Wednesday, July 25, 2012 9:31:29 AM UTC+1, John Cremona wrote
There is a (sort of new) fast probabilistic algorithm for computing Galois
groups, due to Nikolai Durov:
-
N. V. Durov, Computation of the Galois group of a polynomial with
rational coefficients. I. (Russian) Zap. Nauchn. Sem. S.-Peterburg. Otdel.
Mat. Inst. Steklov. (POMI)
I understand that from some point of view mixing groups and
their representations is a bad idea, but many groups are naturally
defined as transformation groups and using a matrix presentation
is just as natural as describing them by permutations, or even more so.
Not to mention the huge size
On Thursday, July 19, 2012 9:52:26 AM UTC+1, Dima Pasechnik wrote:
let me nitpick first by saying that in group theory
presentation means presentation by generators and
relations whereas you mean a (linear) representation.
Fine, maybe I should have use realization or imploementation
On Friday, July 13, 2012 1:53:00 PM UTC+1, Jan Groenewald wrote:
Can you build using make -k instead of make? This will make the
build continue after errors (but it will still respect dependencies).
No idea how. Our rules file say to run:
0
On Friday, July 13, 2012 2:00:36 PM UTC+1, Javier López Peña wrote:
Maybe I am saying something stupid here, but cannot you just change the
first line to this?
#!/usr/bin/make -f -k
Sorry, that should be
#!/usr/bin/make -k -f
--
--
To post to this group, send an email to sage-devel
On Monday, July 9, 2012 2:59:33 AM UTC+1, Birk Eisermann wrote:
(I have searched and found that there has been discussion on how much
networkx will be adapted in sage - and it seems that there is some issue
with the license... right? I also read the sage-devel thread graph
theory: refactor
Why cannot we have our cake and eat it too?
Isn't there a way to have the import/export classes in
a separate file that gets imported inside an import/export
alias in the graph class so that
G.export
is actually GraphExporter(G, whatever) and tab
completion works?
Partially related, ticket
Compiled and long tests pass in OS-X Snow Leopard 10.6.8
J
On Friday, July 6, 2012 8:05:28 AM UTC+1, Jeroen Demeyer wrote:
Because many of the Sage testing machines (redhawk and all of Skynet)
are down, version sage-5.1.rc1 has been tested much less than usual.
So, please build
bigger, the random permutation method appears
to be about 2x slower than the whole random matrix method.
Cheers,
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options
Hi guys,
ticket 12806, upgrading 2 year old networkx 1.2 to version 1.6, needs an
extra review.
The technical part was already positively reviewed by Keshav Kini, but
Jeroen pointed
out a docbuild failure due to a tex error. I patched the problem, and now
need a new
review. The patch consists
I know little of random methods, but do we really need to make things so
complicated? As the OP suggests, we might as well just generate matrices
uniformly at random and discard if not invertible. The set of invertible
matrices is Zariski open, so the probability of hitting a non-invertible
, there is no need to compute the determinants, knowing
if the rank is full or not is enough. So my point is: even if not *very*
fast, still seems faster than what we have now, and it is very easy to
implement while we think of a better solution.
Javier
--
To post to this group, send an email
of another one, as the
chance of hitting the offending row is 1/n and the rank gets recomputed
every time.
Unless there is a faster way of computing the rank taking advantage of
previously used computations, that is.
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
in the spke vs easy_install
thing, but if having it as an optional spkg makes someone's life easier, my
vote is just go for it.
Cheers,
Javier
On Friday, June 22, 2012 2:32:55 AM UTC+1, kcrisman wrote:
I don't remember if we need votes for optional spkgs. I think we do.
Anyway, here is one
On Thursday, June 14, 2012 3:39:23 PM UTC+1, Javier López Peña wrote:
Yes, that is the case. The (weighted) clustering coefficient algorithm
(with weighted *edges*)
computes some auxiliary *vertex* weights. The old method used to return
all of it, the new one
just returns the clustering
))
with disastrous consequences.
Is there any design choice involved here that I can override to get
something like
sqrt(2)/2
instead?
Cheers,
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr
, not to the examples section.
Cheers,
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http
? In your example, why would one want to save the
tuple (5790338948, 24) rather than (24, 12)?
Cheers,
Javier
On 7 feb, 01:53, Dima Pasechnik dimp...@gmail.com wrote:
A workaround is to use GAP facilities to encode a pc group using a pair of
integers.
Cutting from the GAP manual on CodePcgs
gap G
Traceback (most recent call
last)
/Users/javier/code/ipython console in module()
/Applications/sage/local/lib/python2.7/site-packages/IPython/
Prompts.pyc in __call__(self, arg)
550
551 # and now call a possibly user-defined print
mechanism
-- 552 manipulated_val
over any other ring or field
ValueError: self must be a square matrix
so I changed the error message over QQ and the doctests using it
to be consistent with all the other rings.
Cheers,
Javier
[1]: http://trac.sagemath.org/sage_trac/ticket/12370
--
To post to this group, send an email to sage
, or is this done by some design reason?
Cheers
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL
, then.
Cheers
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
Hi Volker,
thanks for your work on the droid app!
In an HTC Desire with Cyanogenmod 7 (Android 2.3 Gingerbread)
I keep getting Web page not available messages whenever I hit the
run button.
Cheers,
Javier
On Jan 24, 6:17 am, Volker Braun vbraun.n...@gmail.com wrote:
I see from the market
Hi Jason,
On Jan 24, 1:07 pm, Jason Grout jason-s...@creativetrax.com wrote:
Can you reach aleph.sagemath.org with your web browser on that phone?
Yes, it loads in my phone browser, though it takes almost an entire
minute to load. Computations there work too.
Cheers,
Javier
--
To post
using plot3d the mesh = True and dots = True options have no
effect whatsoever.
These are reproducible in my local installation, in sagenb.org and in
test.sagenb.org
Cheers
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email
Hi Johan,
do you have the typeset box checked in your notebook?
If so, then things are displayed using the latex method
instead of the repr one.
Cheers,
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel
suggestion in my patch!
Cheers,
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http
, since my patch doesn't modify group.pyx
Are you applying the right patches, or the two year old bit-rotten
version?
Cheers,
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
They were listed on the comments. I have upgraded the ticket
description to make it clearer.
Cheers,
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit
ticket.
Cheers,
Javier
On Dec 7, 12:46 pm, Florent Hivert florent.hiv...@lri.fr wrote:
Hi Simon,
On 7 Dez., 10:16, Simon King simon.k...@uni-jena.de wrote:
But in both cases, it is also assumed that you are using coercion.
Hence, when the test self==None raises an error
to a hand-knitted cache, as
probably
the overhead of a hand-made definition is less than redoing the whole
computation :-/
Thanks for your help!
Cheers
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel
this solves my problem. Thanks again Simon!
Cheers,
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL
**
1 items had failures:
1 of 15 in __main__.example_0
***Test Failed*** 1 failures.
For whitespace errors, see the file /Users/javier/.sage//tmp/
conjugacy_classes_23354.py
[5.2 s
Hi David,
On Dec 6, 6:29 pm, David Joyner wdjoy...@gmail.com wrote:
Where is it? Is it in one of the patches posted to the trac ticket?
Yes, it is in trac_7886_conjugacy_classes.patch
Cheers,
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from
it in the patch
trac_7886_conjugacy_classes_module.patch
Sorry!
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com
the test to include
parent checking
(although the example above suggest that it shouldn't be necessary).
Any idea on what is causing the Testsuit to fail, even if the doctests
pass?
Cheers,
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from
tokenizing input
The following traceback may be corrupted or invalid
The error message is: ('EOF in multi-line statement', (396, 0))
---
TypeError Traceback (most recent call
last)
/Users/javier
, 0))
---
TypeError Traceback (most recent call
last)
/Users/javier/ipython console in module()
/Users/javier/ipython console in Afoo(self)
/Applications/sage/local/lib/python2.6/site-packages
with sagecommandline but
now I realize it is only the sage prompt that gets colorized, so I
will probably make my own environment based on minted for code
listing.
Cheers,
Javier
On Oct 26, 6:48 am, Dan Drake dr...@kaist.edu wrote:
By the way, why aren't you using the sageblock environment
to install pygments in a place where
my latex can find it).
If you think than any of this code or any variation would make an
useful addition to sagetex, feel free to rip it off!
Cheers,
Javier
On Oct 26, 1:21 pm, Dan Drake dr...@kaist.edu wrote:
On Wed, 26 Oct 2011 at 02:03AM -0700, javier wrote
):
^
SyntaxError: unexpected EOF while parsing
Any ideas?
Cheers,
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com
'sage.structure.parent.Parent', type
'sage.structure.category_object.CategoryObject', type
'sage.structure.sage_object.SageObject', type 'object']
Cheers,
Javier
On 9 oct, 13:02, Simon King simon.k...@uni-jena.de wrote:
Hi!
When creating a new-style class with several base classes, Python
uses a method resolution
the loops
if abs(varia-root) 0.67
it is a very little time but adds up quickly over the iterations. Or
if you want to be finer, define the 2./3 as a constant outside of the
loops (with whichever precision you need) and then use the defined
constant inside.
Cheers
Javier
--
To post
There is also an interesting LGPL project based on HTML5:
http://graph.tk/about/
having the choice of interact with sage plots in this way would be
really cool.
Cheers
J
On 13 ago, 16:45, Leonardo Parada leonardoparadavalen...@gmail.com
wrote:
Have you seen these examples?
they could easily
be refactored inside 9773.
Cheers
Javier
[1]
http://en.wikipedia.org/wiki/Structure_theorem_for_finitely_generated_modules_over_a_principal_ideal_domain
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email
I have been looking at the paper and at first glance don't see any
reason that would prevent the stabilization algorithm from working
over any Euclidean domain, as there you have division with remainder,
gcd, xgcd, all ideals are principal, sum of ideals is generated by the
gcd and so on. The only
]
--
All tests passed!
Total time for all tests: 25.8 seconds
Cheers
Javier
On 16 abr, 21:26, Dr. David Kirkby david.kir...@onetel.net wrote:
Is there anyone here with an AMD Opteron? I've got a couple of doctests
failures
on a 2.2 GHz Opteron machine with 1 GB RAM and 3 GB swap. The failures
If one thinks of absolute value as in the metric sense of norm
then indeed the determinant makes no sense. Some valid norms for a
matrix would be:
* The maximum of the absolute values of its entries (supremum norm)
* The root of the sum of the squares of all entries (2-norm)
* The maximum of the
.
Cheers
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
IIRC in the latest Cython release there was a bugfix that reduced the
access time for all cython non-cdef classes [1]. Given the amount of
time that is spent on function calls I wouldn't be surprised if that
change propagated to a general speedup in the doctests.
Cheers
J
[1]
Hi Harald,
I think the operations in the case with zeroes are not random, but a
cyclic permutation of the rows, which allows to reuse most of the
previously computed minors. I haven't read a complete description of
the algorithm, but if cyclic permutations are always enough in the
case with
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 basis, Hilbert series, Hochschild
cohomology and many other ring theoretical methods for big families of
noncommutative
Hi all,
I am getting some weird errors doing computations with groups
algebras. Here is an example:
I create an element of the group algebra:
sage: G = SymmetricGroup(3)
sage: A = GroupAlgebra(G, QQ)
sage: c = sum(1/x.order()*A(x) for x in G)
sage: c
() + 1/2*(2,3) + 1/2*(1,2) + 1/3*(1,2,3) +
Ooops! Too many group algebras lying around. Just ignore my previous
post.
Sorry for the noise.
Cheers
J
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this
Hi Dima,
On Feb 18, 6:26 am, Dima Pasechnik dimp...@gmail.com wrote:
I am curious to know, how you are doing this. IMHO for this you need
to know
each irreducible representation explicitly --- but then you can just
stack up the right
number of copies of each irreducible.
Or you rather mean
Hi all,
I am trying to use sage to compute the Artin-Wedderburn decomposition
of a group algebra. Since I need exact expressions I am working over
QQbar rather than over CC. When trying to compute the idempotents I
get an error resulting from an attempt to coerce a rational number
into QQbar. A
On Feb 17, 2:57 pm, javier vengor...@gmail.com wrote:
Observe that in this situation the numbers I am trying to coerce into
K are rational:
Apparently I was assuming too much. The result of the evaluation of
the character belongs to some cyclotomic field, so apparently the
problem
Hi Nicolas,
What do you mean by exact? I am using CyclotomicFields on a regular
basis for similar things, and this works well. And I would expect it
to be faster than QQbar.
You are right, I guess I could just use CyclotomicField(n) where n is
the order of the group and everything should work
Hi all,
thanks for the tip-off in CombinatorialFreeModule, I have been trying
to use this, but cannot find any sensible way to make it work.
sage: G = SymmetricGroup(3)
sage: B = sorted(list(G))
sage: n = len(B)
sage: K = CyclotomicField(n)
sage: A = GroupAlgebra(G,K)
sage: V =
Some people in my dept. use Cadabra, a CAS developed with field-theory
in mind (i.e. lots of tensors):
http://cadabra.phi-sci.com/index.html
I have no experience with it so cannot advise on its usability.
However, it's written in C++ and released under GPL2, so ideally could
be wrapped up in
Hi all,
gotta do some computations involving a really big matrix, and need to
save each row in a different file (matrix is too big to fit in
memory). SInce every row can be computed independently I have tried to
parallelize the computation. First, this is my original computation of
the matrix
Hi Nicolas,
On Jan 27, 10:28 pm, Nicolas M. Thiery nicolas.thi...@u-psud.fr
wrote:
* Puts all permutation groups and some other finite groups in the
corresponding categories. There remains to handle finite matrix
groups and Galois groups in sage/rings/number_field/.
* As
Hi all
On Jan 28, 11:04 am, Alex Ghitza aghi...@gmail.com wrote:
[snip]
which some might frown at. So another possibility would be this: given
x and y, first compare the norms of x and y; if the norms are equal,
compare str(x) and str(y). I think this would make as much mathematical
sense
Big speed improvements on calculations involving small finite fields,
like finding primitive elements? Possibility for automatic coercion
for finite fields? And the cost is just 0.5MB of harmless plain text
that doesn't even need to be compiled!?
Give it a +1!
Cheers
J
On Dec 18 2009, 11:16 pm,
There are indeed well known (sort of) fast algorithms for
factorization of multivariable polynomials over finite fields:
http://portal.acm.org/citation.cfm?id=808748
http://www.jstor.org/stable/2008063?seq=1
In the second paper there is a particular (probabilistic) algorithm
for bivariate
are
looking for.
Alternatively, since it seems that van Hoeijs algorithm reduces to a
knapsack problem, so maybe it could be easily built upon the brand new
fast graphs methods that we got?
Cheers
J
On Jan 12, 2:08 pm, YannLC yannlaiglecha...@gmail.com wrote:
On Jan 12, 2:46 pm, javier vengor
Dima,
On Jan 11, 3:04 pm, Dima Pasechnik dimp...@gmail.com wrote:
no, from GAP's point of view, Z(2^4)^5 is an element of GF(4).
And thus b is such an element, too...
then from the gap-to-sage point of view nothing else can be done. A
coercion between finite fields is needed before this method
Hi William,
On Jan 12, 12:24 am, William Stein wst...@gmail.com wrote:
Dumb question. There is code in Sage already to convert from GAP's
GF(p) (or GF(q)) to Sage's:
you are completely right. Since at the beginning I tried to do
something like
sage: a = gap(Z(7))
sage: a.sage()
and that
On Jan 12, 12:47 am, William Stein wst...@gmail.com wrote:
Isn't the case of non-prime fields also already in Sage? It was in my
example.
The __call__ function for a non-prime field yes, was already defined.
What wasn't was the conversion of a gap non-prime field into a sage
prime field.
This is now Ticket #7890:
http://trac.sagemath.org/sage_trac/ticket/7890
Thanks for volunteering to work on this, Dmitri! It would be awesome
to be able to access all that gap functions from sage.
Skimming a bit at the conversion code, it looks like the function
sage is called on the gap string
Hi Simon,
On Jan 10, 11:33 am, Simon King simon.k...@nuigalway.ie wrote:
Well, that's a default method, i.e., if nothing else is implemented
than a conversion by strings is attempted, because there is some hope
that the result makes sense.
So, a proper way would be to override the default
Hi all,
have been hacking around a bit and finally got to this:
the class GapElement doesn't have a _sage_ method, when sage() is
called, it defers to the ExpectElement method, which is not aware of
the fact that we have a GAP object to start with. OTOH, I observed
there is a _matrix_ method
should be
called.
Any further work along these lines will be most welcome!
Cheers
J
On Jan 10, 2:37 pm, Dima Pasechnik dimp...@gmail.com wrote:
Javier,
[...]
So, it wasn't that hard (for matrices) after all.
Good!
I don't know whether/
how this can be applied to the E(9) thing unless
Hi Dmitri,
On Jan 10, 5:48 pm, Dima Pasechnik dimp...@gmail.com wrote:
This is not good enough. It could be that the [1,1]-element lies in a
proper subring.
One should either test each matrix entry and take the biggest ring, or
ask GAP to do it for you.
Say, if A is a GAP matrix you can do
Traceback (most recent call
last)
/Users/javier/ipython console in module()
/Applications/sage/local/lib/python2.6/site-packages/sage/rings/
finite_field_givaro.so in
sage.rings.finite_field_givaro.FiniteField_givaro.__call__ (sage/rings/
finite_field_givaro.cpp:4466
Hi there,
I am trying to get my code moved to the source files, but am finding
some problems (it is my first time!). What I did was:
- cloning sage to my own branch (called sage-groups),
- Added a new file $SAGE_ROOT/devel/sage-groups/sage/groups/
group_conjugacy_class.py with my class code
-
method, is it better to return a
python set or a sage Set?
Cheers
J
On Jan 9, 1:23 pm, javier vengor...@gmail.com wrote:
Hi there,
I am trying to get my code moved to the source files, but am finding
some problems (it is my first time!). What I did was:
- cloning sage to my own branch (called
)
sage: gg = g._gap_()
sage: ggg = gg.sage()
---
NotImplementedError Traceback (most recent call
last)
/Users/javier/ipython console in module()
/Applications/sage/local/lib/python2.6/site-packages/sage
Nguyen nguyenmi...@gmail.com wrote:
Hi,
On Sun, Jan 10, 2010 at 2:06 AM, javier vengor...@gmail.com wrote:
Sorted it out, I had forgotten to import one file. Sorry for the
noise. Class patches nicely now; I am just having some test failures
due to different orderings of some output sets
Hi all,
I have been working on this and after a while decided that my original
approach wasn't the most appropriate and started rewriting everything
for scratch.
After thinking about this problem making conjugacy_class a method
that returns a list (or set) didn't feel right. GAP has many methods
According to [1], sys.maxint will be removed in Py3K, so it might be
safer to replace it with sys.maxsize to save us a problem in the
future.
[1] http://docs.python.org/3.1/whatsnew/3.0.html#integers
Cheers
J
On Jan 4, 9:30 pm, Dr. David Kirkby david.kir...@onetel.net wrote:
javier wrote
A into
a Set (or set) will kill any duplicate elements that A might have, so
one has to be careful with it.
Cheers
Javier
On Dec 10, 9:02 am, Nathann Cohen nathann.co...@gmail.com wrote:
Hello !!!
I just tried it, and I'm actually quite surprised
def diffA(a,b):
return [v for v in a if v
) for x in G])
maybe with some added checks to deal with abelian groups (trivial
conjugacy classes) and not using the naive method on infinite groups.
In which file should the code be included?
$SAGE_ROOT/devel/sage/sage/generic.py or somewhere else?
Cheers
Javier
--
To post to this group, send
about this.
Cheers
Javier
--~--~-~--~~~---~--~~
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel-unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com
anything like that, but don't know
whether this is due to my particular desktop (1 processor, two cores,
32bit).
Cheers
Javier
--~--~-~--~~~---~--~~
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email
1 - 100 of 125 matches
Mail list logo
