ckage'
> (/usr/lib/python3/dist-packages/sage/misc/package.py)
>
>
> This appears to indicate that you have a dpkg-installed (old) version of
> Sage, which conflicts with the one you are installing.
>
>
>
> On 9 November 2024 09:50:05 GMT-06:00, Javier Gomez Serra
Thanks!
When using dpkg, pybind11 didn't prompt to that folder.
I tried to uninstall pybind11 and reinstall Sage and it didn't work.
Then I tried to move the folder. The installation still gets stuck. This is
the end of the output:
```Error building Sage.
The following package(s) may have failed
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 nee
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]
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
>
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 manag
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 mos
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
so
On Wednesday, March 20, 2013 5:09:40 AM UTC, Nils Bruin wrote:
> On Mar 19, 9:10 pm, Robert Bradshaw
> 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 bad...) I could make cac
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 expe
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 c
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
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.
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 sti
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) 31
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
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 "imploement
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 som
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 a
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
> jan@snapperkob:~/src/sagem
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 #9
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: ref
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 sage-
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
best of 3: 24.9 ms per loop
As the matrix sizes get 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-d
s a single row that is a multiple 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 g
nvertible, so the situation is
not too bad. Also, 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.
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
mat
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.
>
trac) I am
currently building the PyQt spkg on top of your sip and compilation seems
to be going fine so far.
Cheers,
Javier
On Sunday, June 17, 2012 11:45:19 AM UTC+1, Volker Braun wrote:
>
> I made the optional spkg, which builds on Linux but apparently not on OSX.
> Somebody who act
Hi Nicolas!
You might want to review #418 then ;-)
http://trac.sagemath.org/sage_trac/ticket/418
On Friday, June 15, 2012 10:25:57 PM UTC+1, Nicolas M. Thiéry wrote:
>
> Dear all,
>
> I discussed yesterday with Shalom Eliahou and some other persons that
> could be interested in using S
Done. Patch is ready for review at
http://trac.sagemath.org/sage_trac/ticket/12806
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 group at htt
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
>
On Thursday, June 14, 2012 3:27:41 PM UTC+1, jason wrote:
>
> So, to be clear, the new networkx function does not give you as much
> information as the old one?
Yes, that is the case. The (weighted) clustering coefficient algorithm
(with weighted *edges*)
computes some auxiliary *vertex* wei
>
> I don't think this should be a problem, but current policy is to first
>> deprecate it for a while (usually I've heard one year, see also #13109 for
>> something that will hopefully work in the future). Presumably you can
>> change the backend but still return the weights for now, and make
Hi all,
I am working on the failing doctest to upgrade our almost 2 year old
NetworkX 1.2 to NetworkX 1.6 (see #12806, [1]) I have sorted out the
doctest failures in graph.py and digraph.py; in order to solve the ones in
generic_graph.py there is some design decision that needs to be made.
The
The failing tests in graph.py are due to a minor API change in the
betweenness_centrality function.
They get fixed by replacing
{{{
return networkx.betweenness_centrality(self.networkx_graph(copy=False),
normalized)
}}}
in line 3252 of SAGE_ROOT/devel/sage-main/sage/graphs/graph.py by
{{{
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+uns
D? 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 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
>
>
, 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
-
ValueErrorTraceback (most recent call
last)
/Users/javier/code/ in ()
/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
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
can of worms. Better
leave it as it is for now, 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
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
Hi Jason,
On Jan 24, 1:07 pm, Jason Grout 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 to this group, send an email
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 wrote:
> I see from the market that it i
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
de your 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://www.sagemath.org
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
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
I am really confused here, 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-dev
or another ticket.
Cheers,
Javier
On Dec 7, 12:46 pm, Florent Hivert wrote:
> Hi Simon,
>
>
>
>
>
>
>
>
>
> > On 7 Dez., 10:16, Simon King wrote:
> > > But in both cases, it is also assumed that you are using coercion.
> > > Henc
I can replace 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 unsubs
aded 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/gr
Hi David,
On Dec 6, 6:29 pm, David Joyner 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 this group
---
The following tests failed: _test_eq
**
1 items had failures:
1 of 15 in __main__.example_0
***Test Failed*** 1 failures.
For whitespace errors, see the file /Users/j
it really looks like 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.
want to avoid doing the same
computations over and over when operating with conjugacy classes.
I guess the only way out is to resort 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
--
tatement', (396, 0))
---
TypeError Traceback (most recent call
last)
/Users/javier/ in ()
/Users/javier/ in Afoo(self)
/Applications/sage/local/lib/python2.6/site-packages/sage/mi
Traceback (most recent call
last)
/Users/javier/ in ()
/Applications/sage/local/lib/python2.6/site-packages/sage/misc/
cachefunc.pyc in __call__(self, *args, **kwds)
553 return self.cache[k]
554 except KeyError:
--> 555 w =
self._
is happens, but for now this suits my needs (with
the added advantage of not having 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
thought that worked out of the box 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 wrote:
> By the way, why aren't you using the
n commandline
exec current_statement in globals, locals
File "", line 1
class PowerSetRingElement(RingElement):
^
SyntaxError: unexpected EOF while parsing
Any ideas?
Cheers,
Javier
--
To post to this group, send an email to sage-devel@googlegroups.com
To
Hi Simon,
I don't know if this is what you are looking for, but you can simply
invoke the .mro() method in any "type":
sage: R. = PolynomialRing(QQ, 1)
sage: t = type(R)
sage: t.mro()
[,
,
, , , , , , , , ]
Cheers,
Javier
On 9 oct, 13:02, Simon King wrote:
> Hi!
>
&
nd
over inside all 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
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
wrote:
> Have you seen these examples?
>
> http://jsxgraph.uni-bayreuth.de/wp/home/example
he structure is
additive or multiplicative (as the only thing needed is the orders of
the direct summands used for defining the group), so they could easily
be refactored inside 9773.
Cheers
Javier
[1]
http://en.wikipedia.org/wiki/Structure_theorem_for_finitely_generated_modules_over_a_principa
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
perm_gps/
cubegroup.py"
[25.8 s]
--
All tests passed!
Total time for all tests: 25.8 seconds
Cheers
Javier
On 16 abr, 21:26, "Dr. David Kirkby" wrote:
> Is there anyone here with an AMD Opteron? I've got a couple of doctests
> failures
> on a 2.2 GHz Op
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 th
= gg2.GeneratorsSmallest()
sage: G1 = PermutationGroup(gens)
sage: type(G1)
sage: G1.order()
60
this can be useful for small groups, but I am afraid it would be
terribly inefficient for large ones. A better way would be
implementing general groups with generators and relations in sage, but
I do
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]
http://groups.googl
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 zeroes
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 algebr
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 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) + 1/
Hi Dima,
On Feb 18, 6:26 am, Dima Pasechnik 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 a weaker d
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 = CombinatorialFreeM
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 wo
On Feb 17, 2:57 pm, javier 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 is that there is
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 mi
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 Sage.
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 (for
Hi Nicolas,
On Jan 27, 10:28 pm, "Nicolas M. Thiery"
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 a result, this sta
Hi all
On Jan 28, 11:04 am, Alex Ghitza 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 as possible g
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,
dy contains an algorithm similar to what you 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 wrote:
> On Jan 12, 2:4
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 polynomi
On Jan 12, 12:47 am, William Stein 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. Something like
sag
Hi William,
On Jan 12, 12:24 am, William Stein 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 didn't work I as
Dima,
On Jan 11, 3:04 pm, Dima Pasechnik 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 can work
in a
Hi Dima,
On Jan 11, 4:14 am, Dima Pasechnik wrote:
> I reckon this must be due to Sage representing the finite field of
> order p^n
> as quotient rings F_p[x]/(f(x)), with f an irreducible polynomial of
> degree n. Indeed, in this case to do the coercion to, say F_{p^m}=F_p
> [x]/(g(x)), (with n
-
TypeError Traceback (most recent call
last)
/Users/javier/ in ()
/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:
Hi Dmitri,
On Jan 10, 5:48 pm, Dima Pasechnik 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
> gap> Field(F
f deciding which one should be
called.
Any further work along these lines will be most welcome!
Cheers
J
On Jan 10, 2:37 pm, Dima Pasechnik wrote:
> Javier,
>
> [...]
>
> > So, it wasn't that hard (for matrices) after all.
> Good!
> > I don't know whether/
>
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 tha
Hi Simon,
On Jan 10, 11:33 am, Simon King 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 sage() method (from
>
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
1 - 100 of 135 matches
Mail list logo
