Items tagged with group group Tagged Items Feed

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

f := x^2*(y/x+sqrt(-7*y^2/x^2))/(y^2*(x/y+sqrt(-7*x^2/y^2)));
v := parametrization(f, x, y, t);

it can not parametrize.

i do not know which book teach group theory and algebraic curve

can we call this algebraic curve over finite field ?


how to represent a function as an algebraic curve equation for parametrization?


which group do four differential electromagnetism belong to in library available in gap system? 

what is the order of the group?

do maple 17 have this group? how to show?

Another worksheet dilemma  I am having with Maple.

I have number of "execution groups", like this, I created using CTRL-J

Now I wanted to put these in a section, so it becomes like this: (I had to make new worksheet now)

Since I did not know how put existing groups inside a new section I wanted to create (the section always comes at different level that does not include the groups), I thought I can create the section first, then go copy the groups and paste them to the new section.

The problem is how does one actually select multiple execution groups for the purpose of copying them?  The obvious way is to use the mouse, and select all groups with the mouse.

Well, this a big problem, since my groups are so large, I can spend 5-10 minutes scrolling down, very slowly to select them. my hand gets tired and I get tired doing this. I also one time got an error from Maple, saying selection too large, and something about rtf memory error or something. This is after wasting 10 minutes scrolling down carefully to select over 10,000 lines that is one large list.

In Mathematica, I can simply select a cell, no matter how large (an execution group in Maple talk) by just clicking on the edge of the cell.  I can select multiple cells the same way (hold, click on the edge of all). Very easy. I do not have to scroll down to select the content as I do with Maple

But here, with Maple, I put the mouse of the left edge, and can't select the group. Nothing happens. So I have to actually scroll down. I do not see the point of having a left [ edge to a group if one can't use it to select the group?

So my question is: How to select one or more execution groups without scrolling the mouse over all the content?


1. is module in algebraic geometry for classification of topological space which a poset is a frame

2. which invariant is for doing this classification of topological space in algebraic geometry or group cohomology?

3. if want to do full combination before classification, which kind of polynomials be a full combination

4. is poset just like function fst and snd function for meet and join in functional programming instead of using "and" and "or" logic? how a matrix group related with topological space which a poset is a frame?

5. is there any invariant function for classification of topological space in maple?

It is possible to add groups of questions to an assignment in Maple T.A. But how do you see the grades divided into these groups? As an example, suppose we have two groups of questions say 5 questions in the group "algebra" and 5 questions in the group "geometry". The class grades show the grades for all 10 questions all together, but I would like to see the grades for two groups individually.



Greetings to all.

As some of you may remember I have posted several announcements concerning Power Group Enumeration and the Polya Enumeration Theorem this past year, e.g. at this MaplePrimes link: Power Group Enumeration.

I have continued to work in this field and for those of you who have followed the earlier threads I would like to present some links to my more recent work using the Burnside lemma. Of course all of these are programmed in Maple and include the Maple code and it is with the demonstration of Maple's group theory capabilities in mind that I present them to you (math.stackexchange links).

The third and fourth to last link in particular include advanced Maple code.

With my best wishes for happy group theory computing with Maple,


Marko Riedel

Does there exist a Frobenius Group which is not  neither a Dihedralgroup nor  Symm(3) ?


Best regards


Kurt Ewald

which theory can explain the interaction of composition of group for combination of composition of group

if succeed to search a list of groups, what is the next step research them?


I would like to compute the elements of the permutation group, let us say S10 or S20.

Is there any method to compute all the elements.

And can we make a list of the tranposition and cycles.

Many thinks.


for example

a*b v a^-1 = b

i guess Disj or Conj are Max or Min respectively

however i do not know how to max(a,b) where a and b are permutation group

reference from L group in


if can not calculate this, do not know how to determine whether equal in a*b v a^-1 = b

1.which rules or theorems can guide to generate relations for words in group theory?

2.Is topological method such as complexes the direction to answer Question 1?

How to do composition for finite group?

is the composition like permutation group ?

if express finite group like permutation group,

if so, can elements in first row duplicate? can the second row duplicate?

however, do not know how to map when there are more than or equal two choices

my guess is that

if finite group can be expressed into permutation group

for example 3*3 matrx, each column is a permutation group

then there will be 3 permutation groups, when do composition , first column's permutation group composite with first column's permutation group , second composite with second etc

is it right?

1 2 Page 1 of 2