Posts : 95 Join date : 2009-09-15 Age : 57 Location : Alexandria

Subject: Combinatorial Groups Mon Dec 20, 2010 10:29 pm

I have tried to write an equivalent definition of a combinatorial group, inspired by the Burnside definition of a transitive group.

Burnside wrote:

133. Definition. A permutation-group is called transitive when, by means of its permutations, a given symbol a_{1} can be changed into every other symbol a_{2}, a_{3}, ..., a_{n} operated on by the group. When it has not this property, the group is called intransitive.

Here is what I got :

Equivalent definition Let H be a closed subset of n permutations of the symmetric group Sn that permutes the symbols a_{1},......, a_{n}. H is called combinatorial group if H is transitive, i.e, by means of its permutations, a given symbol a_{1} can be changed into every other symbol a_{1}, a_{2}, a_{3}, ..., a_{n} operated by H.

Example :

====

The next piece that I need to explain why GroupeCombinatoire' = Lin is the Big Bijection Theory.

To understand the Big Bijection Theory one must understand the Relativity Theory.

Mainly, the Relativity Theory says that the time flows with the same speed all over*, and, yes, we can synchronize clocks for two events to be linearly compared, even that a direct link cause-effect is not possible to establish between them.

Thus, every box/slot/cube/ball/label ever produced has two simultaneous attributes :

- a unique ID number (a name) - a unique time-stamp, that can be always compared, by the theory of relativity, with others time-stamps.

The Big Bijection Theory sustains that there is an Unique Original Bijection between the IDs of objects and their time-stamps.

Thus, a named-slots structure is the very same combinatorial thing with a linear order structure.

----------------- * excepting, for academic rigor, accelerated environments such as roller coasters or discos.

Posts : 95 Join date : 2009-09-15 Age : 57 Location : Alexandria

Subject: Re: Combinatorial Groups Tue Dec 21, 2010 1:23 pm

Dig Da Link, bros, Dig Da Link !

======================= Look here.

There are people that are studying 4D synthetic geometry. One day, someone will write a computer program that will train the user to develop his 4D intuition. Some stunt man will wire himself to the computer, and he will obtain the 4D intuition.

I think that these kind of intuition's experiments must come in a natural manner. If I will ever understand a combinatorial identity like

a Normal Subgroup = a Group ( a Group)

or whatever is a group labeled with another group, this must come naturally, like the snow in a beautiful winter as this one.

Subject: Re: Combinatorial Groups Thu Dec 23, 2010 1:35 am

you know,

this natural generalization of Cardinal Numbers and Ordinal Numbers exists only in your imagination, like all Math in the world. Math does not exists in books, but in the heads of people that claim them selves mathematicians.

Until another claim, you should use "Nick of Longueuil" to point who did this generalization.

Subject: Re: Combinatorial Groups Fri Dec 24, 2010 11:03 am

After you point a node in a graph, you get a set of neighbors, After you point a node in a group, you get a lin of neighbors, After you point a node in a cube, you a cyc of neighbors, and After you point a node in a function, you get an X of neighbors. ============== Let's stick on subject :

When labeling, you have one special element and four choices for the first label. To label the rest, is to label { i, j, k, ijk, jik, ikj, kiji, kji, jki } that is an Ens3.

Subject: Re: Combinatorial Groups Fri Dec 24, 2010 8:28 pm

nick wrote:

the Big Bijection Theory. Thus, every box/slot/cube/ball/label ever produced has two simultaneous attributes : - a unique ID number (a name) - a unique time-stamp, that can be always compared, by the theory of relativity, with others time-stamps.

The only solution I see is to develop the Big Bijection Theory.

Thus, every abstract group has two attributes :

- a Burnside group ( primitive of some lin ) - a Cayley group ( or Cayley table )

After pinning a special point, another point becomes very special. The remaining liberty of moving (relabeling) is described by - either a Cyc_{4}(X^{6}) - either a Cyc_{3}(X^{8}) - or a Cyc_{2}(X^{12}) (no coefficients are needed), where aCyc(aLin) expresses the solidity. The e.g.f. is x(1/4+1/3+1/2)x^24 hence you have 13/12.25! = 26!/24 distinct labellings (with 26 distinct labels)

---- So, after pinning a point in aField, everybody will believe that the pinned point is 0, and the remaining liberty is aCyc one...

Who's next ? do you have an example of endo-species aSpecies that has no primitive ?

Subject: Re: Combinatorial Groups Wed Dec 29, 2010 7:37 pm

Doc is right, Nick.

powerset (A), A×A, A^{A}are in the same situation.

The secret of trees is that those nodes have a very small amount of structure around them; the trees are the most "naked" structures among others.

A tree acting on its nodes is equal to the tree of edges (with concatenation). They are very complex and simultaneously exposed structure, hence their generosity as species.

Posts : 95 Join date : 2009-09-15 Age : 57 Location : Alexandria

Subject: Re: Combinatorial Groups Wed Dec 29, 2010 11:23 pm

Yep. To integrate a field, one must add a point (namely infinity) and consider the Möbius transformations - that form a sharply triple transitive group.

Möbius Fields -----> Affine Fields -----> Cycs, Groups ----- >Lins That's the way aha aha !

Fellows, my inquiry comes to its end... as doctor said, we can not find new things about boolean algebras using the four basic operations of species (of numbers).

When passing to species we loose axioms, constants, relations, operations: plenty of useful things that make math. Nevertheless, an object caught in a simple combinatorial equation must be a fundamental math object that deserves to be studied.

Posts : 95 Join date : 2009-09-15 Age : 57 Location : Alexandria

Subject: Re: Combinatorial Groups Sun Jan 02, 2011 3:08 pm

Again good news ! I have found new tables of species.

It is no more about derivation, but is about disintegration ! Probably, the word "derivation" was used to help the student to remember what he has to do when passing to e.g.f.

A Möbius Fielddisintegrates into an Affine Field that disintegrates into a Cyclic Group that disintegrates into a Lin.

http://home.wlu.edu/~dresdeng/smallrings/ Other good news is that there are intermediary objects between groups and fields, that could be rings. They are more than sharply transitive and less that sharply double transitive.

Again, let's take C_{7}, P_{7}, C_{7}/Z_{3 }and P_{7}/Z_{3}from tables.

meaning respectively group (Z_{7}) , some ring, some ring, and field (F_{7})

One can see those species as linear transformations a.x+b over Z_{7}, where

- a belongs to {1} - a belongs to {1, 6} - a belongs to {1, 2, 4} or - a belongs to {1, 2, 3, 4, 5, 6} respectively.

Posts : 95 Join date : 2009-09-15 Age : 57 Location : Alexandria

Subject: Re: Combinatorial Groups Tue Jan 04, 2011 10:18 am

And here is the new inquiry.

Once accepted the identity-free representation of a permutation group (a closed subset of permutations), e.g. the Diamond {12abc, 12bca, 12cab, 21bac, 21cba, 21acb} has order 6 and degree 5,

also written as a rectangle 12abc 12bca 12cab 21bac 21cba 21acb that works since anyone of these xyztu may be appointed as identity,

the four basic operations with species become :

Sum : Means just to put nearby two rectangles,

Product : - the new degree is the sum of the degrees - the lines of the new rectangle are the all concatenations of the lines of the two tables

Disintegration : Means to reduce the degree with one and to clean up the messed rectangle(s) new degree = degree - 1 new order' = order/degree

Composition : It is the wreath product Means to substitute the symbols in the first rectangle with lines and copies of lines of the second rectangle. new degree = degree1×degree2 new order = order1×(order2)^degree1

Hall (1959) describes the composition (wreath product).

Subject: Re: Combinatorial Groups Tue Jan 04, 2011 6:31 pm

Ok.

so, a species is no more some clouds or traines des nuages in the blue sky that suffers magical interferences with other clouds, but is a permutation group (or a series of).

Let's call this group a ground group.

Nick, will you explain :

- why the ground group of a group G is the group acting on itself and not Aut(G) - why the ground group of a field F is not (F,+), not (F, ×) but (F, ax+b)

etc etc. Does a math structure has a unique ground group and how do you obtain it ?