[sage-combinat-devel] Re: The queue on 5.6.beta2
Thanks, Travis and Christian! Christian, it looks like your patch trac_11187-finite_reflection_groups-cs.patch imports UCF on sage startup, which means that removing UCF meant sage wouldn't start with the queue applied. This was affecting all versions, not just 5.6 betas, so I went ahead and reinstated your UCF patch with the parts from #13727 and #13728 removed. Feel free to resolve this whatever way you like in the longer term, of course. cheers, Hugh On Friday, January 4, 2013 8:06:45 AM UTC-8, Hugh Thomas wrote: > > > Hi everyone! > > Below are the results of my attempt to apply the queue on 5.6.beta2. > > Nicolas: trac_10193-graded_enumerated_sets-nt.patch needs to be rebased > over #13742 (Nathann's ticket about the permutations code), which needs to > be added into the queue. > Also, category-symmetric_groups-nt.patch needs a trivial rebase over #13366 > > Travis: trac_8392-check_permutation-ts.patch also needs to be rebased over > #13742. > > Christian: trac_8327_universal_cyclotomic_field-cs.patch needs to be > rebased over your patches #13727 and #13728, which also need to be added > into the queue. (Unless I'm mistaken, the rebase just amounts to deleting > the corresponding hunks from trac_8327.) > > Florent: gap3_spkg_doc_link-fh.patch needs what may be a trivial rebase > over #13211 (GAP upgrade). > > cheers, > > Hugh > -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To view this discussion on the web visit https://groups.google.com/d/msg/sage-combinat-devel/-/d-mmN31BUH4J. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
Re: [sage-combinat-devel] Lattice paths in Sage
On Fri, Jan 04, 2013 at 09:38:43PM +0100, Christian Stump wrote: > I see that there is quite some stuff implemented for "WordPaths". I > now wonder if someone already has code (or how much work would it be) > to provide the possibility of constructing WordPaths from a given > start point A to a given end point B that are contained in a region > given by linear (or polynomial, or other) inequalities. I do assume a > priori (since this is almost impossible to check in general, if I > recall correctly) that there are only finitely many paths from A to B. > > This seems to be fairly easy to implement: > > - if A and B coincide, use the empty path, > - otherwise check for every point A+S for a given step S if all given > inequalities are satisfied, and append S to all paths from A+S to B. > > Similarly, one can obtain all paths within the region starting at A of > a given length. A more general question: what about finding by breadth > first search all finite length paths from A to B, even if there exist > paths of arbitrary length ? This must certainly be a known problem... > > Such an implementation could be used to define all kinds of relatives > of Dyck and Schröder like paths (and also tons of others)... Quick comment for the special cases where the paths have a "main direction" like for Dyck and Schröder paths (each step goes right and up or down by a certain amount): IntegerListsLex should cover many of those. For non self-intersecting paths, Xavier Provencal could be a good person to ask. Cheers, 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. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
