# Unitriangular matrix group of degree three over quotient of polynomial ring over F2 by square of indeterminate

View a complete list of particular groups (this is a very huge list!)[SHOW MORE]

## Definition

### As a matrix group

This group is defined as the unitriangular matrix group of degree three over the ring $\mathbb{F}_2[t]/(t^2)$. Explicitly, it is the group (under matrix multiplication) of upper-triangular $3 \times 3$ unipotent matrices over the ring $\mathbb{F}_2[t]/(t^2)$, i.e., matrices of the form: $\left\{ \begin{pmatrix} 1 & a_{12} & a_{13} \\ 0 & 1 & a_{23} \\ 0 & 0 & 1 \\\end{pmatrix} : a_{12}, a_{13}, a_{23} \in \mathbb{F}_2[t]/(t^2)\right\}$

## Arithmetic functions

Want to compare and contrast arithmetic function values with other groups of the same order? Check out groups of order 64#Arithmetic functions

### Basic arithmetic functions

Function Value Similar groups Explanation
underlying prime of p-group 2
order (number of elements, equivalently, cardinality or size of underlying set) 64 groups with same order As $UT(n,R), n = 3, |R| = 4$: $|R|^{n(n-1)/2} = 4^{3(2)/2} = 4^3 = 64$
prime-base logarithm of order 6 groups with same prime-base logarithm of order
max-length of a group 6 max-length of a group equals prime-base logarithm of order for group of prime power order
chief length 6 chief length equals prime-base logarithm of order for group of prime power order
composition length 6 composition length equals prime-base logarithm of order for group of prime power order
exponent of a group 4 groups with same order and exponent of a group | groups with same exponent of a group
prime-base logarithm of exponent 2 groups with same order and prime-base logarithm of exponent | groups with same prime-base logarithm of order and prime-base logarithm of exponent | groups with same prime-base logarithm of exponent
nilpotency class 2 groups with same order and nilpotency class | groups with same prime-base logarithm of order and nilpotency class | groups with same nilpotency class As $UT(n,R)$ for $R$ commutative: $n - 1 = 3 - 1 = 2$
derived length 2 groups with same order and derived length | groups with same prime-base logarithm of order and derived length | groups with same derived length As $UT(n,R)$ for $R$ commutative: smallest integer greater than or equal to $\log_2n$
Frattini length 2 groups with same order and Frattini length | groups with same prime-base logarithm of order and Frattini length | groups with same Frattini length
minimum size of generating set 4 groups with same order and minimum size of generating set | groups with same prime-base logarithm of order and minimum size of generating set | groups with same minimum size of generating set
rank of a p-group 4 groups with same order and rank of a p-group | groups with same prime-base logarithm of order and rank of a p-group | groups with same rank of a p-group
normal rank of a p-group 4 groups with same order and normal rank of a p-group | groups with same prime-base logarithm of order and normal rank of a p-group | groups with same normal rank of a p-group

## GAP implementation

### Group ID

This finite group has order 64 and has ID 215 among the groups of order 64 in GAP's SmallGroup library. For context, there are groups of order 64. It can thus be defined using GAP's SmallGroup function as:

SmallGroup(64,215)

For instance, we can use the following assignment in GAP to create the group and name it $G$:

gap> G := SmallGroup(64,215);

Conversely, to check whether a given group $G$ is in fact the group we want, we can use GAP's IdGroup function:

IdGroup(G) = [64,215]

or just do:

IdGroup(G)

to have GAP output the group ID, that we can then compare to what we want.