[sage-combinat-devel] Re: fast vector partitions algorithm

> >> I have opened a trac ticket >> now. Unfortunately something weird is happening with my local git branch. I >> have copied a file fast_vector_partitions.py with all the source code (it >> works in ordinary Python with 'import

[sage-combinat-devel] Re: fast vector partitions algorithm

Thanks to everybody for the friendly replies. > > I could paste the code right here, is that the proper way to do it? How is > the license transferred to Sage? > The way to submit code is to push a git branch to our trac server and then update the ticket to include that branch name under the

[sage-combinat-devel] Re: fast vector partitions algorithm

Hi Denis, That is great that it can have a faster implementation. Do you have the code available for us somewhere? Some thing to also note is that VectorPartitions creates a Sage Element instance instead of a simple Pyhton list, which has extra overhead. However, this should not account for

[sage-combinat-devel] Re: Discreture library: iterate through combinations, permutations, partitions...

It definitely could help with some things. However, I am a bit turned off on using it considering statements about comparing a highly optimized special purpose library with SageMath: This comparison isn't very fair (C++ vs python). On the same system, > iterating over all (24 choose 12)

[sage-combinat-devel] Re: SkewTableaux

On Friday, June 1, 2018 at 7:25:21 PM UTC+10, Bruce wrote: > > I am confused about the interface between SkewTableaux and Tableaux. > I suspect this is something people are aware of. > > The points I have come across (and I doubt these are the only ones) are: > > A SkewTableau can be created

[sage-combinat-devel] Re: Lie algebra representations and Crystals

Hi Nicolas, > > I am doing computations in a Lie algebra representation V; actually a > pretty simple one, though huge (in case this is relevant, V is a > subspace of the ring of polynomials in r sets of n variables, under > the action of gl_r. The nice feature is that weight spaces are >

[sage-combinat-devel] Re: Categories, Parents, Elements

> > > Then I can think of the set of Tableaux as the parent and lists of > objects > > as elements. > > You say that you "think of the *set* of Tableaux" as the parent? That > doesn't > sound promising at all. Although I don't know which notion you are using, > it seems likely to me that

[sage-combinat-devel] Re: Free partially commutative monoid associated to a graph

Sorry for taking so long to answer this. In short, yes, it is. The group version is implemented in Sage under the name right-angled Artin group (see groups/raag.py). That code trivially lifts up to the monoid case. Although a list of the letters (rather than syllables) might be better data

[sage-combinat-devel] Fwd: SageDays@ICERM

Cross-post from Sage-devel On Wednesday, November 15, 2017 at 6:49:13 AM UTC-6, Travis Scrimshaw wrote: > > Hey all, >Gabe Feinberg, Darij Grinberg, Ben Salisbury, and I are organizing a > SageDays to take place at ICERM, located in Providence, RI, USA, from > Jul

[sage-combinat-devel] Re: Improvements to FreeAlgebra

Hey Simon, > > On 2017-03-29, Nicolas M. Thiery > wrote: > > It would be interesting to know specifically on which aspects the path > > algebra is improving on the current free algebra. The data structure > > of indices (i.e. words in the generators)? The data

[sage-combinat-devel] Re: Constructing elements in disjoint enumerated sets that are Cartesian products

Hey Andrew, > > > Unfortunately, now it seems that I can't access the elements of the tuple > directly: > > sage: tabs = DisjointUnionEnumeratedSets(Family(Partitions(3), lambda mu: > cartesian_product([mu.standard_tableaux(),mu.standard_tableaux()])), > facade=False) > sage:

[sage-combinat-devel] Re: Constructing elements in disjoint enumerated sets that are Cartesian products

Hey Andrew, Well, I've recently been looking at DisjointUnionEnumeratedSets (see https://trac.sagemath.org/ticket/22382) and came across this problem. The first issue is that DisjointUnionEnumeratedSets does not behave like an actual facade parent like it claims to be (at least with default

[sage-combinat-devel] Re: kronecker coefficient

Perhaps Andrew can weigh in on putting Kronecker coefficients with partition tuples, but it feels somewhat artificial to me. Instead, I like the explicitness of the syntax la.kronecker_coefficient(mu, nu) and/or having some (lazily imported) global namespace function of kronecker_coefficient

[sage-combinat-devel] Re: CartanTypes

We also should determine how we want to distinguish between (and input) A_{+oo} and A_{oo}, i.e., index sets of NN and ZZ. In fact, the only place where I really see this fundamentally breaking is the CartanMatrix and Dynkin Diagram. All of the root/weight lattice stuff should work since those

[sage-combinat-devel] Eventual change in behavior for permutation descents

Dear all, On #20555 , we have set in motion an eventual change of the default behavior for the descent in a permutation to be 1-based, instead of 0-based, in order to agree with the usual notion of considering a permutation of {1, 2, ..., n} and an

Re: [sage-combinat-devel] Re: Super Module and Clifford Algebra

Hey Florent, I'm very sensible to the namespace pollution question. However, as a user > (contrary to a developper) I'm using from time to time those methods > directly > and I'm considering those as part of the public API. Indeed, its not > uncommon > that calling one_on_basis or

[sage-combinat-devel] Re: Super Module and Clifford Algebra

Hey Florent, Sorry for taking so long to get to this (in honesty, I forgot about answering). > > Now a question for Travis: > > in super_modules_with_basis.py, you hide the method >_even_odd_on_basis > As a minor consequence, there is a void ParentMethod class in the > documentation.

[sage-combinat-devel] Re: ask-sage question: tensor product of polynomial algebras

Hey Samuel, I don't think there currently is a general implementation for tensor products of rings/algebras. Although you can hack together a small subclass of CombinatorialFreeModule: class PolynomialAlgebra(CombinatorialFreeModule): def __init__(self, base_ring, names):

[sage-combinat-devel] Re: Defining basis keys for combinatorial free modules

Hey Simon, You might want to use FreeMonoid(index_set=S) as your basis indexing set. Although you will need 7.2.beta5 to do the iteration: sage: S = (1,2) sage: F = FreeMonoid(index_set=S) sage: it = iter(F) sage: [next(it) for _ in range(10)] [1, F[1], F[2], F[1]*F[2], F[2]^2, F[1]^2,

Re: [sage-combinat-devel] ClonableIntArray

Hey Andrew, I want this functionality too. I tried adding: > > __metaclass__ = ClasscallMetaclass > > but this produces the error: > > TypeError: Error when calling the metaclass bases > metaclass conflict: the metaclass of a derived class must be a (non- > strict) subclass of the metaclasses

Re: [sage-combinat-devel] ClonableIntArray

Hey Andrew, Just for reference, you do not need these lines as they are in the Tableau code so you can call Tableau(...) directly without having to explicitly create the parent object. @staticmethod def __classcall_private__(cls, elt): return

[sage-combinat-devel] Re: Fraction field elements are not simplified

I think I slightly misspoke about the gcd. See the details on http://trac.sagemath.org/ticket/16993. Best, Travis On Friday, October 9, 2015 at 4:12:12 PM UTC-5, Travis Scrimshaw wrote: > > Hey Salvatore, >I would say this is the same problem as simplifying scalars of fraction

[sage-combinat-devel] Re: Fraction field elements are not simplified

Hey Salvatore, I would say this is the same problem as simplifying scalars of fraction fields of polynomials over QQ, that gcd(x, x) = 1 rather than x because x is a unit. I don't think we have a way around this currently other than doing some kind of explicit coercion. Best, Travis On

Re: [sage-combinat-devel] Re: Skew partitions for symmetric functions

It also makes it much easier for the user to discover it (in fact, this time the user was me; it took examining the code for me to find this functionality in the first place). This is now http://trac.sagemath.org/ticket/19218 and needing review. Best, Travis On Tuesday, September 15, 2015 at

[sage-combinat-devel] Re: Skew partitions for symmetric functions

Hey Mike, I would say that the skew partition input into bases (other than Schur > functions, and for Schurs the documentation is insufficient...see sf.html) > is undocumented and so the output should be suspect (and not what one would > hope). > > For Schur functions, I think the output is

[sage-combinat-devel] Skew partitions for symmetric functions

While looking into the code on skew Schur functions, I noticed this: elif x in sage.combinat.skew_partition.SkewPartitions(): import sage.libs.lrcalc.lrcalc as lrcalc skewschur = lrcalc.skew(x[0], x[1]) return self._from_dict(skewschur) This has the following result: sage: s =

[sage-combinat-devel] GAP3 spkg

Hey combinat, Has anyone tried to install the now included optional GAP3 spkg? I get a checksum error when I do. Best, Travis -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To unsubscribe from this group and stop receiving emails

Re: [sage-combinat-devel] GAP3 spkg

/sage/build/bin/../sage_bootstrap/cmdline.py", line > 193, in run > tarball.download() > File "/Applications/sage/build/bin/../sage_bootstrap/tarball.py", line > 160, in download > raise ChecksumError('checksum does not match') > sage_bootstrap.tarbal

Re: [sage-combinat-devel] Re: CombinatorialFreeModule relies on implementation details of elements

IIRC, #18066 was mainly started so that support() doesn't needlessly sort things, other such cleanups, and better refactor things for generalizations, such as to Lie algebras (which is currently designed to use CFM elements). In the end, I believe the goal is to make CFM irrelevant and have

[sage-combinat-devel] Re: function arguments and decorators

Hey Salvatore, Have you tried the `key` attribute for `@cached_function` and/or `@cached_method`? @cached_method(key=tuple) def foo(x): return tuple(x)*2 The only downside is that there will be some redundancy (you have to do the cast twice, once for the key, once in the method). I

[sage-combinat-devel] Re: bug in free module construction?

Hey Mark, AFAIK, there is not currently a ticket on this. However it would not be hard to implement R^4 as a free module over R as a default: sage: h = SymmetricFunctions(QQ).h() sage: F = FreeModule(h, 4) sage: v = F([h[2,1], h[3,2,2,1], -2, h[7]]); v (h[2, 1], h[3, 2, 2, 1], -2*h[], h[7])

Re: [sage-combinat-devel] KL polynomials for translations in the affine Weyl groups

We also have the native (almost certainly significantly slower) version: sage: R.q = LaurentPolynomialRing(QQ) sage: W = WeylGroup(['A',3,1]) sage: K = KazhdanLusztigPolynomial(W, q) sage: P = RootSystem(['A',3,1]).weight_lattice() sage: K.P(W.one(),

Re: [sage-combinat-devel] weird behavior under combining remove and for loop

I'm surprised it's not raising an error as well because I knew of the error that the dictionary raises that Simon mentioned having personally encountered it in my code myself. There is not a copy of i with its current value that build the current lambda each step, no. In fact, all lambda use

[sage-combinat-devel] Re: Test digraph for cycles containing a vertex?

Hey Simon, I would imagine this would be relatively efficient: def has_path(u, v): it = D.all_paths_iterator([u], [v]) try: it.next() return True except StopIteration: pass return False Best, Travis On Saturday, June 20, 2015 at 5:51:09 AM UTC-7,

[sage-combinat-devel] Re: Specification of combinatorial free module?

Hey all, Speaking of CFM, what should we do http://trac.sagemath.org/ticket/18750 (sorry to throw it onto the pile Nicolas)? Should CFM always make sure any input given to it by a user be the proper basis element? My current fix on #18750 doesn't work, but I believe it is the correct way

[sage-combinat-devel] Re: Test digraph for cycles containing a vertex?

Hey Simon, That is correct and the only way I know of AFAIK. Best, Travis On Friday, June 19, 2015 at 2:31:28 PM UTC-7, Simon King wrote: Hi! Let D be a digraph, potentially with multiple edges and loops. Let v be a vertex. How should one test whether v is contained in a cycle

[sage-combinat-devel] Re: strange category

Hey Mark, The reason this was done was because the category doesn't depend on the particular base ring, but on its category. The issue is that the people who work on finite fields create a lot of fields over large ranges of primes, and so would have to create a new category every time with

[sage-combinat-devel] Re: European Horizon 2020 project OpenDreamKit accepted

Congratulations! *fireworks* -- You received this message because you are subscribed to the Google Groups sage-combinat-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-combinat-devel+unsubscr...@googlegroups.com. To post to this group,

[sage-combinat-devel] Re: map_coefficients factor

Hey Mike, At least as a workaround you could do something like this: sage: s=SymmetricFunctions(QQ).s() sage: x = s[2,1] + 2*s[3] sage: for i,c in x: print i, factor(c) [3] 2 [2, 1] 1 Best, Travis On Wednesday, April 15, 2015 at 5:00:18 PM UTC-4, Mike Zabrocki wrote: Hi all, There is

[sage-combinat-devel] Re: Import error using recusive trees

Hey Henrik, You might also be interested in these tickets on some combinatorial Hopf algebras: http://trac.sagemath.org/ticket/13793 http://trac.sagemath.org/ticket/13855 Best, Travis On Wednesday, February 11, 2015 at 3:40:49 AM UTC-8, Henrik Sperre Sundklakk wrote: Oh, thanks. That

[sage-combinat-devel] Re: necklaces

Hey Mike, We had the problem for Lyndon words (http://trac.sagemath.org/ticket/12997), but it was hacked around. So either we fix _sfc/_simple_fixed_content or we hack around it by stripping leading 0's and then modifying the yielded elements (by adding # leading 0's). Best, Travis On

Re: [sage-combinat-devel] Making code for some seminormal representations faster

Hmmm... I don't see anything from a quick read of the code why this is going wrong. I'll take a more detailed look today. Best, Travis On Friday, November 21, 2014 5:55:51 AM UTC-8, Andrew wrote: I'm currently going around in circles with some CombinatorialFreeModule woes. The previous

Re: [sage-combinat-devel] Making code for some seminormal representations faster

Hey Andrew and Nicolas, I've probably mentioned this before, but I think we should figure out how we want to handle categories for representations in general. I would like this for Lie algebras (equiv. universal enveloping algebras), quantum groups, and general groups (equiv. group

[sage-combinat-devel] Re: A small hint in Symmetric Functions

Hey Nicolas, I confirm this issue with 6.5.beta0. I think that change is sufficient (as a haunting voice echoes in the wind, along with adding a doctest). Welcome back. Best, Travis On Thursday, November 20, 2014 3:19:16 AM UTC-8, Nicolas Borie wrote: Hello all, As I was constructing

Re: [sage-combinat-devel] Making code for some seminormal representations faster

Here's a thought for something that could work for elements. Make it a wrapper around the element you'd do computations in and have a lazy attribute for the converted element, and I think you can use __getattr__ (or __getattribute__?) to rediect to the wrapped element and I think this works

Re: [sage-combinat-devel] Making code for some seminormal representations faster

Hey Andrew, One of the things that I don't like about (my understanding of) the CombinatorialFreeModule approach to modules is that it is very hard for the (uneducated/unenlightened/unwashed) user to construct their own bases for modules: To construct a new basis you have to explicitly

[sage-combinat-devel] Re: Left and right cells of Coxeter groups

Hey Andrew, Am I right in thinking that sage does not (yet) know about the left, right and two-sided Kazhdan-Lusztig cells of Coxeter groups? As sage can compute Kazhdan-Lusztig polynomials I assumed that it knew about cells as well, but it doesn't seem to. Please tell me if I am missing

[sage-combinat-devel] Re: Left and right cells of Coxeter groups

hard it is to wrap something around chevie's implementation. Andrew On Monday, 10 November 2014 15:43:30 UTC+11, Travis Scrimshaw wrote: Hey Andrew, Am I right in thinking that sage does not (yet) know about the left, right and two-sided Kazhdan-Lusztig cells of Coxeter groups? As sage

Re: [sage-combinat-devel] Making code for some seminormal representations faster

``_rmul_`` and ``_lmul_`` (it's the module element (i.e., ``self``) on the right or left respectively), and (somewhat unfortunately) I think you need to also inherit from ModuleElement (or copy the ``__mul__`` method). Or is it preferred to use ``_acted_upon_`` (see in CombinatorialFreeModule)?

[sage-combinat-devel] Re: Making code for some seminormal representations faster

Hey Andrew, I'm always for including things into Sage. We need to refactor symmetric group representations to not use CombinatorialClass (and the seminormal form for the SGA), and we can factor out common functionality at that point. However that's for later. Now looking at what you're

[sage-combinat-devel] Re: weyl group element of E8 act on a positive root to get some partiular root but the below program shows error

As I understand it, the error is because GAP ran out of memory (because the Weyl group is too big for your computer's memory basically). Best, Travis On Monday, August 18, 2014 9:15:27 AM UTC-7, Biswajit Ransingh wrote: W=WeylGroup(['E',8]) R = RootSystem(['E',8]).root_lattice() alpha =

[sage-combinat-devel] Re: quiver algebra

Hey Nicolas, I would say this is like matrices: do you want the iterator for matrices to iterate by default over all elements or rows? Currently the iterator goes over all rows and you can call M.list() to get a flat list of entries. Actually, this is a question for graded objects in

[sage-combinat-devel] Re: Extednding tableaux

Hey Andrew, Darij was wanting to do this, but if I remember correctly, he is going to be busy the next few weeks and there was http://trac.sagemath.org/ticket/15862 on mutating tableaux that needed to be addressed. Best, Travis On Thursday, July 10, 2014 7:11:52 AM UTC-7, Andrew wrote:

[sage-combinat-devel] Re: redesign combinatorial statistics

Okay here's where I think we are, and my 2 cents in the matter. Simon wants to have a database which stores the map information which is constructed by the decorator @combinatorial_map in order to not have it cause any slowdowns. The question is, how to do this? Here's my 2 cents of a

Re: [sage-combinat-devel] Re: sum(Composition([1,2,3])) # broken

I think we would have to implement __mul__() as Composition does not inherit from MonoidElement, nor is Compositions in the category of Monoids. So there is no implementation of __mul__() inherited by the element_class (which goes into the coercion framework). Best, Travis -- You received

[sage-combinat-devel] Re: CombinatorialFreeModule

The indexing set for CombinatorialFreeModule should be a parent, not an element. So C = CombinatorialFreeModule(QQ, Foos()) and you should have your Foo initialize itself as an element (which will fix that tab completion error; I've encountered it when not initializating the category for an

[sage-combinat-devel] Re: fractional powers of a variable

Hey Mark, The workaround Andrew and I used in the Iwahori-Hecke algebra was to use a new variable v and passed in q=v^2. Although this led to a minor panic when I couldn't get the output to line up with references (everything was squared). Best, Travis On Tuesday, April 15, 2014 10:19:25

Re: [sage-combinat-devel] tensor products of free modules; combinatorial algebras

Hey Mark, Ack...my bad. If we were to have a separate category for tensor products of modules, then I agree that it should not be in there to avoid technical/implementation issues. Best, Travis On Sunday, April 6, 2014 1:31:20 PM UTC-7, Mark Shimozono wrote: Travis, The zero module is

Re: [sage-combinat-devel] tensor products of free modules; combinatorial algebras

Hey Nicolas and Mark, Somewhat of a side remark: I think we should also have the 0 module accessible as a special object in the category of modules (since it is the terminal object and we might take tensor products). Actually, perhaps we should have that object as a class which we can add in

[sage-combinat-devel] Re: Organize the index of combinatorial modules

I created http://trac.sagemath.org/ticket/14582 a while ago with a slightly more ambitious goal (and there's a patch on the old combinat queue, which I should be port to a branch). However it's fallen to the wayside as math and other code has taken priority (and because getting the doc to

Re: [sage-combinat-devel] Re: Organize the index of combinatorial modules

As soon as I'm able to I will. Best, Travis On Friday, April 4, 2014 8:02:21 AM UTC-7, Nathann Cohen wrote: Yo !! I created http://trac.sagemath.org/ticket/14582 a while ago with a slightly more ambitious goal (and there's a patch on the old combinat queue, which I

[sage-combinat-devel] Re: Infinite loop when comparing two crystal elements

It's not related to #14019, but a problem with = comparison in the tensor product of crystals code. I inadvertently ended up fixing this with #15882 trying to get full coverage to combinat/crystals/tensor_product.py: sage: u,v = crystals.Tableaux(['A',2], shape=[2,1])[:2] sage: u,v ([[1, 1],

[sage-combinat-devel] Re: How about a class method for R_tilde polynomials in class KazhdanLusztigPolynomial

Hey Aalen, Welcome to Sage. I think this will be a useful addition, so go ahead an open a ticket. Also, if you find yourself writing functions like this (that aren't a part of sage but are doing it often), you can put it in a .sage file and then run sage: %attach path/to/file/name.sage

[sage-combinat-devel] Re: Call for vote about ticket #10963: axioms and more functorial constructions

Hey everyone, I've been using #10963 in developing #14901 (Lie algebras). I first gave 'Lie' as an axiom of NonAssociativeNonUnitalAlgebras (which I just asked Nicolas for how to do it without really looking at the examples), but decided that I didn't want _mul_() to give the Lie bracket, so

[sage-combinat-devel] Re: [sage-devel] Re: Call for vote about ticket #10963: axioms and more functorial constructions

On Tuesday, March 11, 2014 12:40:41 PM UTC-7, Nathann Cohen wrote: On that note, I think reviewers shouldn't hold up tickets because they don't like the current implementation without providing a working alternative and can demonstrate why it's better. Do you think that a patch

[sage-combinat-devel] Re: expanding in symmetric functions (revisited)

Hey Dan, The reason why you're getting the symbolic ring error is because you are saying the matrix should have coeff in SR (the symbolic ring) but the matrix coeff you've specified are in the power series ring. So it should work if you change SR to S in the M = matrix(...) line (I suspect

[sage-combinat-devel] Re: git question

Hey Mark, AFAIK, you'll need to manually merge in the base (lower) branch into the dependent (upper) branch (although only when you need the changes in the base branch) and push the appropriate branch to the server when changes are made. If there's any changes that were not pulled in from

Re: [sage-combinat-devel] Re: git question

I'm not quite sure...perhaps try running sage -sync-build because maybe it's using a file that is no longer there? On Thursday, February 27, 2014 12:59:03 PM UTC-8, Mark Shimozono wrote: Thanks. I'm having the recurring problem of first changing filename.py, then running sage -b and

Re: [sage-combinat-devel] Re: git question

Hey Mark, Try running make build in your Sage root. I believe the most recent changes require you to update your spkg's (which sage -b does not do). Although I recall that this takes awhile due to some ATLAS changes. Best, Travis -- You received this message because you are subscribed to

Re: [sage-combinat-devel] tensor products of free modules; combinatorial algebras

Hey Mark, It's probably that some of the internal code relied on a spkg being upgraded, which isn't done when running `sage -b`. So now you should be okay with just using `sage -b`... Best, Travis On Monday, February 24, 2014 6:07:40 PM UTC-8, Mark Shimozono wrote: Well, I tried doing

[sage-combinat-devel] Re: Installation of sage-combinat

Hey Norha, You can do one of two things: 1 - Download a pre-compiled source from http://www-ftp.lip6.fr/pub/math/sagemath/linux/index.html, and then extract it. Once that's done, you should be able to simple go into the new directory and run Sage. 2 - Go into the directory where you've

Re: [sage-combinat-devel] Further affine matters

Hey Dan and Nicolas, On Thursday, February 20, 2014 4:43:37 AM UTC-8, Nicolas M. Thiery wrote: Hi Dan! On Wed, Feb 19, 2014 at 03:34:53PM -0800, bump wrote: Is the invariant inner product implemented already in the ambient space? I think what is called inner product is

[sage-combinat-devel] Re: Misleading documentation about Cartan types

Hey Dan, Another question: Sage automatically warps CartanType(['A', n, 2]) to CartanType(['BC',n/2,2]) when n is even. This differs from Kac' notation. Whose notation is this? Just as a side note, if you want to display this in Kac's notation, you can use: sage:

[sage-combinat-devel] Re: Misleading documentation about Cartan types

Hey Dan, I was referring to how the arrows correspond to the matrix values. However I can see the potential confusion and take blame for it. I agree that we should clarify this. Best, Travis On Tuesday, February 18, 2014 3:56:21 PM UTC-8, bump wrote: In the Cartan type documentation

Re: [sage-combinat-devel] tensor products of free modules; combinatorial algebras

Hey Mark, I would say so. Although at that time I was focused just on piecing together the coercions, it probably should be abstracted so we can do something like: sage: tensor([phi, psi, xi]) given some module morphisms phi, psi, and xi to get a morphism of the appropriate tensor

Re: [sage-combinat-devel] tensor products of free modules; combinatorial algebras

Hey Mark, I believe the standard way to setting the prefix is to use the prefix optional argument when constructing / initializing a CFM. Is there a way to hijack this capability for input mangling or coercion for the custom subclass? I would like to say something like sage: C([a,b])

[sage-combinat-devel] Re: Input for skew tableaux

Hey Christian, I'm split on checking data, on one hand, it's good for the obvious reasons, however I don't like the performance hit it can have when creating many such elements. Here, I think `to_word()` should work with the 0's (or any filling which we can make an alphabet for that matter).

[sage-combinat-devel] Re: Russian

Hey William, I don't know Russian, but hopefully this will clarify some of the terms. - 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

[sage-combinat-devel] Re: combinat and sage 6.0

Hey Martin, Do you know what features and/or patches in particular you're after? I can start a public/combinat branch with those. Side note, I've created http://trac.sagemath.org/ticket/15628 for what we decide to do with the combinat scripts. Best, Travis On Saturday, December 28, 2013

[sage-combinat-devel] Re: Speed regression in KirillovReshetikhinTableaux?

Hey Volker, I'm working on it. It's likely not a speed regression per-say, but instead doing more checks in one of tests (specifically it seems to be `_test_stembridge_local_axioms()`) due the implementation being more mathematically correctly. I'll post a fix which will clean this up today.

[sage-combinat-devel] Re: Speed regression in KirillovReshetikhinTableaux?

This is now http://trac.sagemath.org/ticket/15581. Best, Travis -- You received this message because you are subscribed to the Google Groups sage-combinat-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to

Re: [sage-combinat-devel] Re: Bug in Core

The reason why we need(ed) a separate core class is that for example otherwise it would not be possible or easy to implement the action of the affine symmetric group on (k+1)-cores. Of course, one can ask whether a given partition is an n-core and that method should live in

Re: [sage-combinat-devel] Re: The queue and Sage 5.13.beta5

Hey Jean-Baptiste, I've marked #15150 as merged, so it should (hopefully) apply now. Best, Travis -- You received this message because you are subscribed to the Google Groups sage-combinat-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to

[sage-combinat-devel] Re: A Partitions Pickle

Hey Andrew, As GlobalOptions are not pickeable I agree that this error probably occurs because of PartitionOptions being passed as an argument to the IntegerListsLex class. Unfortunately, I think that this is the real problem: global options for one class are not intended to be passed as

[sage-combinat-devel] The queue and Sage 5.13.beta5

For those who are curious, the queue applies cleanly to 5.13.beta5 and Sage starts. Best, Travis -- You received this message because you are subscribed to the Google Groups sage-combinat-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to

[sage-combinat-devel] A Partitions Pickle

Hey everyone, The following gives a PicklingError: sage: P = Partitions(5, max_length=4) sage: loads(dumps(P)) The actual object created in an instance of `IntegerListsLex`, and the pickling error is due to the fact that the global options `PartitionOptions` cannot pickled since it passes

Re: [sage-combinat-devel] Re: expanding symmetric rational function products in symmetric polynomials

Hey Dan, Anne's way makes things much more simple/straightforward: sage: n = 5 sage: R.t = QQ[] sage: S = PowerSeriesRing(R, n, 'x', default_prec=n+1) sage: Sym = SymmetricFunctions(R) sage: HLP = Sym.hall_littlewood(t).P() sage: f = prod( (1 - t*S.gen(i)*S.gen(j)) / (1 - S.gen(i)*S.gen(j))

[sage-combinat-devel] Re: expanding symmetric rational function products in symmetric polynomials

Hey Dan, This is only a part of the way, but I'd start by doing the computations by having t in a polynomial ring R (over QQ say), and the basic variables x_i coming from a power series ring over R: sage: R.t = QQ[] sage: S.x1,x2,x3 = PowerSeriesRing(R) sage: (1 - t*x1*x3) / (1 - x1*x3) 1 +

[sage-combinat-devel] sage 5.13.beta2

Hey everyone, The queue applies to 5.13.beta2 with the following exception: - sage-demos-and-tutorials-nt.patch -- I've done the trivial rebase Nicolas and (back)imported the OEIS patch so there should be no rejects (it works for me on 5.13.beta0). Best, Travis -- You received this

[sage-combinat-devel] Re: group and algebra homomorphisms

Hey Vincent, Well, I can solve the question by using reduced expressions from the Coxeter presentation: sage: S3 = SymmetricGroup(3) sage: SGA = GroupAlgebra(S3, QQ) sage: MS = MatrixSpace(QQ,2) sage: mtx = [MS([[0,-1],[1,-1]]), MS([[1,-1],[0,-1]])] sage: phi = SGA.module_morphism(lambda x:

[sage-combinat-devel] Re: [sage-devel] SetPartitions output as sets?

Hey, On Monday, October 28, 2013 7:17:50 PM UTC-7, Mike Zabrocki wrote: I am not sure, but I believe that this was probably changed in #14140 when SetPartition was changed from a CombinatorialClass to a ClonableArray. It doesn't look like it changed in #15143 but additional changes to the

[sage-combinat-devel] Re: combinat queue doesn't work for me

Hey Mark and Nicolas, I've rebased the patch in question. Stupid trivial rejects... Best, Travis On Wednesday, October 23, 2013 12:41:38 PM UTC-7, Mark Shimozono wrote: After a new build of sage-5.12 from source, sage -combinat install produced: applying finite_semigroup-nt.patch

Re: [sage-combinat-devel] Re: StandardTableaux broken

Hey Andrew and Jean-Yves, Looking at the patch queue, robinson_schensted_inverse was depreciated in trac8392 http://trac.sagemath.org/attachment/ticket/8392. It seems to have been replaced with RSK_inverse which just seems wrong to me: with tab-completion I don't see the need for random

[sage-combinat-devel] Re: sage crashes after 10963

This should be fixed now. Best, Travis On Tuesday, October 15, 2013 7:21:37 AM UTC-7, Jean-Yves Thibon wrote: I don't know whether this is the same problem, since I don't see the crash report, but I experienced a similar crash due to a parenthesis missing in yangian.py (my crash report

[sage-combinat-devel] Re: sage crashes after 10963

Hey Anne, Fixed. Sorry about that. I don't remember that part being given to me in the reject file... Best, Travis On Sunday, October 6, 2013 10:45:42 PM UTC-7, Anne Schilling wrote: Hi Travis, Sage crashes after your recent rebase of 10963

[sage-combinat-devel] Re: trouble with the queue

/graded_modules_with_basis.py.rej patch failed, unable to continue (try -v) patch failed, rejects left in working dir errors during apply, please fix and refresh trac_10963-more_functorial_constructions-nt.patch Abort Best, Anne On 10/3/13 7:34 AM, Travis Scrimshaw wrote: Hey Anne

Re: [sage-combinat-devel] Installation problem

Hey Matthieu, I believe the command you wanted was sage -combinat update not *upgrade *. Update pulls the latest version of the changes to the queue, upgrade tries to upgrade sage (which is basically broken) with the combinat queue (I think). From your error message, I think I fixed the

[sage-combinat-devel] Re: rebasing patches

Hey Florent, I also had to rebase trac_11529-rooted_trees-fh.patch due to a trivial reject in combinat/index.rst. patching file doc/en/reference/combinat/index.rst Hunk #1 FAILED at 52 1 out of 1 hunks FAILED -- saving rejects to file doc/en/reference/combinat/index.rst.rej patch failed,

[sage-combinat-devel] Re: Should ClasscallMetaclass do a consistency test?

Hey Simon, On Tuesday, July 30, 2013 9:18:28 PM UTC+9, Simon King wrote: Hi all, On 2013-07-29, Simon King simon...@uni-jena.de javascript: wrote: After all, we have a class, and we call the class as if to create an instance---but what we get is in fact not an instance of this class,

[sage-combinat-devel] Rebased patches

Hey Florent and Andrew, I did trivial rebasing to the following two patches in order to get the queue to apply: - trac_11529-rooted_trees-fh.patch - tableaux-combinatorics-am.patch Best, Travis -- You received this message because you are subscribed to the Google Groups

  1   2   3   >