Hello, everyone !
I guess this is a very stupid question, but I was wondering if it
would be possible one day to have Sage work on Windows except with a
Virtual Machine. I'm not asking that question for myself, as I have
quit using Windows a long time ago, but it would draw many more
users... I gu
t Bradshaw
wrote:
> On May 25, 2010, at 1:42 PM, ablondin wrote:
>
> > Thanks !
> > I would never have guessed the name !
> > Alex
>
> And I had never heard of the term "Bezout coefficients" :). The is an
> abbreviation for "extended gcd."
>
Thanks !
I would never have guessed the name !
Alex
On 25 mai, 16:28, Tim Daly wrote:
> Is anyone else getting duplicate copies of Sage messages? -- Tim
>
> Mike Hansen wrote:
> > Hello,
>
> >> I've been looking for a function that allows one to compute Bezout
> >> coefficients of two numbers (sa
Hello, everyone !
I've been looking for a function that allows one to compute Bezout
coefficients of two numbers (say natural numbers). There is the GCD
function, but I haven't found anything about Bezout coefficients. This
is not complicated to write one, but it would be better if it was
included
tion as
desired. That said, I guess it's not a clean solution...
Alex
On 24 mai, 18:01, John H Palmieri wrote:
> On May 24, 2:17 pm, ablondin
> wrote:
>
>
>
> > What about using the verbatim environment of Latex ?
>
> > class A(SageObject):
>
> >
What about using the verbatim environment of Latex ?
class A(SageObject):
def _latex_(self):
from sage.misc.latex import LatexExpr
return '\\begin{verbatim}\n123\n 23\n\\end{verbatim}'
sage: attach latex.sage
sage: latex(A())
\begin{verbatim}
123
23
\end{verbatim}
In the n
Hello, everyone !
If I may add some comments.
N. O'Trealy is right when he says that the best approach is to look
at the mathematical definitions of objects. On the other hand, one
needs to be careful. For instance, the set E of a graph G = (V,E), a
directed graph G = (V,E) and a multigraph G = (
Thanks ! That worked !
Alex
On 23 avr, 09:49, Willem Jan Palenstijn wrote:
> On Fri, Apr 23, 2010 at 06:32:43AM -0700, ablondin wrote:
>
> > 981 sage: for i in range(1,10):
> > 982 sage: for j in range(1,10):
> > 983 sage:
#x27; but it doesn't
work either.
Any idea what I may do wrong ?
Thank you again !
Alex
On 23 avr, 09:03, John Cremona wrote:
> Why don't you, instead of collecting all the booleans in a list,
> assert each one?
>
> On 23 April 2010 13:55, ablondin wrote:
>
> >
Hello, everyone !
What is the right syntax to include a test like this one in the
docstring ?
sage: valid = []
sage: for i in range(1,10):
sage: for j in range(1,10):
sage: if i != j:
sage: w = words.KolakoskiWord(alphabet=(i,j))
sage: valid.append(w[:50] == w.d
Hello, Sage developpers !
I created a ticket to correct some annoying problem about
documentation in graph theory
http://trac.sagemath.org/sage_trac/ticket/8513
I can fix it myself, but I would like to have some opinions before
doing so. The question is, should we just add the reference to these
Hello, everyone !
While working on graph-theory related patchs, I have to test if some
optional tests pass. I tried to test the main branch of sage 4.3.3
without applying any new patch, but some tests fail ! Here is the
output. I thought that sage was 100% doctests... Is my main branch
broken ? Or
Thanks, this is exactly what I was looking for !
Alex
On 14 fév, 17:27, Minh Nguyen wrote:
> Hi Alexandre,
>
> On Mon, Feb 15, 2010 at 3:10 AM, ablondin
>
> wrote:
>
>
>
> > Strangely enough, all functions on digraphs do not seem to appear
> > anywhere !
>
te, there is nothing that allows the users to
enumerate/handle cycles in graphs.
Alexandre
On 13 fév, 17:02, Minh Nguyen wrote:
> Hi Alexandre,
>
> On Sun, Feb 14, 2010 at 2:58 AM, ablondin
>
> wrote:
>
>
>
> > As soon
> > as someone casts some light on those
I forgot to mention that I intend to add iterators over cycles in
undirected graphs as well, but before I write the code, I want to make
sure that everything is alright for the directed version.
Alexandre
On 13 fév, 16:58, ablondin wrote:
> Dear sage developers !
> I've been writing i
Dear sage developers !
I've been writing in Sage some functions that allow one to iterate
over cycles of directed graph. I'm almost ready to submit the patch to
trac, however, there a a few things I don't understand yet. For
instance, I put my functions in the file sage/graphs/digraph.py, but
when
Hello, everyone !
I guess it's not the right place to post this problem but I haven't
found the answer anywhere else...
I have a MacBook Pro with Snow Leopard installed and I'm trying to
generate the doc with the command
sage -docbuild reference html
The problem is that I get the following message
Hello everyone !
I'm trying to install sage combinat on my computer to share patches
with a friend, but it freezes after only a few minutes. Here are the
last lines of input in the terminal
After cloning, if you change any Sage library files and want to
rebuild
the html version of the reference ma
18 matches
Mail list logo
