$SAGE_ROOT/devel/sage-main/sage/rings/polynomial/multi_polynomial_libsingular.pyx
contains
if not self._parent._base.is_field():
raise NotImplementedError, Factorization of multivariate polynomials over
non-fields is not implemented.
It seems trivial to have at least working (but maybe
On Fri, 4 Oct 2013, Volker Braun wrote:
If the integral polynomial is not monic then the roots need not be integral:
sage: R.x = QQ[]
sage: (4*x^2-1).factor()
(4) * (x - 1/2) * (x + 1/2)
So this would not be factorizable in ZZ[x] but is factorizable in QQ[x]
Of course. Duh.
Anyways, is
On Fri, 4 Oct 2013, Marco Streng wrote:
Just take the factorization over QQ, then for each factor, make it a
primitive integral polynomial, i.e., multiply by the lcm of the
denominators of the coefficients and divide by the gcd of the numerators of
the coefficients. Then you have a
On Mon, 7 Oct 2013, John Cremona wrote:
sage: R.x,y = ZZ[]; print (4*x^2-1).factor()
---
NotImplementedError Traceback (most recent call last)
But that is just what I would like to implement, i.e.
I just make a small test:
P.a,b,c,d=QQ[]
for i in range(1,10):
p1=ZZ.random_element(1,5)*P.random_element()
p2=ZZ.random_element(1,5)*P.random_element()
p3=ZZ.random_element(1,5)*P.random_element()
p=p1*p2*p3
if p==0:
continue
print p
f=p.factor()
On Mon, 7 Oct 2013, Burcin Erocal wrote:
I got few floating point exceptions, but they seems to be already
reported: http://trac.sagemath.org/ticket/14658
However, I also found one new error:
Can you check if these problems are still there with the Singular spkg
posted on #14333?
I
On Tue, 29 Oct 2013, Vincent Delecroix wrote:
all rounding are implemented in the CPU (is that true ? perhaps changing
the rounding often makes it slower). Do you have timings ?
Seems to be more complicated than just slow-or-fast -question. See
On Tue, 11 Feb 2014, ref...@uncg.edu wrote:
It seems as though one should always use pari to compute gamma(x)
regardless of whether x is real or complex, since there is such a
drastic speedup when using pari.
Memory? Time to load faster code from disk?
What actually happens when user of
On Wed, 12 Feb 2014, ref...@uncg.edu wrote:
I don't understand what you mean. The real and complex fields are loaded
upon start up. It seems as though time testing that if the user wishes to
compute gamma(x) for real x, he would achieve a faster result by changing x
into a complex number and
On Wed, 12 Feb 2014, ref...@uncg.edu wrote:
Ah, I see what you mean. If that's the case then I understand. How does
one find out if this is true?
In general memory usage is complicated to even define on Linux. However,
a quick test
print get_memory_usage()
gamma(3.14159)
print
On Wed, 12 Feb 2014, William Stein wrote:
1. It is *NOT* true.Sage just directly calls the PARI C library,
which is always loaded on startup of Sage.
OK, good (or bad, which way one wants it to be...).
It's pretty likely that when the line of code in question was written
(prob in 2005
Here is an example where mpfr-gamma and pari-gamma give different
results:
x=1
for i in range(1,400):
x=x*1.101
if gamma(ComplexField(prec=1000)(x))-gamma(x) 0:
print x
outputs
4.71129468628944e16
--
Jori Mäntysalo
--
You received this message because you are subscribed to
On Thu, 13 Feb 2014, Jori Mantysalo wrote:
Here is an example where mpfr-gamma and pari-gamma give different results:
Duh, forget this one: pari-gamma gives Inf.
--
Jori Mäntysalo
--
You received this message because you are subscribed to the Google Groups
sage-devel group.
To unsubscribe
On Mon, 17 Feb 2014, Zimmermann Paul wrote:
On my computer, computing gamma(Pi^2) to 1 bits takes about 1.4s (for the
first computation, when Bernoulli numbers are not cached) instead of 6.1s with
Pari/GP.
Out of curiosity: How this compares to, for example, Mathematica?
--
Jori
On Thu, 13 Mar 2014, Martin Albrecht wrote:
what happened to the Sage 2012 GSoC project on lattices described here:
http://gsoc-sage-lattices.blogspot.co.uk/
I don't know. But anyways, contact Nathan Lawless if you are going to do
something with lattices.
Sage way to generate
Solving equations:
solve(e^x==e^3, x) -- [x == 3]
solve(2^x==2^3, x) -- [x == log(8)/log(2)]
So it does not simplify. But (log(8)/log(2)).full_simplify() returns
log(8)/log(2), not 3. OK, I can do .simplify_radical(), but why
full_simplify() doesn't try it?
I also tried
On Sat, 15 Mar 2014, Eric Gourgoulhon wrote:
It's because since Sage 5.12 simplify_radical() has been removed from
simplify_full() due to many issues - -
OK. Maybe someone can add
Does not apply simplify_radical, see :trac:`12737`.
to /src/sage/symbolic/expression.pyx after line 7779.
--
On Thu, 3 Apr 2014, John Cremona wrote:
There are different objects all called lattices in different contexts.
Let's start by acknowledging that we are not talking about some kind of
poset -- though there will be others for whom that is what the word
lattice means.
Then what word should be
After logging into sage one sees what sheets are running, i.e. that have
data in memory so that user can just continue doing something.
However, is it possible to add some way to see really running sheets,
i.e. those that are actually calculating something? At least for admin
this would be
On Tue, 15 Apr 2014, John Cremona wrote:
One thing you can do is run top on your server: assuming that all
notebooks are running under the account with username sage, you can
look to see if any processes owned by sage are using a non-trivial
amount of CPU. If not, you can go ahead and restart
I was playing with more complex functions and found a memory leak. I have
been trying to figure out where is it, and here is result so far:
def foo(L, s):
return sum( [L.mobius_function(y, L.top())/prod(s[x] for x in
L.interval(L.bottom(), y)) for y in s.keys()] )
S.x,y=QQ[]
def bar(L,
There is function is_isomorphic in Sage, but there is not is_conjugate.
For curiosity I looked source, and it seems to be an oneliner to write
one:
def are_conjugates(self, g1, g2):
Returns ``True`` if ``g1`` and ``g2`` are conjugates under the
action of ``self``.
On Thu, 31 Jan 2013, Simon King wrote:
- What is naming policy? Should this be is_conjugate?
Indeed, I would keep the naming as close to GAP's one as possible.
As close as possible is, I think, not a good advice -- because it
could be understood to adopt GAP's function name IsConjugate.
On Thu, 31 Jan 2013, Javier López Peña wrote:
there are indeed many GAP method that are not exposed to the sage library.
A while back I wrote a wrapper for (some) conjugacy classes methods:
http://trac.sagemath.org/sage_trac/ticket/7886
My patches don't merge anymore, but I will try to
On Fri, 1 Feb 2013, Dima Pasechnik 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
This is not efficient - -
True.
Should Sage aim to efficient code whenever something is added, or
On Tue, 5 Feb 2013, Javier López Peña wrote:
Incidentally, I think I misunderstood what you wanted to do. Apparently
you are trying to identify conjugate *subgroups* of a group G, whilst
what I did works for identifying conjugate *elements* of the group. So
feel free to implement your
On Tue, 17 Jun 2014, Gregory Bard wrote:
This has been brought up many times before, but I'd like to bring up
the possibility of adding two commands to Sage: cuberoot(x) and
nthroot(x, n)
Could you summarize previos discussion(s)?
For example what should cuberoot(1)^2 be? Different from
Does Sage has a function to check if poset A contains a subposet
isomorphic to subposet B?
If not, is it because there is no good algorithm for it, or because it is
not implemented?
--
Jori Mäntysalo
--
You received this message because you are subscribed to the Google Groups
sage-devel
On Fri, 22 Aug 2014, Nathann Cohen wrote:
Does Sage has a function to check if poset A contains a subposet
isomorphic to subposet B?
Not... exactly. There is no Poset method that does that, but there is a
DiGraph method that does that. But then, it depends on what you call a
On Fri, 22 Aug 2014, Travis Scrimshaw wrote:
Next, short description. There are three different style used
for True/False -functions:
- Returns True if the poset has a unique minimal element.
- Returns True if the poset is totally ordered, and False
otherwise.
-
On Fri, 22 Aug 2014, Mark ODell wrote:
cp: preserving ACL for
`/home/modell/pkg/sage/sage-6.3/local/include/NTL/version.h': Operation not
supported
Error installing package ntl-6.1.0.p0
Do you have some default ACL's set up? Something like
setfacl -m --default u:backup:r
said to
Let us imagine a person reading
http://www.sagemath.org/doc/reference/combinat/sage/combinat/posets/posets.html
It starts saying implements finite partially ordered sets, so there is
no support for infinite posets.
This page tells a reader about has_bottom() and has_top(), and there is
also
On Fri, 22 Aug 2014, Mark ODell wrote:
no default access control that I am aware of
though I do little with ACLs
a specific command you would like run for output ?
cp -p tries to preserve ACL's. It gives warning, not error, when it can't.
So, it seems that ACL's are not problem. However,
On Mon, 25 Aug 2014, Travis Scrimshaw wrote:
In my experience, most people read the documentation in Sage using `?`
rather than the reference manual. So it's not a matter of where the method
is defined (you can think of the category like an ABC in this case).
OK. I have used to using html
Graph({'Pekka':['Matti', 'Leena', 'Timo'],
'Matti':['Mari']}).show(vertex_size=1500)
There is nothing wrong with output, but why it changes every time I run
the command? Bug or feature?
--
Jori Mäntysalo
--
You received this message because you are subscribed to the Google Groups
On Mon, 25 Aug 2014, Volker Braun wrote:
Thats not how it works. Try sage -f ntl
It works. But:
libtool: install: ranlib /home/jm58660/sage-6.3/local/lib/libntl.a
libtool: finish:
Just a short note,
On Mon, 25 Aug 2014, Travis Scrimshaw wrote:
Although I don't think we have methods to get all lattices of a given
rank yet in Sage...IDK off-hand for sure.
Yep, AFAIK there is none.
Nathan Lawless has made a code for generating lattices (and has given it
to me).
On Tue, 26 Aug 2014, Jori Mantysalo wrote:
Gunnar Brinkmann has made a code for generating posets. I think I'm
going to try if I can compile it as a part of Sage.
I got permission from Brinkmann and Brendan McKay to add code to Sage. The
code is written in C.
The code is much faster, about
On Fri, 22 Aug 2014, Nathann Cohen wrote:
Does Sage has a function to check if poset A contains a subposet
isomorphic to subposet B?
Not... exactly. There is no Poset method that does that, but there is a
DiGraph method that does that. But then, it depends on what you call a
subposet of a
On Thu, 28 Aug 2014, Nathann Cohen wrote:
Yes, you do need this induced=True otherwise the chain contains all
other (smaller) posets :-P
But
def has_isomorphic_subposet(A, B):
for x in Subsets(A.list(), k=B.cardinality()):
if A.subposet(x).is_isomorphic(B):
return
On Thu, 28 Aug 2014, Emil Widmann wrote:
IMO there are three big issues with the current Sage Windows VM:
1 - It's slow because it runs within the VM (which also causes some
usability issues with multiple webpages by the OS setup); this also
has high memory usage.
2 - It's too big (I think
On Thu, 28 Aug 2014, Nathann Cohen wrote:
(In the forest)
With the transitive closure ! The transitive closure AND induced= true.
Now it seems to work! I'll continue testing, and add a function to sage.
Is it pine forest? In any case, have a nice walk.
--
Jori Mäntysalo (mänty=pine,
On Thu, 28 Aug 2014, Nathann Cohen wrote:
Now it seems to work! I'll continue testing, and add a function to
sage.
It is meant to be equivalent, so it would be a bad news if they did not
give the same answer :-P
As a side note of testing: Docs for is_modular() reference to the
wikipedia
On Thu, 28 Aug 2014, Jori Mantysalo wrote:
As a side note of testing: Docs for is_modular() reference to the wikipedia
Uh, forget. If poset is also lattice and has subposet that is also
lattice, still subposet might not be sublattice.
--
Jori Mäntysalo
--
You received this message because
On Thu, 28 Aug 2014, Emil Widmann wrote:
However, can we put VirtualBox and Sage to one .exe? What is really
needed
is to convert http://wiki.sagemath.org/SageAppliance to be just 1)
Download this .exe, 2) Doubleclick it, 3) Ready.
Yes, I wrote an installer which included the VirtualBox
On Thu, 28 Aug 2014, Vincent Delecroix wrote:
Note that for teaching/installation there is an alternative: tell the
students to come with a USB stick and just clone the sage-debian live
(http://sagedebianlive.metelu.net/). It is very easy to use and all
students will have exactly the same
On Sun, 31 Aug 2014, Emil Widmann wrote:
here is the link to the Sage Win installer
https://www.dropbox.com/s/uq9p60hkttr3ail/Sage-Win-Installer.exe?dl=0
Slow link. Here's faster: http://www.sis.uta.fi/~jm58660/sage-win.exe
As for testing, I am awaiting report from my wife.
--
Jori
On Sun, 31 Aug 2014, Emil Widmann wrote:
Yes, I wrote an installer which included the VirtualBox installer and
the Sage Appliance inside one exe.
I haven't tested it myself, but got comments: Too many Next-clicks, and
then Sage did not open; I tell to open Vbox and click green arrow. It says
On Mon, 25 Aug 2014, Travis Scrimshaw wrote:
IIRC most of the doc is in the header of some module... just use view(P,
tightpage=True), it uses dot2tex if you install the optional spkg (with
sage -i dot2tex). IMO the output is much prettier.
For example view(Poset( ([1,2,3,4,5],
On Mon, 1 Sep 2014, Emil Widmann wrote:
Sure, more work is needed.
I just included the vanilla vbox installer and thought some verbosity might
be good for a prototype (back in 2011).
I have a different setup of the network, so localhost:8080 may not work.
If virtual machine has additions
On Tue, 2 Sep 2014, Nathann Cohen wrote:
If there is a Poset function which is an exact copy of the HasseDiagram
function, is there any reason for not removing the HasseDiagram one ?
And how is documentation supposed to be?
As I said, has_top() has same examples. mobius_function(x, y) has
On Tue, 2 Sep 2014, Nathann Cohen wrote:
I would say that it should be the union of the two. Some examples are
meant to the users, some are meant to test past bugs that we fixed, and
we do not want to lose that.
I think that this is bad from user viewpoint.
In the ideal world things would
On Tue, 2 Sep 2014, Nathann Cohen wrote:
But at least user should not see details like There was an error in
code three years ago. We show that it is corrected by
Why shouldn't we see it ?
Because it is (mostly) irrelevant. Just as users should not be bothered by
things like There is
On Tue, 2 Sep 2014, Nathann Cohen wrote:
Because it is (mostly) irrelevant. Just as users should not be bothered
by things like There is a SSD disk in this computer or Calculations
are actually executed on cloud or This mail was delivered with SMTP
protocol.
It's a point of faith, I
On Mon, 1 Sep 2014, Travis Scrimshaw wrote:
For example view(Poset( ([1,2,3,4,5],
[[1,2],[1,3],[3,4],[2,5],[4,5]]) ),
tightpage=True) does nothing.
It takes a few seconds to feed it to my pdf viewer, but it works for me (and
I have installed the dot2tex optional spkg).
Usually ./configure make works on my 64-bit Fedora system. However, on
Sage I must say LD_LIBRARY_PATH=/usr/lib64/ (or SAGE_INSTALL_GCC=yes)
before make. Otherwise compiling R stops because of missing fortran
library.
Is this a bug in Fedora or in Sage?
--
Jori Mäntysalo
--
You received
On Wed, 3 Sep 2014, Francois Bissey wrote:
on Sage I must say LD_LIBRARY_PATH=/usr/lib64/ (or
SAGE_INSTALL_GCC=yes) before make. Otherwise compiling R stops because
of missing fortran library.
Is it only happening with R?
I don't know. Compiling Sage stops when first error occurs; to me
On Wed, 3 Sep 2014, Volker Braun wrote:
It works for me on Fedora 20 without doing anything like that. Can you post the
R build log
Here: http://www.sis.uta.fi/~jm58660/r-3.1.1.p0.log
cpp -print-search-dirsls -al /lib /lib64
I guess you mean -print-search-dirs. It also gives error from
On Wed, 3 Sep 2014, Sébastien Labbé wrote:
sage: view(latex(graphs.PetersenGraph()), tightpage=True)
Stops with
! LaTeX Error: File `preview.sty' not found.
(Why didn't I got this error before?) Anyways, this now works after
installing missing package. (yum install tex-preview on Fedora.))
On Wed, 3 Sep 2014, Sébastien Labbé wrote:
sage: view(latex(graphs.PetersenGraph()), tightpage=True)
Stops with
! LaTeX Error: File `preview.sty' not found.
(Why didn't I got this error before?)
Maybe because of view(latex(p)) versus view(p) ? ...too late now to
On Wed, 3 Sep 2014, Volker Braun wrote:
Seems that Sage's version of libgfortran clashes with what ATLAS has
been compiled with. Try a make distclean make to build from a clean
slate if you haven't done so before. Also, are you compiling ATLAS or
using the system ATLAS?
I tried removing
On Wed, 3 Sep 2014, Travis Scrimshaw wrote:
Before you do so, can you tell me if that graphviz is the system (local)
install or the one using the experimental
Sage spkg (just covering all my bases here)?
I have not installed any experimental package.
Ticket:
On Thu, 4 Sep 2014, Volker Braun wrote:
ls -al /lib /lib64
ls: cannot access /lib64 : No such file or directory
You don't have a 64-bit system, it seems.
What the hell... I have just mechanically copied output without thinkin.
I have 64-bit system where /lib64 is symlink to
On Fri, 5 Sep 2014, Volker Braun wrote:
So it seems that we don't link libf77blas against libgfortran. Whats the output
of
sage -sh -c ldd local/lib/libf77blas.so
linux-vdso.so.1 = (0x7fffad3fe000)
libatlas.so.3 =
On Fri, 5 Sep 2014, Jean-Pierre Flori wrote:
Btw, I just installed a clean Fedora 20. At least yum install patch m4
is needed before compiling. Might be worth writing up somewhere the
packages that are needed to compile.
http://www.sagemath.org/doc/installation/source.html
On Fri, 5 Sep 2014, Francois Bissey wrote:
What is very curious is that you have a compilation error, yet you say
that setting LD_LIBRARY_PATH solve the problem. That variable
shouldn't influence compilation/linking, unlike LD_RUN_PATH or
LDFLAGS.
Are you using gold for linking?
I have never
On Fri, 5 Sep 2014, Francois Bissey wrote:
In
/home/jm58660/r-compile-test/sage-6.3/local/var/tmp/sage/build/r-3.1.1.p0/src/src/main
What does
gcc -std=gnu99 -Wl,--export-dynamic -fopenmp
-L/home/jm58660/r-compile-test/sage-6.3/local/lib/ -o R.bin Rmain.o
-L../../lib -lR -Wl,--verbose
On Fri, 5 Sep 2014, Francois Bissey wrote:
Sorry you should have started a sage shell first
/home/jm58660/r-compile-test/sage-6.3/sage -sh
And then cd and gcc? Here:
(sage-sh) jm58660@localhost:sage-6.3$ cd
On Fri, 5 Sep 2014, Francois Bissey wrote:
You appear to have bits of another gnu compiler in /usr/local. You
don't appear to have the binaries but some libs. Do you also have
libgfortran under /usr/local/lib64?
Yes. And of course /usr/local/* is checked before / and /usr. I have no
idea
Here is the code for is_isomorphic() on class FinitePoset:
if hasattr(other,'hasse_diagram'):
return . . .
else:
raise ValueError('The input is not a finite poset.')
So for example Posets.PentagonPoset().is_isomorphic(Hello everyone!)
gives the error
On Thu, 28 Aug 2014, Nicolas M. Thiery wrote:
Posets(5)
which internally does something like
[x for x in GenerateAllDirectedGrapsh(5) if x.is_poset()]
Semantically, this is correct. Luckily the implementation is more
clever than this: it only runs through digraphs that are actually
Hasse
I was just playing with posets. Let L=Posets(7). Then
len([x for x in L if x.is_lattice()])
takes about two times more time than
len([x for x in L if x.is_bounded() and x.is_lattice()])
Is this just some marginal and uninterestin case, or is algorithm badly
chosen, or is is_lattice() meant
On Sun, 14 Sep 2014, Simon King wrote:
I was just playing with posets. Let L=Posets(7). Then
sage: %time len([x for x in L if x.is_lattice()])
Sorry for not giving full example code. In your example almost all time
goes to poset generation. Start with
L=[x for x in Posets(7)]
and then
On Sun, 14 Sep 2014, Simon King wrote:
L=[x for x in Posets(7)]
I should have said simply Posets(7).list(), but it doesn't make difference
for this.
Concerning the rest of the difference: If you just ask for the posets x
so that x.is_bounded(), then only 63 remain. Hence, x.is_lattice()
I think that Sage documentation should contain a phrase height of poset
somewhere.
If P is a poset, it can be computed with P.rank()+1. (Or, maybe, P.rank()
--- which one is definition of height?)
Should there be a .height() function? Nathann Cohen said that probably,
but I should ask about
On Thu, 25 Sep 2014, rjf wrote:
I am curious as to what parts of Sage you use. I suspect you are using
it mostly as a front-end to Maxima, In which case -- have you considered
using Maxima directly, esp. wxmaxima?
Installing Sage is quite easy; it took time if you compile it yourself,
but
After clicking Lastmod-header it got tickets sorted like
1 mins 23 hours 32 mins 8 days
Is this bug in trac in general or some setting at sage trac?
--
Jori Mäntysalo
--
You received this message because you are subscribed to the Google Groups
sage-devel group.
To unsubscribe from this
A ticket about this: http://trac.sagemath.org/ticket/15206 . This is not
related to posets only, but to graphs in general. Is anyone planning to do
this?
It seems that mostly part append(text(str(v) at set_vertices on
graph_plot.py must be changed, and the chain of function calls changed to
On Thu, 2 Oct 2014, Francesco Biscani wrote:
Thanks for the other pointers as well.
At Tampere we used Sage to study singularity of lcm-matrices of gcd-closed
sets. With Sage it is very easy to show divisor semilattice of such a set.
On the other direction we generated all lattices of given
Now we have Posets.RandomPoset(n, p). It generates a poset of n
element. Second argument is propability: p=1.0 will always make chains,
p=0.0 will always make antichains.
Does it sound natural to have syntax like for example
Posets.RandomPoset(10, p, ['graded', 'connected'])
? 3. argument
P = Poset({1:[]},facade=False)
type(P(1))
This prints class
'sage.combinat.posets.elements.FinitePoset_with_category.element_class'
from command line, but on notebook I got
class
'sage.combinat.posets.elements.FinitePoset_with_category.element_class'\
gt;
What part of Sage bugs here?
--
I have made some additions to posets and lattices, for example
http://trac.sagemath.org/ticket/17121
But I am confused about logic (if any...) behind location of functions on
different places. For example
is_bounded := has_top has_bottom
and all three functions are defined on
On Fri, 10 Oct 2014, Nathann Cohen wrote:
So, what is the logic behind this?
I don't think that there is any.
Duh.
To understand what I mean, just observe that posets have a .base_ring()
method. Or a .construction() method.
And .is_exact(). But to be honest, at the end of documentation
On Sat, 11 Oct 2014, Volker Braun wrote:
But apparently you do have a permission problem with cp -p.
That might be because source filesystem has acl's enabled and target fs
has not. Or in principle target system might be for example fat32 withouth
support for almost anything.
--
Jori
This might be of general interest, even if this specific example is just
for lattices.
On Fri, 10 Oct 2014, Nathann Cohen wrote:
About using hasse diagrams directly: Is it possible to do for example
Posets.ChainPoset(500) without 10 seconds of cpu time?
That such a thing takes so long does
First of all, a warning: I am not a mathematician, just a computer support
and IT admin interested in strange things.
On Fri, 10 Oct 2014, Anne Schilling wrote:
When Travis and I were working on the bug fix for 14019, we were also
contemplating deprecating HasseDiagram and moving the methods
On Sun, 12 Oct 2014, Nathann Cohen wrote:
True; also for example there could be doublehasse, i.e. structure with
both upper and lower covers saved as a list for an element.
Isn't that already the case ? A hasse digram should be a (sparse)
digraph, and a (sparse) digraph should be stored
On Fri, 3 Oct 2014, Nathann Cohen wrote:
A ticket about this: http://trac.sagemath.org/ticket/15206 . This is
not related to posets only, but to graphs in general. Is anyone
planning to do this?
I do not understand: do you only want to draw a graph with anything you
want as labels of the
On Tue, 14 Oct 2014, Nathann Cohen wrote:
G=DiGraph({0:[1,2]})
G.set_edge_label(0,1,'Hi!')
G.set_edge_label(0,2,'Hi!')
(But .relabel(lambda e: ...) -syntax is easier, I think.)
Yes but we can't do the same for the vertices of a graph, of we would
have no way to differentiate them afterwards.
See http://trac.sagemath.org/ticket/13810 . Can somebody confirm that KASH
really bugs with polynomials of degree 22 and 23? For me it works only
up to 21 in three different Linux-machine. I did ask about this from mail
address found on KANT/KASH www-page, but got no response.
And in any case
When I hit this, I was making a code for posets, but this is actually more
general question. Shortly, do (di)graphs have some kind of order of
vertices? To start, will
Graph({'b':['a']}).vertices()
always print ['a', 'b'], not ['b', 'a']? How about directed graphs? What
about adding or
On Mon, 20 Oct 2014, Erik Massop wrote:
Shortly, do (di)graphs have some kind of order of vertices?
If the vertices happen to have a total ordering everything should be
fine.
OK. Then I can use it on poset, because labels for vertices in Hasse
diagram are just natural numbers. But...
1) Why is join() defined for join-semilattices, but join_matrix()
defined for posets? (I.e. it works by giving exception if the poset is
not join-semilattice.)
2) Would it be useful to have join() function taking more than two
arguments? And if so, should then also L.join(x) return x if x in
On Wed, 22 Oct 2014, Nathann Cohen wrote:
given a Poset, how can you detect if this poset is a meet semilattice ?
For sure we need a function for that ! And it seems that this function
is exactly what join_matrix does.
Of course one can try to build a [semi]lattice and see if it works or
On Wed, 22 Oct 2014, Volker Braun wrote:
Its in 6.4.beta6. Run with sage --notebook=ipython
It said that pyzmq is missing. Then sage -i pyzmq said that zmq.h was not
found. (And last yum whatprovides 'zmq.h' found no matches...). A bug in
pyzmq?
(Might be, again, something wrong with my
On Thu, 23 Oct 2014, Nathann Cohen wrote:
which says that detecting if a poset is lattice can be done on O(n^2.5).
Oh. Cool.
Now somebody should just read, understand and implement it. :=)
Ok. To have join(a,b,c,...) or join([a,b,c,...])?
Hmmm.. Well, we can have both at the same time.
On Thu, 23 Oct 2014, Nathann Cohen wrote:
It really is not a problem either to only have this P.join(a_list) available
And it can always be later expanded to accept also another kind of args.
Btw, I noticed that there kind of is a function for this already: sum().
But not that easy to
On Thu, 23 Oct 2014, Volker Braun wrote:
Did you run make after pulling the git branch? The zeromq and pyzmq packages
are new and need to be compiled.
I did not. But no help from that:
running configure
Configure: Autodetecting ZMQ settings...
Custom ZMQ dir:
On Thu, 23 Oct 2014, Volker Braun wrote:
Workaround is to run
sage -f zeromqsage -f pyzmq
sage -f ipython
[Errno 104] Connection reset by peer
I.e. sagemath.org stalled. Mirrors of those somewhere?
--
Jori Mäntysalo
--
You received this message because you are subscribed to the Google
I got ipython to run. Looks nice.
How is account management done with it? Ldap integration?
--
Jori Mäntysalo
--
You received this message because you are subscribed to the Google Groups
sage-devel group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
1 - 100 of 172 matches
Mail list logo
