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 t
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 R
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 tree-lik
Checking the TestSuite 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 Bori
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 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 combinato
Le 19/07/2012 11:17, Simon King a écrit :
Hi!
On 2012-07-19, Dima Pasechnik 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 compact way
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 (plac
ng in my
code too hardly, that's still 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
0 s[] 0 0]
[ 0 0 0 0 s[] 0]
[ 0 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
****
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 relativ
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
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 ins
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:
Le 09/06/2015 06:50, Viviane Pons a écrit :
Hi everyone,
I'm doing this:
sage: FreeA. = 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 into two fa
16 matches
Mail list logo
