On Wed, May 30, 2018 at 11:46 AM, Bruce wrote:
> I am still missing something basic. I now have one local branch.
> There was a second which I deleted (I hope that was safe.).
>
> At no point after the commit have I been able to see the files I have
> committed on
> my file system.
Then
Hi Bruce,
On Wed, May 30, 2018 at 10:19 AM, Bruce wrote:
> I think I have my branches sorted out. However I still don't see
> any of the three files I committed in my local system.
Then you are perhaps on the wrong branch currently. You can switch
branches (provided that you don't have
Hi Bruce,
On Tue, May 29, 2018 at 10:34 PM, Bruce wrote:
> I have opened a ticket #25434. I believe I have commited three files.
> However, I think I have more than one branch and that all but one
> have nothing on them. If this is a situation it is a mess. I want
> to work on this but I am
Hi,
just wanted to mention that Travis has started a ticket on this a while ago:
http://trac.sagemath.org/ticket/18066
IMHO we really need to do some proper OOP here, with contracts and
abstract methods, if we want people to keep adding combinatorial Hopf
algebras and the likes to Sage without
Hi Anne,
On Wed, Aug 19, 2015 at 12:23 PM, Anne Schilling a...@math.ucdavis.edu wrote:
Nicolas and I just did some experiments with Sage and stumbled upon the
following:
sage: t = StandardTableaux([3,2,1]).an_element()
sage: tt = Tableau(t[:])
sage: t == tt
True
sage: hash(t) == hash(tt)
On Sun, Jun 28, 2015 at 12:05 PM, Nicolas Borie pout...@gmail.com wrote:
i is a free variable and exist in a single piece of memory...
Gods. This is worse than I thought...
The only reason why this doesn't happen for, say, L = [2**i for i in
range(5)], is that 2**i is eagerly evaluated, I
On Sat, Jun 13, 2015 at 4:33 PM, Franco Saliola sali...@gmail.com wrote:
On Saturday, June 13, 2015 at 6:15:44 AM UTC-5, Darij Grinberg wrote:
Hi Anne,
On Sat, Jun 13, 2015 at 3:13 AM, Anne Schilling an...@math.ucdavis.edu
wrote:
The SageMathCloud was great for those who had trouble
Hi Anne,
ah, this got updated while I wasn't looking :) Thanks for the reminder!
Best regards,
Darij
On Sat, Jun 13, 2015 at 5:58 PM, Anne Schilling a...@math.ucdavis.edu wrote:
Hi Darij,
Step 3: maybe explain how to tell when the copying is complete? I
think it took more than 3min for
Hi,
thanks to both of you for your help on step 3, but I've got another
problem on step 4 now:
~/sage-dev-images/sage-6.8.beta3$ git trac config --user darij --pass [redacted]
Saved trac username.
Saved trac password.
Trac xmlrpc URL:
http://trac.sagemath.org/xmlrpc (anonymous)
On Sat, Jun 13, 2015 at 8:08 PM, Volker Braun vbraun.n...@gmail.com wrote:
The last public key is invalid, there is no space to set off the comment
from the b64'ed key.
Ah, thank you! I was overzealous in deleting whitespaces that came
from the copypasting.
--
You received this message
On Sat, Jun 13, 2015 at 1:26 AM, William Stein wst...@gmail.com wrote:
This is a bummer. It gives me even more motivation to make
SageMathCloud Sage-developer friendly.I'm also curious if anybody
has any -- possibly *radical* -- suggestions about how to address this
problem using new
On Sat, Apr 18, 2015 at 7:04 AM, Mike Zabrocki mike.zabro...@gmail.com
wrote:
Let me give you another example of how I think Sage is not good at being a
CAS:
sage: (q,t)=QQ['q','t'].fraction_field().gens()
sage: a = (-q^5)/(-t^3)
sage: expand(a)
(-q^5)/(-t^3)
sage: simplify(a)
Hi,
please don't make a distinction based on the n being less than 15! That
would make a really bad pitfall.
Best regards,
Darij
On Wed, Mar 18, 2015 at 6:28 AM, Viviane Pons p...@univ-mlv.fr wrote:
2015-03-18 12:40 GMT+01:00 Mike Zabrocki mike.zabro...@gmail.com:
That would make
Hi Sam and everyone,
thanks @Sam for bringing this up. src/sage/graphs/tutte_polynomial.py has
been scaring me for some time and I hope this will lead to its becoming
better.
One thing that goes wrong in your example (but I am unsure if it is the
main issue!) is this:
sage: G = Graph();
sage:
Hi Sam,
I don't use Sage Notebook, but both my own sage install and the cell
server show True as the result. I suspect this is the right answer.
There have been updates to symmetric functions in the recent history
of Sage, particularly #16560: http://trac.sagemath.org/ticket/16560 .
If your Sage
Hi,
sorry, guys; I woke up to 20 replies and I probably need to catch up
first, but as I need to catch a plane, let me throw in my 2 cents now.
Can we make Composition.sum() a classmethod rather than a
staticmethod? I don't understand why it is not currently a
classmethod. This isn't sane:
Hi,
See also http://trac.sagemath.org/ticket/15163 .
Best regards,
Darij
On Mon, May 19, 2014 at 12:01 PM, Simon King simon.k...@uni-jena.de wrote:
Hi Nicolas,
On 2014-05-19, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote:
That being said, since Composition seems to be the single
Hi Vit,
I just answered on trac. Basically, your branch had a conflict with
the new develop version of sage because both you and someone else made
(different) edits to the same chunk of code. This asks for a manual
merge. You can still pull the branch from trac and then merge it
locally, but I've
Hi Mark,
Someone correct me if I am ignorant, but
even after fixing syntax errors, the problem will be that multivariate
polynomials
don't know when they are divisible by things like x_i - x_j.
Really?
sage: P
Multivariate Polynomial Ring in x, y over Rational Field
sage:
Hi,
I'm highly in favor of adding more meat to the representations of the
Specht modules in Sage. Currently, the way I understand them, they're
but a container for matrices.
There is a Modules(R) in Sage, but it seems to be tailored for
commutative rings. Can we use it for noncommutative R?
Hi Christian,
On Wed, Feb 5, 2014 at 4:15 PM, Christian Stump
christian.st...@gmail.com wrote:
Thanks for your comments, Darij! My impression is that I also do not quite
answer to your mail:
What I would like to have:
Given a partition \lambda (or something more general, even a BadShape
Hi Christian,
I fear I'm going to derail this a bit but I actually care about
hearing answers to these questions...
The way you speak of Le-diagrams, they are fillings of partitions with
0's and 1's. But from a quick look at Postnikov's paper, it seems that
they are better regarded as subsets of
Hi,
On Sat, Jan 18, 2014 at 4:04 AM, William Stein wst...@gmail.com wrote:
- Combinatorics: tableau - I'm wondering if I should translate it
generically as 'table' (which is a term in Russian combinatorics) or
is it something more specific - maybe if you gave more of a
description I could
On Sun, Jan 19, 2014 at 2:32 AM, Anne Schilling a...@math.ucdavis.edu wrote:
Yes, it does! The quantized universal enveloping algebra U_q(g) contains a
parameter
q, which is related to the temperature in 2-dimensional solvable models.
Crystal bases are bases in the limit q-0, so in fact
Hi Nathann,
You are right. Infinite words don't belong into an algebra; you cannot
multiply them. Barring hack reasons, the change is correct.
Best regards,
Darij
On Sun, Jan 5, 2014 at 3:32 PM, Nathann Cohen nathann.co...@gmail.com wrote:
Or possibly : you know that your algebras can
Oops, I've just realized that you *can* multiply infinite words,
though I'm not sure if this has ever been used. (No, you cannot take
their shuffle product.)
On Sun, Jan 5, 2014 at 4:29 PM, Nathann Cohen nathann.co...@gmail.com wrote:
Okay, I just created an element manually instead of calling
On Sun, Jan 5, 2014 at 5:54 PM, Vincent Delecroix
20100.delecr...@gmail.com wrote:
How do you define multiplication ?! If it is concatenation then uv = u...
Yes, but it's associative, so it works... (Except I don't expect it to
have much of a use.)
--
You received this message because you are
Hi Nathann,
I certainly can recall dealing with lots and lots of small posets
(typical for algebraic combinatorics: your combinatorial objects are
small, but you are often considering all of them at once because you
are talking formal linear combinations of them and likewise). I also
have dealt
wrote:
Hi!
On Fri, Dec 20, 2013 at 12:37:51PM +0100, Darij Grinberg wrote:
But you are right in saying that this is not an optimal solution, and it
might be better to implement the Murnaghan-Nakayama rule directly as a
hook-removal algorithm rather than by building the whole s
Oops, coefficient(mu), not coefficient([mu]).
On Fri, Dec 20, 2013 at 11:38 AM, Darij Grinberg
darijgrinb...@gmail.com wrote:
Hi Amri,
On Fri, Dec 20, 2013 at 11:33 AM, Amri amripra...@gmail.com wrote:
Is there a fast implementation for characters values of symmetric groups in
Sage? It looks
Hi Amri,
On Fri, Dec 20, 2013 at 11:33 AM, Amri amripra...@gmail.com wrote:
Is there a fast implementation for characters values of symmetric groups in
Sage? It looks like sage.combinat.symmetric_group_representations.py
constructs the representation explicitly to compute the character values.
Hi Amri,
Oops, I made a mistake: it should be s(p[la]), not p(s[la]). Sorry!
Generally, any basis of Sym is implemented as a *ring in its own*. So when
you write p(s[la]), it understands compute the Schur function
corresponding to partition la, and then convert it to the power-sum ring.
And once
Hi Nathann,
I think the deprecation message is plain wrong, and it should be
Partitions(n, length=k).cardinality().
However, this is nowhere near the speed of the deprecated
number_of_partitions(n, k)... no idea what happened here!
Best regards,
Dairj
On Fri, Nov 29, 2013 at 1:13 PM,
Hi Jean-Yves and everyone,
OK, so it seems that some patch on the sage-combinat queue as of
sage-5.4.1 solved the descents() problem in a more radical way than my
sage-main patch. When my patch got merged into sage-main, the
sage-combinat page would no longer apply, and so descents() once again
Hi Mike,
what is your queue, and what is the exact traceback you're getting?
Best regards,
Darij
On Mon, Aug 19, 2013 at 2:18 PM, Mike Zabrocki mike.zabro...@gmail.com wrote:
Travis,
I am trying to figure out why the Permutation class stopped working with
#14772. The description of the
Hi Nicolas and everyone,
That's a nice suggestion (although I nearly deleted your mail due to
its subject line...). Maybe some briefing on the advantages and
disadvantages of WordLikeObject, ClonableArray and ClonableIntArray
would be good to have before embarking on a journey like this.
Another
Hi Anne, hi Jean-Yves (sorry for not answering your mail long ago!),
On Thu, Jul 4, 2013 at 9:00 PM, Anne Schilling a...@math.ucdavis.edu wrote:
I just disabled the patch
descents_composition_of_empty_permutation_jyt.patch
in the sage-combinat queue since several people sent me personal
Hi Anne,
If your patch makes the same change,
Yes, it did.
Usually, before you push changes to the queue, you are supposed to run
hg qpush -a
sage -br
It was Travis who pushed my patch into the queue because I wanted him
to rebase his patch on top of mine. I know, I should install
Hi all (Travis in particular since he's working on the file),
A few days ago, the lack of functionality in combinat/skew_tableau.py
(as opposed to combinat/tableau.py) bit me: I was trying to generate
all skew semistandard tableaux of a given shape with a given
max_entry, and noticed that there
Hi Travis,
thanks. This comes too late for my patch, but I'll think about it in
the future (I didn't think about splitting the summary into a one-line
and a detailed part). BTW, is there a way to refer to
:meth:`SuperClass.foo` without giving the whole path
(sage.combinat..) to SuperClass?
Hi,
here's a quick question: I'm defining some method on a class and then
redefining it on a subclass for speed improvement. (Concretely, it is
a map on the symmetric functions which I redefine on the power-sum
basis because it's easier to compute there.) What should I do with the
docstring?
copypaste it, then every change will have to be made
several times. What is the right way here?
Best regards,
Darij
On Fri, Jun 28, 2013 at 7:37 PM, Simon King simon.k...@uni-jena.de wrote:
Hi Darij,
On 2013-06-28, Darij Grinberg darijgrinb...@gmail.com wrote:
here's a quick question: I'm
Hi Anne,
Did you make the changes in the source code? Then you can just do
sage -br
Thanks - I got that wrong (thought this is what upgrade would do)!
and test your function.
If you are happy with your changes and want to put them under mercurial
supervision
do
hg qnew rank-dg.patch
Hi Anne,
Isn't the following a big bug in posets in sage:
sage: P = Poset(([1,2,3,4],[[1,4],[2,3],[3,4]]), facade = True)
sage: P.is_graded()
False
The definition of grading is that all maximal chains of every interval
have the same length. This is given in the above poset, but sage says
44 matches
Mail list logo
