Unitriangular matrix group:UT(3,3): Difference between revisions
No edit summary |
No edit summary |
||
| Line 27: | Line 27: | ||
|- | |- | ||
| [[Fitting length]] || [[arithmetic function value::Fitting length;1|1]] || | | [[Fitting length]] || [[arithmetic function value::Fitting length;1|1]] || | ||
|- | |||
| [[derived length]] || [[arithmetic function value::derived length;2|2]] || | |||
|- | |||
| [[nilpotency class]] || [[arithmetic function value::nilpotency class;2|2]] || | |||
|- | |||
| [[minimum size of generating set]] || [[arithmetic function value::minimum size of generating set;2|2]] || | |||
|- | |||
| [[subgroup rank of a group|subgroup rank]] || [[arithmetic function value::subgroup rank of a group;2|2]] || | |||
|- | |||
| [[rank of a p-group|rank as p-group]] || [[arithmetic function value::rank of a p-group;2|2]] || | |||
|- | |||
| [[normal rank of a p-group|normal rank as p-group]] || [[arithmetic function value::normal rank of a p-group;2|2]] || | |||
|- | |||
| [[characteristic rank of a p-group|characteristic rank as p-group]] || [[arithmetic function value::characteristic rank of a p-group;1|1]] | |||
|} | |} | ||
Revision as of 01:06, 11 September 2009
This article is about a particular group, i.e., a group unique upto isomorphism. View specific information (such as linear representation theory, subgroup structure) about this group
View a complete list of particular groups (this is a very huge list!)[SHOW MORE]
Definition
This group is defined in the following equivalent ways:
- It is the unique (up to isomorphism) non-abelian group of order and exponent .
- It is the upper-triangular unipotent matrix group: the group of matrices over the field of three elements.
- It is the inner automorphism group of wreath product of groups of order p for .
- It is the Burnside group : the quotient of the free group of rank two by the subgroup generated by all cubes in the group.
Families
- Prime-cube order group:U(3,p): For an odd prime , this is the unique non-abelian group of order and exponent . It is the group of unipotent upper-triangular matrices over the field of three elements.
- Burnside groups: This group is . In general, the Burnside groups are all finite.
Arithmetic functions
| Function | Value | Explanation |
|---|---|---|
| order | 27 | |
| exponent | 3 | |
| Frattini length | 2 | |
| Fitting length | 1 | |
| derived length | 2 | |
| nilpotency class | 2 | |
| minimum size of generating set | 2 | |
| subgroup rank | 2 | |
| rank as p-group | 2 | |
| normal rank as p-group | 2 | |
| characteristic rank as p-group | 1 |
Group properties
| Property | Satisfied | Explanation |
|---|---|---|
| abelian group | No | |
| group of prime power order | Yes | |
| nilpotent group | Yes | prime power order implies nilpotent |
| solvable group | Yes | |
| extraspecial group | Yes | |
| Frattini-in-center group | Yes |
Other associated constructs
| Associated construct | Isomorphism class | Comment |
|---|---|---|
| Lazard Lie ring | upper-triangular nilpotent Lie ring:u(3,3) |
GAP implementation
Group ID
This finite group has order 27 and has ID 3 among the groups of order 27 in GAP's SmallGroup library. For context, there are groups of order 27. It can thus be defined using GAP's SmallGroup function as:
SmallGroup(27,3)
For instance, we can use the following assignment in GAP to create the group and name it :
gap> G := SmallGroup(27,3);
Conversely, to check whether a given group is in fact the group we want, we can use GAP's IdGroup function:
IdGroup(G) = [27,3]
or just do:
IdGroup(G)
to have GAP output the group ID, that we can then compare to what we want.