Items tagged with group group Tagged Items Feed

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 to last link in particular includes 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?


i understand quotient group is

G/(normal subgroup)

= G composite with inverse permutation group of normal subrgoup

is this understanding correct?

If do not have subgroup or normal subgroup, how to do quotient group?


if i shift second row many times in order to find Subgroup satisfy G*Subgroup = Subgroup*G

after find Subgroup then test


inverse(g)*Subgroup*g = Subgroup


how to test whether inverse(g)*Subgroup*g belong to Subgroup?

or just use equal in inverse(g)*Subgroup*g = Subgroup?

a*b - b*a    where a , b are permutation group

how to minus this?

if a + b , then how to plus permutation group

assume the word equation is

a_i *a_j - a_j *a_i = 0

how to find which permutation group is a_i and a_j

my understanding is to try all rotations

a book use underscript i and j

can i see them as upper script for i rotations which is shift i times to left for second row

and try all combination and composite them in two for loop? 

Greetings to all.

This past year I have on occasion shared mathematical adventures with cycle index computations and Maple, e.g. at these links:

Befitting the season I am sending another post to continue this series of cycle index computations. I present two Maple implementations of Power Group Enumeration as described by Harary and Palmer in their book "Graphical Enumeration" and by Fripertinger in his paper "Enumeration in Musical Theory." It was a real joy working with Maple to implement the computational aspects of their work, i.e. the Power Group Enumeration Theorem. Moreover the resulting software is easy to read, simple and powerful and has a straightforward interface, taking advantage of many different capabilities present in Maple.

The problem I am treating is readily described. Consider a cube in 3 space and its symmetries under rotation, i.e. rigid motions. We ask in how many different ways we may color the edges of the cube with at most N colors where all colors are completely interchangable, i.e. have the symmetric group acting on them in addition to the edge permutation group of the cube. At the following Math Stackexchange Link  I have posted the Maple code to implement the algorithms / formulas of Harary / Palmer / Fripertinger to solve this problem. The reader is invited to study and test these algorithms. It seems to me an excellent instance of computational combinatorics fun.

To conclude I would like to point out that these algorithms might be candidates for a Polya Enumeration Theorem (PET) package that I have been suggesting for a future Maple release at the above posts, the algorithms being of remarkable simplicity while at the same time providing surprisingly sophisticated combinatorics and enumeration methods.

Season's greetings!

Marko Riedel

1 2 Page 1 of 2