On Wed, 23 Jan 2008, Jason Grout wrote:
>
>
> Robert's patch on trac #1900 affords an opportunity to bring up a small
> simplification of adjacency_matrix(). It seems that the over_integers
> parameter over-complicates the interface. There are other more standard
> ways of specifying the rin
William wrote:
> If anybody out there is a java expert, this might be a good problem to look
> at,
> where this is "loading images many many times using sage's 3d plotting can
> lead to problems".
The problem might be related to how much memory is allocated to the
Java plugin by default. Here
Jason Grout wrote:
>
> Robert's patch on trac #1900 affords an opportunity to bring up a small
> simplification of adjacency_matrix(). It seems that the over_integers
> parameter over-complicates the interface. There are other more standard
> ways of specifying the ring over which you would
Robert's patch on trac #1900 affords an opportunity to bring up a small
simplification of adjacency_matrix(). It seems that the over_integers
parameter over-complicates the interface. There are other more standard
ways of specifying the ring over which you would like a matrix, like:
sage: #
On Jan 23, 2008, at 6:08 PM, William Stein wrote:
> On Jan 23, 2008 6:00 PM, Robert Bradshaw
> <[EMAIL PROTECTED]> wrote:
>>
>> On Jan 23, 2008, at 5:53 PM, Jason Grout wrote:
>>
>>> Hi everyone,
>>>
>>> What is the difference between x.plot() and x.show() for an
>>> object x?
>>> For that ma
On Jan 23, 2008 6:00 PM, Robert Bradshaw <[EMAIL PROTECTED]> wrote:
>
> On Jan 23, 2008, at 5:53 PM, Jason Grout wrote:
>
> > Hi everyone,
> >
> > What is the difference between x.plot() and x.show() for an object x?
> > For that matter, what about view()? Of course, right now it
> > depends on
>
On Jan 23, 2008, at 5:53 PM, Jason Grout wrote:
> Hi everyone,
>
> What is the difference between x.plot() and x.show() for an object x?
> For that matter, what about view()? Of course, right now it
> depends on
> the object, but what is the general guideline?
>
> I'm refactoring a patch that
Hi everyone,
What is the difference between x.plot() and x.show() for an object x?
For that matter, what about view()? Of course, right now it depends on
the object, but what is the general guideline?
I'm refactoring a patch that rlm just posted that adds show(list of
graphs) functionality t
Personally I think it makes sense that it is not an ideal, but that
might be from my early exposure to Magma in this context. I think of
a Groebner basis with respect to different orderings as properties of
particular ideals - i.e. the same ideal can have many different
Groebner bases, which migh
On Jan 23, 2008 4:08 PM, Jonathan Bober <[EMAIL PROTECTED]> wrote:
>
> I just realized a source of my confusion. The docstring that I quoted
> was not actually wrong in the way that I thought is was, but was
> apparently deceptive (to me). Perhaps some people are already aware of
> this, but GF(5)
[EMAIL PROTECTED] wrote:
>
>
>
> On Wed, 23 Jan 2008, William Stein wrote:
>
>> On Jan 23, 2008 4:12 PM, Jason Grout <[EMAIL PROTECTED]> wrote:
>>> Does anyone know the best way to partition a list into sublists of a
>>> specific length, similar to the Partition command in Mathematica? I'm
>>
On Wed, 23 Jan 2008, William Stein wrote:
>
> On Jan 23, 2008 4:12 PM, Jason Grout <[EMAIL PROTECTED]> wrote:
>>
>> Does anyone know the best way to partition a list into sublists of a
>> specific length, similar to the Partition command in Mathematica? I'm
>> thinking of something like:
>>
>
On Jan 23, 2008 4:12 PM, Jason Grout <[EMAIL PROTECTED]> wrote:
>
> Does anyone know the best way to partition a list into sublists of a
> specific length, similar to the Partition command in Mathematica? I'm
> thinking of something like:
>
> sage: partition([1,2,3,4],2)
> [[1,2],[3,4]]
> sage: p
Does anyone know the best way to partition a list into sublists of a
specific length, similar to the Partition command in Mathematica? I'm
thinking of something like:
sage: partition([1,2,3,4],2)
[[1,2],[3,4]]
sage: partition([1,2,3,4,5],2,pad=0)
[[1,2],[3,4],[5,0]]
It seems like this is a pr
I just realized a source of my confusion. The docstring that I quoted
was not actually wrong in the way that I thought is was, but was
apparently deceptive (to me). Perhaps some people are already aware of
this, but GF(5), GF(25), and GF(5^100) are all different types, and so
have different docstr
> This looks strange to me (close to a bug).
This is not a bug but a deliberate design decision that an ideal is a distinct
mathematical object from a set of polynomials spanning the ideal. We had some
discussion about this a while ago off list:
-- Forwarded Message --
Subje
> I am very surprized that I.groebner_basis() does not return an ideal.
I don't think it should give back an ideal since a Grobner basis is a
particular basis for an ideal (particularly the one you started with).
sage: R. = PolynomialRing(QQ)
sage: I = R.ideal(a*b-1, c*d-1)
sage: J = R.ideal(I.g
Here is a brute force version. I simply compute the divisors and then
try multiplying size of them together. If the result is the original
number, I keep it. For the small values of n and size that I deal
with this is fast enough, but it would be nice to have something that
scales well (algorit
Hi Gregory,
I agree with you, this would be great to have in SAGE, and I was also
thinking of writing something like that in LinBox sometime for the
sparse charpoly.
Mike Monagan & Al. already wrote something on the subject:
http://www.cecm.sfu.ca/~monaganm/papers/CP8.pdf
I am just getting se
Dear Sage team,
sage: I=R.ideal('a*b-1','c*d-1')
sage: R=PolynomialRing(QQ,'a,b,c,d')
sage: I=R.ideal('a*b-1','c*d-1')
sage: type(I)
sage: type(I.groebner_basis())
I am very surprized that I.groebner_basis() does not return an ideal.
Is it really needed to say:
sage: J=R.ideal(I.groebner_basis
Gregory Bard wrote:
> Once in a while one has a sparse square matrix, and one might wonder
> if it is
> a matrix in block form, but permuted. This can be hard to recognize by
> eye
> if the matrix is big. It turns out one can determine this VERY
> quickly. The
> graph which has an adjacency matrix
> > Thank you! It did solve it, jmol works now. The notebook doesn't, but
> > i understood this will be solved in another alpha-version.
>
> > In sage-2.10, that i obtained without installing java-1_4_2-caco-
> > devel, ldapjdk and ldapjdk-javadoc, there was no problem with jmol.
> > Is the depe
Once in a while one has a sparse square matrix, and one might wonder
if it is
a matrix in block form, but permuted. This can be hard to recognize by
eye
if the matrix is big. It turns out one can determine this VERY
quickly. The
graph which has an adjacency matrix equal to the matrix under
discuss
> Well, if what you mean by factor tree is something like
> http://thesaurus.maths.org/mmkb/media/png/FactorTree.png , then I think
> what Brian is asking for a bit more complicated. If I understand
> correctly, he's asking for the set of all the sets of numbers (prime or
> composite) whose produ
> Quick important question: How big is the positive integer n?
> I.e., is factoring integers an important difficulty?
In what I am doing n is the number of processors an array is
distributed over. Thus, n scales with the number of dollars a user
has spend on their cluster :) This will tend to k
> Sorry, I missed the post where you clarified that you weren't just
> looking for factor pairs. There's got to be a way to extend this idea
> to make it more arbitrary, but I haven't figured it out yet. At least
> we know there's going to be an upper bound on the number of elements you
> have i
I'm feeling 7-zip, feeling 7-zipok you have to be a certain age...
On Jan 22, 11:08 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Jan 22, 2008 8:58 PM, Nick Alexander <[EMAIL PROTECTED]> wrote:
>
>
>
>
>
> > On 22-Jan-08, at 6:00 PM, William Stein wrote:
>
> > > On Jan 22, 2008 9:45 AM,
John Cremona wrote:
> Jacob, are you re-inventing factr trees by any chance? (Try googling
> "factor tree" to see what they are).
>
Well, if what you mean by factor tree is something like
http://thesaurus.maths.org/mmkb/media/png/FactorTree.png , then I think
what Brian is asking for a bit m
On Wed, 23 Jan 2008, Jacob Mitchell wrote:
>
>
>
> Jacob Mitchell wrote:
>>
>> John Cremona wrote:
>>
>>> Is a "multiplcative partition" just a factorization?
>>>
>>> How about this:
>>>
>>> sage: def mp(n):
>>> : return [(d,n//d) for d in n.divisors()]
>>> :
>>> sage: mp(12)
>>> [
Jacob, are you re-inventing factr trees by any chance? (Try googling
"factor tree" to see what they are).
John
On 23/01/2008, Jacob Mitchell <[EMAIL PROTECTED]> wrote:
>
>
>
> Jacob Mitchell wrote:
> >
> > John Cremona wrote:
> >
> >> Is a "multiplcative partition" just a factorization?
> >>
>
Jacob Mitchell wrote:
>
> John Cremona wrote:
>
>> Is a "multiplcative partition" just a factorization?
>>
>> How about this:
>>
>> sage: def mp(n):
>> : return [(d,n//d) for d in n.divisors()]
>> :
>> sage: mp(12)
>> [(1, 12), (2, 6), (3, 4), (4, 3), (6, 2), (12, 1)]
>>
>> where
Sorry to reply to myself, but I just realized that I haven't done
support for duplicates in OrderedSetPartitions so ignore my previous
post :)
--Mike
On Jan 23, 2008 11:47 AM, Mike Hansen <[EMAIL PROTECTED]> wrote:
> > I have a simple function that (like your example) can compute things
> > for
> I have a simple function that (like your example) can compute things
> for size=2. I am trying to figure out how to generalize to arbitrary
> size.
Here's an example of how you can do it in Sage:
sage: a = factor(2*3*3*5*7*13);a
2 * 3^2 * 5 * 7 * 13
sage: b = sum([ [f]*mult for f,mult in a],
John Cremona wrote:
> Is a "multiplcative partition" just a factorization?
>
> How about this:
>
> sage: def mp(n):
> : return [(d,n//d) for d in n.divisors()]
> :
> sage: mp(12)
> [(1, 12), (2, 6), (3, 4), (4, 3), (6, 2), (12, 1)]
>
> where of course you could eliminate the cases d=
The I think that the keywords you need are "factor tree" or
"factorization tree".
John
On 23/01/2008, Brian Granger <[EMAIL PROTECTED]> wrote:
>
> On Jan 23, 2008 11:52 AM, John Cremona <[EMAIL PROTECTED]> wrote:
> >
> > Is a "multiplcative partition" just a factorization?
>
> Yep
>
> > How abou
On Jan 23, 2008 11:52 AM, John Cremona <[EMAIL PROTECTED]> wrote:
>
> Is a "multiplcative partition" just a factorization?
Yep
> How about this:
>
> sage: def mp(n):
> : return [(d,n//d) for d in n.divisors()]
> :
> sage: mp(12)
> [(1, 12), (2, 6), (3, 4), (4, 3), (6, 2), (12, 1)]
T
On Jan 23, 2008 10:33 AM, Brian Granger <[EMAIL PROTECTED]> wrote:
>
> Hi,
>
> I am working on a parallel/distributed array library for
> python/ipython. For this library I need to be able to compute the
> multiplicative partitions of positive integers:
>
> 12 => (2,6), (3,4)
Quick important que
On Jan 22, 6:00 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Jan 22, 2008 9:45 AM, Nick Alexander <[EMAIL PROTECTED]> wrote:
>
>
>
> > Hi everyone, I have no idea if this is true, or if it was auto-
> > generated and is spam, or what, but some people here might care.
>
> I care. I just tri
Is a "multiplcative partition" just a factorization?
How about this:
sage: def mp(n):
: return [(d,n//d) for d in n.divisors()]
:
sage: mp(12)
[(1, 12), (2, 6), (3, 4), (4, 3), (6, 2), (12, 1)]
where of course you could eliminate the cases d=1, d=n and so on.
John
On 23/01/2008, B
On Jan 23, 2008, at 9:47 AM, Simon King wrote:
> Dear Michael,
>
> On Jan 23, 11:22 am, mabshoff <[EMAIL PROTECTED]
> dortmund.de> wrote:
>
>>> What is a JDK?
>>
>>> I was just running yast and was searching for JDK. It showed me
>>> three
>>> packages: java-1_4_2-caco-devel, ldapjdk and ldapj
Hi,
I am working on a parallel/distributed array library for
python/ipython. For this library I need to be able to compute the
multiplicative partitions of positive integers:
12 => (2,6), (3,4)
A few questions about this:
1) Is there a good algorithm for computing these. I can think of
silly
On Jan 23, 2008 9:10 AM, Martin Albrecht <[EMAIL PROTECTED]> wrote:
>
> Hi,
>
> if you consider multivariate polynomials then we have two implementations of
> the same thing depending on the ground field: MPolynomial_polydict and
> MPolynomial_libsingular.
>
> Both are supposed to behave almost id
Dear Michael,
On Jan 23, 11:22 am, mabshoff <[EMAIL PROTECTED]
dortmund.de> wrote:
> > What is a JDK?
>
> > I was just running yast and was searching for JDK. It showed me three
> > packages: java-1_4_2-caco-devel, ldapjdk and ldapjdk-javadoc. None of
> > them is installed. Should i?
>
> A java
Hi,
if you consider multivariate polynomials then we have two implementations of
the same thing depending on the ground field: MPolynomial_polydict and
MPolynomial_libsingular.
Both are supposed to behave almost identical because the shouldn't worry about
the underlying implementation.
My qu
Hi there,
I've got the following failures to report:
As expected
sage -t devel/sage-main/sage/rings/polynomial/toy_buchberger.py
failed, patch available at:
http://trac.sagemath.org/sage_trac/ticket/1894
Also, since we switched to proper return code checking in the fpLLL wrapper,
it fa
Actually, the 'evaluate' link is 100% not working on Internet
Explorer!
Every time it fails. That's a good reason to install Firefox on
Windows :-)
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group
Hi All,
Just a few comments: there are three possible concepts for
generator[s]:
1) As a field over its prime field or base field (function gen(),
category Field or Algebra);
2) As a vector space over its base field (function
additive_generators(), category Module)
3) As a group, restricted to t
Sorry, I was confused. You and William are right.
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_www: http://www.informatik.uni-bremen.de/~malb
_jab: [EMAIL PROTECTED]
--~--~-~--~~~---~--~~
To post to this g
On Jan 23, 2008 4:06 AM, Martin Albrecht <[EMAIL PROTECTED]> wrote:
>
> > > By contrast F.multiplicative_gen() does make sense for all finite
> > > fields so should be provided, though not necessarily computed until
> > > requested for the reasons given by Martin. (It seems that with the
> > > cu
On Jan 23, 2008 4:33 AM, Fabio Tonti <[EMAIL PROTECTED]> wrote:
> I'm sorry to reply here, but I just saw it now: What's happened to the
> Langtangen-book
I removed it since posting it appeared to be a copyright violation.
William
>
> Cheers, Fabio
>
>
>
> On Jan 23, 2008 3:29 AM, William S
I'm sorry to reply here, but I just saw it now: What's happened to the
Langtangen-book
Cheers, Fabio
On Jan 23, 2008 3:29 AM, William Stein <[EMAIL PROTECTED]> wrote:
>
> >
> > On Jan 19, 9:51 pm, Peter <[EMAIL PROTECTED]> wrote:
> > > Hi,
> > >
> > > I created a 1-page Quick Reference Guide
On 23/01/2008, Martin Albrecht <[EMAIL PROTECTED]> wrote:
>
> > > By contrast F.multiplicative_gen() does make sense for all finite
> > > fields so should be provided, though not necessarily computed until
> > > requested for the reasons given by Martin. (It seems that with the
> > > current impl
> > By contrast F.multiplicative_gen() does make sense for all finite
> > fields so should be provided, though not necessarily computed until
> > requested for the reasons given by Martin. (It seems that with the
> > current implementation of non-prime fiinite fields this comes for
> > free, but
Hi
If anyone is interested...
http://www.aims.ac.za/~jan/sage-2.10-ubuntu32-i686-Linux_optional_builds.log.bz2
regards,
Jan
--
.~.
/V\ Jan Groenewald
/( )\www.aims.ac.za
^^-^^
--~--~-~--~~~---~--~~
To post to this group, send email to sage-deve
> That I definitely agree with. I would be very disturbed if we had
> a java app that implemented important computational functionality
> that is not available from the command line. There was actually
> a numerical analysis java applet that is GPL'd that was discussed
> here a while ago that wo
On Jan 23, 11:16 am, Simon King <[EMAIL PROTECTED]> wrote:
> Dear Michael,
>
> Sorry, i answered to sage-support before realizing that you exported
> the thread.
>
> > What JDK are you running?
>
> What is a JDK?
>
> I was just running yast and was searching for JDK. It showed me three
> package
Dear Michael,
Sorry, i answered to sage-support before realizing that you exported
the thread.
> What JDK are you running?
What is a JDK?
I was just running yast and was searching for JDK. It showed me three
packages: java-1_4_2-caco-devel, ldapjdk and ldapjdk-javadoc. None of
them is installe
On Jan 22, 2008, at 19:17 , mabshoff wrote:
>
>
> Hi Justin,
>
> On Jan 23, 3:55 am, "Justin C. Walker" <[EMAIL PROTECTED]> wrote:
>> On Jan 22, 2008, at 6:15 PM, mabshoff wrote:
>> What are the problems that using "-arch" causes? I believe that the
>> endian macros and other related mechanism
Thanks for taking the time to read and respond to my lengthy
contribution. I agree with everything you say!
Sorry to those who don't like the more mathematical discussions on
sage-devel -- personally I find them more interesting than the
notebook interface! but one of Sage's strengths is surely
59 matches
Mail list logo
