Hi,
I had some network problems and some of my previous push did not work
(in particular the renaming of iet_closed...).
Sorry for this, hoping everything will go well.
Vincent
2009/10/9 Nicolas M. Thiery nicolas.thi...@u-psud.fr:
On Fri, Oct 09, 2009 at 06:52:28AM -0700, Anne Schilling
Hi,
Just to say that there is a new section in the design discussion.
http://wiki.sagemath.org/MathsAuLycee
It's not the best place to put it because it does not concern directly
the sage-combinat repository (but it does concern the sage-days in
February). Right for now I have no other place
Hello,
I need to consider two (families of) simple operations on partitions
that are not explicitely implemented in partition. They are
split(pi, a) : (p1, ..., pi, ..., pk) - (p1, ..., a, pi - a - 1, ..., pk)
collapse(pi, pj) : (p1, ..., pi, ..., pj, ..., pk) - (p1, ..., pi
+ pj - 1, ...
Hi,
The patch cardinality_of_rauzy_classes-vd.patch which breaks Sage's
Sorry for that. I'm working on the patch trac_7145 from the review of
Sebastien and let the cardinality apart...
Cheers,
Vincent
--
You received this message because you are subscribed to the Google Groups
Hi Franco, Sebastien and others,
I'm correcting the patch about Interval Exchange Transformations (iet)
which uses a lot sage.iet.words.* (alphabet, words and morphisms). Just
some remarks about this nice library.
1) alphabet does not have a union procedure but... Alphabet heritates
from
Dear Tim, dear sage-combinat,
The huge speed differnce can be seen here:
{{{
sage: timeit('[Combinations(range(i), j).list() for (i, j) in
CartesianProduct(range(15), range(15))]')
5 loops, best of 3: 449 ms per loop
sage: timeit('[combinations(range(i), j) for (i, j) in
Hi John,
2010/1/18 John H Palmieri jhpalmier...@gmail.com:
The patch trac_7948-lazy.patch at http://trac.sagemath.org/
sage_trac/ticket/7948 patches the file sage/combinat/iet/
template.py.
Although the patch already has a positive review, could
someone familiar with the combinatorics code
Hi Florent
Yes. Thank you for pointing this.
I know from where it comes: a path does not know how to build the
underlying graph. I need some help to design this.
Did you create a ticket for it ?
Vincent
--
You received this message because you are subscribed to the Google Groups
2010/3/2 Florent Hivert florent.hiv...@univ-rouen.fr:
Hi William,
A student of mine is going to add to sage the capability of plotting
lots and lots of fractals easily. E.g.,
[...]
The point of this email: if you like plotting fractals, and have some
potentially useful code to
Hi,
With Stepan and Timo we start this week to work on
WordMorphismExtensions starting from the code of Franco (thank you
Franco). The code is in sage-combinat and works almost well. There is
also an opened ticket #8431 relating this feature.
{{{
sage: s = WordMorphism('a-ab, b-ac, c-a')
sage: e
Can you give here some typical use cases for those?
Here it is (in fact the dual morphism operates more on patches than on
faces because the image of a face is a patch and not a face)
{{{
sage: e = WordMorphismExtensionDual('a-ab,b-ac,c-a')
sage: e
E*(WordMorphism: a-ab, b-ac, c-a)
sage: f1 =
Hi Mike, Hi Carlos,
I just answer few words about Automata. We talked with Jean Berstel
about it during Sage days 20 and he said that there was a lot of
software available around the world for dealing with them. The most
general and most active is vaucanson (maintained by Jacques
Sakarovitch)
Hello,
sage.combinat.words have a (HUGE) problem
{{{
sage: Word(aa).is_square_free()
True
}}}
The one-line-patch ticket is #8490 and needs review...
Cheers,
Vincent
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post to this group,
Hello,
One more time with integer partitions...
1) I find the actual __repr__ boring (Ferrers diagram). Why do not
keep the old list representations which is really clearer than lines
of sharps ? Is there a reason to prefer Ferrer diagrams than list of
integers ?
Moreover with the actual serie
Hi,
Just to mention few incompatibilities with two nice different objects
in Sage: the Permutation and the PermutationGroupElement. I can
understand that we need to distinguish the two objects (not so well),
is it projected to have a fusion and if not why ? compatibility
between them ? Which one
2) Is it consistent to define the following operation + on partition
which sounds like concatenation on list
{{{
sage: p = Partition([2, 1])
sage: p
[2, 1]
sage: q = Partition([3, 1])
[3, 1]
sage: p + q
[3, 2, 1, 1]
}}}
-1 on this: I'd rather denoting this operation by the union
What is your Sage version ?
sage/combinat/iet/iet.py is merged in Sage since 4.3.2 (Moreover, I do
not think that there is any link between Sebastien's patch and this
file). It looks strange...
patch failed, unable to continue (try -v)
sage/combinat/iet/iet.py: No such file or directory
No
Hello,
It seems that the words.s_adic generator is broken by some patch
word_dynamic_classes*
sage: fib = WordMorphism('a-ab,b-a')
sage: from itertools import repeat
sage: words.s_adic(repeat(fib), repeat('a'))
ValueErrorTraceback (most recent call last)
...
It seems that the words.s_adic generator is broken by some patch
word_dynamic_classes*
The second of them is very experimental and is guarded by #+not_ready
: make sure that only the first of the word dynamic class patch is
applied.
Tell me if there are still any problems.
Thank you
En fait, je crois qu'une autre solution serait mieux dans ce cas-ci.
L'utilisation de méthodes sur les objets permet d'éviter toute
l'ambiguité due à la création d'un objet plus complexes à partir
d'objets simples (qui peuvent utiliser les mêmes structures de données
python pour représenter
Hi,
Just consider the following group
sage: G = SymmetricGroup(1)
sage: G
Symmetric group of order 1! as a permutation group
What must be standard generators for it ? For now it is the family
consisting of the identity...
sage: G.gens()
Family ((),)
But I would prefer an empty family as gap
Hi sage-devs,
During the sage-days in Luminy, Florent told me about a possible
mutability of objects that fails to be mathematically consistent for a
moment. As an example, starting with the permutation [1,2,3] switching
1 and 2 in two steps gives an intermediate step with [1,1,3] which is
no
Hello,
I made an error while correcting the series file (relative to the
patch that appeared at the end of the file). My first attempt was to
correct it but while starting Sage I get
RuntimeError: Unable to start MuPAD because the command 'mupkern -P e
-U SAGE=TRUE' failed.
In order to use the
Hello,
I made an error while correcting the series file (relative to the
patch that appeared at the end of the file). My first attempt was to
correct it but while starting Sage I get
I decided to disabling mupad-interface which seems to resolve the problem.
--
You received this message
I think that this kind of question is more dedicated to sage-support
because it does not deal about combinatorics
(http://groups.google.com/group/sage-support)
2010/7/28 Christian Stump christian.st...@gmail.com:
Salut cython specialists,
I would like to implement a routine adding dictionaries
Hi Sébastien, hi combinat devs,
Hence, since the majority of the patches I'm working on are
independent of other's, I decided to create my own patches repository
(made of my patches and the patches I am reviewing) :
http://sage.math.washington.edu/home/slabbe/patches/
I found that's a good
Dear Frederic and sage-combinat team,
j'essaye de faire sage -combinat update, depuis quelques jours, sur
diverses machines, et a chaque fois ca donne ca :
IOError: could not find dependency
sage/dynamics/flat_surfaces/origamis/cpython.pxd included in
Hello,
In a scratch-built Sage 4.6 on sage.math, I ran
./sage -combinat install
./sage -combinat update
./sage
but I see
[...]
/mnt/usb1/scratch/mpatel/tmp/sage-4.6-combinat/local/bin/ipy_profile_sage.py
ImportError: No module named flat_surfaces.all
Error importing ipy_profile_sage
I was aiable to reinstall sage-combinat on sage-4.6 but not to push
any changes. What did change from yesterday ?
Vincent
vinc...@jahe$ sage -hg push
pushing to http://combinat.sagemath.org/patches/
searching for changes
** unknown exception encountered, details follow
** report bug details to
I was aiable to reinstall sage-combinat on sage-4.6 but not to push
any changes. What did change from yesterday ?
The problem curiously disappeared... if anyone has an explanation, I
will be happy to hear it!
Vincent
--
You received this message because you are subscribed to the Google
Hi Anne,
I modified the series file (to make it compatible with sage-4.4.2),
did hg commit and then tried hg push from the sage-combint/.hg/patches
directory and got the following error message. Now I am not sure what's
wrong.
I just realized [*] that I get the same error as you few months
Maybe:
sage -combinat qselect
(some new guards have been introduced recently).
Thank you Nicolas for your answer.
What does the command sage -combinat qselect do ?
In any case, the command does not solve anything... (But I found how
to solve temporarily the problem by hand
PS: my hunky traceback
Which patches are applied?
patches guarded (verbose output from $ hg -v qseries | grep \ G\ ).
In particular the patch 27
trac_9648_modulemorphism_codomain_extension-cs.patch is.
0 G trac_7420-fix-infinite-coercion-discovery-loop-2.patch
1 G sage-4.3.1.patch
2 G
PS: my hunky traceback
Which patches are applied?
patches guarded (verbose output from $ hg -v qseries | grep \ G\ ).
In particular the patch 27
trac_9648_modulemorphism_codomain_extension-cs.patch is.
Ok, so that's indeed the problem: those patches are guarded whereas
they should
vinc...@chezmoi$ sage -combinat update nor
vinc...@chezmoi$ sage -combinat qselect
fixed the problem
Hmm. You might need to run sage -combinat qselect *in the sage-combinat
repository*. Could you give it a shot, and have a look at the script,
to see if this is the problem and possibly fix
Ah: that's wrong. There must be a glitch in the guards detection
(functions hg_all_guards / hg_active_guards).
There is (sort of) glitch ! I have the option verbose = true in my
hgrc and the result of hg qelect -s is not a list of
+name_of_the_guard but is the result of hg qselect -sv which
2010/11/27 Nicolas M. Thiery nicolas.thi...@u-psud.fr:
On Sat, Nov 27, 2010 at 04:56:28PM +0100, Vincent Delecroix wrote:
There is (sort of) glitch ! I have the option verbose = true in my
hgrc and the result of hg qelect -s is not a list of
+name_of_the_guard but is the result of hg qselect
Hello,
I would like to use CombinatorialFreeModule and other combinatorial
modules like group algebra. But there is always the same error when
calling .gens() (and the traceback is not so useful for explaining me
what should I do)... how do we use these objects ?
Thanks Vincent
sage:
Hi Nicolas!
I decided to implement a Python extension in order to provide the best
performances (because I just found that itertools has a combination
function which is 100 times faster that anything I did with Cython).
(you mean with Python I guess?) ^^
Just a question/remark : a DeBruijn sequence is just a Hamiltonian
cycle in the Rauzy graph of the full language right ? (remark that for
the DeBruijn graph the problem of finding Hamiltonian path is
equivalent to the one of looking for Euler cycles at the next level!).
It could be nice to have
Hello,
I made some improvements (?) of the Permutation function (in
improve_constructors_of_iet-vd.patch) in order to disable
{{{
sage: Permutation(['a','b','c'])
['a', 'b', 'c']
sage: Permutation([2,1,1])
[2, 1, 1]
}}}
We now have:
{{{
sage: Permutation(['a','b','c'])
TypeError
Sorry,
Due to conflict with trac_8898 the combinat queue is currently
broken... wait few minutes before pull and push.
Vincent
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post to this group, send email to
Due to conflict with trac_8898 the combinat queue is currently
broken... wait few minutes before pull and push.
This conflict is resolved and should work on sage-4.6.1. But
application de trac_9065-facade_parents-nt.patch
patching file sage/categories/enumerated_sets.py
Hunk #1 FAILED at 108
The four patches below do not apply on 4_6_1, so I decided to
temporarily to guard them with a +4_6_1
* trac_10333-lrcalc-mh.patch
* coxeter3-mh.patch
* coxeter3-iterator.patch
* trac_8360_semigroupe-interface-nt.patch
It will be push in few minutes
Vincent
--
You received this
Hello Florent, hello others,
I'm rewriting subword, subset, set_partition_ordered and set_partition
in order to
* correct many bugs (as example sage: Subwords([1,2,3], 0).last())
* improve documentation (in many case write the documentation)
* have admissibe time (eg not infinite) for
Hello !
I'm rewriting subword, subset, set_partition_ordered and set_partition
in order to
* correct many bugs (as example sage: Subwords([1,2,3], 0).last())
* improve documentation (in many case write the documentation)
* have admissibe time (eg not infinite) for iterations through
Hello Nicolas (the little),
I'm widely interested in your class for exhaustive generation of
vectors modulo permgroup ! Thank you for this nice patch.
My need are a bit more general:
1) iteration of couples (vector, stabilizer of the vector)
2) iteration through vectors such that the
1) iteration of couples (vector, stabilizer of the vector)
It depend on what kind of information you want in `stabilizer of the
vector`. If you want it to be a sage or gap permutation group, it can be
very very painful (especially for speed...). The orbit is `very easy` to
get, for more,
Hello Florent,
There are 20 lines at the begining of the patch
improve_constructors_of_iet-vd.patch
which modify permutation.py (the __init__ method). See the following thread
http://groups.google.com/group/sage-combinat-devel/browse_thread/thread/354f6e841ae5cc58
Cheers,
Vincent
--
You
Hello,
skipping separatrix_diagram-vd.patch - guarded by '-4_7_1'
applying translation_surface_homology-vd.patch
unable to find 'sage/dynamics/flat_surfaces/separatrix_diagram.py' for
patching
That's normal because translation_surface_homology-vd.patch depends on
Salut Nicolas,
2011/4/26 Nicolas M. Thiery nicolas.thi...@u-psud.fr:
Salut Vincent,
I just rebased your patch
trac_10534-generation_of_subsets_and_set_partitions-vd.patch
[...]
Rationale: with #10534, TestSuite checks that cardinality returns an
Integer. So I had to fix
Hello,
I get problem with the sage-combinat queue on sage-4.7.1.alpha0. Which
version should I use to be able to use the queue ?
vd@chezmoi$ hg qpush
application de trac_10998-categories-posets-nt.patch
patching file sage/misc/sageinspect.py
Hunk #1 FAILED at 651
1 out of 1 hunks FAILED --
Hi,
On Thu, Jun 02, 2011 at 11:24:09PM +0200, Vincent Delecroix wrote:
I get problem with the sage-combinat queue on sage-4.7.1.alpha0. Which
version should I use to be able to use the queue ?
The queue needed some rebase. I just worked on this, and it now
applies both on 4.7 and 4.7.1
Salut Florent, dear trees developer,
Florent, I see your nice patches about trees which I will use in a
next future. More precisely, I would like to iterate through unrooted
planar trees (planar = cyclic ordering at each node).
* do your patches stable enough that I can open a new one just
Salut Christian,
I had to disable all patches inside iet and translation surfaces as
they didn't apply. Could you please have a look and solve it.
You did well. But everything applies fine at home (with sage-4.7.1).
Which version are you running ? I should have put some guards relative
to the
As far as I understand, your index.html should be built from the
source. But I read the source and I find it not well documented from
the point of vue of programmer. I'm really interested in your code as
I implement similar stuff and it would be time saving to merge our
classes. Moreover, I could
You can find the file where I implemented RibbonGraphs at the following address
http://iml.univ-mrs.fr/~delecroi/ribbon_graph.py
(it is not really in sage-combinat by default because of a guard)
I had two main goals:
* implement a generic structure in order to compute topological
invariant of
Hello Bruce,
I am now reading Chapter I of Lando and Zvonkin so I
have a much better idea of your interests.
Cool! But beyond ramified covers of the sphere (as in [LZ]) and
Strebel differentials (as in the paper [MP] mentioned by Tom), I used
ribbon graph as a topological object : a graph
Hello,
I am currently participating in a sage-based project that aims to
integrate a lot of number theory databases
[...]
I am very interested in the project since I have the problem of
interfacing databases in Sage from various sources (in particular, one
sounds number theoretical: the
2011/11/24 Florent Hivert florent.hiv...@lri.fr:
I'm thinking about organizing a small one-week coding sprint around
January-February in the south-west of Paris. Following the *-combinat
tradition I plan to reserve the Guest house at Cernay-la-Ville:
[...]
- Refactoring of the
Dear sage-combinat lovers and Cernay organizers,
From the poll (I appologize that I vote twice) it seems that the week
from 6/2 to 10/2 has the best possible audience (8 people).
http://nuages.domainepublic.net/cd7d/vote/
For my organization (and the one of Stepan), I would like a week to be
Dear all,
I'm currently implementing factorial languages which are just a set of
words which stable under taking factors. Such object for sure should
be a parent and the associated words its elements. Moreover, I suspect
that a the good category would be FiniteEnumeratedSet or
Dear compositions lover,
I found a weird bug which perhpas needs a ticket : it is not possible
to send a composition for argument inner/outer of Compositions as in :
{{{
sage: c = Composition([2,2,1])
sage: C1 = Compositions(5,outer=c); C1
Compositions of the integer 5 satisfying constraints
Hello,
I think we should record such things for the week at Cernay during which
we intend to speak about basic object in combinatorics.
Feel free to create a wiki page about weirdness in basics objects of
combinatorics. I will also try to add some comments about integer
vectors. I think you
Hello,
I'm looking at what I would like to do in Cernay, and I found new
things about groups and group actions... but perhaps some of the stuff
is implemented somewhere. I will complete the wiki on that topic just
before the begining of the week. If you have any comment, please do.
1) The
Hello,
I'm working on refactorization of sage.combinat.words (#12224) and I
have two general questions of design.
1) The class Alphabet (in sage.combinat.words.alphabet) does nothing
more or less than EnumeratedSets (in
sage.sets.finite_enumerated_sets). It is considered as a basis for the
free
One more,
One item on the todo list is the migration from CombinatorialClass to
FiniteEnumeratedSet and InfiniteEnumeratedSet. What happens to the
following functions
* rank(self, elt)
* unrank(self, i)
* __getitem__ = unrank
They are not implemented for IntegerRange as I would expect.
Best,
Hello,
Together with the language-team, we decided to implement a
LazyEnumeratedSet (see my patch in the queue) which takes as input an
iterable (finite or infinite) and mimic a set which contains the
element of the iterable. It is very useful when we do not want to
implement a specific class...
Hi,
Trying to apply the combinat queue on sage-5.0.beta2 I get
applying trac_10963-more_functorial_constructions-nt.patch
patching file sage/categories/commutative_additive_monoids.py
Hunk #1 FAILED at 2
1 out of 2 hunks FAILED -- saving rejects to file
2012/2/16, Vincent Delecroix 20100.delecr...@gmail.com:
2012/2/11, Nicolas M. Thiery nicolas.thi...@u-psud.fr:
On Sat, Feb 11, 2012 at 12:05:49PM +0100, Florent Hivert wrote:
Together with the language-team, we decided to implement a
LazyEnumeratedSet (see my patch in the queue) which takes
I get trouble with TestSuite which only works when elements of the set
have parents. In particular it does not work in the following case
{{{
sage: from sage.sets.set_from_iterator import EnumeratedSetFromIterator
sage: E = EnumeratedSetFromIterator(graphs,
Finally I implemented two decorators : one for functions and one for
methods and everything seems to work. The last version is in
sage-combinat queue.
I have to write down documentation but the ticket should be finalized today.
If you have any remark on naming convention, architecture, possible
2012/2/18, Nicolas M. Thiery nicolas.thi...@u-psud.fr:
Hi Florent, Vincent,
All my edits in the series file to carefully craft guards on the
patches that are already merged in 5.0 got discarded in one of the
recent merge!
I reinstated them, so the queue should work again ...
That
2012/2/23, Nicolas M. Thiery nicolas.thi...@u-psud.fr:
On Wed, Feb 22, 2012 at 03:12:39PM +, Vincent Delecroix wrote:
Actually the methods are removed in
trac_10963-more_functorial_constructions-nt.patch
But then, I get a problem when I build a parent which is an infinite
enumerated set
Hi,
What do you think about
{{{
sage: ZZ.has_coerce_map_from(NN)
False
}}}
Despite of the fact that
{{{
sage: NN.facade_for()
(Integer Ring,)
}}}
Cheers,
Vincent
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post to this group, send
Hello,
Sorry, me again! I am refactoring the code of lyndon_words to fit the
new word implementation. I do not have a problem except for
int/Integer incompatibilities.
More precisely, I do not understand
{{{
sage: Integer(1) in IntegerRange(0,4)
True
sage: int(1) in IntegerRange(0,4)
False
}}}
Hello,
Here is a question about conventions for enumerated sets:
In sage.sets.finite_enumerated_sets unrank raise an IndexError: tuple
index out of range if the index is out or a TypeError: tuple indices
must be integers, not str if the argument is not coercable into an
integer. While, the
2012/3/1, Anne Schilling a...@math.ucdavis.edu:
Now Mike pointed out further that whether an element needs to be typed or
not to be in the set
is rather arbitrary:
sage: [3,1,2] in Compositions()
True
sage: [1,2,3,4] in Words()
False
sage: [1,0,1,0] in DyckWords()
True
sage: [[1,2],[3]]
Hello,
Sage is not saying anything. But, there seem to be a fix in sage-combinat :
sage: perm = Permutation([1,2,1])
---
ValueErrorTraceback (most recent call last)
...
ValueError: the
Hi,
There was in sage-combinat queue a patch of Mike that add to
Permutation a decorator @combinatorial_class_from_iterator for
burhat_succ and bruhat_pred in order to return a CombinatorialClass
and not a list. In #12518, I replaced it with @set_from_method which
should be the new version of
Hi Martin, hi Nicolas,
2012/3/15, Nicolas M. Thiery nicolas.thi...@u-psud.fr:
Hi Martin, hi Vincent,
On Thu, Mar 15, 2012 at 08:43:47AM +0100, Martin Rubey wrote:
I was using lrcalc, and noticed that supplying the weight keyword does
not work, not even the doctest: (this is on sage
does anyone know if I'd be safe to just remove this from
the
vd.patch, otherwise who should I contact about this?
From `hg log`, this patch hasn't changed since september 2011. So yes,
that sounds safe. I guess Vincent Delecroix will even be pleased not
to have to handle this hunk anymore
2012/5/20, Nicolas M. Thiery nicolas.thi...@u-psud.fr:
On Sun, May 20, 2012 at 11:07:16AM +0200, Vincent Delecroix wrote:
Hello,
On Fri, May 18, 2012 at 07:36:51AM -0700, Frédéric Chapoton wrote:
trying to test my own files on sage 5.0, it seems that it takes many
import statements
Dear all,
I push a last version of import_statements. Use it and break it...
(good luck :-)
The implementation uses mainly sys.modules (thank you Nicolas for that
pointer). In the case the object is an instance of a class, the final
check is done using sage_getsource/re instead of find/grep.
If
When there are several names, I think we should return the one that
agrees with the name that was given by the user.
I really don't know how we can obtain the name used inside the
function. We should somewhat access the stack of calls of the console
(as the calls
Hi Michael,
Since I am new to SAGE development
Welcome ;-)
just created a ticket #12996 for a patch including a class with
support for one-dimensional shifts of finite type which should
eventually make its way into sage/dynamics/symbolic.
Very cool! The first data structure for set of
Potential workarounds:
- Accept things as they are: that's just a corner case, it's easy for
the user to fix the name after the import
- Accept strings like cached_method as input as well as names for
those cases
I like it better. But that way there is no better method than parsing
for
By the way, you haven't pushed your latest changes.
Right ;-) done.
--
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
Hi Andrew,
2012/7/30, Andrew Mathas andrew.mat...@gmail.com:
I want to review a few patches but I am confused by one point.
The wiki says that the patch should apply cleanly to the *latest
development release*. What is confusing me is that the patches in the
queue, and those on trac, are
Hi,
I'm working on #8920 about factorization of codes between alphabets
and sets. I got problems with the following behavior::
{{{
sage: int(2) in IntegerRange(1,3)
False
sage: int(2) in Integers()
True
sage: int(2) in NonNegativeIntegers()
True
sage: int(2) in PositiveIntegers()
False
}}}
It
Quick update : I really don't like the following (which comes from the
default sage.structure.parent.__contains__)
{{{
sage: Zmod(12)(5) in ZZ
True
}}}
2012/8/16, Vincent Delecroix 20100.delecr...@gmail.com:
Hi,
I'm working on #8920 about factorization of codes between alphabets
and sets. I
Thanks Simon.
The default behaviour of x in P for any parent P in Sage is:
x in P
=
P(x)==x is True (and does not raise an error)
This default behavior is very badly suited. In parallel to my second
mail, I found the more striking example
{{{
sage: R = Zmod(5)
sage: i = ZZ(3)
sage: j =
Hello,
There is a weirdness in the initialization of Parent with a facade.
Consider the following example
class MySet(Parent):
def __init__(self):
Parent.__init__(self, category=(FiniteEnumeratedSets(), Monoids()))
The category of an instance of MySet is just a join of the two
Hi Anne,
Your patch
applying trac_8920-alphabet-vd.patch
patching file sage/combinat/words/finite_word.py
Hunk #2 FAILED at 129
1 out of 23 hunks FAILED -- saving rejects to file
sage/combinat/words/finite_word.py.rej
patch failed, unable to continue (try -v)
patch failed, rejects left
Hello,
I do have a question linked to categorification of sage.combinat.words
(trac #12224), Subwords (trac #10534) and graded sets (trac #10193).
For object like integer partition, compositions or words, it make
sense to take slices. In the current implementation we do have quite
different
Hi,
Thanks to Nicolas the Little, Sage has a SearchForest class. It is a very nice
tools to iterate through sets defined by a recursive choice
tree. Unfortunately, currently due to the name someone who doesn't know that
it exists has no chance to find it. It seems that there is an agreement
Hi,
For string representation, I think that it sould be a matter of the
parent via a _repr_element_ method. This method is yet used in some
classes. The issue may be fixed with the modification of
Element.__repr__ as
def __repr__(self):
if self.__custom_name:
return
Granted: there should be an abstract class for word-like objects (or
more possibly generally objects with labels), and this method should
be implemented there. But in the mean time just leave it there.
Note that the terminology is not uniform. Among others
* evaluation
* Parikh vector
*
Saluut,
Here's how you can get an infinite loop in two lines with Permutation.
sage: p =
Permutation([(1,10,11,13,9,3,16,0,22),(8,2,15,18,24,26,20,21,4),(5,6,17,12,25,7,23,14,19)])
sage: p.to_cycles()
Of course it has to be because my permutation goes from 0 to n-1 while the
code
Dear facade lovers,
I just upload on trac a patch about the initialisation of facade sets
at #13801. One of the smallest patch I never write... which corrects
two errors.
Please, send comments.
Best,
Vincent
--
You received this message because you are subscribed to the Google Groups
1 - 100 of 1584 matches
Mail list logo
