Items tagged with symmetric


Using convert(f,elsymfun) when f is a symmetric polynomial will write it in terms of elementary symmetric polynomials. For example, x^2+y^2 would become (x+y)^2-2x*y. For this command not to return an error, f must be symmetric, equivalently of type symmfunc(all indeterminants in expression).

I'd like to use this in a broader sense, when there are extra variables hanging around. For example, suppose f is a polynomial in a,b,c,x,y,z, and symmetric in x,y,z, so that type(f,symmfunc(x,y,z)) returns true. Then it is still possible to write this in terms of the elementary symmetric polynomials on x,y,z (with coefficients taken being rational polynomials in a,b,c).

For example, a+x^2+y^2 can be written as a+(x+y)^2-2x*y.

Is there a command available for this? Or is there a roundabout way to make Maple forget temporarily that a,b,c are indeterminants, before putting them back in after?


In my study, I often need to verify that two operator is symmetric i.e. [P,Q]=PQ-QP=0, where A and D are operator polynomial such like  D2+4u+uxD-1 multiply with D3+uD+ux,where D is differential operator.

I tried to use the Ore_package which can easily deal with the operator polynomial without integral(i.e. D-1 term), so in my case , how to deal with operator with both differential and integral?


I am comptuing the eigenvalues and the characteristic polynomial of a 8 by 8 symmetric matrix, say M. Thus, we define the matrix M, and compute its charast. plynm. by



and its eigenvalues with the command



Well, Maple returns the charast. polynm. an dthe eigenvalues. But, if we compute p(E[k]), for k=1,...,8, thats is, the values of the polynomial p(x) in the eingenvalues, Maple not turns cero!!! I'm really confused ... anyone know what could be happening?


Maple attached file with this example. Thank very much for your help!!



Dear friends,

some time ago I shared a story here on the use of Maple to compute the cycle index of the induced action on the edges of an ordinary graph of the symmetric group permuting the vertices and the use of the Polya Enumeration Theorem to count non-isomorphic graphs by the number of edges. It can be found at the following Mapleprimes link.

I am writing today to alert you to another simple Maple program that is closely related and demonstrates Maple's capability to implement concepts from group theory and Polya enumeration. This link at shows how to use the cycle index of the induced action by the symmetric group permuting vertices on the edges of a multigraph that includes loops to count set partitions of multisets containing two instances of n distinct types of items. The sequence that corresponds to these set partitions is OEIS A020555 where it is pointed out that we can equivalently count multigraphs with n labeled i.e. distinct edges where the vertices of the graph represent the multisets of the multiset partition and are connected by an edge k if the two instances of the value k are included in the sets represented by the two vertices that constitute the edge. The problem then reduces to a simple substitution into the aforementioned cycle index of a polynomial representing the set of labels on an edge including no labels on an edge that is not included.

This computation presents a remarkable simplicity while also implementing a non-trivial application of Polya counting. It is hoped that MaplePrimes users will enjoy reading this program, possibly profit from some of the techniques employed and be motivated to use Maple in their work on combinatorics problems.

Best regards,

Marko Riedel

I have a problem with IsMatrixShape. I have in my part of formulation this matrix expression: QTIbQ

While Ib is a symmetric matrix, this matrix expression is clearly symmetric. However, when I try to check this issue with IsMatrixShape command, it returns false. I am extremely confused. Can anyone help me? Thanks in advance.

Hello every one.

I want to do some tensor computations in maple in a specified coordinate system but I don't know how! As an example I ask the follwing question.

Consider a second order symmetric tensor "A". I want to compute the components of "curl(curl(A))" in cylinderical coordinates. How should I do this in maple?

This is related to a famous equation in elasticity known as "small strain compatibility" equation.

Thanks for the help

Dear all;

nice to speak with you.

complete a table randomly by positive three-digit numbers and display only the symmetrical numbers.



Greetings to all.

It is a new year (for some time now) and I am writing to indicate that the mathematical adventures with cycle index computations and Maple continue!

Here are the previous installments:

My purpose this time is to alert readers who might be interested to a new cycle index computation that is neither an application of the classical form of the Polya Enumeration Theorem (PET) nor of Power Group Enumeration. The former counts objects being distributed into slots with a group acting on the slots and the latter objects going into slots with a second group which permutes the objects in addition to the slots being permuted. What I am about to present treats a third possible case: when the slot permutation group and the object permutation group are one and the same and act simultaneously (not exactly the same but induced by the action of a single group).

This requires quite radical proceedings in the etymological sense of the word, which is to go back to the roots of a problem. It seems that after working with the PET sooner or later one is confronted with enumeration problems that demand the original unmitigated power of Burnside's lemma, sometimes called the lemma that is not Burnside's. This is the case with the following problem. Suppose you have an N-by-N matrix whose entries are values from 1 to N, with all assignments allowed and the symmetric group on N elements acts on the row and column indices permuting rows and columns as well as the entries simultaneously. We ask how many such matrices there are taking these double symmetries into account. This also counts the number of closed binary operations on a set of N elemnents and there is a discussion as well as the Maple code (quite simple in my opinion and no more than a few lines) that solves this problem at the following Math Stackexchange link, which uses Lovasz Formula for the cycle index of the symmetric group which some readers may remember.

In continuing the saga of Polya and Burnside exploration I have often reflected on how best to encapsulate these techniques in a Maple package. With this latest installment it would appear that a command to do Burnside enumeration probably ought to be part of such a package.

Best regards,

Marko Riedel

I was working with the computation of the eigenvectors of a 3X3 symmetric matrix with algebraic entries and Maple 17 doesn´t give me an answer after a long time, even with CUDA activated. You can see this by the commands below:


I am working over F_p, where p is prime. When p = 2, the number of 2x2x2 arrays (aka hypermatrices or tensors) over this field is 2^(2*2*2) = 256. Of those 256 arrays, I only want the symmetric ones: that is, if x_{ijk} is the ijk-th element of the array X, then x_{ijk} = x_{ikj} = x_{jik} = x_{jki} = x_{kij} = x_{kji}. Is there a quick loop that does this? 

Page 1 of 1