One more time,
Since I want to sell such code (I really don't know how use it ? only me
?)...
Here is another example : C = {a, b, c} with a > b > c and G = <
((1,4),(2,3)), ((1,2), (1,4)) >
***
sage: C =
Le 29/02/2016 16:23, Simon King a écrit :
Hi!
I have a finite set C, and I have a finite group that acts
on the n-fold Cartesian product of C by permutation of positions, wher
n is a fixed number.
At sage.combinat.enumeration_mod_permgroup, I see how I can compute the
orbit of one element of
Le 28/06/2015 11:42, Darij Grinberg a écrit :
On Sun, Jun 28, 2015 at 10:07 AM, Nicolas Borie pout...@gmail.com wrote:
PS: The last entry of my collection of Python tricky codes was danger from
free variables : (MAKE A LIST OF FIRST POWER FUNCTION (1, X, X^2, X^3,
X^4))
L = [lambda x : x**i
Le 28/06/2015 06:55, Anne Schilling a écrit :
Hi!
Is this what I should expect from this code:
sage: positions=[1,2,3,4,5,6]
sage: for j in positions:
: positions.remove(j)
:
sage: positions
[2, 4, 6]
Wha this one will increase my collection of tricky examples... There
is a
Le 28/06/2015 22:47, Anne Schilling a écrit :
Hi Nicolas B.,
Thank you for your explanations! It was a little difficult
to find this bug since in some cases it actually works
{{{
sage: positions=[1,2,3,4,5,6]
sage: for j in positions:
if is_even(j):
positions.remove(j)
:
sage:
Le 09/06/2015 06:50, Viviane Pons a écrit :
Hi everyone,
I'm doing this:
sage: FreeA.a,b,c,d,e,f = FreeAlgebra(QQ,implementation=letterplace)
sage: P = a*b*a*c*c*b + a*b*a*d*d*b + a*c*a*d*d*c + b*c*b*d*d*c
sage: X = P.lm()
sage: X
a*b*a*c*c*b
And now I would like a way to cut my element X
Hello,
Computing the inverse of the identity matrix is not possible. Ok, it
works for rings using RingElement class for the elements (like ZZ, QQ,
RR, CC, ...).
sage: SF = SymmetricFunctions(QQ).schur(); SF
Symmetric Functions over Rational Field in the Schur basis
sage: one = SF.one()
sage:
Hello all,
As I was constructing some Free Modules over the symmetric functions, I
fall on this (sage 6.4.beta2 for my version (yes, that's probably old)):
sage: SymmetricFunctions(QQ) in CommutativeRings()
False
sage: SymmetricFunctions(QQ).a_realization() in CommutativeRings()
True
I would
Le 07/09/2014 13:31, Volker Braun a écrit :
I would recommend that you try to compile the latest version from source.
Hello,
On Lubuntu 64 bits (up to date),
When trying to compile the 6.3 from sources, I just got :
real13m9.547s
user18m36.662s
sys0m51.881s
Successfully
Hi all,
Is there currently a way in Sage-combinat to compute the action of a
permutation over standard tableaux ?
For example, I would like something like :
Permutation([2,1,3,4]) * B([[1,2],[3,4]]) = B([[1,2],[3,4]]) -
B([[1,3],[2,4]])
This thing is called in French algorithme de
Second answers on myself,
Does the catgeory guys already think the possibility or utility to
define the category of :
Representations( ring )
Whose Parents belonging to this catgeory would be a king of meet (think
meet in terms of category construction) between :
A set with an action
A
On 02/12/2013 20:34, Darij Grinberg wrote:
Hi,
Is the following a case of refused bequest? (If you don't know much
about symmetric functions, it should be enough to know that p and s
are two free modules with coercions between them.)
sage: Sym = SymmetricFunctions(QQ)
sage: p = Sym.p()
sage: s
On 15/11/2013 23:04, Nicolas M. Thiery wrote:
On Fri, Nov 15, 2013 at 02:43:29PM -0500, Vincent Delecroix wrote:
Thanks for taking care of it. I would like cartesian products to be
smarter about iteration... especially when one of the factor is
infinite. I have a working implementation of the
Hi all,
Thanks you Simon for the time you spent to give answers. Thanks you also
Vincent for the suggestion. I have now a trac number :
http://trac.sagemath.org/ticket/15160
Feel free to rephrase the ticket description or modify anything (still
my English...). This is far from final but
On 03/09/2013 22:48, Simon King wrote:
PS:
- I recommend to *try* (no guarantee it will work) to create a new type
of action A (inherit from sage.categories.action.Action). You need to
implement its _call_ and _repr_name_, and I think that's all what is to do
(but perhaps you'll find
Hi all,
I am fighting with the same problem for too much time... I want to
invert matrices (squares and invertibles especially because they
represent basis change of a finite dimensional quotient : K[X] /
Sym(X)^+ ). We begin to have a large bunch of combinatorial ring in
sage-combinat and
On 03/09/2013 22:48, Simon King wrote:
PS:
On 2013-09-03, Simon King simon.k...@uni-jena.de wrote:
Shouldn't there always be a coercion from the base ring into a
unital algebra? It seems to me that the underlying problem is that
matrix spaces do not properly use the new coercion model (in
Le 30/07/2013 14:18, Simon King a écrit :
Hi all,
I determined all classes-with-ClasscallMetaclass that sometimes return
instances that are not instances of this class:
...
sage.combinat.integer_vectors_mod_permgroup.IntegerVectorsModPermutationGroup
...
What do you think? These are
draft code which hasn't been readed by a
native speaker...
Cheers,
Nicolas Borie.
--
You received this message because you are subscribed to the Google Groups
sage-devel group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr
0 0 0 0 s[]]
sage: Id._charpoly_df()
s[]*x^6 - 6*s[]*x^5 + 15*s[]*x^4 - 20*s[]*x^3 + 15*s[]*x^2 - 6*s[]*x + s[]
sage: Id.charpoly()
Traceback (most recent call last):
...
ValueError: ['x'] is not an element of Partitions
*
Cheers,
Nicolas Borie
Le 22/02/2013 16:59, Travis Scrimshaw a écrit :
Hey Franco,
I noticed that this morning and fixed it (about an hour ago and it
was an error on every version caused by me).
I confirm that both of you are right!!!
This is fixed! But the sage -combinat script stop when applying the
queue
Le 10/10/2012 15:53, Simon King a écrit :
Why not RecursiveSet? The word Generated seems redundant to me.
And what you tell about the role of post_process makes me think it could be
renamed into branch_cut.
Best regards,
Simon
Hello,
The post_process hardly depend on a fonction (placed in
Le 19/07/2012 11:17, Simon King a écrit :
Hi!
On 2012-07-19, Dima Pasechnik dimp...@gmail.com wrote:
let me nitpick first by saying that in group theory=20
presentation means presentation by generators and
relations whereas you mean a (linear) representation.
In this way of thinking, the most
Hello,
I would like to have some precision about Facades. In the Facade code,
the documentation say :
**
A *facade set* is a parent ``P`` whose elements actually belong to some
other parent
**
I don't want to play with the sense of words and especially the sense of
the
Le mercredi 04 avril 2012 à 18:44 +0200, Nicolas M. Thiery a écrit :
Hi Nicolas, Florent!
On Wed, Apr 04, 2012 at 06:23:57PM +0200, Nicolas Borie wrote:
I am using the 5.0.beta2 (The Cernay2012 version) and the sage -combinat
update give me :
...
Is there anything to be fixed
Le vendredi 24 février 2012 à 00:30 -0800, Anne Schilling a écrit :
Hi Florent,
I changed this over to ClonableList, but still get the same error. Could you
please have a look to see what is wrong.
---
sage: strongTableau([[-1, -2,
Le vendredi 24 février 2012 à 00:30 -0800, Anne Schilling a écrit :
---
sage: strongTableau([[-1, -2, -3], [3]],2,[3] )
You also should try :
strongTableau([[-1,-2,-3],[3]], 2, 3)
In the __init__ of strongTableaux, the error message is
Le lundi 23 janvier 2012 à 03:58 -0800, Dima Pasechnik a écrit :
Given that Chevie needs Maple, it can be regarded as highly
optional.
Hello Dima,
If you are a Chevie lover, you can already have it in Sage in a fully
open-source way. As Jean pointed out, Chevie is also a GAP'3' --
package.
Le lundi 23 janvier 2012 à 03:58 -0800, Dima Pasechnik a écrit :
Given that Chevie needs Maple, it can be regarded as highly
optional.
Hello Dima,
If you are a Chevie lover, you can already have it in Sage in a fully
open-source way. As Jean pointed out, Chevie is also a GAP'3' --
package.
is an excellent way to verify you correctly use
the category framework. (necessary but not sufficient)
This was just a small tour about the categories and some expert will
probably tell better advises than me. Also sorry for my English.
Cheers,
Nicolas Borie.
--
You received this message because you
is an excellent way to verify you correctly use
the category framework. (necessary but not sufficient)
This was just a small tour about the categories and some expert will
probably tell better advises than me. Also sorry for my English.
Cheers,
Nicolas Borie.
--
To post to this group, send an email
Hello,
I am currently developing an experimental refactoring of the
IntegerVectors with a data structure for elements inheriting from
ClonableIntArray.
Among the different Goals of this refactoring, there are :
- Use properly the categories ((Infinite)EnumeratedSets())
- Speed up computation by
Le dimanche 16 octobre 2011 à 23:58 +0200, Florent Hivert a écrit :
Also I can't reproduce you behavior:
--
| Sage Version 4.7.1, Release Date: 2011-08-11 |
| Type notebook() for the GUI, and license()
Le dimanche 16 octobre 2011 à 23:58 +0200, Florent Hivert a écrit :
Also I can't reproduce you behavior:
--
| Sage Version 4.7.1, Release Date: 2011-08-11 |
| Type notebook() for the GUI, and license()
Hello,
I am very sorry, All was already in the doc!
def _element_constructor_from_element_class(self, *args,
**keywords):
...
Caveat: ``self`` is passed to the constructor of the
element class as a keyword argument ``parent``. Many
Hello,
I am trying to finalise the module enumerating integer vectors modulo
the action of a permutation group. In order to benefit as much as I can
of the useful features already available, I was converting my integer
vectors in nice ClonableIntArray instead of simple python lists.
I just found
Le dimanche 16 octobre 2011 à 23:58 +0200, Florent Hivert a écrit :
Which version of sage are you using ?
I use the 4.7.1 with combinat...
nicolas@lancelot:/opt/sage/devel/sage-combinat$ hg qtop
trac_6812_integer_vectors_mod_permgroup.patch
nicolas@lancelot:/opt/sage/devel/sage-combinat$ sage
Le dimanche 24 juillet 2011 à 15:38 -0700, Dima Pasechnik a écrit :
On Sunday, 24 July 2011 22:37:05 UTC+1, Rafael T wrote:
The gap-system already has the ability to work with Coxeter
groups:
http://www.gap-system.org/Gap3/Manual3/C075S005.htm Maybe I
Le lundi 25 juillet 2011 à 04:47 -0700, Martin Raum a écrit :
Hello all,
Hello Martin,
I happened to think about Sidon g-sets and to do some computations I
implemented a recursive enumeration of such sets. Clearly, this would
go into the combinatorics tree. I am not an expert in
Le mercredi 27 avril 2011 à 17:05 -0400, Nicolas M. Thiery a écrit :
Option 3: add a guard +power_zero on your patch, and use
sage -combinat qselect power_zero
to use it without bothering Vincent.
Yes, but I am only a mercurial adventurer of level 2.
This is a nice option! I will
Hi,
I don't know if you intend to touch it but I have a modification in
sage/groups/perm_gps/permgroup_element.pyx
I had the following method:
cpdef list _act_on_list_on_position(self, list x):
Returns the right action of ``self`` on the list ``x``. This is the
action on
Le dimanche 10 avril 2011 à 10:36 +, Vincent Delecroix a écrit :
Hello Nicolas (the little),
Hello,
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
Hello Samuel,
I'm trying to push my first patch to the combinat patch server. It
seems I need to authenticate. How do I get/choose a username and
password?
Yes, to push to the combinat repository, once must use the login and the
password of the Trac server. If you have no trac account, it is
Hello all,
I implemented a method major_index for FinitePermutationGroups. This
method returns the major index polynomial. This is a gadget counting the
elements of the group by major index.
For the first implementation, i got :
sage: DihedralGroup(5).major_index()
q^10 + q^9 + q^8 + q^7 + q^6 +
Le samedi 23 octobre 2010 à 18:56 -0700, Anne Schilling a écrit :
Hi!
With sage-4.5.3 there currently seems to be an error when applying the queue:
applying permgroup_cleanup-mh.patch
applying permgroup-domain.patch
patching file sage/categories/finite_permutation_groups.py
Hunk #1
Le dimanche 24 octobre 2010 à 08:07 -0700, Anne Schilling a écrit :
Hello Nicolas le Petit,
Thank you!
Now I have another question: I made added a new module
rigged_configurations and put the line
from rigged_configurations.all import *
in all.py in /combinat and an all.py file in the
Hello all,
I am trying to search a good name and a good syntax for a parent with
parameters. The parent is the integer vectors modulo the action of a
permutation group. It consists to enumerate integer vectors maximal in
their orbit for the lexicographic order under a permutation group.
Hello,
I put a message on the trac 8361...
I still work on the SearchForest feature (and rebase it because it no
longer worked with 4.5.2). But it is definitely right that an iterator
of IntergerVectors doesn't deserve to use the SearchForest engine
(SearchForest is only adapted for poor
From trac :
***
Hi Nicolas,
I'm currently using search forest and I run into some troubles... I also
want to suggest some improvements in the code:
please define method _repr_ (Sage way) rather than __repr__ (Python's
way).
when you need to
Hi William,
Le mardi 01 juin 2010 à 15:52 -0400, William Laffin a écrit :
I have a few general questions questions:
Are there plans for Uniform-cost, Depth-limited, iterative deepening,
and bidirectional(if applicable)?
How does one easily incorporate a bounding function? The comments of
Hello all!
I have a language question: which one of the following is the correct
name for the semiring of non-negative integers:
- NonNegativeIntegerSemiring
- NonNegativeIntegersSemiring
On IRC, Tim suggested :
(12:15:44) nborie: English Language question : we say Integer Ring,
not Integers
Hi Viviane,
There is so much different ways to do it... I discussed a while about
that with Nicolas and the better way to do this seems to implement a
'free' method for some categories.
Define a free group with some generators, a free monoid, a free
algebra... is a definitely a feature we will
Hi Franco,
I will be happy to participate to the coding sprints of Sage Days 20.5
from France. It will be very kind of you (and the other specialists of
coding sprints...) if you caught edit and maintain a wiki page about the
coding sprints organisation.
I don't mean something long. Just a list
Hi,
For IntegerRange(a, b, step):
{a, a+step, ..., ?} is nice... Evaluating the ? require a very small
computation.
In the same way, I find For IntegerRange(a, infinity, step)
{a, a+step, ..., ∞} is very nice too. ∞ is 236 of ascii code... (don't
know the possibility of using such symbol...)
{a,
Hello,
As often in algebraic combinatoric, I compute very very huge
FreeModule/VectorSpace... Let's me give some examples :
- I have a Matrix algebra (Hecke like) defined by a set of 5 matrices
of size factorial(5)*factorial(5) and I want to get a basis this
algebra as a VectorSpace over Q. For
Hello,
As often in algebraic combinatoric, I compute very very huge
FreeModule/VectorSpace... Let's me give some examples :
- I have a Matrix algebra (Hecke like) defined by a set of 5 matrices
of size factorial(5)*factorial(5) and I want to get a basis this
algebra as a VectorSpace over Q. For
Chevie is a very huge package...
-- from http://www.math.rwth-aachen.de/~CHEVIE/how-get.html:
It is now very easy to get the GAP part of CHEVIE - you only need to
install GAP, version 3.4.4, released in April 97 (see GAP for
details).
---
Yes, Chevie
57 matches
Mail list logo
