[sage-combinat-devel] Re: [sage-trac] #8963: Make tableau row_stabilizer return group of perms involving all elements of the tableau

#8963: Make tableau row_stabilizer return group of perms involving all elements of the tableau ---+- Reporter: Dan Christensen |Owner: Sage Combinat CC user Type: defect | Status:

[sage-combinat-devel] Re: Bijection between King tableaux and Semistandard oscillating tableaux

This is an interesting paper. However this is not the right place for your question. You could try https://math.stackexchange.com/ instead. On Monday, 30 March 2020 02:43:55 UTC+1, Soheli Das wrote: > > Hello, > > Can someone help me understand the construction (rules 1 & 2) with an > example

Re: [sage-combinat-devel] Re: King Tableaux

Hello all, I wanted to thank everyone who helped me with the King Tableau functions. I've everything figured out now. I debugged all the functions and all are working properly. I'm getting my desired output, the functions are outputting the correct king tableaux. Once again, thank you for all

Re: [sage-combinat-devel] Re: King Tableaux

You were right. I debugged is_king_tableau and found a minor fault in it. I fixed it like this: def is_king_tableau(t): """A function which tests if a semistandard tableau is a King tableau.""" if SemistandardTableau(t): if t[0][0] < 1: return False """checks

Re: [sage-combinat-devel] Re: King Tableaux

Right I forgot about it. Take a semi standard tableau that is in the resulting list and should not be there (or the converse). Apply is_king_tableau. If the result is not as expected, then it's time to debug is_king_tableau. If the result is as expected, then something went wrong with how you

Re: [sage-combinat-devel] Re: King Tableaux

But now I'm using the tidied function given by Bruce: def is_king_tableau(t): """A function which tests if a semistandard tableau is a King tableau.""" if t[0][0] != 1: return False for i, row in enumerate(t): if row[0] <= 2*i: return False return

Re: [sage-combinat-devel] Re: King Tableaux

> I have checked out the iterators thematic tutorial and I must say, it's > really helpful. Thank you for recommending that. Glad to hear :-) > Seems like the is_king_tableau throws away the tableaux that have 2 > in the 2nd-row 1st column. After that, it displays all other > tableaux. I

Re: [sage-combinat-devel] Re: King Tableaux

I have checked out the iterators thematic tutorial and I must say, it's really helpful. Thank you for recommending that. Seems like the is_king_tableau throws away the tableaux that have 2 in the 2nd-row 1st column. After that, it displays all other tableaux. I tried implementing a condition

Re: [sage-combinat-devel] Re: King Tableaux

On Mon, Mar 09, 2020 at 05:20:02PM -0700, Soheli Das wrote: > I was trying to list the King tableaux of a particular shape. Here's the > function: > > def list_of_king_tableaux(t_shape, t_max_entry): > """A function which finds the list of King tableaux of given shape.""" > return

[sage-combinat-devel] Re: King Tableaux

I was trying to list the King tableaux of a particular shape. Here's the function: def list_of_king_tableaux(t_shape, t_max_entry): """A function which finds the list of King tableaux of given shape.""" return list([t for t in SemistandardTableaux(t_shape, max_entry=t_max_entry) if

[sage-combinat-devel] Re: King Tableaux

Alright, now I get it. Thanks for your help! On Monday, March 9, 2020 at 4:54:48 AM UTC-4, Bruce wrote: > > The king_tableaux is an iterator not a function. > it is used in the last three lines. > > if you want a list look inside no_of_king_tableaux > > On Sunday, 8 March 2020 21:41:34 UTC,

[sage-combinat-devel] Re: King Tableaux

The king_tableaux is an iterator not a function. it is used in the last three lines. if you want a list look inside no_of_king_tableaux On Sunday, 8 March 2020 21:41:34 UTC, Soheli Das wrote: > > Thank you Bruce!! Indeed the function looks tidier. > The third function gives me this message: "

[sage-combinat-devel] Re: King Tableaux

Thank you Bruce!! Indeed the function looks tidier. The third function gives me this message: "". The 'p' is supposed to mean the partition right? Once again thank you for your help. I really appreciate it! -Soheli On Sunday, March 8, 2020 at 5:26:41 AM UTC-4, Bruce wrote: > > Thank you for

Re: [sage-combinat-devel] Re: Image of a permutation

> Oops. Certainly 2 is fixed, so, doesn't belong to the support. > Deserves a ticket, IMHO. Ouch. Indeed! Nicolas -- Nicolas M. Thiéry "Isil" http://Nicolas.Thiery.name/ -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group.

[sage-combinat-devel] Re: Image of a permutation

On 2020-03-08, David Joyner wrote: > On a tangential matter, I'd like to add that > according to Dan Bump's notes "Group Representation > Theory" (http://sporadic.stanford.edu/bump/group/gr1_4.html), > this set of elements that the permutations does not > fix is called the support. Exactly. >

[sage-combinat-devel] Re: Image of a permutation

On 2020-03-08, David Joyner wrote: > I agree with Michael O, a permutation is a bijection, > so the image is the domain is the codomain. +1 > For a patch to "define the image of a permutation > to be the set of elements that it does not fix" is a > mistake, IMHO. Maybe the set computed could be

[sage-combinat-devel] Re: King Tableaux

Thank you for helping me. I created the function: sage: def is_king_tableau(t,no_of_rows): : for i in range(no_of_rows): : if t[0][0] != 1: : return False : elif t[i][0] <= 2*i: : return False : else: :

Re: [sage-combinat-devel] Re: King Tableaux

> Thank you for helping me. I created the function ... > > What do you think? Were you suggesting something like this? Yes indeed something like this (I did not check the exact conditions you used, but that's your expertise :-)). Now you should just have to come back to the template I sent you

Re: [sage-combinat-devel] Re: King Tableaux

Dear Nicolas, Thank you for helping me. I created the function: sage: def is_king_tableau(t,no_of_rows): : for i in range(no_of_rows): : if t[0][0] != 1: : return False : elif t[i][0] <= 2*i: : return False : else: :

Re: [sage-combinat-devel] Re: King Tableaux

Dear Soheli, Thanks for the extra info. As a first step I suggest that you write a little function that takes a semi standard tableau and test whether it's a king tableau. def is_king_tableau(t): ... Cheers, Nicolas On Fri, Mar 06, 2020 at

[sage-combinat-devel] Re: King Tableaux

Hi Bruce, I'm working on King Tableaux along with my Professor. We came up with this algorithm to generate king tableaux from semistandard tableaux. If you could suggest a better algorithm, that would be great. Either way, I need help with writing the code. I'm new to Sage and Python as well.

[sage-combinat-devel] Re: King Tableaux

Dear Soheli, Your post does not have a question so I am not sure if you are asking for help on getting started with writing code or whether you are asking for a better algorithm. I am really following up on Nicolas' post and discussing the algorithm. The history is that crystal operators on

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

On Thursday, February 20, 2020 at 2:13:23 PM UTC+1, Denis Sunko wrote: > > > > On Thursday, February 20, 2020 at 2:46:37 AM UTC+1, Travis Scrimshaw wrote: >> >> >> >>> there is nothing wrong with pushing a non-working branch somewhere. >>> This way it's very easy to see what's going wrong there.

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

On Thursday, February 20, 2020 at 2:46:37 AM UTC+1, Travis Scrimshaw wrote: > > > >> there is nothing wrong with pushing a non-working branch somewhere. >> This way it's very easy to see what's going wrong there. >> (I guess it's something to do with importing things) >> > > Also linking it to

[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

On Wednesday, February 19, 2020 at 5:50:46 PM UTC+1, Denis Sunko wrote: > > > 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

[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 fast_vector_partitions') and

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

I forgot to say you need to work on the "develop" branch. So the steps would be: - open an account on gitlab.com - connect to gitlab.com - fork this project: https://gitlab.com/sagemath/sage/ - modify the "develop" branch in your fork - send a merge request against the "develop" branch

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

Thu 2020-02-13 19:29:57 UTC, Denis Sunko: > > I read some of the developer's guide but it all seemed > rather intimidating, especially for a small change. Alternatively to pushing a branch to Sage's Trac server, you can - open an account on gitlab.com - fork this project on GitLab

[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

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? I have a trac account because I once contributed a small bugfix but nothing happened with it, so

[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: fast vector partitions algorithm

PS: Sorry, I just notice that you did answer my question: It is 60 lines of python code. That shouldn't be a problem to include in the Sage library (i.e., in relevant parts of src/sage/..., maybe in the same location than the current implementation. Do you have a trac account? Best regards,

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

Hi Denis, in the past, sage-combinat-devel was a very active list and certainly the topic of your post fits well, but it seems to me that it would be a good idea to re-post on sage-devel. Did you read the developer's guide? Certainly people could help you contributing the code. In particular

[sage-combinat-devel] Re: GSoC 2020

Tue 2020-02-04 17:38:18 UTC, Sagnik Dey: > > > I was a GSoC participant last year working on a C++ library. > I am interested in contributing to Sage Math repositories this year. > Can someone please direct me to where I can get started? > > PS: I hope this isn't the wrong place to post this. If

[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: ABC

On Wednesday, 13 June 2018 14:48:23 UTC+1, Andrew wrote: > > Hi Bruce, > > I think that what you have is fine: > Yes, I agree. It was not working earlier. I found a mistake but didn't realise I had fixed it. Thanks for your support. -- You received this message because you are subscribed

[sage-combinat-devel] Re: ABC

Hi Bruce, I think that what you have is fine. Compare with: {{{ sage: mu=Partition([3,2]) sage: type(mu) }}} If you try adding a method to `PathTableau`, such as with {{{ class PathTableau(ClonableList): @abstract_method(optional=False) def check(self): pass def

[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, Travis has already answered Q1. I was going to say Yes because; if it holds in one basis then it holds in all bases (which I suspect you had in mind when you formulated the question); then it holds in the canonical basis in the strong sense that applying a lowering operator gives 0

[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

See also https://trac.sagemath.org/ticket/25173 (please ping if I the code is of interest) Martin -- 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: Categories, Parents, Elements

> Also, have a look at the implementation of k-tableaux in > combinat/k_tableau.py. That should give an idea how to implement other > kinds of tableaux. > > Hi Anne, Thanks, that is useful. I notice that you an abstract class WeakTableau_abstract and three classes that inherit from this. All

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

Hi Bruce, > For most combinatorial objects, the main things you want to implement are: > > - An __init__ for the parent that calls Parent.__init__(self, > category=cat), with cat either Sets(), EnumeratedSets(), > EnumeratedSets().Finite(), EnumeratedSets().Infinite(), etc. > - An __init__

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

Hi Bruce, The research on these objects is still a bit ongoing so the conventions have not yet settled down which is why I hesitate to submit it to Sage until there is clean expository material to refer to. They will go into Sage eventually, but I think that they are closely related to

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

This is intriguing but I need some help as I am not familiar with these. Can you give me some references on the background? In my setup, a "tableau" is a sequence of "partitions" with constraints on neighbouring partitions. Do set valued tableaux, or multiset valued tableaux, fit this framework?

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

Hi Bruce, > Just to clarify; I refer to tableaux because I am taking constructions > that are well know for tableaux > and generalising. One example is oscillating tableaux; these are sequences > of partitions where you > add or remove a single box at each step. One example I want to

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

I am not sure: Is it fair to say that the category framework was invented > with > the intention to provide mixin abstract base classes for parents and > elements, > but based on mathematical notions instead of just in terms of python > classes > (as in Python's abc module)? > My

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

Hi Bruce, On 2018-05-19, Bruce wrote: > Can I make two comments? > i. I think it would be better to say that (to a first approximation) a sage > category is a subcategory of Sets. > When you are taught category theory it is drilled into you not to think of > an object

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

I have followed Travis' suggestion and been inspired by both answers and now have a working first version. This is wonderful! Can I make two comments? i. I think it would be better to say that (to a first approximation) a sage category is a subcategory of Sets. When you are taught category

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

Hi Travis, On 2018-05-19, Travis Scrimshaw wrote: >> And "parent" is just another word for "object of a sub-cateogory of the >> category of sets". So, if there is a category of tableaux and if each >> tableau has elements, then a tableau is a parent and its elements 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: Categories, Parents, Elements

Hi Bruce, On 2018-05-18, Bruce wrote: > As I understand it, in sage, the way to implement this is to have a > category. Provided that what you are implementing does in fact form a mathematical category (https://en.wikipedia.org/wiki/Category_(mathematics)) > However

[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] Re: End(CombinatorialFreeModule)?

On Thursday, December 6, 2012 at 12:47:53 PM UTC, Dima Pasechnik wrote: > > On 2012-12-06, Nicolas M. Thiery wrote: > > On Thu, Dec 06, 2012 at 07:29:57AM +, Dima Pasechnik wrote: > >> I wonder if one can actually work in the endomorphism ring/algebra of a > >>

Re: [sage-combinat-devel] Re: Crystals not displaying

also, could you please post here the logfile of dot2tex installation: it is SAGEROOT/logs/pkgs/dot2tex-2.9.0.p1.log On Friday, June 2, 2017 at 11:41:50 PM UTC+1, Julie Beier wrote: > > This returns false. > > On Friday, June 2, 2017 at 4:59:39 PM UTC-4, Dima Pasechnik wrote: >> >> >> >> On

Re: [sage-combinat-devel] Re: Crystals not displaying

On Friday, June 2, 2017 at 1:16:19 AM UTC+1, Julie Beier wrote: > > Current version of SAGE: 7.5.1 though this happened with several versions, > all binary install > Operating System: OSX 10.11.6 > Version of Tex: Version 3.14159265-2.6-1.40.17 (TeX Live 2016); All > packages up to date > > As

Re: [sage-combinat-devel] Re: Crystals not displaying

On Thursday, June 1, 2017 at 8:34:55 PM UTC+1, Julie Beier wrote: > > So I guess this was the point of my message. What you just posted does > *not* work for me. It says True for dot2tex installed, but I get the two > different tex files (doing this on my computer versus on the cloud) and on

Re: [sage-combinat-devel] Re: Crystals not displaying

On Thursday, June 1, 2017 at 7:57:22 PM UTC+1, Julie Beier wrote: > > Dima, > > Sorry but I'm not sure I understand. I followed the directions in the > sage help that say to do sage -i 'dot2tex'. That is done. But it still > creates the different tex files, and I still have the problem. >

Re: [sage-combinat-devel] Re: Crystals not displaying

On Thursday, June 1, 2017 at 7:23:29 PM UTC+1, Julie Beier wrote: > > All, > > Thanks all for the help; glad to know it wasn't just something trivial > that I missed. > > This work around doesn't seem to work for whole crystals as there is no > set_latex_options option. Anyway to work around

Re: [CoCalc] Re: [sage-combinat-devel] Re: Crystals not displaying

Right, it is in fact invoking show(), which is File: /projects/sage/sage-7.5/local/lib/python2.7/site-packages/smc_sagews/sage_salvus.py Source: def show(*objs, **kwds): """ Show a 2d or 3d graphics object (or objects), animation, or matplotlib figure, or show an expression

Re: [CoCalc] Re: [sage-combinat-devel] Re: Crystals not displaying

On Thu, Jun 1, 2017 at 2:59 PM, Dima Pasechnik wrote: > right, sorry, I mean a sagews notebook running Sage. > I did not try other SMC Sage interfaces. Yes, there is probably somewhere this "show" function involved, which has the same name but a different implementation --

Re: [CoCalc] Re: [sage-combinat-devel] Re: Crystals not displaying

On Thu, Jun 1, 2017 at 1:46 PM, Harald Schilly wrote: > On Thu, Jun 1, 2017 at 9:02 AM, Dima Pasechnik wrote: >> By the way, this example does work on SMC, so they must be doing something >> non-standard here. >> What is that? > > Hi, you need to be

Re: [CoCalc] Re: [sage-combinat-devel] Re: Crystals not displaying

On Thu, Jun 1, 2017 at 9:02 AM, Dima Pasechnik wrote: > By the way, this example does work on SMC, so they must be doing something > non-standard here. > What is that? Hi, you need to be more precise, since CoCalc has a rather large feature surface. In case you mean "sagews"

Re: [sage-combinat-devel] Re: Crystals not displaying

On Wednesday, May 31, 2017 at 2:24:55 PM UTC+1, Nicolas M. Thiéry wrote: > >Hi, > > I am investigating this. Current status: > > Remember that graphs can be latex rendered in two ways: either by > having Sage produce tikz manually (1), or through dot2tex (2). For > general graphs,

[sage-combinat-devel] Re: Crystals not displaying

This was also reported here: https://tex.stackexchange.com/questions/342983/on-drawing-a-crystal-graph-i-have-a-trouble-illegal-parameter-number-in-defi How about we at least open a trac ticket to deal with this? On Monday, May 29, 2017 at 9:48:45 PM UTC+1, Julie Beier wrote: > > I have been

Re: [sage-combinat-devel] Re: Crystals not displaying

Update: - Up to trivial comments, the default latex output has not changed since Sage 6.7beta3 (at least). view fails similarly with that version. - A slightly smaller example: sage: t = Partition([1]) sage: G = DiGraph([[t,t]], loops=True) sage: latex(G)

Re: [sage-combinat-devel] Re: Crystals not displaying

Hi, I am investigating this. Current status: Remember that graphs can be latex rendered in two ways: either by having Sage produce tikz manually (1), or through dot2tex (2). For general graphs, the former is the default. For graphs produced from crystals, the default is to use (2) if

[sage-combinat-devel] Re: [CoCalc] Re: Crystals not displaying

On Wed, May 31, 2017 at 12:02 PM, Dima Pasechnik wrote: > oops, it does work after I install dot2tex by doing > > sage -i dot2tex Well, I can only confirm, that dot2tex is installed on CoCalc... Better error messages and sanity checks FTW :-) -- harald -- You received this

[sage-combinat-devel] Re: Crystals not displaying

On Wednesday, May 31, 2017 at 7:43:14 AM UTC+1, Dima Pasechnik wrote: > > I can confirm that > B = crystals.Tableaux(['A',2], shape=[2,1]); view(B, tightpage=True) > does not work with the latest Sage beta. > It looks as if some tikz-related stuff in the TeX file header > is messed up. >

[sage-combinat-devel] Re: Crystals not displaying

I can confirm that B = crystals.Tableaux(['A',2], shape=[2,1]); view(B, tightpage=True) does not work with the latest Sage beta. It looks as if some tikz-related stuff in the TeX file header is messed up. On Wednesday, May 31, 2017 at 7:38:29 AM UTC+1, Dima Pasechnik wrote: > > Perhaps SMC

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

Hi Travis, On 2017-03-31, Travis Scrimshaw wrote: > I agree that this is something that should be fixed (actually 0 is not > recognized as being in a CFM, which is a bug IMO). AFTER the fix from #22707? > Well, we do have a number of CFM subclasses that explicitly have a

[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: Improvements to FreeAlgebra

Hi Nicolas, 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 structure for >

Re: [sage-combinat-devel] Re: combinat.sagemath.org

On Mon, Mar 27, 2017 at 5:50 PM, Matthew Rennekamp wrote: > What are we going to do for the files and other publications? publications will be on the main sagemath.org page, it's just that there are two links in the menu missing. -- h -- You received this message

Re: [sage-combinat-devel] Re: combinat.sagemath.org

What are we going to do for the files and other publications? Will those be wiki pages with attachments, or redirect to something else? On Mar 27, 2017 7:16 AM, "Nicolas M. Thiery" wrote: > On Mon, Mar 27, 2017 at 01:11:24PM +0200, Harald Schilly wrote: > > Ok, modulo

Re: [sage-combinat-devel] Re: combinat.sagemath.org

It makes sense functionally, but I don't see why we should add more pages for the files (combinat.sagemath.org/* redirecting to wiki.sagemath.org/combinat/*) as opposed to only combinat.sagemath.org/index.html redirecting. -- You received this message because you are subscribed to the Google

Re: [sage-combinat-devel] Re: combinat.sagemath.org

On Mon, Mar 27, 2017 at 01:11:24PM +0200, Harald Schilly wrote: > Ok, modulo some global dns changes and updates, things like this work: > > combinat.sagemath.org/Installation -> wiki.sagemath.org/combinat/Installation Great; working smoothly here. Finally our page is back. Thanks a lot!

Re: [sage-combinat-devel] Re: combinat.sagemath.org

On Mon, Mar 27, 2017 at 12:47 PM, Harald Schilly wrote: > I'll report back when this is working. Ok, modulo some global dns changes and updates, things like this work: combinat.sagemath.org/Installation -> wiki.sagemath.org/combinat/Installation -- harald -- You

Re: [sage-combinat-devel] Re: combinat.sagemath.org

On Sat, Mar 25, 2017 at 2:02 AM, Anne Schilling wrote: >> https://github.com/sagemath/publications > Is just pushed a couple of updates to the references to the repository. > I hope you can see them. Unfortunately no ... but ok, I see what's going on. What's missing is

Re: [sage-combinat-devel] Re: combinat.sagemath.org

On Fri, Mar 24, 2017 at 11:33 PM, Nicolas M. Thiery wrote: > All we > need is to have http://combinat.sagemath.org redirect to > https://wiki.sagemath.org/combinat/ for "backward compatibility" with > references in e.g. published papers. Uhm ok, I'll try to create a

Re: [sage-combinat-devel] Re: combinat.sagemath.org

On 3/24/17 9:32 AM, Harald Schilly wrote: > On Fri, Mar 24, 2017 at 5:47 AM, Anne Schilling wrote: >>> http://www.sagemath.org/library-publications-combinat.html >>> >>> ? >> >> Yes, thank you! I see that some references are outdated and some new >> can be added. I will add

Re: [sage-combinat-devel] Re: combinat.sagemath.org

Dear Matthew, (thanks Anne, Harald, and William for the additional feedback) On Tue, Mar 21, 2017 at 04:26:15PM -0700, Matthew Rennekamp wrote: >It's been awhile since this discussion. Are there any more Combinat >people that want these files open, or possibly the subdomain

Re: [sage-combinat-devel] Re: combinat.sagemath.org

On Fri, Mar 24, 2017 at 5:47 AM, Anne Schilling wrote: >> http://www.sagemath.org/library-publications-combinat.html >> >> ? > > Yes, thank you! I see that some references are outdated and some new > can be added. I will add those soon. Well, a while ago nathan cohen

Re: [sage-combinat-devel] Re: combinat.sagemath.org

>> The Wiki page looks very different from before! It used to start with a list >> of upcoming/recent events. Now it just has some links to disconnected >> websites. > > What is "the wiki page"? https://wiki.sagemath.org/ still starts with > a list of upcoming/recent events... The wiki that was

Re: [sage-combinat-devel] Re: combinat.sagemath.org

On 3/23/17 2:00 PM, Harald Schilly wrote: > > > On Thursday, March 23, 2017 at 10:42:18 AM UTC+1, Anne Schilling wrote: >> For example, we had >> a list of all publications citing sage-combinat etc. there. This should be >> kept! > > Do you mean these publications: > >

Re: [sage-combinat-devel] Re: combinat.sagemath.org

On Thursday, March 23, 2017 at 5:48:20 PM UTC+1, Matthew Rennekamp wrote: > > Could we set up another repo, use it as a "project site" (as they call > it), and then use the www.sagemath.org/combinat as URL forwarding or > something else? > >> >> Yes, sure, see [1]. I think we can also have

Re: [sage-combinat-devel] Re: combinat.sagemath.org

I assume that the main website and the www subdomain are hosted from GitHub. Could we set up another repo, use it as a "project site" (as they call it), and then use the www.sagemath.org/combinat as URL forwarding or something else? The wiki page is https://wiki.sagemath.org/combinat, and

[sage-combinat-devel] Re: combinat.sagemath.org

Hi! The website http://combinat.sagemath.org/ seems to be down right now. I agree with Nicolas, that it would be good to keep this website. For example, we had a list of all publications citing sage-combinat etc. there. This should be kept! The Wiki page looks very different from before! It

[sage-combinat-devel] Re: combinat.sagemath.org

Hey, all. It's been awhile since this discussion. Are there any more Combinat people that want these files open, or possibly the subdomain pointing to the SageWiki page? I've changed my mind to support whoever administers the GitHub account to move files on there, as long as there are more

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

On Friday, 17 February 2017 17:18:20 UTC+11, Travis Scrimshaw wrote: > > Hey Andrew, >> >> >> >> Yea, it comes from the fact that it is only a simple wrapped element and > doesn't do anything beyond forwarding the repr/latex/ascii-art outputs. I > go back and forth on whether or not to pass

[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

On Thursday, 16 February 2017 15:41:37 UTC+11, Andrew wrote: > > Thanks Travis! Obviously I didn't read the documentation well enough as I > thought `Facade` was `False` by default -- so I'd tried setting > `Facade=True` with no joy. > > Cheers, > Andrew > > Unfortunately, now it seems that I

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

Thanks Travis! Obviously I didn't read the documentation well enough as I thought `Facade` was `False` by default -- so I'd tried setting `Facade=True` with no joy. Cheers, Andrew pd. I will have a look at your ticket. On Thursday, 16 February 2017 13:52:22 UTC+11, Travis Scrimshaw wrote: > >

[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: Multivariate Laurent polynomial ring with noncommutative relation y1*y2 = -y2*y1 ....and commutative relations x1*x2= x2*x1

Dear Mike Zabrocki, Thank you again. Your codes are helpful after inserting P.inject_variables() Sincerely Biswajit On Saturday, 11 February 2017 17:46:17 UTC+5:30, Mike Zabrocki wrote: > > Is what you want something like this?: > > sage: P = FreeAlgebra(QQ,7,'x1,x2,x3,x4,y1,y2,y3') > > sage:

[sage-combinat-devel] Re: Multivariate Laurent polynomial ring with noncommutative relation y1*y2 = -y2*y1 ....and commutative relations x1*x2= x2*x1

Dear Mike Zabrocki, Thank you for useful information. sage: y2bar*y1bar+y1bar*y2bar # should be 0 it would be nice if we get y2bar*y1bar+y1bar*y2bar=0. But we are not getting that. Basically I am trying for supergrassmanian which has some commutative variable x0, x1, x2, x3, x4 and rest non

[sage-combinat-devel] Re: Multivariate Laurent polynomial ring with noncommutative relation y1*y2 = -y2*y1 ....and commutative relations x1*x2= x2*x1

Is what you want something like this?: sage: P = FreeAlgebra(QQ,7,'x1,x2,x3,x4,y1,y2,y3') sage: (x1, x2, x3, x4, y1, y2, y3) = P.gens() sage: I = P.ideal([y1*y2+y2*y1,y2*y3+y3*y2,y1*y3+y3*y1,x1*x2-x2*x1,x1*x3-x3*x1,x1*x4-x4*x1,x2*x3-x3*x2,x2*x4-x4*x2,x3*x4-x4*x3]) sage: P.quotient_ring(I)

Re: [sage-combinat-devel] Re: combinat.sagemath.org

On Sat, Jan 14, 2017 at 12:03 PM, Nicolas M. Thiery wrote: > Nevertheless, Sage-Combinat and http://combinat.sagemath.org/ are > cited in many places, including 100+ publications. So we want this URL > to keep working, for historical reasons and future work. > > Hence my

Re: [sage-combinat-devel] Re: combinat.sagemath.org

Hi Matthew, Thanks for your interest and request for more background to decide what's the right thing to do. Sage-Combinat started back in 2008, as a reincarnation of a similar project MuPAD-Combinat (we switched the underlying platform from MuPAD to Sage). At some point Sage-Combinat

  1   2   3   4   5   6   7   8   9   10   >