Problem background: I want to find the smallest (in l_2 norm) vectors
that satisfy a certain condition - creating a minimal set of coset
representatives for Z^d/A(Z^d) for a dilation matrix A. My idea is to
start with 0 and enumerate vectors in Z^d one at a time. For each new
vector that I consid
On Wed, 05 May 2010 at 07:38AM -0600, jrodri1...@gmail.com wrote:
> Thanks!!! I got that working. But, I stumbled onto something else...
>
> I tried copying my file into the same directory as the sage file and
> running it from there. The interesting thing is that I can only run
> sage if I type "s
On Thu, Apr 29, 2010 at 8:01 PM, Tom Boothby wrote:
> I've been working on a new implementation of an algorithm to compute
> the genus of graphs. Throughout the process, I've been bound by the
> chains of backwards compatibility. As I've attempted to finish off
> the patch, I've found some deepl
The same point came up in another thread on sage-support, which
spurred me to actually come with a solution. There's a patch at #1975
which sorts this out, and should allow Ken to teach what he wanted to!
John
On Apr 12, 7:00 pm, chris wuthrich
wrote:
> Let link the discussion to the old ticket
There is now a simple patch on the Sage trac server (see
http://trac.sagemath.org/sage_trac/ticket/1975) which allows the
following:
sage: N = 1715761513
sage: E = EllipticCurve(Integers(N),[3,-13])
sage: P = E(2,1)
sage: LCM([2..60])*P
Traceback (most recent call last):
..
On Wed, May 5, 2010 at 2:46 PM, Matt Bainbridge
wrote:
> Sage knows how to coerce from Frac(ZZ[x]) to Frac(QQ[x]). There is no
> coercion going the other way, though there should be one, since these
> two rings are equivalent. Is there a reasonable way for me to define
> my own coercion?
This d
Hello, I have another quick question regarding coercion:
Sage knows how to coerce from Frac(ZZ[x]) to Frac(QQ[x]). There is no
coercion going the other way, though there should be one, since these
two rings are equivalent. Is there a reasonable way for me to define
my own coercion?
--
To post
Hello, Georg !
If I understand correctly your question, you would like to convert
arithmetical expressions directly into Latex.
I don't know if it is possible to do it in Sage, but you could always
write your own function. I've written a small one that should do the
trick.
def sarrus(A):
brack
Hi all,
i've written a function to explain the rule of sarrus. Is there a
possibility to return latex code insted of a text? I'd like to use
something like $\sage{sarrus(A)}$ in sagetex.
Thanks a lot,
Georg
P.S.: I expirimented with JSMathExpr from sage.misc.latex, but i
couldn't improve th
Thanks, Mike! This works perfectly.
--M
On May 5, 11:09 am, Mike Hansen wrote:
> Hello,
>
> On Wed, May 5, 2010 at 5:03 AM, Matt Bainbridge
>
> wrote:
> > I wrote a sage program which does a lot of arithmetic in the field of
> > rational functions Frac(Q[x,y,z]). The problem is that sage does
Thanks!!! I got that working. But, I stumbled onto something else...
I tried copying my file into the same directory as the sage file and running it
from there. The interesting thing is that I can only run sage if I type
"sage\sage" (when in the "Applications" folder) or /Applications/sage/sage.
On Wed, May 5, 2010 at 6:10 AM, Luis Finotti wrote:
>
>
> On May 5, 8:45 am, William Stein wrote:
>> On Wed, May 5, 2010 at 4:10 AM, Luis Finotti wrote:
>>
>> > Also, how do I compile a binary for this laptop using a different
>> > computer?
>>
>> Just do this:
>>
>> export SAGE_FAT_BINARY="yes"
On May 5, 8:45 am, William Stein wrote:
> On Wed, May 5, 2010 at 4:10 AM, Luis Finotti wrote:
>
> > Also, how do I compile a binary for this laptop using a different
> > computer?
>
> Just do this:
>
> export SAGE_FAT_BINARY="yes"
> make
> ./sage -bdist 4.4.1-extra_info
So, I don't need the ke
On Wed, May 5, 2010 at 4:10 AM, Luis Finotti wrote:
> Dear all,
>
> I've just tried to compile 4.4.1 on my laptop. It is Thinkpad T60:
>
> -
> t60[~]$ infobash -v3
> Host/Kernel/OS "t60" running Linux 2.6.33-3.slh.5-sidux-686 i686
> [ sidux 2009-02 Αιθήρ - kde-lite - (20090714154
Dear all,
I've just tried to compile 4.4.1 on my laptop. It is Thinkpad T60:
-
t60[~]$ infobash -v3
Host/Kernel/OS "t60" running Linux 2.6.33-3.slh.5-sidux-686 i686
[ sidux 2009-02 Αιθήρ - kde-lite - (200907141544) ]
CPU Info(1) Genuine Intel T2500 @ 2048 KB cache flags(
Hello,
On Wed, May 5, 2010 at 5:03 AM, Matt Bainbridge
wrote:
> I wrote a sage program which does a lot of arithmetic in the field of
> rational functions Frac(Q[x,y,z]). The problem is that sage doesn't
> check for common divisors of the numerator and denominator, so after
> doing a lot of arit
Hi there,
I wrote a sage program which does a lot of arithmetic in the field of
rational functions Frac(Q[x,y,z]). The problem is that sage doesn't
check for common divisors of the numerator and denominator, so after
doing a lot of arithmetic operations, I end up with rational functions
whose num
17 matches
Mail list logo
