%\documentclass[12pt,draft]{amsart}
%\documentclass[draft]{amsart}
\documentclass{amsart}
\usepackage{amsmath,amssymb,amsthm,bm,bbm}
\usepackage{graphicx,enumerate}
\usepackage{layout}
\usepackage{longtable}
\usepackage[all,cmtip]{xy}

\setlength{\topmargin}{-50pt}
\setlength{\oddsidemargin}{-20pt}
\setlength{\evensidemargin}{-20pt}
\setlength{\textwidth}{490pt}
\setlength{\textheight}{725pt}
%\setlength{\textheight}{730pt}

\theoremstyle{plain}
\newtheorem{theorem}{Theorem}[section]
\newtheorem*{theorem-nn}{Theorem}
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem*{proposition-nn}{Proposition}
\newtheorem{corollary}[theorem]{Corollary}
\newtheorem*{problem}{Problem}

\theoremstyle{definition}
\newtheorem{definition}[theorem]{Definition}
\newtheorem{defn}[theorem]{Definition}
\newtheorem{example}[theorem]{Example}
\newtheorem{remark}[theorem]{Remark}
\newtheorem*{acknowledgments}{Acknowledgments}
\newtheorem*{acknowledgment}{Acknowledgment}

\theoremstyle{remark}

\newcommand{\si}{\sigma}\newcommand{\ta}{\tau}\newcommand{\la}{\lambda}
\newcommand{\al}{\alpha}\newcommand{\be}{\beta}\newcommand{\ga}{\gamma}
\newcommand{\om}{\omega}
\newcommand{\bZ}{\mathbbm{Z}}\newcommand{\bQ}{\mathbbm{Q}}
\newcommand{\bC}{\mathbbm{C}}\newcommand{\bG}{\mathbbm{G}}
\newcommand{\bN}{\mathbbm{N}}\newcommand{\bF}{\mathbbm{F}}
\newcommand{\bR}{\mathbbm{R}}
\newcommand{\GL}{{\rm GL}}\newcommand{\SL}{{\rm SL}}
\newcounter{sub}\def\tr{\mbox{tr }}
\newenvironment{sub}%
{\begin{list}{(\arabic{sub})}{\usecounter{sub}%
\setlength{\leftmargin}{2em}}}{\end{list}}

%------------------------ 自設?EO
\def\fn#1{\operatorname{#1}} % function work like \sin
\def\op#1{\operatorname*{#1}} % operator work like \dim
\def\bm#1{\mathbbm{#1}}
\def\c#1{\mathcal{#1}}
\def\ul#1{\mathop{\underline{#1}}}
\def\ol#1{\mathop{\overline{#1}}}
\def\side#1#2{\mathop{^{#1}\mkern-1.5mu#2}}
\def\q{\quad\;}  % 在 align 環境留白?E舋斥?ex: &\q x+y \\  &= a+b

%%%%%%%%%%%%%%%%%%%%%%%%%%

\def\ch{\mbox{\rm char }}
\def\image{\mbox{Im }}
\def\ker{\mbox{Ker }}
\def\id{\mbox{id}}
\def\rank{\mbox{rank }}
\def\Hom{\mbox{Hom}}

\renewcommand{\baselinestretch}{1.1}

%%\numberwithin{equation}{section}
%%\addtocounter{section}{-1}

\title{Multiplicative Invariant Fields of Dimension $\le 6$}

\author[A. Hoshi]{Akinari Hoshi}
\address{Department of Mathematics, Niigata University, Niigata 950-2181,
Japan}
\email{hoshi@math.sc.niigata-u.ac.jp}

\author[M. Kang]{Ming-chang Kang}
\address{Department of Mathematics, National Taiwan University, Taipei, Taiwan}
\email{kang@math.ntu.edu.tw}

\author[A. Yamasaki]{Aiichi Yamasaki}
\address{Department of Mathematics, Kyoto University, Kyoto 606-8501, Japan}
\email{aiichi.yamasaki@gmail.com}

%\date{\today}
\thanks{{\it Key words and phrases.} Rationality problems,
Noether's problem, crystallographic groups, integral representations,
unramified Brauer groups, algebraic tori.\\
This work was partially supported by JSPS KAKENHI Grant Numbers
24540019, 25400027, 16K05059.
Parts of the work were finished when the
first-named author and the third-named author were visiting the
National Center for Theoretic Sciences (Taipei), whose
support is gratefully acknowledged.}

\subjclass[2010]{Primary 14E08, 20C10, 14F22, 20J06.}
%%11-XX:Number theory
%%11Exx:Forms and linear algebraic groups
%%11E72 Galois cohomology of linear algebraic groups
%%12-XX:Field theory and polynomials
%%12Fxx:Field extensions
%%12F20 Transcendental extensions
%%13-XX:Commutative algebra
%%13Axx:General commutative ring theory
%%13A50 Actions of groups on commutative rings; invariant theory
%%14-XX:Algebraic geometry
%%14Exx:Birational Geometry
%%14E08 Rationality questions
%%20-XX Group theory and generalizations
%%20Cxx Representation theory of groups
%%20C10 Integral representations of finite groups
%%20Gxx:Group theory and generalizations
%%20G15 Linear algebraic groups over arbitrary fields


%%%%%%    TEXT START    %%%%%%

\begin{document}
%
\begin{abstract}
The finite subgroups of $GL_4(\bm{Z})$ are classified up to conjugation in \cite{BBNWZ}; in particular, there exist $710$ non-conjugate finite groups in $GL_4(\bm{Z})$. Each finite group $G$ of $GL_4(\bm{Z})$ acts naturally on $\bm{Z}^{\oplus 4}$; thus we get a faithful $G$-lattice $M$ with ${\rm rank}_\bm{Z} M=4$. In this way, there are exactly $710$ such lattices. Given a $G$-lattice $M$ with ${\rm rank}_\bm{Z} M=4$,
the group $G$ acts on the rational function field $\bm{C}(M):=\bm{C}(x_1,x_2,x_3,x_4)$
by multiplicative actions, i.e. purely monomial automorphisms over $\bm{C}$. We are concerned with the rationality problem of the fixed field $\bm{C}(M)^G$. A tool of our investigation is the unramified Brauer group of the field $\bm{C}(M)^G$ over $\bm{C}$. It is known that, if the unramified Brauer group, denoted by  ${\rm Br}_u(\bm{C}(M)^G)$, is non-trivial, then
the fixed field $\bm{C}(M)^G$ is not rational (= purely transcendental) over $\bm{C}$. A formula of the unramified Brauer group ${\rm Br}_u(\bm{C}(M)^G)$ for the multiplicative invariant field was found by Saltman in 1990. However, to calculate ${\rm Br}_u(\bm{C}(M)^G)$ for a specific multiplicatively invariant field requires additional efforts, even when the lattice $M$ is of rank equal to $4$. There is a direct decomposition ${\rm Br}_u(\bm{C}(M)^G)= B_0(G) \oplus H^2_u(G,M)$ where $H^2_u(G,M)$ is some subgroup of $H^2(G,M)$. The first summand $B_0(G)$, which is related to the faithful linear representations of $G$, has been investigated by many authors. But the second summand $H^2_u(G,M)$ doesn't receive much attention except when the rank is $\le 3$. Theorem 1. Among the $710$ finite groups $G$, let $M$ be the associated faithful
$G$-lattice with ${\rm rank}_\bm{Z} M=4$,
there exist precisely $5$ lattices $M$ with ${\rm Br}_u(\bm{C}(M)^G)\neq 0$.
In these situations, $B_0(G)=0$ and thus ${\rm Br}_u(\bm{C}(M)^G)\subset H^2(G,M)$. The {\rm GAP IDs} of the five groups $G$ are
{\rm (4,12,4,12), (4,32,1,2), (4,32,3,2), (4,33,3,1), (4,33,6,1)}
in {\rm \cite{BBNWZ}} and in {\rm \cite{GAP}}.
Theorem 2. There exist $6079$ finite subgroups $G$ in $GL_5(\bm{Z})$. Let $M$ be the lattice with rank $5$ associated to each group $G$. Among these lattices precisely $46$ of them satisfy the condition ${\rm Br}_u(\bm{C}(M)^G)\neq 0$. The {\rm GAP IDs} (actually the {\rm CARAT IDs}) of the corresponding groups $G$ may be determined explicitly. A similar result for lattices of rank $6$ is found also. Motivated by these results, we construct $G$-lattices $M$ of rank $2n+2, 4n, p(p-1)$ ($n$ is any positive integer and $p$ is any odd prime number) satisfying that $B_0(G)=0$ and $H^2_u(G,M)\neq 0$; and therefore $\bm{C}(M)^G$ are not rational over
$\bm{C}$.
\end{abstract}
%

\maketitle

\tableofcontents

%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\section{Introduction}\label{seInt}
%

Let $k$ be a field, $G$ be a finite group and
$\rho : G\rightarrow GL(V)$ be a faithful representation of $G$ where $V$ is a finite-dimensional vector space over $k$.
Then $G$ acts on the rational function field $k(V)$.
Noether's problem asks whether the fixed field $k(V)^G$ is rational
(= purely transcendental) over $k$ \cite[Sa2]{Sw}.

In order to solve the rationality problem of $k(V)^G$, it is natural and almost inevitable that we reduce the problem to that of the multiplicative invariant field $k(M)^G$ defined in Definition \ref{d1.2}; an illustration of reducing Noether's problem to the multiplicative invariant field can be found, for example, in \cite{CHKK}. When $M$ is a $G$-lattice with ${\rm rank}_\bm{Z} M=n$, the multiplicative invariant field $k(M)^G$ is nothing but $k(x_1,\ldots, x_n)^G$, the fixed field of the rational function field $k(x_1,\ldots, x_n)$ on which $G$ acts by multiplicative actions. The purpose of this article is to study the multiplicative invariant fields $k(M)^G$ where $M$ is a $G$-lattice with ${\rm rank}_\bm{Z} M=n \le 6$. In Theorem \ref{thHaj87} and Theorem \ref{thHKHR} we will review the known results for the rationality problem of the multiplicative invariant fields up to dimension $3$; see Theorem \ref{th116} for some partial result of dimension $4$.


\begin{defn}\label{d1.1}
Let $G$ be a finite group and $\bm{Z}[G]$ be the group ring.
A finitely generated $\bm{Z}[G]$-module $M$ is called a {\it $G$-lattice} if,
as an abelian group, $M$ is a free abelian group of finite rank.
We will write ${\rm rank}_\bm{Z} M$ for the rank of $M$ as a free
abelian group.
A $G$-lattice $M$ is called {\it faithful} if, for any
$\sigma\in G\setminus\{1\}$, $\sigma\cdot x\neq x$ for some $x\in M$.

Suppose that $G$ is any finite group and $\Phi : G\rightarrow GL_n(\bm{Z})$ is a group homomorphism, i.e. an integral representation of $G$. Then the group $\Phi(G)$ acts naturally on the free abelian group $M:=\bm{Z}^{\oplus n}$; thus $M$ becomes a $\bm{Z}[G]$-module. We call $M$ the $G$-lattice associated to $\Phi$ (or $\Phi(G)$). Conversely, if $M$ is a $G$-lattice with ${\rm rank}_\bm{Z} M=n$, write $M=\oplus_{1\leq i\leq n}\bm{Z}\cdot x_i$.
Then there is a group homomorphism
$\Phi : G\rightarrow GL_n(\bm{Z})$ defined as follows: If
$\sigma\cdot x_i=\sum_{1\leq j\leq n}a_{ij}\,x_j$
where $\sigma\in G$ and $a_{ij}\in\bm{Z}$,
define $\Phi(\sigma)=(a_{ij})_{1\leq i,j\leq n}\in GL_n(\bm{Z})$.

When the group homomorphism $\Phi : G\rightarrow GL_n(\bm{Z})$ is injective, the corresponding $G$-lattice is a faithful $G$-lattice. For examples, any finite subgroup $G$ of $GL_n(\bm{Z})$ gives rise to
a faithful $G$-lattice of rank $n$.

The list of all the finite subgroups of $GL_n(\bm{Z})$ (with $n \le 4$), up to conjugation, can be found in the book \cite{BBNWZ} and in GAP. As to the situations of $GL_n(\bm{Z})$ (with $n \ge 5$), Plesken etc. found the lists of all the finite subgroups of $GL_n(\bm{Z})$ (with $n =5$ and $6$); see \cite{PS} and the references therein. These lists may be found in the GAP package
CARAT \cite{CARAT} and also in \cite[Chapter 3]{HY}.

Here is a list of the total number of lattices,
up to isomorphism, of a given rank:\\
\begin{center}
\begin{tabular}{c|r}
rank & number of the lattices\\\hline
$1$ & $2$\\
$2$ & $13$\\
$3$ & $73$\\
$4$ & $710$\\
$5$ & $6079$\\
$6$ & $85308$
\end{tabular}
~\\~\\
\end{center}
\end{defn}

\begin{defn}\label{d1.2}
Let $M$ be a $G$-lattice of rank $n$ and write
$M=\oplus_{1\leq i\leq n}\bm{Z}\cdot x_i$.
For any field $k$, define $k(M)=k(x_1,x_2,\ldots,x_n)$
the rational function field of $n$ variables over $k$.
Define a {\it multiplicative action} of $G$ on $k(M)$ : For any $\sigma\in G$,
if $\sigma\cdot x_i=\sum_{1\leq j\leq n}a_{ij}\,x_j$ in the $G$-lattice $M$,
then we define $\sigma\cdot x_i=\prod_{1\leq j\leq n}x_j^{a_{ij}}$
in the field $k(M)$.
Note that $G$ acts trivially on $k$.
The above multiplicative action is called a {\it purely monomial action} of $G$
on $k(M)$ in \cite{HK1}; elements in the fixed field
$k(M)^G=\{u\in k(M) : \sigma\cdot u=u\ {\rm for\ any}\ \sigma\in G\}$
is called a {\it multiplicative field invariant} in \cite{Sa3}.
%%%

In case $M$ is the $G$-lattice $\bm{Z}[G]$ where $M=\oplus_{g \in G} \bm{Z} \cdot x_g$ and $h \cdot x_g=x_{hg}$ for $h, g \in G$, then $k(M)=k(x_g : g \in G)$. In this situation we simply write the fixed field $k(M)^G$ as $k(G)$. Note that $k(G)= k(V_{\rm reg})^G$ where $G \rightarrow GL(V_{\rm reg})$ is the regular representation of $G$ over $k$.

By the no-name lemma, it is known that $k(G)$ is stably rational over $k$ if and only if so is $k(V)^G$ where $\rho : G\rightarrow GL(V)$ is any faithful representation of $G$ over $k$ (see the proof of \cite[Proposition 2.2]{CHK}). Thus the rationality problem of $k(G)$ over $k$ is also called Noether's problem
\cite{Sw}.
\end{defn}

\begin{defn}\label{d1.3}
Let $k$ be a field and $\mu$ be a multiplicative subgroup of $k \setminus \{0 \}$ containing all the
roots of unity in $k$.
If $M$ is a $G$-lattice, a {\it $\mu$-extension} is an exact sequence of
$\bm{Z}[G]$-modules given by
$(\alpha) : 1\rightarrow\mu\rightarrow M_\alpha\rightarrow M\rightarrow 0$
where $G$ acts trivially on $\mu$. Be aware that $M_{\alpha}=\mu \oplus M$ as abelian groups, but not as $\bm{Z}[G]$-modules except when the extension $(\alpha)$ splits.

As in Definition \ref{d1.2}, if $M=\oplus_{1\leq i\leq n}\bm{Z}\cdot x_i$ and $M_{\alpha}$ is a $\mu$-extension,
we define the field $k_\alpha(M)=k(x_1,\ldots,x_n)$ the rational function
field of $n$ variables over $k$; the action of $G$ on $k_\alpha(M)$ will be described in the next paragraph. Note that $M_{\alpha}$ is embedded into the
multiplicative group $k_\alpha(M) \setminus \{ 0 \}$ by sending $(\epsilon, \sum_{1 \le i \le n}b_ix_i)\in \mu \oplus M$ to the element $\epsilon \prod_{1 \le i \le n}x_i^{b_i}$ in the field $k_\alpha(M) =k(x_1,\ldots,x_n)$.

The group $G$ acts on $k_\alpha(M)$ by a twisted multiplicative action:
Suppose that, in $M$ we have $\sigma\cdot x_i=\sum_{1\leq j\leq n}a_{ij}\,x_j$, and
in $M_\alpha$ we have $\sigma\cdot x_i=\varepsilon_i(\sigma)+\sum_{1\leq j\leq n}a_{ij}\,x_j$ where $\varepsilon_i(\sigma)\in\mu$.
Then we define
$\sigma\cdot x_i=\varepsilon_i(\sigma)\prod_{1\leq j\leq n}x_j^{a_{ij}}$
in $k_\alpha(M)$. Again $G$ acts trivially on the coefficient field $k$.
The above group action is called a monomial group action in \cite{HK1};
the elements of $k_\alpha(M)^G$ are called twisted multiplicative
field invariants in \cite{Sa4}.

Note that, if the extension $(\alpha) : 1\rightarrow \mu\rightarrow M_\alpha
\rightarrow M\rightarrow 0$ is a split extension, then $k_\alpha(M)=k(M)$
and the twisted multiplicative action is reduced to the multiplicative
action in Definition \ref{d1.2}.
\end{defn}

Now return to the rationality problem.

First of all, recall some terminology.

Let $k$ be a field, and $L$ be a finitely generated field
extension of $k$. $L$ is called {\it $k$-rational} (or {\it rational over
$k$}) if $L$ is purely transcendental over $k$, i.e.\ $L$ is
isomorphic to some rational function field over $k$.
$L$ is called {\it stably $k$-rational} if $L(y_1,\ldots,y_m)$ is $k$-rational
for some $y_1,\ldots,y_m$ which are algebraically independent over $L$.
$L$ is called {\it $k$-unirational} if $L$ is $k$-isomorphic to a
subfield of some $k$-rational extension of $k$.
We recall another notion, retract rationality, due to Saltman \cite{Sa2}.

\begin{defn}\label{d1.9}
Let $k$ be an infinite field and $L$ be a field containing $k$.
$L$ is called {\it retract $k$-rational}, if $L$ is the quotient field of some affine
domain $A$ over $k$ and there exist $k$-algebra morphisms $\varphi: A\to
k[X_1,\ldots,X_m][1/f]$, $\psi:k[X_1,\ldots, X_m][1/f] \to A$
satisfying that $\psi\circ \varphi=1_A$, the identity map on $A$, where and
$k[X_1,\ldots,X_m]$ is a polynomial ring of $m$ variables over $k$, $f\in
k[X_1,\ldots,X_m]\backslash \{0\}$.
\end{defn}

It is not difficult to see that ``$k$-rational" $\Rightarrow$ ``stably $k$-rational" $\Rightarrow$ ``retract $k$-rational" $\Rightarrow$ ``$k$-unirational".

As mentioned before, in solving Noether's problem, no matter
what in the affirmative direction or in the negative direction,
it is crucial to consider the rationality problems of
$k(M)^G$ or $k_\alpha(M)^G$ where $M$ (resp. $M_\alpha$) is a $G$-lattice
(resp. a $\mu$-extension). In the following we list some previously known results along this line.

\begin{theorem}[{Hajja \cite{Ha}}]\label{thHaj87}
Let $k$ be a field and $G$ be a finite group acting on $k(x_1,x_2)$
by monomial $k$-automorphisms.
Then $k(x_1,x_2)^{G}$ is $k$-rational.
\end{theorem}

\begin{theorem}[{Hajja, Kang \cite{HK1,HK2}, Hoshi, Rikuna \cite{HR}}]
\label{thHKHR}
Let $k$ be a field and $G$ be a finite group acting on
$k(x_1,x_2,x_3)$ by purely monomial $k$-automorphisms.
Then $k(x_1,x_2,x_3)^G$ is $k$-rational.
\end{theorem}


\begin{theorem}[Hoshi, Kang, Kitayama {\cite[Theorem 1.16]{HKK}}]\label{th116}
Let $k$ be a field, $G$ be a finite group and $M$ be a $G$-lattice
with ${\rm rank}_{\bZ} M=4$ such that $G$ acts on $k(M)$ by
purely monomial $k$-automorphisms.
If $M$ is decomposable, i.e. $M=M_1\oplus M_2$ as $\bZ[G]$-modules where
$1\le {\rm rank}_{\bZ} M_1 \le 3$, then $k(M)^G$ is $k$-rational.
\end{theorem}

\begin{theorem}[Hoshi, Kang, Kitayama {\cite[Theorem 6.2]{HKK}}]\label{th62}
Let $k$ be a field, $G$ be a finite group and $M$ be a $G$-lattice
such that $G$ acts on $k(M)$ by purely monomial $k$-automorphisms.
Assume that
{\rm (i)} $M=M_1\oplus M_2$ as $\bZ[G]$-modules where
${\rm rank}_{\bZ}M_1=3$ and ${\rm rank}_{\bZ} M_2=2$,
{\rm (ii)} either $M_1$ or $M_2$ is a faithful $G$-lattice.
Then $k(M)^G$ is $k$-rational except the following situation:
{\rm char} $k\ne 2$, $G=\langle\sigma,\tau\rangle \simeq D_4$
and $M_1=\bigoplus_{1\le i\le 3}
\bZ x_i$, $M_2=\bigoplus_{1\le j\le 2} \bZ y_j$ such that
$\sigma:x_1\leftrightarrow x_2$, $x_3\mapsto -x_1-x_2-x_3$,
$y_1\mapsto y_2\mapsto -y_1$, $\tau: x_1\leftrightarrow x_3$,
$x_2\mapsto -x_1-x_2-x_3$, $y_1\leftrightarrow y_2$ where the
$\bZ[G]$-module structure of $M$ is written additively.
For the exceptional case, $k(M)^G$ is not retract $k$-rational.
\end{theorem}

The proofs of Theorem \ref{thHaj87} and Theorem \ref{thHKHR} are achieved by constructing the transcendence bases in a case by case fashion (there are no more than $13 + 73$ cases!). When we move to the rank $4$ lattices, we have $710$ lattices. This explains partially the reason why we consider only the decomposable lattices in Theorem
\ref{th116}. However, Theorem \ref{th62} tells us some pathological case may arise even for the decomposable lattices of rank $5$. How to understand the rationality problem of $k(M)^G$ for the situation ${\rm rank}_\bm{Z} M \ge 4$?

A useful obstruction to the rationality problem is the unramified Brauer group of an algebraic variety $V$ defined over $\bC$, denoted by $\fn{Br}_u(V)$. If a unirational smooth projective variety $V$ is rational, then $\fn{Br}_u(V)=0$. $\fn{Br}_u(V)$ is a birational invariant; it is the torsion subgroup of $H^3(V, \bZ)$ in the counter-example constructed by M. Artin and Mumford \cite{AM}. The unramified Brauer group was recast by Saltman in an algebraic form \cite{Sa1}; thus we may define $\fn{Br}_u(K)$ for any field extension $K$ over $\bC$.  Saltman and Bogomolov proposed very power methods to computing $\fn{Br}_u(K)$ \cite[Bo]{Sa4}. In this article, we focus on the computing of $\fn{Br}_u(\bm{C}(M)^G)$ for any multiplicative invariant field $\bm{C}(M)^G$ where $M$ is a lattice of rank $\le 6$. If $\bm{C}(M)^G$ is retract rational, it is necessary that $\fn{Br}_u(\bm{C}(M)^G)=0$. Equivalently, the non-vanishing of $\fn{Br}_u(\bm{C}(M)^G)$ implies that the field $\bm{C}(M)^G$ is not retract rational; in particular, it is not rational over $\bC$. We will emphasize that the vanishing of $\fn{Br}_u(\bm{C}(M)^G)$ is a necessary condition, but not a sufficient condition, of retract rationality; it may happen that $\fn{Br}_u(\bm{C}(M)^G)=0$ while $\bm{C}(M)^G$ is not retract rational (see \cite[HKY]{Pe}).

In case ${\rm rank}_\bm{Z} M \le 3$, $\fn{Br}_u(\bm{C}(M)^G)=0$ for all lattices $M$ because $\bm{C}(M)^G$ are always rational (see Theorem \ref{thHaj87} and Theorem \ref{thHKHR}). We will classify all the lattices $M$ with $\fn{Br}_u(\bm{C}(M)^G)\neq 0$ when ${\rm rank}_\bm{Z} M =4, 5$ and $6$. Thus $\bm{C}(M)^G$ are not retract rational for these lattices (and thus are not rational). In this way we obtain a plenty of ``counter-examples" to the rationality problem for lattices of rank $\ge 4$.

On the other hand, Theorem \ref{t7.5} provides a sufficient condition for  $\bm{C}(M)^G$ to be retract rational. In this way, among lattices $M$ with rank $= 4, 5$ and $6$, we find many lattices $M$ (but not all of them) such that $\bm{C}(M)^G$ are retract rational.

\medskip
\begin{defn}\label{d1.12}
Let $k\subset K$ be a finitely generated extension of fields.
The notion of the {\it unramified Brauer group} of $K$ over $k$ was introduced by Saltman \cite{Sa1}; we denote it by $\fn{Br}_{u,k}(K)$, or by $\fn{Br}_u(K)$ if the base field $k$ is understood from the context.

By definition, $\fn{Br}_{u,k}(K)=\bigcap_R \fn{Image} \{ \fn{Br}(R)\to
\fn{Br}(K)\}$ where $\fn{Br}(R)\to \fn{Br}(K)$ is the natural morphism of
Brauer groups and $R$ runs over all the discrete valuation rings $R$
such that $k\subset R\subset K$ and $K$ is the quotient field of
$R$.

If $k$ is an infinite field and $K$ is retract $k$-rational, it can be shown that the natural map $\fn{Br}(k)\to \fn{Br}_{u,k} (K)$ is an isomorphism \cite[Proposition 2.2]{Sa3}.
In particular, if $k$ is an algebraically closed field (for examples, $k= \bm{C}$) and $K$ is
retract $k$-rational, then $\fn{Br}_{u,k}(K)=0$. Consequently, if $k$ is algebraically closed and ${\rm Br}_{u,k}(K)$ is non-trivial, then $K$ is not retract $k$-rational (and thus it is not stably $k$-rational, in particular).

In Definition \ref{d1.4}, we will see that ${\rm Br}_u(\bm{C}(M)^G) \simeq B_0(G) \oplus H^2_u(G,M)$ where $B_0(G)$ is the so-called Bogomolov multiplier and $H^2_u(G,M)$ is some subgroup of the group cohomology $H^2(G,M)$. We remark that $B_0(G)$ is related to the rationality of $\bC(V)^G$ where $G \to GL(V)$ is any faithful linear representation of $G$ over $\bC$; on the other hand, $H^2_u(G,M)$ arises from the multiplicative nature of the field $\bm{C}(M)^G$.
\end{defn}

\bigskip
Here is one of the main results of this article, which tells exactly the lattices $M$ with rank $\le 6$ for which the unramified Brauer group of $\bC(M)^G$ is non-trivial. For those $M$ with trivial ${\rm Br}_u(\bm{C}(M)^G)$ we do not know whether $\bC(M)^G$ are $\bC$-rational or not.

\begin{theorem}\label{t1.5}
Let $G$ be a finite group and $M$ be a faithful $G$-lattice.
\\
{\rm (1)} If ${\rm rank}_\bm{Z} M \le 3$, then ${\rm Br}_u(\bm{C}(M)^G)=0$.\\
{\rm (2)} If ${\rm rank}_\bm{Z} M =4$, then ${\rm Br}_u(\bm{C}(M)^G)\neq 0$
if and only if $M$ is one of the $5$ cases in {\rm Table} $1$ of
Section \ref{seTables}.
Moreover, if $M$ is one of the $5$ $G$-lattices with %non-trivial
${\rm Br}_u(\bm{C}(M)^G)\neq 0$, then $B_0(G)=0$ and ${\rm Br}_u(\bm{C}(M)^G)=H_u^2(G,M)$.\\
{\rm (3)} If ${\rm rank}_\bm{Z} M =5$, then ${\rm Br}_u(\bm{C}(M)^G)\neq 0$ if and only if
$M$ is one of the $46$ cases in {\rm Table} $2$ of Section \ref{seTables}.
Moreover, if $M$ is one of the $46$ $G$-lattices with %non-trivial
${\rm Br}_u(\bm{C}(M)^G)\neq 0$, then $B_0(G)=0$ and ${\rm Br}_u(\bm{C}(M)^G)=H_u^2(G,M)$. \\
{\rm (4)} If ${\rm rank}_\bm{Z} M =6$, then
${\rm Br}_u(\bm{C}(M)^G)\neq 0$ if and only if
$M$ is one of the $1073$ cases as in {\rm Table} $3$ of Section \ref{seTables}.
Moreover, if $M$ is one of the % $1051$
$1073$ $G$-lattices with %non-trivial
${\rm Br}_u(\bm{C}(M)^G)\neq 0$, then $B_0(G)=0$ and ${\rm Br}_u(\bm{C}(M)^G)=H_u^2(G,M)$,
except for $24$ cases
with $B_0(G)=\bm{Z}/2\bm{Z}$ where the {\rm CARAT ID} of $G$ are
%$(6,6459,8)$, $(6,6464,6)$
$(6,6458,i)$, $(6,6459,i)$, $(6,6464,i)$ $(1\leq i\leq 8)$.
Note that $22$ cases out of the exceptional $24$ cases satisfy $H_u^2(G,M)=0$.
$($See Definition \ref{d1.4} for the definitions of $B_0(G)=H_u^2(G,\bm{Q}/\bm{Z})$ and $H_u^2(G,M)$.$)$
\end{theorem}

\begin{remark}
%We note that
(1) The above theorem remains valid if we replace the coefficient field $\bm{C}$ by any algebraically closed field $k$ with char $k=0$.\\
(2) If $M$ is of rank $\leq 6$ and ${\rm Br}_u(\bm{C}(M^G))\neq 0$,
then $G$ is solvable and non-abelian, and
${\rm Br}_u(\bm{C}(M)^G)\simeq \bZ/2\bZ$, $\bZ/3\bZ$ or
$\bZ/2\bZ\oplus\bZ/2\bZ$.
Namely, if $G$ is abelian or non-solvable with
${\rm Br}_u(\bC(M)^G)\neq 0$, then $n\geq 7$
(for explicit examples, see Section \ref{seAbelianA6}).
%In Theorem \ref{thm3},
The case where ${\rm Br}_u(\bm{C}(M)^G)\simeq\bZ/3\bZ$ occurs only for
$4$ groups $G$ of order $27$, $27$, $54$, $54$
with the {\rm CARAT ID}
$(6,2865,1)$, $(6,2865,3)$, $(6,2899,3)$, $(6,2899,5)$
which are isomorphic to $C_9\rtimes C_3$, $C_9\rtimes C_3$,
$(C_9\rtimes C_3)\rtimes C_2$, $(C_9\rtimes C_3)\rtimes C_2$ respectively.
See Section 8 for details.
For {\rm CARAT ID}, see Hoshi-Yamasaki \cite[Chapter 3]{HY}.
\\
%Only $4$ cases of them, the CARAT ID
%$(6,2865,1)$, $(6,2865,3)$, $(6,2899,3)$, $(6,2899,5)$,
%satisfy ${\rm Br}_u(\bm{C}(M^G))\simeq\bZ/3\bZ$.\\
(3)
%In Theorem \ref{thm2},
The group $G \, (\simeq D_4)$ which appears as the exceptional case in Theorem \ref{th62} (i.e. \cite[Theorem 6.2]{HKK}) satisfies the property that ${\rm Br}_u(\bm{C}(M)^G)= H^2 _u (G,M)\neq 0$ where $M$ is the associated lattice. It follows that $\bC(M)^G$ is not retract rational.
In fact, this group is the group with {\rm CARAT ID} $(5,100,11)$ which is the unique group in Table $2$-$3$.

In Theorem \ref{th62}, note that both $\bC(M_1)^G$ and $\bC(M_2)^G$ are rational by Theorem \ref{thHKHR} and Theorem \ref{thHaj87}. Thus
%${\rm Br}_u(\bm{C}(M_1)^G)=
${\rm Br}_u(\bm{C}(M_2)^G)=0$ and %then %It follows that
$H^2 _u (G,M_2)=0$. But $M_1$ is not a faithful $G$-lattice and we cannot apply Theorem \ref{thSa4} to $\bC(M_1)^G$. Hence it is possible that $H^2 _u (G,M_1)$ is non-trivial. Because $H^2 _u (G,M) \simeq H^2 _u (G,M_1)\oplus H^2 _u (G,M_2)$, this allows for the possibility that $H^2 _u (G,M)$ is non-trivial. Indeed, by the same method as in Section 6, it can be shown that $H^2 _u (G,M_1) \simeq \bZ/2 \bZ$ and therefore ${\rm Br}_u(\bm{C}(M)^G)= H^2 _u (G,M_1)\simeq \bZ/2 \bZ$.

We also note that the fixed field $\bm{C}(M)^G$ is stably isomorphic to $\bm{C}(M')^{D_4}$ for some indecomposable $D_4$-lattice $M'$ in Theorem \ref{t1.5} (2) (see Theorem \ref{equiv} for details). \\
(4) In the decomposable cases $M=M_1\oplus M_2$, the lattices in Table $2$-$2$ (resp. $3$-$2$, $3$-$3$-$2$, $3$-$4$, $3$-$5$, $3$-$6$) of Section 8 satisfy the property that $H^2 _u(G, M_1)\neq 0$, but $M_1$ is not a faithful $G$-lattice in some situations; thus the non-triviality of ${\rm Br}_u(\bC(M)^G)=H^2 _u(G, M)$ is automatic. However, for the lattices in Table $2$-$3$ (resp. $3$-$3$-$1$), we have ${\rm Br}_u(\bm{C}(M_i)^G)=0$ for $(i=1,2)$. An explanation of this peculiar phenomenon can be found in the remark (3) above. \\
{\rm (5)} Here is a summary of Theorem \ref{t1.5}:\\
\begin{center}
\begin{tabular}{c|r|r}
rank & number of the lattices & number of lattices with non-trivial\\
& & unramified Brauer groups\\\hline
$1$ & $2$ & $0$\\
$2$ & $13$ & $0$\\
$3$ & $73$ & $0$\\
$4$ & $710$ & $5$\\
$5$ & $6079$ & $46$\\
$6$ & $85308$ & $1073$
\end{tabular}
~\\~\\
\end{center}

%Theorem \ref{th62}

%More precisely, see Theorem \ref{equiv}.\\
%%%%%%%%%%%%%
%In Theorem \ref{thm2},
%the decomposable case of rank $3+2=5$ with ${\rm Br}_u(\bm{C}(M)^G)\neq 0$
%appeared
%Theorem \ref{th62} (\cite[Theorem 6.2]{HKK}).
% See Theorem \ref{equiv} for details.
\end{remark}

The idea of the proof of Theorem \ref{t1.5} is to write an algorithm {\tt H2nrM(g)} for computing $H_u^2(G,M)$ (see Definition \ref{d1.4} and Section 7 for the algorithm). In devising this algorithm, some known GAP functions do not fit our purpose. Thus we are forced to modify these functions. For examples, we write new algorithms for computing the $2$-cocycles and the restriction maps of cohomology groups. With this algorithm in arms, GAP computation will tell us the unramified Brauer groups. All of the computation of this paper may be carried out in a personal computer. As it is common in most questions involving computations, we should employ some theoretic arguments to minimize the computing time and the memory of the computer; thus the traditional methods are inevitable (see the proof of Theorem \ref{thm3}). We remark that the main problem of Theorem \ref{t1.5} is to determine $H_u^2(G,M)$, because there have been algorithms for the computation of $B_0(G)$ (see Theorem \ref{t2.12} and Definition \ref{d1.4} for $H_u^2(G,M)$ and $B_0(G) \simeq H_u^2(G,\bQ/\bZ)$).

 Motivated by the $G$-lattices in Theorem \ref{t1.5}, in Section \ref{seHigher} we will construct $G$-lattices $M$ of rank $2n+2$, $4n$ and $p(p-1)$ ($n$ is any positive integer and $p$ is any odd prime number) such that the unramified Brauer groups of $\bC(M)^G$ are non-trivial. The proof of this result is the traditional theoretic method, because $n$ and $p$ are general integers that the computer computing cannot be of help. The key tool of the proof is the 7-term exact sequence associated to the Hochschild-Serre spectral sequence.


\bigskip
We organize this paper as follows. We recall some preliminaries in Section 2. In particular, Saltman's formula of the unramified Brauer group of $\bC(M)^G$ in terms of certain subgroups of the cohomology groups $H^2(G,M)$ and $H^2(G,\bm{Q}/\bm{Z})$ is given. The proof of Theorem \ref{t1.5} is given in Section 3, while the important algorithm {\tt H2nrM(g)} for computing $H_u^2(G,M)$ is contained in Section 7.

\bigskip
For computing $H_u^2(G,M)$, we rely on
Saltman's formula (see Theorem \ref{thSa4}):
$H_u^2(G,M)\simeq \bigcap_{A} {\rm Ker}({\rm res} : H^2(G,M)
\rightarrow H^2(A,M)$ where $A$ runs over bicyclic subgroups of $G$.
Hence the main part of the algorithm {\tt H2nrM(g)}
is to computing the restriction map
${\rm res} : H^2(G,M)\rightarrow H^2(A,M)$.
The function {\tt ResH2(g,h)} serves to compute the restriction map
${\rm res} : H^2(G,M)\rightarrow H^2(H,M)$ where $H$ is any subgroup of $G$. This function is available from\\
{\tt http://www.math.h.kyoto-u.ac.jp/\~{}yamasaki/Algorithm/MultInvField/res.gap}.

\bigskip

We remark that, in Section 3, the proofs of Theorems \ref{thm1}, \ref{thm2}, \ref{thm3} are preceded by some theoretic explanation which serves to justify the computer algorithm following the discussion; thus the complete proof consists of the discussion and the algorithm (together with the computer computation). The final results are contained in the tables of Section 8.


The lattices of general ranks modeled on some lattices in Theorem \ref{t1.5} are constructed in Section 6. Section 4 and Section 5 arise from a second thought of Theorem \ref{th62}. In fact, Barge's Theorem (Theorem \ref{thB1}) guarantees that there is a $G$-lattice $M$ with ${\rm Br}_u(\bm{C}(M)^G) \neq 0$ where $G \simeq (C_2)^3$, although the rank of this ``bad" lattice is not specified. However, from the tables in Section 8, we cannot find $G$-lattices with non-trivial unramified Brauer groups with $G \simeq (C_2)^3$. This prompts us to conclude that these ``bad" lattices are of rank $\ge 7$. But no database for $G$-lattices of rank $7$ was available when we wrote this article. Thus we construct these lattices ourselves in Section 4 and compute their unramified Brauer groups in Theorem \ref{t5.4}. So far all the ``bad" $G$-lattices are related to solvable groups $G$. At the end of Section 5, we construct $G$-lattices $M$ with ${\rm Br}_u(\bm{C}(M)^G) \neq 0$ and $G \simeq A_6$, the alternating group; such lattices are of rank $9$ (see Theorem \ref{t5.5}). Remember Kunyavskii's Theorem that $B_0(G)=0$ for any non-abelian simple group $G$ \cite{Ku}. Thus the multiplicative nature of $\bm{C}(M)^G$ will add a new component to its unramified Brauer group, a phenomenon which we have encountered in Theorem \ref{t1.5} and Theorem \ref{t5.4}.

\medskip
Notation and terminology : Recall the definition of $k(G)$ (and thus $\bC(G)$ in Definition \ref{d1.2}). The groups $C_n$ and $D_n$ refer to the cyclic group of order $n$ and the dihedral group of order $2n$ respectively. If $n$ is any positive integer, the quasi-dihedral group of order $16n$ is denoted by $QD_{8n}$. If $n$ is any positive integer, the generalized quaternion group of order $8n$ is denoted by $Q_{8n}$. For a linear map $\sigma$, we will write its matrix with respect to a basis $x_i, \ldots, x_n$ in the row form, i.e. if $\sigma \cdot x_i = \sum_{1 \le j \le n} a_{ij} x_j$, then the matrix of $\sigma$ is $(a_{ij})_{1 \le i, j \le n}$. If $M$ is a faithful $G$-lattice and $M$ decomposes into $M_1 \oplus M_2$, it may happen that $M_i$ is not a faithful $G$-lattice. We will denote by $G_i =G |_{M_i}$ the image of the group homomorphism $G \to {\rm Aut}(M_i)$; this notation is used in the tables of Section 8. The reader can find the definitions of the $\bm{Z}$-class and the $\bm{Q}$-class of $GL_n(\bm{Z})$ at the third paragraph of Section 4.





%------------------------------------S2
%\ssection{}
%\cchapter{Preliminaries: unramified Brauer groups}
\section{Preliminaries and the unramified Brauer groups}\label{sePre}


%\bigskip
In this section we review some preliminaries which will be used in the sequel, in particular, the powerful theorems of Bogomolov and Saltman for computing the unramified Brauer group.

Recall that a group $A$ is called bicyclic if $A$ is either a cyclic group or a direct
product of two cyclic groups.

%---------------------t1.4
\begin{theorem}[{Bogomolov \cite{Bo}, Saltman \cite[Theorem 12]{Sa4}}]
\label{t2.12}
Let $G$ be a finite group and $k$ be an algebraically closed field with
$\fn{char}k=0$. Let $\bm{Q}/\bm{Z}$ denote the $\bm{Z}[G]$-module with the trivial $G$-action $($i.e. $\bm{Q}/\bm{Z}$ is isomorphic to the multiplicative
subgroup of all roots of unity in $k$$)$. Then $\fn{Br}_{u,k}(k(G))$ is
isomorphic to the group $B_0(G)$ defined by
\[
B_0(G)=\bigcap_A \fn{Ker}(\fn{res}: H^2(G,\bm{Q}/\bm{Z})\to H^2(A,\bm{Q}/\bm{Z}))
\]
where $A$ runs over all the bicyclic subgroups of $G$.
\end{theorem}

If $G \to GL(V)$ is any faithful linear representation of $G$ over $\bC$, then $\fn{Br}_{u,\bC}(\bC(V)^G) \simeq B_0(G)$ by the No-Name Lemma \cite{Sa4}. The group $B_0(G)$ is a subgroup of $H^2(G,\bm{Q}/\bm{Z})$ (the Schur multiplier); thus it is called the Bogomolov multiplier of $G$ in \cite{Ku}. Note that, the formula in \cite[Theorem 12]{Sa4} can be used to compute not
only $\fn{Br}_{u,\bm{C}}(\bm{C}(V)^G)$, but also $\fn{Br}_{u,\bm{C}}(\bm{C}_\alpha(M)^G)$ where $\bm{C}_\alpha(M)$ is the rational function field associated to the $\mu$-extension $M_{\alpha}$ (see Definition \ref{d1.3}). We record it as follows.

\begin{theorem}[Saltman {\cite[Theorem 12]{Sa4}}]\label{thSa4}
Let $k$ be an algebraically closed field with char $k =0$, and $G$ be a finite group. If $M$ is a $G$-lattice and $(\alpha): 1 \to \mu \to M_{\alpha} \to M \to 0$ is a $\mu$-extension such that {\rm (i)} $M$ is a faithful $G$-lattice, and {\rm (ii)} $H^2(G,\mu) \to H^2(G,M_\alpha)$ is injective, then %of order prime to {\rm char}
\[
{\rm Br}_{u,k}(k_\alpha(M)^G)=\bigcap_{A} {\rm Ker}(
{\rm res} : H^2(G,M_\alpha)\rightarrow H^2(A,M_\alpha))
\]
where $A$ runs over all the bicyclic subgroups of $G$.

In particular, if the $\mu$-extension $(\alpha) : 1\rightarrow\mu\rightarrow M_\alpha\rightarrow M\rightarrow 0$ splits, then ${\rm Br}_{u,k}(k(M)^G)\simeq B_0(G) \oplus \bigcap_{A} {\rm Ker}(
{\rm res} : H^2(G,M)\rightarrow H^2(A,M))$ where $A$ runs over bicyclic subgroups of $G$.
\end{theorem}

\begin{defn}\label{d1.4}
{}From Definition \ref{d1.12}, $\fn{Br}_{u,k}(K)$ is a subgroup of the Brauer group $\fn{Br}(K)$. On the other hand, from the field extension $k_\alpha(M)^G \subset k_\alpha(M)$, the map of the Brauer groups ${\rm Br}(k_\alpha(M)^G) \to {\rm Br}(k_\alpha(M))$ sends ${\rm Br}_{u,k}(k_\alpha(M)^G)$ to ${\rm Br}_{u,k}(k_\alpha(M))$ \cite[Theorem 2.1]{Sa3}. Since ${\rm Br}_{u,k}(k_\alpha(M))=0$ by \cite[Proposition, 2.2]{Sa3}, it follows that the unramified Brauer group ${\rm Br}_{u,k}(k_\alpha(M)^G)$ is a subgroup of the relative Brauer group ${\rm Br}(k_\alpha(M)/k_\alpha(M)^G)$. As ${\rm Br}(k_\alpha(M)/k_\alpha(M)^G)$ is isomorphic to the cohomology group $H^2(G,k_\alpha(M)^{\times})$, we may regard ${\rm Br}_{u,k}(k_\alpha(M)^G)$ as a subgroup of $H^2(G,k_\alpha(M)^{\times})$.

Through the embedding of $M_\alpha$ into $k_\alpha(M)^\times$,
there is a canonical injection of $H^2(G,M_\alpha)$ into ${\rm Br}(k_\alpha(M)^G)$ \cite[page 536]{Sa4}. Identifying both ${\rm Br}_{u,k}(k_\alpha(M)^G)$ and $H^2(G,M_\alpha)$ as subgroups of $H^2(G,k_\alpha(M)^{\times})$, it can be shown that ${\rm Br}_{u,k}(k_\alpha(M)^G)$ is a subgroup of $H^2(G,M_\alpha)$ \cite[page 536]{Sa4}. Thus we write $H^2_u(G,M_\alpha)$ for ${\rm Br}_{u,k}(k_\alpha(M)^G)$ (see \cite{Sa4})  .

Note that there is a natural map $H^2(G,\bm{Q}/\bm{Z}) \to H^2(G,M_\alpha)$.
Clearly this map is injective if the $\mu$-extension $(\alpha) : 1\rightarrow\mu\rightarrow M_\alpha\rightarrow M\rightarrow 0$ splits. In this case, regarding $H^2(G,\bm{Q}/\bm{Z})$ and $H^2(G,M)$ as subgroups of $H^2(G,M_\alpha)$, we define $H^2_u(G,\bm{Q}/\bm{Z})=H^2(G,\bm{Q}/\bm{Z}) \cap
{\rm Br}_u(k_\alpha(M)^G)$ and $H^2_u(G,M)=H^2(G,M) \cap
{\rm Br}_u(k_\alpha(M)^G)$.
It follows that
${\rm Br}_u(k_\alpha(M)^G)=H_u^2(G,\bQ/\bZ)\oplus H_u^2(G,M)$.
By Theorems \ref{t2.12} and \ref{thSa4},
we have $H^2_u(G,\bQ/\bZ)\simeq B_0(G)$ and
$H^2_u(G,M)\simeq \bigcap_{A} {\rm Ker}(
{\rm res} : H^2(G,M)\rightarrow H^2(A,M))$ where $A$ runs over
bicyclic subgroups of $G$.
\end{defn}

\begin{theorem}[Huebschmann \cite{Hu}, Dekimpe, Hartl, Wauters \cite{DHW}]\label{thDHW}
Let $G$ be a finite group and $N$ be a normal subgroup of $G$.
Then the Hochschild--Serre spectral sequence gives rise to the following
$7$-term exact sequence
\begin{align*}
0 &\to H^1(G/N,M^N) \to H^1(G,M)\to H^1(N,M)^{G/N} \to H^2(G/N,M^N) \\
&\to H^2(G,M)_1
%\xrightarrow{\rho}
\to H^1(G/N,H^1(N,M))
%\xrightarrow{\lambda}
\to H^3(G/N,M^N)
\end{align*}
where $H^2(G,M)_1={\rm Ker}({\rm res}:H^2(G,M)\to H^2(N,M))$.
In particular, if $M^N=0$, then
we have two isomorphisms $H^1(G,M)\simeq H^1(N,M)^{G/N}$ and
$H^2(G,M)_1\simeq H^1(G/N,H^1(N,M))$.
%and $\lambda$ is
%defined as follows. Choose a section $u\colon G/N\to G$ and define a
%$2$-cocycle $\varepsilon\colon G/N\times G/N\to N$ satisfying
%$u(\tau)u(\tau')=\varepsilon(\tau,\tau')u(\tau\tau')$ for any
%$\tau,\tau'\in G/N$. For each $1$-cocycle $\gamma\colon G/N\to
%H^1(N,M)$, the map $\lambda$ is defined by
%\[
%\xymatrix@R=4pt{\lambda\colon H^1(G/N, H^1(N,M)) \ar[r] & H^3(G/N,M) \\
%\gamma \ar@{|->}[r] & \lambda (\gamma)=c}
%\]
%where $c: G/N\times G/N \times G/N \to M$ is the
%$3$-cocycle defined as
%$c(\tau_1,\tau_2,\tau_3)=(\side{u(\tau_1\tau_2)}{\gamma(\tau_3)})
%(\varepsilon(\tau_1,\tau_2))$ for all $\tau_1,\tau_2,\tau_3\in
%G/N$.
\end{theorem}

\begin{theorem}[{Fischer \cite{Fi}, see also Swan \cite[Theorem 6.1]{Sw}}]\label{thFi}
Let $G$ be a finite abelian group with exponent $e$.
Assume that {\rm (i)} either {\rm char} $k=0$ or {\rm char} $k>0$ with
{\rm char} $k$ ${\not |}$ $e$, and
{\rm (ii)} $k$ contains a primitive $e$-th root of unity.
Then $k(G)$ is $k$-rational.
In particular, $\bm{C}(G)$ is $\bm{C}$-rational.
\end{theorem}

\begin{theorem}[{Chu and Kang \cite[Theorem 1.6]{CK}}] \label{thCK}
Let $G$ be a $p$-group of order $\leq p^4$.
If $k$ is a field satisfying {\rm (i)} $\fn{char}k=p>0$, or
{\rm (ii)} $\fn{char}k\ne p$ with $\zeta_e\in k$ where
$e$ is the exponent of the group $G$ and $\zeta_e$ is a primitive $e$-th root of unity, then $k(G)$ is $k$-rational.
\end{theorem}

\begin{theorem}[{Chu, Hu, Kang and Prokhorov \cite[Theorem 1.5]{CHKP}}]
\label{thCHKP}
Let $G$ be a group of order $32$ with exponent $e$.
If $k$ is a field satisfying {\rm (i)} $\fn{char} k=2$,
or {\rm (ii)} $\fn{char}k\ne 2$ with $\zeta_e \in k$ (where $\zeta_e$ is a primitive $e$-th root of unity),
then $k(G)$ is $k$-rational.
\end{theorem}

\begin{theorem}[{Barge \cite[Theorem II.7]{Ba1}}]\label{thB1}
Let $G$ be a finite group.
The following two statements are equivalent:\\
{\rm (i)} all the Sylow subgroups of $G$ are bicyclic;\\
{\rm (ii)} $\fn{Br}_u(\bm{C}(M)^G)=0$ for all $G$-lattices $M$.
\end{theorem}

%\begin{theorem}[Barge {\cite[Theorem IV-1]{Ba2}}] \label{thB2}
%Let $G$ be a finite group.
%The following two statements are equivalent:\\
%{\rm (i)} All the Sylow subgroups of $G$ are cyclic;\\
%{\rm (ii)} $Br_u(\bm{C}_{\alpha}(M)^G)=0$ for all $G$-lattices $M$,
%for all short exact sequences of
%$\bm{Z}[G]$-modules $\alpha : 0 \rightarrow \bm{C}^{\times}
%\rightarrow M_{\alpha} \rightarrow M \rightarrow 0$.
%\end{theorem}


%\begin{theorem}\label{t1.5}
%There exist $710$ lattices $M$ of rank $4$ in total.
%Suppose that the finite group $G$ is chosen such that $M$ is a faithful
%$G$-lattice.
%Let $M_\alpha$ be the split $\mu$-extension $1\rightarrow\mu\rightarrow
%M_\alpha\rightarrow M\rightarrow 0$ of $\bm{Z}[G]$-modules.
%Then\\
%{\rm (1)} ${\rm Br}_u(\bm{C}(M)^G)\neq 0$ if and only if the lattices $M$ and
%the groups $G$ are $5$ cases of the {\rm GAP IDs}
%{\rm (4,12,4,12), (4,32,1,2), (4,32,3,2), (4,33,3,1), (4,33,6,1)}
%in {\rm \cite{BBNWZ}} and in {\rm \cite{GAP}}.\\
%{\rm (2)} If $M$ is one of the above five lattices in (1) with non-trivial
%${\rm Br}_u(\bm{C}(M)^G)$,
%then ${\rm Br}_u(\bm{C}(M)^G)=H_u^2(G,M)$, i.e. $H_u^2(G,\bm{Q}/\bm{Z})$.
%Moreover, ${\rm Br}_u(\bm{C}(M)^G)$ is isomorphic to
%$\bm{Z}/2\bm{Z}$, $\bm{Z}/2\bm{Z}\oplus\bm{Z}/2\bm{Z}$,
%$\bm{Z}/2\bm{Z}$, $\bm{Z}/2\bm{Z}\oplus\bm{Z}/2\bm{Z}$,
%$\bm{Z}/2\bm{Z}$ successively.
%\end{theorem}

%We remark that, the above five groups are isomorphic, as abstract group,
%to $D_4$ (the dihedral group of order $8$),
%$Q_8$ (the quaternion group of order $8$),
%$QD_8$ (the quasi-dihedral group of order $16$),
%$SL_2(\bm{F}_3)$ and $GL_2(\bm{F}_3)$.

%------------------------------------S3
%\ssection{}
%\cchapter{Proof of Theorem {\ref{t1.5}}}
\section{Proof of Theorem {\ref{t1.5}}}\label{sePT}

%gap> Read("f6");
%gap> Read("f51");
%gap> Read("f42");
%gap> Read("f411");
%gap> Read("f33");
%gap> Read("f321");
%gap> Read("f3111");
%gap> Read("f222");
%gap> Read("f2211");
%gap> Read("f21111");
%gap> Read("f111111");
%-> combine them into "Glattice.dat", "Glattice5.dat", "Glattice6.dat"

%\begin{definition}\label{defMG}
%Let $G$ be a finite subgroup of $GL(n,\bm{Z})$.
%The $G$-lattice $M_G$ of rank $n$
%is defined to be the $G$-lattice with a $\bm{Z}$-basis $\{u_1,\ldots,u_n\}$
%on which $G$ acts by $\sigma(u_i)=\sum_{j=1}^n a_{i,j}u_j$ for any $
%\sigma=[a_{i,j}]\in G$.
%\end{definition}

Using the CARAT package \cite{CARAT} of GAP, we can find all the $710$ lattices $M$ of rank $4$.
Similarly there exist $6079$ (resp. $85308$) lattices of rank $5$ (resp. $6$).
The readers may find all these finite groups and their associated lattices by using the related functions which are available from\\
{\tt http://www.math.h.kyoto-u.ac.jp/\~{}yamasaki/Algorithm/MultInvField/}.

For GAP ID and CARAT ID, see Hoshi-Yamasaki \cite[Chapter 3]{HY}.

\bigskip
Now we  start to prove Theorem \ref{t1.5}.

The key idea is to device a computer algorithm to compute $H_u^2(G,M)$. We call this algorithm the function {\tt H2nrM(g)} of GAP \cite{GAP}. For any $G$-lattice $M$ where $G$ is a finite subgroup of $GL_n(\bm{Z})$, this function returns $H_u^2(G,M)$ (see Section 8; Section 9 is the outcome of the computation).
The function {\tt H2nrM(g)} and associated functions are available from
{\tt http://www.math.h.kyoto-u.ac.jp/\~{}yamasaki/Algorithm/MultInvField/}.\\

The proof of Theorem \ref{t1.5} proceeds as follows.

By Theorem \ref{thHKHR}, if $M$ is a faithful $G$-lattice of rank $\leq 3$,
then $\bm{C}(M)^G$ is $\bm{C}$-rational and hence ${\rm Br}_u(\bm{C}(M)^G)=0$. For the remaining cases, we will prove the following three theorems.

\begin{theorem}\label{thm1}
%Let $G$ be a finite subgroup of $\GL(4,\bZ)$ and
%$M_G$ be the faithful $G$-lattice of rank $4$
%as in Definition \ref{defMG}.
%
Let $G$ be a finite group and $M$ be a faithful $G$-lattice of rank $4$.
Then
${\rm Br}_u(\bm{C}(M)^G)\neq 0$ if and only if
$M$ is one of the $5$ cases as in {\rm Table} $1$ of Section \ref{seTables}.
In particular, such $G$-lattices $M$ with
${\rm Br}_u(\bm{C}(M)^G)\neq 0$ are indecomposable.
Moreover, if $M$ is one of the five $G$-lattices with %non-trivial
${\rm Br}_u(\bm{C}(M)^G)\neq 0$, then
${\rm Br}_u(\bm{C}(M)^G)=H_u^2(G,M)$; in other words, $H_u^2(G,\bm{Q}/\bm{Z})=0$.
\end{theorem}

%There exist $6079$ faithful $G$-lattices $M$ of rank $5$.

\begin{theorem}\label{thm2}
Let $G$ be a finite group and $M$ be a faithful $G$-lattice of rank $5$.
Then
${\rm Br}_u(\bm{C}(M)^G)\neq 0$ if and only if
$M$ is one of the $46$ cases as in {\rm Table} $2$ of Section \ref{seTables}.
In particular, there exist $27$ $($resp. $18$, $1$$)$ $G$-lattices
with ${\rm Br}_u(\bm{C}(M)^G)\neq 0$
which are indecomposable $($resp. decomposable into indecomposable component
with rank $4+1$, $3+2$$)$.
%
Moreover, if $M$ is one of the $46$ $G$-lattices with %non-trivial
${\rm Br}_u(\bm{C}(M)^G)\neq 0$, then ${\rm Br}_u(\bm{C}(M)^G)=H_u^2(G,M)$; in other words,  $H_u^2(G,\bm{Q}/\bm{Z})=0$.
\end{theorem}

%There exist $85308$ faithful $G$-lattices $M$ of rank $6$.

\begin{theorem}\label{thm3}
Let $G$ be a finite group and $M$ be a faithful $G$-lattice of rank $6$.
Then
${\rm Br}_u(\bm{C}(M)^G)\neq 0$ if and only if
$M$ is one of the %$1051$
$1073$ cases as in {\rm Table} $3$ of Section \ref{seTables}.
In particular, there exist %$603$
$613$
$($resp. $161$,
%$218$,
$230$,
$59$, $5$, $5$$)$
$G$-lattices with ${\rm Br}_u(\bm{C}(M)^G)\neq 0$
which are indecomposable $($resp. decomposable into indecomposable component
with rank $5+1$, $4+2$, $4+1+1$, $3+3$, $3+2+1$$)$.
%
Moreover, if $M$ is one of the % $1051$
$1073$ $G$-lattices with %non-trivial
${\rm Br}_u(\bm{C}(M)^G)\neq 0$, then ${\rm Br}_u(\bm{C}(M)^G)=H_u^2(G,M)$,
i.e. $H_u^2(G,\bm{Q}/\bm{Z})=0$, except for $24$ cases
with $H_u^2(G,\bm{Q}/\bm{Z})=\bm{Z}/2\bm{Z}$ of the {\rm CARAT ID}
%$(6,6459,8)$, $(6,6464,6)$
$(6,6458,i)$, $(6,6459,i)$, $(6,6464,i)$ $(1\leq i\leq 8)$.
The $22$ cases $($resp. $2$ cases$)$
of the exceptional $24$ cases satisfy $H_u^2(G,M)=0$
$($resp. $H_u^2(G,M)\simeq\bm{Z}/2\bm{Z})$.
In particular, only $2$ cases satisfy $H_u^2(G,\bm{Q}/\bm{Z})\neq 0$
and $H_u^2(G,M)\neq 0$.
\end{theorem}

Note that new phenomena arise when the rank increases. For examples, in Theorem \ref{thm2}, there are decomposable lattices $M$ with ${\rm Br}_u(\bm{C}(M)^G)\neq 0$ (compare with Theorem \ref{th116} and Theorem \ref{thm1}). Also, in Theorem \ref{thm3}, there are lattices $M$ with ${\rm Br}_u(\bm{C}(M)^G)\neq 0$ and $H_u^2(G,\bm{Q}/\bm{Z}) \neq 0$ while $H_u^2(G,M)$ may be trivial or not (compare with Theorem \ref{thm2}). In Theorem \ref{equiv}, we will find an example that multiplicative invariant fields arising from different lattices become stably isomorphic.


\bigskip
We explain how to apply the function {\tt H2nrM(g)} of GAP \cite{GAP} to prove Theorem \ref{t1.5}.

Let $G$ be a finite subgroup of $GL_n(\bm{Z})$. For each prime number $p \mid |G|$, choose a $p$-Sylow subgroup $G_p$ of $G$. Since the restriction map $H^i (G, M_{\alpha}) \to \oplus_{p\mid |G|}H^i (G_p, M_{\alpha})$ is injective for $i \ge 1$ (see \cite[page 130, Proposition 4]{Se}), it follows that $H^2_u (G, M_{\alpha}) \to \oplus_{p\mid |G|}H^2_u (G_p, M_{\alpha})$ is also injective. On the other hand, if the $\mu$-extension $(\alpha) : 1\rightarrow \mu\rightarrow M_{\alpha}\rightarrow M\rightarrow 0$ is a split extension, then $H_u^2(G, M_{\alpha}) \simeq H_u^2(G,\bm{Q}/\bm{Z})\oplus H_u^2(G,M)$.

In other words, in order to show that $H^2_u (G, M_{\alpha})=0$ in Theorems \ref{thm1}, \ref{thm2} and \ref{thm3}, it suffices to show that $B_0(G)=0$ and $H^2_u (G_p, M)=0$ for $p\mid |G|$.

To show that $H^2_u (G_p, M)=0$, we may apply Theorem \ref{thB1} to narrow down  the class of lattices and then apply the function {\tt H2nrM(g)}. In the following proofs of Theorems \ref{thm1}, Theorem \ref{thm2} and Theorem \ref{thm3}, the Steps 1 -- 4 are meant to explain the ideas of the algorithms, then the computer program follows (with the corresponding Steps 1 -- 4).

Now we go ahead to the proofs of these theorems.

\vspace*{2mm}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
{\it Proof of Theorem \ref{thm1}.}\vspace*{2mm}

We will compute $H_u^2(G,M)$ first. The computation of $B_0(G)$ is given in Step 4.

\medskip
Step 1. First we study the structure of maximal finite $p$-subgroups of $GL_4(\bm{Z})$.
It is easy to see that, if $G$ is a finite $p$-group in $GL_4(\bm{Z})$, then $p=2, 3,$ or $5$.

The maximal $3$-subgroup, denoted by $G_3$ (resp. $5$-subgroup, denoted by $G_5$)
is of order $9$ (resp. $5$). Hence
${\rm Br}_u(\bm{C}(M)^{G_p})=0$ by Theorem \ref{thB1}. It remains to
check $2$-groups $G$ with $|G|\geq 8$ which are not bicyclic.

It can be shown a non-bicyclic $2$-group in $GL_4(\bm{Z})$ is of order $\le 128$. Moreover,
the total numbers of non-bicyclic subgroups $G$ in $GL_4(\bm{Z})$ of order
$8$, $16$, $32$, $64$, $128$ are : $90$, $81$, $33$, $14$, $2$ respectively.

Apply the function {\tt H2nrM(G)} to the lattices associated to these groups. We find that only three groups $G$ have non-trivial $H^2_u (G, M)$. The GAP ID of these three groups are :
$(4,12,4,12)$, $(4,32,1,2)$, $(4,32,3,2)$. More precisely, if the GAP ID of $G$ is $(4,12,4,12)$, then
$G \simeq D_4$ and $H_u^2(G,M) \simeq \bm{Z}/2\bm{Z}$; if the GAP ID of $G$ is $(4,32,1,2)$, then
$G \simeq Q_8$ and $H_u^2(G,M) \simeq \bm{Z}/2\bm{Z}\oplus\bm{Z}/2\bm{Z}$; if the GAP ID of $G$ is $(4,32,3,2)$, then
$G \simeq QD_8$ and $H_u^2(G,M) \simeq \bm{Z}/2\bm{Z}$.

Conclusion: Let $G$ be a finite subgroup of $GL_4(\bm{Z})$ (no matter what $G$ is a $2$-group or not). If the $2$-Sylow subgroup of $G$ is not isomorphic to groups with GAP ID $(4,12,4,12)$, $(4,32,1,2)$, $(4,32,3,2)$, then  ${\rm Br}_u(\bm{C}(M)^{G})=0$.

\medskip
Step 2.
Let $G$ be a finite subgroup of $GL_4(\bm{Z})$ which is not a $2$-group. Because of Theorem \ref{thB1}, it suffices to consider the case when $G$ is not bicyclic.
By the conclusion of Step 1, we may restrict only to those groups of order $8m$ or $16m$ where $m \ge 3$ is an odd integer (if the group order is $8$ or $16$, it becomes a $2$-group which has been treated in Step 1). Inspecting the list of finite subgroups in $GL_4(\bm{Z})$, we find that there are no groups of order $8 \cdot 7$, $8 \cdot 11$, $8 \cdot 13, \ldots, 16 \cdot 5, 16 \cdot 7, \ldots$. We are reduced to groups of order $24$, $40$, $72$, $120$, $48$, $144$, $240$.

The total numbers of non-bicyclic subgroups $G$ in $GL_4(\bm{Z})$ of order
$24$, $40$, $72$, $120$ are : $95$, $2$, $27$, $6$ respectively; and the total numbers of non-bicyclic subgroups $G$ in $GL_4(\bm{Z})$ of order
$48$, $144$, $240$ are : $58$, $9$, $2$ respectively.

Not all of the above groups are eligible, because only those groups whose $2$-Sylow subgroups are isomorphic to  one of the three groups we find in Step 1 are the ``bad" groups. The numbers of these ``bad" groups are $4$ (for order $24$) and $1$ (for order $72$); similarly, the numbers of these ``bad" groups are $4$ (for order $48$) and $1$ (for order $144$).

Apply the function {\tt H2nrM(G)} to the above ten groups $G$,
we find that $H_u^2(G,M)=0$
except for two groups. These two groups are the groups whose GAP ID are
$(4,33,3,1)$ and $(4,33,6,1)$.
The group $G$ of the GAP ID $(4,33,3,1)$ (resp. $(4,33,6,1)$)
is isomorphic to $SL_2(\bm{F}_3)$
(resp. $GL_2(\bm{F}_3)$)
with $H_u^2(G,M)=\bm{Z}/2\bm{Z}\oplus\bm{Z}/2\bm{Z}$
(resp. $\bm{Z}/2\bm{Z}$).

\medskip
Step 3. By Theorem \ref{th116},
all of the $G$-lattices $M$ with $H_u^2(G,M)\neq 0$
are indecomposable because $\bm{C}(M)^G$ is $\bm{C}$-rational
if $M$ is decomposable.

\medskip
Step 4.
We will show that $H_u^2(G,\bm{Q}/\bm{Z})=0$ when $G$ are the ``bad" groups found above.

By Theorem \ref{thCK} and Theorem \ref{thCHKP},
if $G$ is a $p$-group of order $\leq p^4$ or $32$,
then $\bm{C}(G)$ is $\bm{C}$-rational and hence $H_u^2(G,\bm{Q}/\bm{Z})=0$.
It remains to check whether $H_u^2(G,\bm{Q}/\bm{Z})=0$ for $|G|=64$ or $128$.
It follows from \cite{CHKK} and \cite{Mo} that $H_u^2(G,\bm{Q}/\bm{Z})=0$
when $G$ is a subgroup of $GL_4(\bm{Z})$ of order $64$ or $128$.
We may also check this using the function {\tt B0G(G)}
in the program b0g.g by Moravec \cite{Mo} or the function
{\tt BogomolovMultiplier(G)} in HAP \cite{HAP}. \\

Before proceeding to the computations of GAP \cite{GAP} below,
we should read the related data from\\
{\tt http://www.math.h.kyoto-u.ac.jp/\~{}yamasaki/Algorithm/MultInvField/}.
\footnote{
CARAT package \cite{CARAT} of GAP
works on Linux or Mac OS X, but not on Windows.}
\\

\begin{verbatim}
gap> Read("crystcat.gap");
gap> Read("caratnumber.gap");
gap> Read("cohomology.gap");
gap> Read("res.gap");
gap> Read("KS.gap");
gap> Read("AllSubdirectProducts.gap");
gap> Read("NonInv.dat");
gap> Read("NonInv5.dat");
gap> Read("Glattice.dat");
gap> Read("Glattice5.dat");
gap> Read("Glattice6.dat");
gap> Read("NSaltman.dat");

# Step 1
gap> GL4Z:=Flat(List([1..33],x->List([1..NrQClassesCrystalSystem(4,x)],
> y->List([1..NrZClassesQClass(4,x,y)],z->MatGroupZClass(4,x,y,z)))));;
gap> o4:=List(GL4Z,Order);;
gap> Collected(Factors(Lcm(o4)));
[ [ 2, 7 ], [ 3, 2 ], [ 5, 1 ] ]
gap> nbc4_2:=Filtered(GL4Z,x->2^7 mod Order(x)=0
> and not IsBicyclic(x));; # |G|=2^n
gap> Collected(List(nbc4_2,Order));
[ [ 8, 90 ], [ 16, 81 ], [ 32, 33 ], [ 64, 14 ], [ 128, 2 ] ]
gap> ns4_2:=Filtered(nbc4_2,x->H2nrM(x).H2nrM<>[]); # computing H2nr(G,M)
[ MatGroupZClass( 4, 12, 4, 12 ), MatGroupZClass( 4, 32, 1, 2 ),
  MatGroupZClass( 4, 32, 3, 2 ) ]
gap> ns4_2i:=List(ns4_2,CrystCatZClassNumber);
[ [ 4, 12, 4, 12 ], [ 4, 32, 1, 2 ], [ 4, 32, 3, 2 ] ]
gap> List(ns4_2,Order);
[ 8, 8, 16 ]
gap> List(ns4_2,StructureDescription);
[ "D8", "Q8", "QD16" ]

# Step 2
gap> nbc4_8m:=Filtered(GL4Z,x->Order(x) mod 16=8 and Order(x)>8
> and not IsBicyclic(x));; # |G|=8m
gap> Collected(List(nbc4_8m,Order));
[ [ 24, 95 ], [ 40, 2 ], [ 72, 27 ], [ 120, 6 ] ]
gap> nbc4_8m_2:=Filtered(nbc4_8m,
> x->CrystCatZClassNumber(SylowSubgroup(x,2)) in ns4_2i);
[ MatGroupZClass( 4, 32, 5, 2 ), MatGroupZClass( 4, 32, 5, 3 ),
  MatGroupZClass( 4, 33, 1, 1 ), MatGroupZClass( 4, 33, 3, 1 ),
  MatGroupZClass( 4, 33, 7, 1 ) ]
gap> Collected(List(nbc4_8m_2,x->CrystCatZClass(SylowSubgroup(x,2))));
[ [ [ 4, 32, 1, 2 ], 5 ] ]
gap> Collected(List(nbc4_8m_2,Order));
[ [ 24, 4 ], [ 72, 1 ] ]
gap> ns4_8m:=Filtered(nbc4_8m_2,x->H2nrM(x).H2nrM<>[]); # computing H2nr(G,M)
[ MatGroupZClass( 4, 33, 3, 1 ) ]
gap> ns4_8mi:=List(ns4_8m,CrystCatZClassNumber);
[ [ 4, 33, 3, 1 ] ]
gap> List(ns4_8m,Order);
[ 24 ]
gap> List(ns4_8m,StructureDescription);
[ "SL(2,3)" ]

gap> nbc4_16m:=Filtered(GL4Z,x->Order(x) mod 32=16 and Order(x)>16
> and not IsBicyclic(x));; # |G|=16m
gap> Collected(List(nbc4_16m,Order));
[ [ 48, 58 ], [ 144, 9 ], [ 240, 2 ] ]
gap> nbc4_16m_2:=Filtered(nbc4_16m,
> x->CrystCatZClassNumber(SylowSubgroup(x,2)) in ns4_2i);
[ MatGroupZClass( 4, 32, 11, 2 ), MatGroupZClass( 4, 32, 11, 3 ),
  MatGroupZClass( 4, 33, 4, 1 ), MatGroupZClass( 4, 33, 6, 1 ),
  MatGroupZClass( 4, 33, 11, 1 ) ]
gap> Collected(List(nbc4_16m_2,x->CrystCatZClass(SylowSubgroup(x,2))));
[ [ [ 4, 32, 3, 2 ], 5 ] ]
gap> Collected(List(nbc4_16m_2,Order));
[ [ 48, 4 ], [ 144, 1 ] ]
gap> ns4_16m:=Filtered(nbc4_16m_2,x->H2nrM(x).H2nrM<>[]); # computing H2nr(G,M)
[ MatGroupZClass( 4, 33, 6, 1 ) ]
gap> ns4_16mi:=List(ns4_16m,CrystCatZClassNumber);
[ [ 4, 33, 6, 1 ] ]
gap> List(ns4_16m,Order);
[ 48 ]
gap> List(ns4_16m,StructureDescription);
[ "GL(2,3)" ]
gap> ns4:=Union(ns4_2i,ns4_8mi,ns4_16mi);
[ [ 4, 12, 4, 12 ], [ 4, 32, 1, 2 ], [ 4, 32, 3, 2 ], [ 4, 33, 3, 1 ], [ 4, 33, 6, 1 ] ]
gap> Length(ns4);
5

# Step 3
gap> NS4:=Intersection(ns4,d4);
[ [ 4, 12, 4, 12 ], [ 4, 32, 1, 2 ], [ 4, 32, 3, 2 ], [ 4, 33, 3, 1 ], [ 4, 33, 6, 1 ] ]
gap> List(NS4,x->H2nrM(MatGroupZClass(x[1],x[2],x[3],x[4])).H2nrM);
[ [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ] ]

# Step 4
gap> LoadPackage("HAP");
true
gap> GL4Q:=Flat(List([1..33],x->List([1..NrQClassesCrystalSystem(4,x)],
> y->MatGroupZClass(4,x,y,1))));;
gap> nb4:=Filtered(GL4Q,x->BogomolovMultiplier(x)<>[]);
[  ]
\end{verbatim}




\vspace*{2mm}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
{\it Proof of Theorem \ref{thm2}.}\vspace*{2mm}

We compute $H^2_u (G, M)$ in Steps $1$ -- $3$ as before.

\medskip
Step 1.
It is not difficult to show that, if $G$ is a finite $p$-group in $GL_5(\bm{Z})$, then $p=2, 3,$ or $5$.

The maximal $3$-subgroup, denoted by $G_3$ (resp. $5$-subgroup, denoted by $G_5$)
is of order $9$ (resp. $5$). Hence
${\rm Br}_u(\bm{C}(M)^{G_p})=0$ by Theorem \ref{thB1}. It remains to
check $2$-groups $G$ with $|G|\geq 8$ which are not bicyclic.

It can be shown a non-bicyclic $2$-group in $GL_5(\bm{Z})$ is of order $\le 256$. Moreover,
the total numbers of non-bicyclic subgroups $G$ in $GL_5(\bm{Z})$ of order
$8$, $16$, $32$, $64$, $128$, $256$ are : $507$, $1030$, $700$, $247$, $61$, $4$ respectively.

Apply the function {\tt H2nrM(G)} to the lattices associated to these groups. We find that exactly 41 groups $G$ have non-trivial $H^2_u (G, M)$. The number of these groups are: $15$ (groups of order $8$), $20$ (groups of order $16$), and $6$ (groups of order $32$); we omit the GAP ID of these groups (the reader can find them in the lists of Section 9).

Conclusion: Let $G$ be a finite subgroup of $GL_5(\bm{Z})$ (no matter what $G$ is a $2$-group or not). If the $2$-Sylow subgroup of $G$ is not isomorphic to one of the $15+ 20 + 6$ groups found before, then  ${\rm Br}_u(\bm{C}(M)^{G})=0$.


\medskip
Step 2.
Let $G$ be a finite subgroup of $GL_5(\bm{Z})$ which is not a $2$-group. Because of Theorem \ref{thB1}, we consider the non-bicyclic groups.
By the conclusion of Step 1, we may restrict only to those groups of order $8m$, $16m$ or $32m$ where $m \ge 3$ is an odd integer $\ge 3$ (as before, we will not consider groups of order $8$, $16$, or $32$).

As in the case of Step 2 of the proof of Theorem \ref{thm1}, apply {\tt H2nrM(G)} again for these non-bicyclic groups. We find that
$H_u^2(G,M)=0$  except for the groups $G$ whose CARAT ID are :
$(5,691,1)$, $(5,730,1)$, $(5,733,1)$, $(5,734,1)$, $(5,776,1)$. The group orders of these $5$ exceptional groups are : $24$, $48$, $48$, $48$, $96$ respectively, and they are isomorphic to $SL_2(\bm{F}_3)$, $C_2\times SL_2(\bm{F}_3)$, $GL_2(\bm{F}_3)$, $GL_2(\bm{F}_3)$,
$C_2\times GL_2(\bm{F}_3)$ respectively. The corresponding unramified cohomology $H_u^2(G,M)$ of them are $\bm{Z}/2\bm{Z}\oplus\bm{Z}/2\bm{Z}$, $\bm{Z}/2\bm{Z}\oplus\bm{Z}/2\bm{Z}$, $\bm{Z}/2\bm{Z}$,
$\bm{Z}/2\bm{Z}$, $\bm{Z}/2\bm{Z}$ respectively.

In conclusion, we find all the lattices $M$ associated to the $46$ groups ($41$ groups obtained in Step 1 and $5$ additional groups in this step) with $H_u^2(G,M) \neq 0$.

\medskip
Step 3.
Using the function {\tt LatticeDecompositions(n)} which is provided by [HY, Section 4.1] we find that, among the $46$ lattices in Step 2, the numbers of lattices which are indecomposable, decomposable into indecomposable component with rank $4+1$, decomposable into indecomposable component with rank $3+2$ are : $27$, $18$, $1$ respectively. The reader may consult also [HY, Example 4.9], where a method to classify the decomposable lattices of type $4+1$ and $3+2$ is provided.

\medskip
Step 4.
We verify that $H_u^2(G,\bm{Q}/\bm{Z})=0$ by using the function {\tt B0G(G)}
in the program b0g.g by Moravec \cite{Mo} or the function
{\tt BogomolovMultiplier(G)} in HAP \cite{HAP} (see also Step 4 in the proof of Theorem \ref{thm1}).
 \\

\begin{verbatim}
# Step 1
gap> GL5Z:=Flat(List([1..955],x->List([1..CaratNrZClasses(5,x)],
> y->CaratMatGroupZClass(5,x,y))));;
gap> o5:=List(GL5Z,Order);;
gap> Collected(Factors(Lcm(o5)));
[ [ 2, 8 ], [ 3, 2 ], [ 5, 1 ] ]
gap> nbc5_2:=Filtered(GL5Z,x->2^8 mod Order(x)=0
> and not IsBicyclic(x));; # |G|=2^n
gap> Collected(List(nbc5_2,Order));
[ [ 8, 507 ], [ 16, 1030 ], [ 32, 700 ], [ 64, 247 ], [ 128, 61 ], [ 256, 4 ] ]
gap> ns5_2:=Filtered(nbc5_2,x->H2nrM(x).H2nrM<>[]);; # computing H2nr(G,M)
gap> ns5_2i:=List(ns5_2,CaratZClassNumber);
[ [ 5, 39, 5 ], [ 5, 63, 12 ], [ 5, 65, 12 ], [ 5, 71, 19 ], [ 5, 73, 37 ],
  [ 5, 76, 31 ], [ 5, 76, 49 ], [ 5, 76, 50 ], [ 5, 76, 51 ], [ 5, 79, 18 ],
  [ 5, 99, 5 ], [ 5, 99, 23 ], [ 5, 99, 24 ], [ 5, 99, 25 ], [ 5, 100, 5 ],
  [ 5, 100, 11 ], [ 5, 100, 12 ], [ 5, 100, 23 ], [ 5, 105, 5 ],
  [ 5, 109, 5 ], [ 5, 116, 20 ], [ 5, 118, 18 ], [ 5, 119, 4 ],
  [ 5, 140, 23 ], [ 5, 142, 14 ], [ 5, 664, 1 ], [ 5, 664, 2 ],
  [ 5, 672, 1 ], [ 5, 672, 2 ], [ 5, 673, 1 ], [ 5, 673, 2 ], [ 5, 674, 1 ],
  [ 5, 675, 1 ], [ 5, 704, 3 ], [ 5, 706, 8 ], [ 5, 721, 1 ], [ 5, 721, 2 ],
  [ 5, 773, 3 ], [ 5, 773, 4 ], [ 5, 774, 3 ], [ 5, 774, 4 ] ]
gap> Collected(List(ns5_2,Order));
[ [ 8, 15 ], [ 16, 20 ], [ 32, 6 ] ]
gap> List(ns5_2,StructureDescription);
[ "D8", "D8", "D8", "C2 x D8", "C2 x D8", "C2 x D8", "C2 x D8", "C2 x D8",
  "C2 x D8", "C2 x D8", "D8", "D8", "D8", "D8", "D8", "D8", "D8", "D8",
  "C4 : C4", "(C4 x C2) : C2", "(C4 x C2) : C2", "(C4 x C2) : C2", "C2 x D8",
  "(C4 x C2 x C2) : C2", "(C2 x C2 x C2 x C2) : C2", "C2 x Q8", "C2 x Q8",
  "QD16", "QD16", "QD16", "QD16", "QD16", "QD16", "((C4 x C2) : C2) : C2",
  "((C4 x C2) : C2) : C2", "C2 x QD16", "C2 x QD16", "Q8", "Q8", "Q8", "Q8" ]
gap> List(ns5_2,IdSmallGroup);
[ [ 8, 3 ], [ 8, 3 ], [ 8, 3 ], [ 16, 11 ], [ 16, 11 ], [ 16, 11 ],
  [ 16, 11 ], [ 16, 11 ], [ 16, 11 ], [ 16, 11 ], [ 8, 3 ], [ 8, 3 ],
  [ 8, 3 ], [ 8, 3 ], [ 8, 3 ], [ 8, 3 ], [ 8, 3 ], [ 8, 3 ], [ 16, 4 ],
  [ 16, 3 ], [ 16, 3 ], [ 16, 3 ], [ 16, 11 ], [ 32, 28 ], [ 32, 27 ],
  [ 16, 12 ], [ 16, 12 ], [ 16, 8 ], [ 16, 8 ], [ 16, 8 ], [ 16, 8 ],
  [ 16, 8 ], [ 16, 8 ], [ 32, 6 ], [ 32, 6 ], [ 32, 40 ], [ 32, 40 ],
  [ 8, 4 ], [ 8, 4 ], [ 8, 4 ], [ 8, 4 ] ]

# Step 2
gap> nbc5_8m:=Filtered(GL5Z,x->Order(x) mod 16=8 and Order(x)>8
> and not IsBicyclic(x)); # |G|=8m
gap> Collected(List(nbc5_8m,Order));
[ [ 24, 663 ], [ 40, 15 ], [ 72, 249 ], [ 120, 32 ], [ 360, 4 ] ]
gap> nbc5_8m_2:=Filtered(nbc5_8m,
> x->CaratZClassNumber(SylowSubgroup(x,2)) in ns5_2i);;
gap> Collected(List(nbc5_8m_2,x->CaratZClass(SylowSubgroup(x,2))));
[ [ [ 5, 773, 3 ], 5 ], [ [ 5, 773, 4 ], 1 ], [ [ 5, 774, 3 ], 1 ] ]
gap> Collected(List(nbc5_8m_2,Order));
[ [ 24, 6 ], [ 72, 1 ] ]
gap> ns5_8m:=Filtered(nbc5_8m_2,x->H2nrM(x).H2nrM<>[]); # computing H2nr(G,M)
[ <matrix group of size 24 with 2 generators> ]
gap> ns5_8mi:=List(ns5_8m,CaratZClassNumber);
[ [ 5, 691, 1 ] ]
gap> List(ns5_8m,Order);
[ 24 ]
gap> List(ns5_8m,StructureDescription);
[ "SL(2,3)" ]
gap> List(ns5_8m,x->CaratZClass(SylowSubgroup(x,2)));
[ [ 5, 773, 3 ] ]

gap> nbc5_16m:=Filtered(GL5Z,x->Order(x) mod 32=16 and Order(x)>16
> and not IsBicyclic(x)); # |G|=16m
gap> Collected(List(nbc5_16m,Order));
[ [ 48, 714 ], [ 80, 5 ], [ 144, 185 ], [ 240, 20 ], [ 720, 12 ] ]
gap> nbc5_16m_2:=Filtered(nbc5_16m,
> x->CaratZClassNumber(SylowSubgroup(x,2)) in ns5_2i);;
gap> Collected(List(nbc5_16m_2,x->CaratZClass(SylowSubgroup(x,2))));
[ [ [ 5, 664, 1 ], 5 ], [ [ 5, 664, 2 ], 1 ], [ [ 5, 672, 1 ], 5 ],
  [ [ 5, 672, 2 ], 1 ], [ [ 5, 673, 1 ], 5 ], [ [ 5, 673, 2 ], 1 ],
  [ [ 5, 674, 1 ], 1 ], [ [ 5, 675, 1 ], 1 ] ]
gap> Collected(List(nbc5_16m_2,Order));
[ [ 48, 17 ], [ 144, 3 ] ]
gap> ns5_16m:=Filtered(nbc5_16m_2,x->H2nrM(x).H2nrM<>[]); # computing H2nr(G,M)
[ <matrix group of size 48 with 2 generators>,
  <matrix group of size 48 with 2 generators>,
  <matrix group of size 48 with 2 generators> ]
gap> ns5_16mi:=List(ns5_16m,CaratZClassNumber);
[ [ 5, 730, 1 ], [ 5, 733, 1 ], [ 5, 734, 1 ] ]
gap> List(ns5_16m,Order);
[ 48, 48, 48 ]
gap> List(ns5_16m,StructureDescription);
[ "C2 x SL(2,3)", "GL(2,3)", "GL(2,3)" ]
gap> List(ns5_16m,x->CaratZClass(SylowSubgroup(x,2)));
[ [ 5, 664, 1 ], [ 5, 673, 1 ], [ 5, 672, 1 ] ]
gap> nbc5_32m:=Filtered(GL5Z,x->Order(x) mod 64=32 and Order(x)>32
> and not IsBicyclic(x)); # |G|=32m
gap> Collected(List(nbc5_32m,Order));
[ [ 96, 336 ], [ 160, 9 ], [ 288, 63 ], [ 480, 2 ], [ 1440, 4 ] ]
gap> nbc5_32m_2:=Filtered(nbc5_32m,
> x->CaratZClassNumber(SylowSubgroup(x,2)) in ns5_2i);;
gap> Collected(List(nbc5_32m_2,x->CaratZClass(SylowSubgroup(x,2))));
[ [ [ 5, 721, 1 ], 5 ], [ [ 5, 721, 2 ], 1 ] ]
gap> Collected(List(nbc5_32m_2,Order));
[ [ 96, 5 ], [ 288, 1 ] ]
gap> ns5_32m:=Filtered(nbc5_32m_2,x->H2nrM(x).H2nrM<>[]); # computing H2nr(G,M)
[ <matrix group of size 96 with 2 generators> ]
gap> ns5_32mi:=List(ns5_32m,CaratZClassNumber);
[ [ 5, 776, 1 ] ]
gap> List(ns5_32m,Order);
[ 96 ]
gap> List(ns5_32m,StructureDescription);
[ "C2 x GL(2,3)" ]
gap> List(ns5_32m,x->CaratZClass(SylowSubgroup(x,2)));
[ [ 5, 721, 1 ] ]
gap> ns5:=Union(ns5_2i,ns5_8mi,ns5_16mi,ns5_32mi);
[ [ 5, 39, 5 ], [ 5, 63, 12 ], [ 5, 65, 12 ], [ 5, 71, 19 ], [ 5, 73, 37 ],
  [ 5, 76, 31 ], [ 5, 76, 49 ], [ 5, 76, 50 ], [ 5, 76, 51 ], [ 5, 79, 18 ],
  [ 5, 99, 5 ], [ 5, 99, 23 ], [ 5, 99, 24 ], [ 5, 99, 25 ], [ 5, 100, 5 ],
  [ 5, 100, 11 ], [ 5, 100, 12 ], [ 5, 100, 23 ], [ 5, 105, 5 ],
  [ 5, 109, 5 ], [ 5, 116, 20 ], [ 5, 118, 18 ], [ 5, 119, 4 ],
  [ 5, 140, 23 ], [ 5, 142, 14 ], [ 5, 664, 1 ], [ 5, 664, 2 ],
  [ 5, 672, 1 ], [ 5, 672, 2 ], [ 5, 673, 1 ], [ 5, 673, 2 ], [ 5, 674, 1 ],
  [ 5, 675, 1 ], [ 5, 691, 1 ], [ 5, 704, 3 ], [ 5, 706, 8 ], [ 5, 721, 1 ],
  [ 5, 721, 2 ], [ 5, 730, 1 ], [ 5, 733, 1 ], [ 5, 734, 1 ], [ 5, 773, 3 ],
  [ 5, 773, 4 ], [ 5, 774, 3 ], [ 5, 774, 4 ], [ 5, 776, 1 ] ]
gap> Length(ns5);
46

# Step 3
gap> NS5:=Intersection(ns5,e5);
[ [ 5, 39, 5 ], [ 5, 71, 19 ], [ 5, 73, 37 ], [ 5, 76, 49 ], [ 5, 76, 50 ],
  [ 5, 76, 51 ], [ 5, 79, 18 ], [ 5, 99, 23 ], [ 5, 99, 24 ], [ 5, 99, 25 ],
  [ 5, 100, 12 ], [ 5, 100, 23 ], [ 5, 105, 5 ], [ 5, 109, 5 ],
  [ 5, 116, 20 ], [ 5, 118, 18 ], [ 5, 119, 4 ], [ 5, 140, 23 ],
  [ 5, 142, 14 ], [ 5, 664, 2 ], [ 5, 672, 2 ], [ 5, 673, 2 ], [ 5, 704, 3 ],
  [ 5, 706, 8 ], [ 5, 721, 2 ], [ 5, 773, 4 ], [ 5, 774, 4 ] ]
gap> Length(NS5);
27
gap> List(NS5,x->H2nrM(CaratMatGroupZClass(x[1],x[2],x[3])).H2nrM);
[ [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2 ] ]
gap> NS41:=Intersection(ns5,e41);
[ [ 5, 63, 12 ], [ 5, 65, 12 ], [ 5, 76, 31 ], [ 5, 99, 5 ], [ 5, 100, 5 ],
  [ 5, 664, 1 ], [ 5, 672, 1 ], [ 5, 673, 1 ], [ 5, 674, 1 ], [ 5, 675, 1 ],
  [ 5, 691, 1 ], [ 5, 721, 1 ], [ 5, 730, 1 ], [ 5, 733, 1 ], [ 5, 734, 1 ],
  [ 5, 773, 3 ], [ 5, 774, 3 ], [ 5, 776, 1 ] ]
gap> Length(NS41);
18
gap> List(NS41,x->H2nrM(CaratMatGroupZClass(x[1],x[2],x[3])).H2nrM);
[ [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ] ]
gap> NS32:=Intersection(ns5,e32);
[ [ 5, 100, 11 ] ]
gap> Length(NS32);
1
gap> List(NS32,x->H2nrM(CaratMatGroupZClass(x[1],x[2],x[3])).H2nrM);
[ [ 2 ] ]
gap> Union(NS5,NS41,NS32)=ns5;
true
gap> List([NS5,NS41,NS32],Length);
[ 27, 18, 1 ]
gap> CaratZClassNumber(DirectProductMatrixGroup(
> [MatGroupZClass(4,12,4,12),Group([[[1]]])]));
[ 5, 99, 5 ]
gap> CaratZClassNumber(DirectProductMatrixGroup(
> [MatGroupZClass(4,12,4,12),Group([[[-1]]])]));
[ 5, 76, 31 ]
gap> M1:=DirectProductMatrixGroup([MatGroupZClass(4,12,4,12),Group([[[-1]]])]);
<matrix group with 3 generators>
gap> Filtered(List(ConjugacyClassesSubgroups(M1),Representative),
> x->Order(PartialMatrixGroup(x,[1..4]))=8);
[ <matrix group of size 8 with 3 generators>,
  <matrix group of size 8 with 3 generators>,
  <matrix group of size 8 with 3 generators>,
  <matrix group of size 8 with 3 generators>,
  <matrix group of size 16 with 4 generators> ]
gap> Set(last,CaratZClassNumber);
[ [ 5, 63, 12 ], [ 5, 65, 12 ], [ 5, 76, 31 ], [ 5, 99, 5 ], [ 5, 100, 5 ] ]
gap> CaratZClassNumber(DirectProductMatrixGroup(
> [MatGroupZClass(4,32,1,2),Group([[[1]]])]));
[ 5, 773, 3 ]
gap> CaratZClassNumber(DirectProductMatrixGroup(
> [MatGroupZClass(4,32,1,2),Group([[[-1]]])]));
[ 5, 664, 1 ]
gap> M2:=DirectProductMatrixGroup([MatGroupZClass(4,32,1,2),Group([[[-1]]])]);
<matrix group with 3 generators>
gap> Filtered(List(ConjugacyClassesSubgroups(M2),Representative),
> x->Order(PartialMatrixGroup(x,[1..4]))=8);
[ <matrix group of size 8 with 3 generators>,
  <matrix group of size 8 with 3 generators>,
  <matrix group of size 8 with 3 generators>,
  <matrix group of size 8 with 3 generators>,
  <matrix group of size 16 with 4 generators> ]
gap> Set(last,CaratZClassNumber);
[ [ 5, 664, 1 ], [ 5, 773, 3 ], [ 5, 774, 3 ] ]
gap> CaratZClassNumber(DirectProductMatrixGroup(
> [MatGroupZClass(4,32,3,2),Group([[[1]]])]));
[ 5, 672, 1 ]
gap> CaratZClassNumber(DirectProductMatrixGroup(
> [MatGroupZClass(4,32,3,2),Group([[[-1]]])]));
[ 5, 721, 1 ]
gap> M3:=DirectProductMatrixGroup([MatGroupZClass(4,32,3,2),Group([[[-1]]])]);
<matrix group with 3 generators>
gap> Filtered(List(ConjugacyClassesSubgroups(M3),Representative),
> x->Order(PartialMatrixGroup(x,[1..4]))=16);
[ <matrix group of size 16 with 4 generators>,
  <matrix group of size 16 with 4 generators>,
  <matrix group of size 16 with 4 generators>,
  <matrix group of size 16 with 4 generators>,
  <matrix group of size 32 with 5 generators> ]
gap> Set(last,CaratZClassNumber);
[ [ 5, 672, 1 ], [ 5, 673, 1 ], [ 5, 674, 1 ], [ 5, 675, 1 ], [ 5, 721, 1 ] ]
gap> CaratZClassNumber(DirectProductMatrixGroup(
> [MatGroupZClass(4,33,3,1),Group([[[1]]])]));
[ 5, 691, 1 ]
gap> CaratZClassNumber(DirectProductMatrixGroup(
> [MatGroupZClass(4,33,3,1),Group([[[-1]]])]));
[ 5, 730, 1 ]
gap> M4:=DirectProductMatrixGroup([MatGroupZClass(4,33,3,1),Group([[[-1]]])]);
<matrix group with 4 generators>
gap> Filtered(List(ConjugacyClassesSubgroups(M4),Representative),
> x->Order(PartialMatrixGroup(x,[1..4]))=24);
[ <matrix group of size 24 with 4 generators>,
  <matrix group of size 48 with 5 generators> ]
gap> Set(last,CaratZClassNumber);
[ [ 5, 691, 1 ], [ 5, 730, 1 ] ]
gap> CaratZClassNumber(DirectProductMatrixGroup(
> [MatGroupZClass(4,33,6,1),Group([[[1]]])]));
[ 5, 734, 1 ]
gap> CaratZClassNumber(DirectProductMatrixGroup(
> [MatGroupZClass(4,33,6,1),Group([[[-1]]])]));
[ 5, 776, 1 ]
gap> M5:=DirectProductMatrixGroup([MatGroupZClass(4,33,6,1),Group([[[-1]]])]);
<matrix group with 5 generators>
gap> Filtered(List(ConjugacyClassesSubgroups(M5),Representative),
> x->Order(PartialMatrixGroup(x,[1..4]))=48);
[ <matrix group of size 48 with 5 generators>,
  <matrix group of size 48 with 5 generators>,
  <matrix group of size 96 with 6 generators> ]
gap> Set(last,CaratZClassNumber);
[ [ 5, 733, 1 ], [ 5, 734, 1 ], [ 5, 776, 1 ] ]
gap> G:=CaratMatGroupZClass(5,100,11);
<matrix group with 2 generators>
gap> Display(G.1);
[ [   0,   1,   0,   0,   0 ],
  [   1,   0,   0,   0,   0 ],
  [   0,   0,   0,   0,   1 ],
  [   0,   0,   0,  -1,   0 ],
  [   0,   0,   1,   0,   0 ] ]
gap> Display(G.2);
[ [   1,   0,   0,   0,   0 ],
  [   0,  -1,   0,   0,   0 ],
  [   0,   0,   0,   1,  -1 ],
  [   0,   0,   0,  -1,   0 ],
  [   0,   0,  -1,  -1,   0 ] ]
gap> G1:=PartialMatrixGroup(G,[1,2]);
Group([ [ [ 0, 1 ], [ 1, 0 ] ], [ [ 1, 0 ], [ 0, -1 ] ] ])
gap> G2:=PartialMatrixGroup(G,[3,4,5]);
Group([ [ [ 0, 0, 1 ], [ 0, -1, 0 ], [ 1, 0, 0 ] ],
  [ [ 0, 1, -1 ], [ 0, -1, 0 ], [ -1, -1, 0 ] ] ])
gap> CrystCatZClassNumber(G1);
[ 2, 3, 2, 1 ]
gap> CrystCatZClassNumber(G2);
[ 3, 3, 1, 3 ]
gap> StructureDescription(G1);
"D8"
gap> StructureDescription(G2);
"C2 x C2"
gap> [3,3,1,3] in N3;
true

# Step 4
gap> LoadPackage("HAP");
true
gap> GL5Q:=List([1..955],x->CaratMatGroupZClass(5,x,1));;
gap> nb5:=Filtered(GL5Q,x->BogomolovMultiplier(x)<>[]);
[  ]
\end{verbatim}

\vspace*{2mm}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
{\it Proof of Theorem \ref{thm3}.}\vspace*{2mm}

\medskip
Step 1.
It is not difficult to show that, if $G$ is a finite $p$-group in $GL_6(\bm{Z})$, then $p=2, 3, 5$ or $7$.

Because the maximal $5$-subgroup $G_5$ (resp. $7$-subgroup $G_7$)
of $GL_6(\bm{Z})$ is of order $5$ (resp. $7$) and hence
${\rm Br}_u(\bm{C}(M)^{G_p})=0$.

We should check $2$-groups $G$ with $|G|\geq 8$
and $3$-groups $G$ with $|G|\geq 27$ which are not bicyclic.

Note that the maximal order of a $2$-group in $GL_6(\bm{Z})$ is $2^{10}$, and the maximal order of a $3$-group in $GL_6(\bm{Z})$ is $81$.

The total numbers of non-bicyclic subgroups $G$ in $GL_6(\bm{Z})$ of order
$2^i$ where $3 \le i \le 10$ are : $2708$, $11198$, $14261$, $8290$, $3008$, $868$, $128$, $4$ respectively (in the order $i=3$ to $i=10$). The number of non-bicyclic subgroups $G$ in $GL_6(\bm{Z})$ of order
$27$ is $10$, while the number for those of order $81$ is $3$.

Applying the function {\tt H2nrM(G)} to the above groups, we find that exactly $2$ (resp. $0$) groups $G$ of order $27$ (resp. $81$) satisfy $H_u^2(G,M)\neq 0$. Similarly, we find that exactly $895$ groups which are $2$-groups of order $\le 256$ and satisfying that $H_u^2(G,M)\neq 0$; more precisely, the numbers of such groups of order $2^i$ where $3 \le i \le 8$ are $96$, $346$, $347$, $95$, $11$, $0$ respectively. We may also apply the function {\tt H2nrM(G)} to groups of order $2^9= 512$ or $2^{10}= 1024$, but it takes very long computation time and requires huge memory sources for a personal computer. Thus we take a detour for these groups.

In the following we will show that there is no non-bicyclic groups of order $512$ or $1024$ satisfying that $H_u^2(G,M)\neq 0$.

\medskip
We consider the case $G$ is of order $2^9=512$ first. There are $128$ such groups in total.

Case 1.1 It is possible that we can choose a subgroup $N$ of $G$ satisfying the conditions : (i) $[G:N]=2$ and $M^N=0$, (ii) the cohomology group $H^1(N,M)$ is an elementary abelian $2$-group (thus it may be regarded as a finite-dimensional vector space over the finite field $\bm{F}_2$ with $G/N \simeq C_2$ acting on $H^1(N,M)$), and (iii) the Jordan normal form of the generator of $G/N$ acting on $H^1(N,M)$ consists of a direct sum of several copies of the block
$(\begin{smallmatrix}1&1\\0&1\end{smallmatrix})$. We remark that there are $60$ groups with the above properties.


By Theorem \ref{thDHW} we have
the isomorphisms $H^1(G,M)\simeq H^1(N,M)^{G/N}$ and
$H^2(G,M)_1=\fn{Ker}(H^2(G,M)\xrightarrow{\rm res}H^2(N,M))\simeq H^1(G/N,H^1(N,M))$. Since the Jordan normal form of the generator of $G/N$ acting on $H^1(N,M)$ is of the required form, it follows that dim$_{\bm{F}_2} H^1(N,M)= 2 \cdot$dim$_{\bm{F}_2} H^1(G,M)$ (remember that $H^1(G,M)\simeq H^1(N,M)^{G/N}$).

By a straight-forward computation, we find $H^1(G/N,H^1(N,M))=0$. From $H^2(G,M)_1 \simeq H^1(G/N,H^1(N,M))$, we find that $H^2(G,M)_1=0$, i.e. the restriction map $H^2(G, M) \to H^2(N, M)$ is injective. It follows that the restriction map $H_u^2(G,M) \to H_u^2(N, M)$ is also injective.

On the other hand, if $N$ is of order $2^8$, we have shown that $H_u^2(N, M)= 0$. Thus $H_u^2(G,M)=0$.


Case 1.2. $G$ doesn't satisfy the conditions in Case 1.1. There are $68$ such groups.

We apply the function {\tt H2nrM(G)} to these groups. Fortunately the GAP computation is feasible for these groups. We find that $H_u^2(G,M)=0$.

\medskip
Now consider groups $G$ with order $2^{10}=1024$. There are only 4 such groups.

We search the index 2 subgroup $N$ of $G$ as in Case 1.1. Two groups $G$ possess the required properties. We proceed as in Case 1.1 and finish the proof. For the remaining two groups $G$, just apply the function {\tt H2nrM(G)} to them, because the GAP computation is feasible.

\medskip
In summary, the total number of non-bicyclic $2$-groups (resp. $3$-groups) in $GL_6(\bm{Z})$ satisfying that $H_u^2(G,M)\neq 0$ is $895$ (resp. $2$).

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\medskip
Step 2. Let $G$ be a finite group in $GL_6(\bm{Z})$ which is not a $p$-group. As before, we should check whether the $2$-Sylow subgroup $G_2$ (resp. $3$-Sylow subgroup $G_3$) of $G$
is one of the $895$ (resp. $2$) groups obtained in Step 1.
%assume that $|G|=8m$ or $16m$
%where $m$ is odd integer.

Using {\tt H2nrM(G)} for groups $G$ of order $27m'$ ($m' = 2^d$ is some integer $d$),
we get $H_u^2(G,M)=0$ except for $2$ groups
$G$ of the CARAT ID $(6,2899,3)$, $(6,2899,5)$ ; these two groups are isomorphic to $(C_9\rtimes C_3)\rtimes C_2$ as abstract groups.

\medskip
Next applying {\tt H2nrM(G)} to groups $G$
of order $8m$ (resp. $16m$, $128m$), where $m$ is an odd integer $\ge 3$, we have
$H_u^2(G,M)=0$ except for $35$ (resp. $58$, $1$) groups $G$. Note that there is no group of order $256m$ where $m \ge 3$ is an odd integer.

For the case where $|G|=32m$, $64m$, we need
additional argument treated below (as in Step 1 due to the computational feasibility again).

We treat the situation that $|G|=32m$ ($m \ge 3$ is an odd integer) first.

There are $10216$ such groups (i.e. $10216$ $\bZ$-classes) and $9$ possibilities for the group orders of $G$. Check $2$-Sylow subgroups of these groups and use the results in Step 1. We find that, if $G$ is a ``possibly bad" group, then the order of $G$ should be $32 \cdot 3$, $32 \cdot 9$, $32 \cdot 27$, $32 \cdot 81$. Although groups of order $32 \cdot 27$ have been treated above, we will check it once again.

Case 2.1. $27 \mid |G|$, i.e. $|G|=32 \cdot 27$ or $32 \cdot 81$.

By similar technique as in Case 1.1, We can find a subgroup $N$ of $G$ with index $[G:N]=2$
which satisfies (i) $M^N=0$ and (ii) $H^1(N,M)=0$ or $\bZ/3\bZ$.
Applying Theorem \ref{thDHW},
we have
$H^2(G,M)_1={\rm Ker}(H^2(G,M)\xrightarrow{\rm res}H^2(N,M))
\simeq H^1(G/N,H^1(N,M))$.
However the latter group is zero because $\gcd(|G/N|,|H^1(N,M)|)=1$.
This implies $H_u^2(G,M)=0$ (see also Step 1).

Case 2.2. $27$ ${\not|}$ $|G|$, i.e. $|G|=32 \cdot 3$ or $32 \cdot 9$.

We simply apply {\tt H2nrM(G)} and obtain the result $H_u^2(G,M)$. Then there are precisely $46$ groups with non-trivial $H_u^2(G,M)$ : the number of groups of order $32 \cdot 3$ is $39$, and the number of groups of order $32 \cdot 9$ is $7$.

\medskip

Now for the case $|G|=64m$ ($m \ge 3$ is an odd integer). The proof is almost the same as the situation $|G|=32m$.

In short, if $|G|=64m$ ($m \ge 3$ is an odd integer), then there are $5107$ such groups (i.e. $5107$ $\bZ$-classes). Check $2$-Sylow subgroups of these groups and use the results in Step 1. We find that, if $G$ is a ``possibly bad" group, then the order of $G$ should be $64 \cdot 3$, $64 \cdot 9$ or $64 \cdot 27$. Groups of order $64 \cdot 27$ have been treated before and we know that $H_u^2(G,M)=0$. For groups of order $64 \cdot 3$ or $64 \cdot 9$, apply {\tt H2nrM(G)}. Then there are precisely $12$ groups with non-trivial $H_u^2(G,M)$ : the number of groups of order $64 \cdot 3$ is $11$, and the number of groups of order $64 \cdot 9$ is $1$.


\medskip
In summary, the total number of groups $G$ with $H_u^2(G,M)\neq 0$
and are of order $24$, $48$, $54$, $72$, $96$, $144$, $192$, $288$, $384$, $576$ is: $34$, $51$, $2$, $1$, $39$, $7$, $11$, $7$, $1$, $1$ respectively. In other words, we find exactly $154$ non-$p$-groups $G$ satisfying that  $H_u^2(G,M)\neq 0$.
It follows that there are, in total, $1051$ $(=897+154)$ subgroups $G$ in $GL_6(\bm{Z})$ with $H_u^2(G,M)\neq 0$.

\medskip
Step 3.
Using the function {\tt LatticeDecompositions(n)} provided by \cite[Section 4.1]{HY} (also see Step 2 in the proof of Theorem \ref{thm2}), we find that, among the $1051$ lattices in Step 2, the numbers of lattices are $603$ (indecomposable lattices), $161$ (decomposable into $5+1$), $218$ (decomposable into $4+2$), $59$ (decomposable into $4+1+1$), $5$ (decomposable into $3+3$), $5$ (decomposable into $3+2+1$).

\medskip
Step 4.
We can check whether $H_u^2(G,\bm{Q}/\bm{Z})=0$
using the function {\tt B0G(G)}
in the program b0g.g by Moravec \cite{Mo} or the function
{\tt BogomolovMultiplier(G)} in HAP \cite{HAP}
(see also Step 4 in the proof of Theorem \ref{thm1}).
We see that $H_u^2(G,\bm{Q}/\bm{Z})\neq 0$ if and only if
CARAT ID of $G$ is one of the $24$
$(6,6458,i)$, $(6,6459,i)$, $(6,6464,i)$ $(1\leq i\leq 8)$.
The corresponding $G$-lattice $M$ is indecomposable
(resp. decomposable into indecomposable component with rank $4+2$)
for $i=2,4,6,8$ (resp. $i=1,3,5,7$).
{}From Steps 1--3, we find that
these $24$ $G$-lattices $M$ satisfy $H_u^2(G,M)=0$
except for the two groups whose CARAT ID are $(4,6459,8)$, $(4,6464,6)$ (with $H_u^2(G,M)=\bm{Z}/2\bm{Z}$ for both groups).

We conclude that there exist $1073$ $(=1051+24-2)$
subgroups $G$ of $GL_6(\bm{Z})$ with ${\rm Br}_u(\bm{C}(M)^G)\neq 0$ where the $1051$ groups are those obtained in Step 2, the $24$ groups are obtained in this step while $2$ groups correspond to the groups with CARAT ID $(4,6459,8)$ and $(4,6464,6)$ respectively.
\vspace*{2mm}

\begin{verbatim}
# Step 1
gap> GL6Z:=Flat(List([1..7103],x->List([1..CaratNrZClasses(6,x)],
> y->CaratMatGroupZClass(6,x,y))));;
gap> o6:=List(GL6Z,Order);;
gap> Collected(Factors(Lcm(o6)));
[ [ 2, 10 ], [ 3, 4 ], [ 5, 1 ], [ 7, 1 ] ]

gap> nbc6_3:=Filtered(GL6Z,x->3^4 mod Order(x)=0
> and not IsBicyclic(x));; # |G|=3^n
gap> Length(nbc6_3);
13
gap> Collected(List(nbc6_3,Order));
[ [ 27, 10 ], [ 81, 3 ] ]
gap> ns6_3:=Filtered(nbc6_3,x->H2nrM(x).H2nrM<>[]);; # computing H2nr(G,M)
gap> Length(ns6_3);
2
gap> ns6_3i:=List(ns6_3,CaratZClassNumber);
[ [ 6, 2865, 1 ], [ 6, 2865, 3 ] ]
gap> List(ns6_3,Order);
[ 27, 27 ]
gap> Collected(last);
[ [ 27, 2 ] ]
gap> List(ns6_3,StructureDescription);
[ "C9 : C3", "C9 : C3" ]

gap> nbc6_2:=Filtered(GL6Z,x->2^10 mod Order(x)=0
> and not IsBicyclic(x));; # |G|=2^n
gap> Length(nbc6_2);
40465
gap> Collected(List(nbc6_2,Order));
[ [ 8, 2708 ], [ 16, 11198 ], [ 32, 14261 ], [ 64, 8290 ], [ 128, 3008 ],
  [ 256, 868 ], [ 512, 128 ], [ 1024, 4 ] ]
gap> nbc6_8:=Filtered(nbc6_2,x->Order(x)=8);; # |G|=8
gap> nbc6_16:=Filtered(nbc6_2,x->Order(x)=16);; # |G|=16
gap> nbc6_32:=Filtered(nbc6_2,x->Order(x)=32);; # |G|=32
gap> nbc6_64:=Filtered(nbc6_2,x->Order(x)=64);; # |G|=64
gap> nbc6_128:=Filtered(nbc6_2,x->Order(x)=128);; # |G|=128
gap> nbc6_256:=Filtered(nbc6_2,x->Order(x)=256);; # |G|=256
gap> nbc6_512:=Filtered(nbc6_2,x->Order(x)=512);; # |G|=512
gap> nbc6_1024:=Filtered(nbc6_2,x->Order(x)=1024);; # |G|=1024

gap> ns6_8:=Filtered(nbc6_8,x->H2nrM(x).H2nrM<>[]);; # |G|=8
gap> Length(ns6_8);
96
gap> ns6_8i:=List(ns6_8,CaratZClassNumber);
[ [ 6, 4682, 3 ], [ 6, 4691, 4 ], [ 6, 4691, 10 ], [ 6, 4691, 11 ],
  [ 6, 4691, 18 ], [ 6, 4691, 26 ], [ 6, 4692, 5 ], [ 6, 4692, 11 ],
  [ 6, 4692, 13 ], [ 6, 4732, 5 ], [ 6, 4735, 5 ], [ 6, 4749, 5 ],
  [ 6, 4749, 10 ], [ 6, 4809, 8 ], [ 6, 4809, 11 ], [ 6, 4809, 12 ],
  [ 6, 4809, 19 ], [ 6, 4809, 28 ], [ 6, 4809, 31 ], [ 6, 4809, 32 ],
  [ 6, 4809, 46 ], [ 6, 4809, 52 ], [ 6, 4809, 53 ], [ 6, 4809, 64 ],
  [ 6, 4809, 69 ], [ 6, 4810, 8 ], [ 6, 4810, 19 ], [ 6, 4810, 22 ],
  [ 6, 4810, 25 ], [ 6, 4810, 31 ], [ 6, 4810, 32 ], [ 6, 4812, 8 ],
  [ 6, 4812, 19 ], [ 6, 4812, 22 ], [ 6, 4812, 25 ], [ 6, 4812, 31 ],
  [ 6, 4812, 32 ], [ 6, 4813, 8 ], [ 6, 4813, 11 ], [ 6, 4813, 12 ],
  [ 6, 4813, 19 ], [ 6, 4813, 28 ], [ 6, 4813, 31 ], [ 6, 4813, 32 ],
  [ 6, 4814, 5 ], [ 6, 4814, 23 ], [ 6, 4814, 24 ], [ 6, 4814, 25 ],
  [ 6, 4814, 39 ], [ 6, 4892, 8 ], [ 6, 4892, 22 ], [ 6, 4892, 23 ],
  [ 6, 4892, 41 ], [ 6, 4892, 47 ], [ 6, 4892, 48 ], [ 6, 4892, 51 ],
  [ 6, 4892, 57 ], [ 6, 4892, 58 ], [ 6, 4892, 61 ], [ 6, 4892, 67 ],
  [ 6, 4892, 68 ], [ 6, 4892, 83 ], [ 6, 4892, 86 ], [ 6, 4892, 87 ],
  [ 6, 4892, 88 ], [ 6, 4892, 89 ], [ 6, 4892, 95 ], [ 6, 4892, 96 ],
  [ 6, 4892, 102 ], [ 6, 4892, 103 ], [ 6, 4892, 107 ], [ 6, 4892, 108 ],
  [ 6, 4892, 114 ], [ 6, 4892, 115 ], [ 6, 4892, 141 ], [ 6, 4892, 154 ],
  [ 6, 4892, 163 ], [ 6, 4892, 181 ], [ 6, 4892, 182 ], [ 6, 5750, 1 ],
  [ 6, 5750, 2 ], [ 6, 5750, 3 ], [ 6, 5751, 1 ], [ 6, 5751, 2 ],
  [ 6, 6100, 1 ], [ 6, 6100, 2 ], [ 6, 6100, 3 ], [ 6, 6100, 4 ],
  [ 6, 6100, 5 ], [ 6, 6100, 6 ], [ 6, 6100, 7 ], [ 6, 6101, 1 ],
  [ 6, 6101, 2 ], [ 6, 6101, 3 ], [ 6, 6101, 4 ], [ 6, 6101, 6 ] ]

gap> ns6_16:=Filtered(nbc6_16,x->H2nrM(x).H2nrM<>[]);; # |G|=16
gap> Length(ns6_16);
346
gap> ns6_16i:=List(ns6_16,CaratZClassNumber);
[ [ 6, 2322, 4 ], [ 6, 2323, 16 ], [ 6, 2326, 14 ], [ 6, 2332, 12 ],
  [ 6, 2336, 16 ], [ 6, 2400, 71 ], [ 6, 2400, 76 ], [ 6, 2400, 78 ],
  [ 6, 2400, 90 ], [ 6, 2400, 100 ], [ 6, 2400, 103 ], [ 6, 2400, 107 ],
  [ 6, 2400, 120 ], [ 6, 2401, 47 ], [ 6, 2401, 58 ], [ 6, 2401, 61 ],
  [ 6, 2401, 64 ], [ 6, 2402, 28 ], [ 6, 2402, 42 ], [ 6, 2403, 8 ],
  [ 6, 2403, 13 ], [ 6, 2403, 17 ], [ 6, 2404, 27 ], [ 6, 2404, 30 ],
  [ 6, 2404, 31 ], [ 6, 2404, 38 ], [ 6, 2404, 53 ], [ 6, 2404, 56 ],
  [ 6, 2404, 65 ], [ 6, 2404, 77 ], [ 6, 2404, 78 ], [ 6, 2405, 39 ],
  [ 6, 2405, 47 ], [ 6, 2405, 49 ], [ 6, 2407, 5 ], [ 6, 2407, 10 ],
  [ 6, 2407, 12 ], [ 6, 2407, 24 ], [ 6, 2407, 34 ], [ 6, 2407, 38 ],
  [ 6, 2407, 47 ], [ 6, 2407, 62 ], [ 6, 2407, 63 ], [ 6, 2409, 35 ],
  [ 6, 2412, 35 ], [ 6, 2412, 53 ], [ 6, 2412, 61 ], [ 6, 2412, 63 ],
  [ 6, 2415, 10 ], [ 6, 2415, 16 ], [ 6, 2415, 22 ], [ 6, 2415, 24 ],
  [ 6, 2418, 10 ], [ 6, 2418, 11 ], [ 6, 2418, 12 ], [ 6, 2418, 16 ],
  [ 6, 2419, 10 ], [ 6, 2419, 16 ], [ 6, 2419, 22 ], [ 6, 2419, 24 ],
  [ 6, 2420, 32 ], [ 6, 2420, 37 ], [ 6, 2420, 39 ], [ 6, 2420, 51 ],
  [ 6, 2421, 5 ], [ 6, 2421, 10 ], [ 6, 2421, 12 ], [ 6, 2421, 24 ],
  [ 6, 2424, 5 ], [ 6, 2424, 11 ], [ 6, 2424, 12 ], [ 6, 2424, 23 ],
  [ 6, 2424, 42 ], [ 6, 2424, 43 ], [ 6, 2424, 57 ], [ 6, 2424, 58 ],
  [ 6, 2424, 59 ], [ 6, 2424, 63 ], [ 6, 2630, 4 ], [ 6, 2630, 30 ],
  [ 6, 2633, 2 ], [ 6, 2633, 7 ], [ 6, 2634, 2 ], [ 6, 2634, 6 ],
  [ 6, 2634, 12 ], [ 6, 2634, 15 ], [ 6, 2634, 20 ], [ 6, 4687, 10 ],
  [ 6, 4687, 19 ], [ 6, 4687, 20 ], [ 6, 4688, 16 ], [ 6, 4695, 3 ],
  [ 6, 4697, 9 ], [ 6, 4761, 8 ], [ 6, 4761, 19 ], [ 6, 4761, 22 ],
  [ 6, 4761, 25 ], [ 6, 4761, 31 ], [ 6, 4761, 32 ], [ 6, 4764, 8 ],
  [ 6, 4764, 19 ], [ 6, 4764, 22 ], [ 6, 4764, 25 ], [ 6, 4764, 31 ],
  [ 6, 4764, 32 ], [ 6, 4765, 65 ], [ 6, 4765, 78 ], [ 6, 4770, 62 ],
  [ 6, 4770, 74 ], [ 6, 4773, 19 ], [ 6, 4774, 23 ], [ 6, 4774, 39 ],
  [ 6, 4774, 57 ], [ 6, 4778, 47 ], [ 6, 4780, 5 ], [ 6, 4780, 23 ],
  [ 6, 4780, 24 ], [ 6, 4780, 25 ], [ 6, 4780, 39 ], [ 6, 4785, 16 ],
  [ 6, 4825, 16 ], [ 6, 4825, 28 ], [ 6, 4825, 36 ], [ 6, 4825, 42 ],
  [ 6, 4825, 44 ], [ 6, 4825, 54 ], [ 6, 4825, 55 ], [ 6, 4825, 56 ],
  [ 6, 4825, 70 ], [ 6, 4825, 71 ], [ 6, 4827, 10 ], [ 6, 4827, 31 ],
  [ 6, 4827, 51 ], [ 6, 4827, 60 ], [ 6, 4827, 97 ], [ 6, 4827, 98 ],
  [ 6, 4827, 99 ], [ 6, 4827, 100 ], [ 6, 4827, 101 ], [ 6, 4827, 102 ],
  [ 6, 4827, 103 ], [ 6, 4827, 128 ], [ 6, 4827, 129 ], [ 6, 4827, 130 ],
  [ 6, 4827, 150 ], [ 6, 4827, 151 ], [ 6, 4827, 152 ], [ 6, 4827, 156 ],
  [ 6, 4827, 157 ], [ 6, 4827, 158 ], [ 6, 4828, 10 ], [ 6, 4828, 11 ],
  [ 6, 4828, 12 ], [ 6, 4828, 31 ], [ 6, 4828, 97 ], [ 6, 4828, 98 ],
  [ 6, 4828, 99 ], [ 6, 4828, 100 ], [ 6, 4828, 101 ], [ 6, 4828, 102 ],
  [ 6, 4828, 103 ], [ 6, 4828, 104 ], [ 6, 4828, 105 ], [ 6, 4828, 106 ],
  [ 6, 4828, 107 ], [ 6, 4828, 108 ], [ 6, 4828, 109 ], [ 6, 4828, 110 ],
  [ 6, 4828, 111 ], [ 6, 4828, 112 ], [ 6, 4828, 113 ], [ 6, 4828, 114 ],
  [ 6, 4828, 115 ], [ 6, 4828, 116 ], [ 6, 4828, 117 ], [ 6, 4828, 128 ],
  [ 6, 4828, 129 ], [ 6, 4828, 130 ], [ 6, 4829, 31 ], [ 6, 4829, 128 ],
  [ 6, 4829, 129 ], [ 6, 4829, 130 ], [ 6, 4830, 31 ], [ 6, 4830, 78 ],
  [ 6, 4830, 106 ], [ 6, 4830, 109 ], [ 6, 4830, 110 ], [ 6, 4830, 129 ],
  [ 6, 4830, 130 ], [ 6, 4830, 140 ], [ 6, 4830, 143 ], [ 6, 4830, 158 ],
  [ 6, 4830, 230 ], [ 6, 4830, 280 ], [ 6, 4830, 281 ], [ 6, 4830, 324 ],
  [ 6, 4831, 31 ], [ 6, 4831, 54 ], [ 6, 4831, 106 ], [ 6, 4831, 107 ],
  [ 6, 4831, 108 ], [ 6, 4831, 129 ], [ 6, 4831, 130 ], [ 6, 4831, 146 ],
  [ 6, 4831, 152 ], [ 6, 4831, 155 ], [ 6, 4832, 178 ], [ 6, 4832, 207 ],
  [ 6, 4832, 213 ], [ 6, 4832, 219 ], [ 6, 4833, 5 ], [ 6, 4833, 43 ],
  [ 6, 4833, 44 ], [ 6, 4833, 45 ], [ 6, 4833, 46 ], [ 6, 4833, 47 ],
  [ 6, 4833, 48 ], [ 6, 4833, 49 ], [ 6, 4833, 63 ], [ 6, 4833, 77 ],
  [ 6, 4833, 103 ], [ 6, 4833, 104 ], [ 6, 4833, 106 ], [ 6, 4833, 107 ],
  [ 6, 4834, 152 ], [ 6, 4834, 215 ], [ 6, 4834, 216 ], [ 6, 4834, 217 ],
  [ 6, 4837, 12 ], [ 6, 4837, 34 ], [ 6, 4837, 43 ], [ 6, 4837, 51 ],
  [ 6, 4837, 58 ], [ 6, 4837, 61 ], [ 6, 4837, 62 ], [ 6, 4837, 65 ],
  [ 6, 4837, 70 ], [ 6, 4837, 75 ], [ 6, 4837, 94 ], [ 6, 4837, 99 ],
  [ 6, 4837, 102 ], [ 6, 4837, 108 ], [ 6, 4837, 123 ], [ 6, 4837, 126 ],
  [ 6, 4837, 181 ], [ 6, 4837, 194 ], [ 6, 4837, 195 ], [ 6, 4837, 235 ],
  [ 6, 4839, 130 ], [ 6, 4839, 152 ], [ 6, 4839, 161 ], [ 6, 4839, 166 ],
  [ 6, 4839, 169 ], [ 6, 4839, 176 ], [ 6, 4839, 180 ], [ 6, 4839, 183 ],
  [ 6, 4839, 188 ], [ 6, 4839, 193 ], [ 6, 4839, 213 ], [ 6, 4839, 216 ],
  [ 6, 4839, 222 ], [ 6, 4839, 225 ], [ 6, 4841, 51 ], [ 6, 4841, 75 ],
  [ 6, 4841, 77 ], [ 6, 4841, 102 ], [ 6, 5574, 11 ], [ 6, 5641, 1 ],
  [ 6, 5641, 2 ], [ 6, 5641, 3 ], [ 6, 5645, 3 ], [ 6, 5649, 1 ],
  [ 6, 5649, 2 ], [ 6, 5650, 1 ], [ 6, 5650, 2 ], [ 6, 5651, 1 ],
  [ 6, 5652, 1 ], [ 6, 5831, 1 ], [ 6, 5831, 2 ], [ 6, 5831, 3 ],
  [ 6, 5831, 4 ], [ 6, 5831, 5 ], [ 6, 5831, 6 ], [ 6, 5831, 7 ],
  [ 6, 5832, 1 ], [ 6, 5832, 2 ], [ 6, 5832, 3 ], [ 6, 5832, 4 ],
  [ 6, 5832, 5 ], [ 6, 5832, 6 ], [ 6, 5832, 7 ], [ 6, 5834, 9 ],
  [ 6, 5836, 4 ], [ 6, 5836, 10 ], [ 6, 5839, 1 ], [ 6, 5839, 2 ],
  [ 6, 5839, 3 ], [ 6, 5839, 4 ], [ 6, 5839, 5 ], [ 6, 5839, 6 ],
  [ 6, 5839, 7 ], [ 6, 5840, 1 ], [ 6, 5840, 4 ], [ 6, 5840, 5 ],
  [ 6, 5842, 10 ], [ 6, 5842, 12 ], [ 6, 5842, 13 ], [ 6, 5842, 24 ],
  [ 6, 5844, 9 ], [ 6, 5844, 13 ], [ 6, 5846, 23 ], [ 6, 5847, 17 ],
  [ 6, 5848, 1 ], [ 6, 5848, 2 ], [ 6, 5848, 4 ], [ 6, 5848, 5 ],
  [ 6, 5849, 1 ], [ 6, 5849, 2 ], [ 6, 5849, 4 ], [ 6, 5849, 5 ],
  [ 6, 5849, 11 ], [ 6, 5850, 1 ], [ 6, 5850, 2 ], [ 6, 5850, 4 ],
  [ 6, 5850, 5 ], [ 6, 5851, 1 ], [ 6, 5851, 2 ], [ 6, 5851, 4 ],
  [ 6, 5851, 5 ], [ 6, 5852, 1 ], [ 6, 5852, 2 ], [ 6, 5852, 3 ],
  [ 6, 5852, 4 ], [ 6, 5852, 5 ], [ 6, 5852, 6 ], [ 6, 6222, 2 ],
  [ 6, 6222, 5 ], [ 6, 6223, 3 ], [ 6, 6224, 1 ], [ 6, 6224, 2 ],
  [ 6, 6225, 1 ], [ 6, 6225, 2 ], [ 6, 6226, 1 ], [ 6, 6226, 2 ],
  [ 6, 6226, 4 ], [ 6, 6226, 5 ] ]

gap> ns6_32:=Filtered(nbc6_32,x->H2nrM(x).H2nrM<>[]);; # |G|=32
gap> Length(ns6_32);
347
gap> ns6_32i:=List(ns6_32,CaratZClassNumber);
[ [ 6, 2352, 23 ], [ 6, 2359, 19 ], [ 6, 2432, 38 ], [ 6, 2434, 60 ],
  [ 6, 2435, 65 ], [ 6, 2438, 66 ], [ 6, 2438, 71 ], [ 6, 2438, 75 ],
  [ 6, 2439, 47 ], [ 6, 2439, 58 ], [ 6, 2439, 61 ], [ 6, 2439, 64 ],
  [ 6, 2442, 39 ], [ 6, 2442, 47 ], [ 6, 2442, 49 ], [ 6, 2445, 5 ],
  [ 6, 2445, 23 ], [ 6, 2445, 24 ], [ 6, 2445, 25 ], [ 6, 2447, 23 ],
  [ 6, 2447, 45 ], [ 6, 2450, 47 ], [ 6, 2450, 58 ], [ 6, 2450, 61 ],
  [ 6, 2450, 64 ], [ 6, 2455, 8 ], [ 6, 2455, 19 ], [ 6, 2455, 22 ],
  [ 6, 2455, 25 ], [ 6, 2461, 24 ], [ 6, 2465, 16 ], [ 6, 2468, 19 ],
  [ 6, 2469, 5 ], [ 6, 2469, 23 ], [ 6, 2469, 24 ], [ 6, 2469, 25 ],
  [ 6, 2469, 34 ], [ 6, 2469, 39 ], [ 6, 2469, 41 ], [ 6, 2469, 53 ],
  [ 6, 2470, 92 ], [ 6, 2470, 103 ], [ 6, 2470, 106 ], [ 6, 2470, 109 ],
  [ 6, 2471, 5 ], [ 6, 2471, 23 ], [ 6, 2471, 24 ], [ 6, 2471, 25 ],
  [ 6, 2471, 34 ], [ 6, 2471, 40 ], [ 6, 2471, 41 ], [ 6, 2471, 52 ],
  [ 6, 2471, 71 ], [ 6, 2471, 72 ], [ 6, 2471, 112 ], [ 6, 2471, 113 ],
  [ 6, 2471, 114 ], [ 6, 2471, 118 ], [ 6, 2472, 5 ], [ 6, 2472, 23 ],
  [ 6, 2472, 24 ], [ 6, 2472, 25 ], [ 6, 2472, 34 ], [ 6, 2472, 39 ],
  [ 6, 2472, 41 ], [ 6, 2472, 53 ], [ 6, 2476, 5 ], [ 6, 2476, 23 ],
  [ 6, 2476, 24 ], [ 6, 2476, 25 ], [ 6, 2478, 5 ], [ 6, 2478, 23 ],
  [ 6, 2478, 24 ], [ 6, 2478, 25 ], [ 6, 2480, 5 ], [ 6, 2480, 23 ],
  [ 6, 2480, 24 ], [ 6, 2480, 25 ], [ 6, 2481, 100 ], [ 6, 2481, 103 ],
  [ 6, 2481, 106 ], [ 6, 2482, 23 ], [ 6, 2482, 24 ], [ 6, 2482, 77 ],
  [ 6, 2482, 80 ], [ 6, 2482, 100 ], [ 6, 2482, 103 ], [ 6, 2482, 106 ],
  [ 6, 2483, 5 ], [ 6, 2483, 23 ], [ 6, 2483, 24 ], [ 6, 2483, 25 ],
  [ 6, 2483, 34 ], [ 6, 2483, 38 ], [ 6, 2483, 47 ], [ 6, 2483, 62 ],
  [ 6, 2483, 63 ], [ 6, 2483, 79 ], [ 6, 2484, 23 ], [ 6, 2484, 24 ],
  [ 6, 2484, 68 ], [ 6, 2484, 74 ], [ 6, 2484, 80 ], [ 6, 2484, 82 ],
  [ 6, 2486, 23 ], [ 6, 2486, 25 ], [ 6, 2486, 74 ], [ 6, 2486, 80 ],
  [ 6, 2487, 23 ], [ 6, 2487, 24 ], [ 6, 2487, 68 ], [ 6, 2487, 74 ],
  [ 6, 2487, 80 ], [ 6, 2487, 82 ], [ 6, 2488, 5 ], [ 6, 2488, 8 ],
  [ 6, 2488, 12 ], [ 6, 2488, 25 ], [ 6, 2489, 5 ], [ 6, 2489, 23 ],
  [ 6, 2489, 24 ], [ 6, 2489, 25 ], [ 6, 2489, 45 ], [ 6, 2489, 53 ],
  [ 6, 2490, 73 ], [ 6, 2490, 84 ], [ 6, 2490, 87 ], [ 6, 2490, 90 ],
  [ 6, 2491, 81 ], [ 6, 2491, 84 ], [ 6, 2491, 87 ], [ 6, 2492, 47 ],
  [ 6, 2492, 58 ], [ 6, 2492, 61 ], [ 6, 2492, 64 ], [ 6, 2492, 81 ],
  [ 6, 2492, 84 ], [ 6, 2492, 87 ], [ 6, 2492, 108 ], [ 6, 2492, 114 ],
  [ 6, 2496, 47 ], [ 6, 2496, 58 ], [ 6, 2496, 61 ], [ 6, 2496, 64 ],
  [ 6, 2498, 73 ], [ 6, 2498, 76 ], [ 6, 2500, 38 ], [ 6, 2500, 44 ],
  [ 6, 2500, 50 ], [ 6, 2500, 52 ], [ 6, 2500, 66 ], [ 6, 2500, 68 ],
  [ 6, 2500, 70 ], [ 6, 2500, 71 ], [ 6, 2502, 15 ], [ 6, 2504, 32 ],
  [ 6, 2504, 37 ], [ 6, 2505, 34 ], [ 6, 2505, 45 ], [ 6, 2505, 48 ],
  [ 6, 2505, 51 ], [ 6, 2506, 71 ], [ 6, 2506, 75 ], [ 6, 2506, 77 ],
  [ 6, 2508, 10 ], [ 6, 2508, 16 ], [ 6, 2508, 22 ], [ 6, 2508, 24 ],
  [ 6, 2508, 68 ], [ 6, 2508, 71 ], [ 6, 2508, 74 ], [ 6, 2508, 75 ],
  [ 6, 2508, 76 ], [ 6, 2508, 77 ], [ 6, 2509, 10 ], [ 6, 2509, 16 ],
  [ 6, 2509, 22 ], [ 6, 2509, 24 ], [ 6, 2509, 48 ], [ 6, 2509, 51 ],
  [ 6, 2512, 38 ], [ 6, 2512, 40 ], [ 6, 2512, 42 ], [ 6, 2512, 43 ],
  [ 6, 2516, 38 ], [ 6, 2517, 45 ], [ 6, 2645, 12 ], [ 6, 2646, 5 ],
  [ 6, 2648, 26 ], [ 6, 2651, 5 ], [ 6, 2652, 5 ], [ 6, 2658, 26 ],
  [ 6, 2659, 12 ], [ 6, 2660, 4 ], [ 6, 2662, 52 ], [ 6, 2662, 64 ],
  [ 6, 2664, 8 ], [ 6, 4701, 7 ], [ 6, 4849, 62 ], [ 6, 4849, 153 ],
  [ 6, 4849, 156 ], [ 6, 4849, 159 ], [ 6, 4850, 102 ], [ 6, 4850, 207 ],
  [ 6, 4853, 5 ], [ 6, 4853, 43 ], [ 6, 4853, 44 ], [ 6, 4853, 45 ],
  [ 6, 4853, 46 ], [ 6, 4853, 47 ], [ 6, 4853, 48 ], [ 6, 4853, 49 ],
  [ 6, 4853, 102 ], [ 6, 4853, 103 ], [ 6, 4853, 104 ], [ 6, 4853, 105 ],
  [ 6, 4853, 106 ], [ 6, 4853, 107 ], [ 6, 4856, 152 ], [ 6, 4856, 215 ],
  [ 6, 4856, 216 ], [ 6, 4856, 217 ], [ 6, 4870, 169 ], [ 6, 4870, 200 ],
  [ 6, 4870, 205 ], [ 6, 4870, 209 ], [ 6, 4871, 102 ], [ 6, 4872, 112 ],
  [ 6, 4873, 112 ], [ 6, 4877, 151 ], [ 6, 5678, 7 ], [ 6, 5679, 4 ],
  [ 6, 5694, 1 ], [ 6, 5694, 2 ], [ 6, 5907, 17 ], [ 6, 5907, 26 ],
  [ 6, 5907, 27 ], [ 6, 5908, 4 ], [ 6, 5908, 14 ], [ 6, 5908, 18 ],
  [ 6, 5908, 21 ], [ 6, 5908, 22 ], [ 6, 5908, 35 ], [ 6, 5909, 18 ],
  [ 6, 5909, 25 ], [ 6, 5909, 28 ], [ 6, 5909, 31 ], [ 6, 5910, 17 ],
  [ 6, 5910, 19 ], [ 6, 5910, 23 ], [ 6, 5910, 24 ], [ 6, 5910, 26 ],
  [ 6, 5910, 31 ], [ 6, 5910, 32 ], [ 6, 5910, 38 ], [ 6, 5919, 11 ],
  [ 6, 5924, 4 ], [ 6, 5924, 10 ], [ 6, 5926, 5 ], [ 6, 5938, 11 ],
  [ 6, 5939, 6 ], [ 6, 5941, 1 ], [ 6, 5941, 2 ], [ 6, 5941, 3 ],
  [ 6, 5941, 4 ], [ 6, 5941, 5 ], [ 6, 5941, 6 ], [ 6, 5946, 1 ],
  [ 6, 5946, 2 ], [ 6, 5946, 3 ], [ 6, 5946, 4 ], [ 6, 5947, 1 ],
  [ 6, 5947, 2 ], [ 6, 5947, 3 ], [ 6, 5947, 4 ], [ 6, 5949, 1 ],
  [ 6, 5949, 2 ], [ 6, 5949, 3 ], [ 6, 5949, 4 ], [ 6, 5949, 5 ],
  [ 6, 5949, 6 ], [ 6, 5956, 1 ], [ 6, 5956, 2 ], [ 6, 5956, 3 ],
  [ 6, 5956, 4 ], [ 6, 5956, 5 ], [ 6, 5956, 6 ], [ 6, 5957, 1 ],
  [ 6, 5957, 2 ], [ 6, 5957, 3 ], [ 6, 5957, 4 ], [ 6, 5957, 5 ],
  [ 6, 5957, 6 ], [ 6, 5958, 1 ], [ 6, 5958, 3 ], [ 6, 5958, 4 ],
  [ 6, 5958, 5 ], [ 6, 5959, 1 ], [ 6, 5959, 3 ], [ 6, 5959, 4 ],
  [ 6, 5959, 5 ], [ 6, 5962, 11 ], [ 6, 5966, 5 ], [ 6, 6323, 9 ],
  [ 6, 6324, 2 ], [ 6, 6324, 9 ], [ 6, 6324, 13 ], [ 6, 6325, 2 ],
  [ 6, 6325, 5 ], [ 6, 6325, 12 ], [ 6, 6326, 3 ], [ 6, 6326, 4 ],
  [ 6, 6329, 1 ], [ 6, 6329, 2 ], [ 6, 6329, 3 ], [ 6, 6333, 4 ],
  [ 6, 6334, 3 ], [ 6, 6337, 5 ], [ 6, 6339, 3 ], [ 6, 6339, 7 ],
  [ 6, 6341, 2 ], [ 6, 6342, 10 ], [ 6, 6343, 6 ], [ 6, 6343, 7 ],
  [ 6, 6343, 8 ], [ 6, 6343, 9 ], [ 6, 6344, 3 ], [ 6, 6344, 4 ],
  [ 6, 6345, 5 ], [ 6, 6345, 6 ], [ 6, 6346, 3 ], [ 6, 6346, 5 ],
  [ 6, 6346, 6 ], [ 6, 6347, 1 ], [ 6, 6347, 2 ], [ 6, 6347, 3 ],
  [ 6, 6347, 4 ], [ 6, 6350, 11 ], [ 6, 6351, 8 ], [ 6, 6351, 13 ],
  [ 6, 6352, 7 ], [ 6, 6354, 6 ], [ 6, 6354, 8 ], [ 6, 6354, 9 ],
  [ 6, 6354, 10 ], [ 6, 6355, 6 ], [ 6, 6355, 8 ] ]

gap> ns6_64:=Filtered(nbc6_64,x->H2nrM(x).H2nrM<>[]);; # |G|=64
gap> Length(ns6_64);
95
gap> ns6_64i:=List(ns6_64,CaratZClassNumber);
[ [ 6, 2537, 60 ], [ 6, 2543, 45 ], [ 6, 2553, 47 ], [ 6, 2553, 58 ],
  [ 6, 2553, 61 ], [ 6, 2553, 64 ], [ 6, 2560, 8 ], [ 6, 2560, 19 ],
  [ 6, 2560, 22 ], [ 6, 2560, 25 ], [ 6, 2566, 52 ], [ 6, 2566, 100 ],
  [ 6, 2568, 5 ], [ 6, 2568, 23 ], [ 6, 2568, 24 ], [ 6, 2568, 25 ],
  [ 6, 2575, 102 ], [ 6, 2578, 103 ], [ 6, 2582, 45 ], [ 6, 2679, 14 ],
  [ 6, 2683, 23 ], [ 6, 2693, 35 ], [ 6, 2694, 34 ], [ 6, 2695, 20 ],
  [ 6, 2702, 23 ], [ 6, 2702, 54 ], [ 6, 2703, 50 ], [ 6, 2705, 35 ],
  [ 6, 2706, 14 ], [ 6, 2708, 3 ], [ 6, 6018, 22 ], [ 6, 6020, 20 ],
  [ 6, 6031, 17 ], [ 6, 6031, 22 ], [ 6, 6031, 25 ], [ 6, 6035, 14 ],
  [ 6, 6035, 24 ], [ 6, 6035, 25 ], [ 6, 6035, 26 ], [ 6, 6044, 1 ],
  [ 6, 6044, 2 ], [ 6, 6044, 3 ], [ 6, 6044, 4 ], [ 6, 6044, 5 ],
  [ 6, 6056, 11 ], [ 6, 6060, 11 ], [ 6, 6063, 5 ], [ 6, 6063, 23 ],
  [ 6, 6065, 11 ], [ 6, 6065, 25 ], [ 6, 6065, 31 ], [ 6, 6067, 17 ],
  [ 6, 6069, 11 ], [ 6, 6069, 18 ], [ 6, 6069, 25 ], [ 6, 6071, 17 ],
  [ 6, 6072, 5 ], [ 6, 6078, 9 ], [ 6, 6078, 22 ], [ 6, 6078, 23 ],
  [ 6, 6079, 24 ], [ 6, 6080, 5 ], [ 6, 6411, 9 ], [ 6, 6412, 6 ],
  [ 6, 6424, 3 ], [ 6, 6424, 4 ], [ 6, 6428, 3 ], [ 6, 6428, 4 ],
  [ 6, 6440, 5 ], [ 6, 6440, 7 ], [ 6, 6440, 8 ], [ 6, 6441, 3 ],
  [ 6, 6441, 4 ], [ 6, 6442, 3 ], [ 6, 6442, 4 ], [ 6, 6443, 3 ],
  [ 6, 6443, 4 ], [ 6, 6444, 6 ], [ 6, 6444, 7 ], [ 6, 6444, 8 ],
  [ 6, 6445, 5 ], [ 6, 6445, 6 ], [ 6, 6445, 7 ], [ 6, 6445, 8 ],
  [ 6, 6445, 9 ], [ 6, 6449, 7 ], [ 6, 6451, 18 ], [ 6, 6451, 21 ],
  [ 6, 6454, 15 ], [ 6, 6459, 8 ], [ 6, 6464, 6 ], [ 6, 6465, 6 ],
  [ 6, 6466, 7 ], [ 6, 6474, 7 ], [ 6, 6474, 10 ] ]

gap> ns6_128:=Filtered(nbc6_128,x->H2nrM(x).H2nrM<>[]);; # |G|=128
gap> Length(ns6_128);
11
gap> ns6_128i:=List(ns6_128,CaratZClassNumber);
[ [ 6, 2619, 23 ], [ 6, 5775, 11 ], [ 6, 5775, 24 ], [ 6, 5782, 17 ],
  [ 6, 5789, 11 ], [ 6, 6145, 8 ], [ 6, 6148, 15 ], [ 6, 6167, 3 ],
  [ 6, 6167, 4 ], [ 6, 6200, 7 ], [ 6, 6201, 20 ] ]
gap> ns6_256:=Filtered(nbc6_256,x->H2nrM(x).H2nrM<>[]); # |G|=256
[  ]

gap> Length(nbc6_512); # |G|=512
128
gap> nbc6_512h1:=List(nbc6_512,x->Filtered(H1(x),y->y>1)); # H1(G,M)
[ [ 2, 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ], [ 2, 2, 2 ], [ 2, 2 ], [ 2, 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ],
  [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ],
  [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ] ]
gap> nbc6_512n:=List(nbc6_512,x->Filtered(NormalSubgroups(x),
> y->Order(y)=256));; # N<G with [G:N]=2
gap> nbc6_512n:=List(nbc6_512n,x->Filtered(x,y->B0(y)=[]));; # N with M^N=0
gap> nbc6_512nn:=List([1..128],x->Filtered(nbc6_512n[x], # N with dim H^1(N,M)=2 dim H^1(G,M)
> y->Filtered(H1(y),z->z>1)=Concatenation(nbc6_512h1[x],nbc6_512h1[x])));;
gap> Filtered([1..128],x->nbc6_512nn[x]=[]); # we should check only the followings
[ 1, 2, 3, 5, 6, 7, 8, 10, 11, 12, 13, 15, 17, 18, 19, 21, 23, 25, 27, 29,
  31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67,
  69, 71, 73, 75, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104,
  106, 108, 111, 113, 115, 117, 119, 121, 123, 125, 127 ]
gap> nbc6_512a:=List(last,x->nbc6_512[x]);; # to do
gap> Length(nbc6_512a);
68
gap> ns6_512:=Filtered(nbc6_512a,x->H2nrM(x).H2nrM<>[]); # |G|=512
[  ]

gap> Length(nbc6_1024); # |G|=1024
4
gap> nbc6_1024h1:=List(nbc6_1024,x->Filtered(H1(x),y->y>1));
[ [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ] ]
gap> nbc6_1024n:=List(nbc6_1024,x->Filtered(NormalSubgroups(x),y->Order(y)=512));;
gap> nbc6_1024n:=List(nbc6_1024n,x->Filtered(x,y->B0(y)=[]));; # N with M^N=0
gap> nbc6_1024nn:=List([1..4],x->Filtered(nbc6_1024n[x], # N with dim H^1(N,M)=2 dim H^1(G,M)
> y->Filtered(H1(y),z->z>1)=Concatenation(nbc6_1024h1[x],nbc6_1024h1[x])));;
gap> Filtered([1..4],x->nbc6_1024nn[x]=[]); # we should check only the followings
[ 1, 3 ]
gap> nbc6_1024a:=List(last,x->nbc6_1024[x]);; # to do
gap> Length(nbc6_1024a);
2
gap> ns6_1024:=Filtered(nbc6_1024a,x->H2nrM(x).H2nrM<>[]); # |G|=1024
[  ]

# Step 2
gap> nbc6_27m:=Filtered(GL6Z,x->Order(x) mod 81 in [27,54]
> and Order(x)>27 and not IsBicyclic(x));; # |G|=27m
gap> Length(nbc6_27m);
2406
gap> Collected(List(nbc6_27m,Order));
[ [ 54, 102 ], [ 108, 449 ], [ 216, 870 ], [ 432, 658 ], [ 864, 227 ],
  [ 1728, 48 ], [ 3456, 36 ], [ 6912, 15 ], [ 13824, 1 ] ]
gap> nbc6_27m_3:=Filtered(nbc6_27m,
> x->CaratZClassNumber(SylowSubgroup(x,3)) in ns6_3i);;
gap> Length(nbc6_27m_3);
8
gap> Collected(List(nbc6_27m_3,x->CaratZClass(SylowSubgroup(x,3))));
[ [ [ 6, 2865, 1 ], 4 ], [ [ 6, 2865, 3 ], 4 ] ]
gap> Collected(List(nbc6_27m_3,Order));
[ [ 54, 6 ], [ 108, 2 ] ]
gap> ns6_27m:=Filtered(nbc6_27m_3,x->H2nrM(x).H2nrM<>[]);; # computing H2nr(G,M)
gap> Length(ns6_27m);
2
gap> ns6_27mi:=List(ns6_27m,CaratZClassNumber);
[ [ 6, 2899, 3 ], [ 6, 2899, 5 ] ]
gap> List(ns6_27m,Order);
[ 54, 54 ]
gap> List(ns6_27m,StructureDescription);
[ "(C9 : C3) : C2", "(C9 : C3) : C2" ]
gap> List(ns6_27m,x->CaratZClass(SylowSubgroup(x,3)));
[ [ 6, 2865, 1 ], [ 6, 2865, 3 ] ]

gap> nbc6_8m:=Filtered(GL6Z,x->Order(x) mod 16=8 and Order(x)>8
> and not IsBicyclic(x));; # |G|=8m
gap> Length(nbc6_8m);
8779
gap> Collected(List(nbc6_8m,Order));
[ [ 24, 4691 ], [ 40, 134 ], [ 72, 2817 ], [ 120, 180 ], [ 168, 3 ],
  [ 216, 870 ], [ 360, 39 ], [ 648, 43 ], [ 2520, 2 ] ]
gap> nbc6_8m_2:=Filtered(nbc6_8m,
> x->CaratZClassNumber(SylowSubgroup(x,2)) in ns6_8i);;
gap> Length(nbc6_8m_2);
69
gap> Collected(List(nbc6_8m_2,Order));
[ [ 24, 50 ], [ 72, 14 ], [ 216, 3 ], [ 648, 2 ] ]
gap> ns6_8m:=Filtered(nbc6_8m_2,x->H2nrM(x).H2nrM<>[]);; # computing H2nr(G,M)
gap> Length(ns6_8m);
35
gap> Collected(List(ns6_8m,Order));
[ [ 24, 34 ], [ 72, 1 ] ]
gap> ns6_8mi:=List(ns6_8m,CaratZClassNumber);
[ [ 6, 199, 5 ], [ 6, 199, 11 ], [ 6, 200, 5 ], [ 6, 200, 11 ],
  [ 6, 206, 5 ], [ 6, 207, 5 ], [ 6, 225, 5 ], [ 6, 225, 11 ],
  [ 6, 225, 31 ], [ 6, 225, 37 ], [ 6, 233, 11 ], [ 6, 233, 30 ],
  [ 6, 233, 36 ], [ 6, 234, 17 ], [ 6, 234, 23 ], [ 6, 234, 37 ],
  [ 6, 235, 5 ], [ 6, 235, 11 ], [ 6, 235, 31 ], [ 6, 236, 5 ],
  [ 6, 236, 18 ], [ 6, 236, 24 ], [ 6, 242, 5 ], [ 6, 242, 18 ],
  [ 6, 5518, 3 ], [ 6, 5518, 7 ], [ 6, 5669, 1 ], [ 6, 6737, 1 ],
  [ 6, 6737, 2 ], [ 6, 6738, 1 ], [ 6, 6739, 1 ], [ 6, 6740, 1 ],
  [ 6, 6740, 3 ], [ 6, 6741, 1 ], [ 6, 6977, 1 ] ]
gap> List(ns6_8m,StructureDescription);
[ "C3 x D8", "C3 x D8", "C3 x D8", "C3 x D8", "C3 x D8", "C3 x D8",
  "(C6 x C2) : C2", "(C6 x C2) : C2", "(C6 x C2) : C2", "(C6 x C2) : C2",
  "D24", "D24", "D24", "D24", "D24", "D24", "(C6 x C2) : C2",
  "(C6 x C2) : C2", "(C6 x C2) : C2", "(C6 x C2) : C2", "(C6 x C2) : C2",
  "(C6 x C2) : C2", "(C6 x C2) : C2", "(C6 x C2) : C2", "S4", "S4",
  "SL(2,3)", "SL(2,3)", "SL(2,3)", "C3 x Q8", "C3 x Q8", "C3 : Q8",
  "C3 : Q8", "C3 : Q8", "C3 x SL(2,3)" ]
gap> List(ns6_8m,IdSmallGroup);
[ [ 24, 10 ], [ 24, 10 ], [ 24, 10 ], [ 24, 10 ], [ 24, 10 ], [ 24, 10 ],
  [ 24, 8 ], [ 24, 8 ], [ 24, 8 ], [ 24, 8 ], [ 24, 6 ], [ 24, 6 ],
  [ 24, 6 ], [ 24, 6 ], [ 24, 6 ], [ 24, 6 ], [ 24, 8 ], [ 24, 8 ],
  [ 24, 8 ], [ 24, 8 ], [ 24, 8 ], [ 24, 8 ], [ 24, 8 ], [ 24, 8 ],
  [ 24, 12 ], [ 24, 12 ], [ 24, 3 ], [ 24, 3 ], [ 24, 3 ], [ 24, 11 ],
  [ 24, 11 ], [ 24, 4 ], [ 24, 4 ], [ 24, 4 ], [ 72, 25 ] ]

gap> nbc6_16m:=Filtered(GL6Z,x->Order(x) mod 32=16 and Order(x)>16
> and not IsBicyclic(x));; # |G|=16m
gap> Length(nbc6_16m);
12986
gap> Collected(List(nbc6_16m,Order));
[ [ 48, 8533 ], [ 80, 97 ], [ 144, 3332 ], [ 240, 191 ], [ 336, 5 ],
  [ 432, 658 ], [ 720, 121 ], [ 1296, 43 ], [ 5040, 6 ] ]
gap> nbc6_16m_2:=Filtered(nbc6_16m,
> x->CaratZClassNumber(SylowSubgroup(x,2)) in ns6_16i);;
gap> Length(nbc6_16m_2);
207
gap> Collected(List(nbc6_16m_2,Order));
[ [ 48, 123 ], [ 144, 65 ], [ 432, 13 ], [ 1296, 6 ] ]
gap> ns6_16m:=Filtered(nbc6_16m_2,x->H2nrM(x).H2nrM<>[]);; # computing H2nr(G,M)
gap> Length(ns6_16m);
58
gap> Collected(List(ns6_16m,Order));
[ [ 48, 51 ], [ 144, 7 ] ]
gap> ns6_16mi:=List(ns6_16m,CaratZClassNumber);
[ [ 6, 283, 5 ], [ 6, 367, 5 ], [ 6, 367, 18 ], [ 6, 367, 24 ],
  [ 6, 368, 5 ], [ 6, 368, 18 ], [ 6, 368, 24 ], [ 6, 410, 5 ],
  [ 6, 420, 5 ], [ 6, 424, 5 ], [ 6, 424, 18 ], [ 6, 425, 5 ],
  [ 6, 425, 18 ], [ 6, 428, 5 ], [ 6, 5531, 6 ], [ 6, 5710, 1 ],
  [ 6, 5713, 1 ], [ 6, 5714, 1 ], [ 6, 6002, 1 ], [ 6, 6002, 2 ],
  [ 6, 6004, 1 ], [ 6, 6004, 2 ], [ 6, 6571, 1 ], [ 6, 6577, 1 ],
  [ 6, 6578, 1 ], [ 6, 6584, 1 ], [ 6, 6584, 2 ], [ 6, 6592, 1 ],
  [ 6, 6592, 2 ], [ 6, 6880, 1 ], [ 6, 6880, 2 ], [ 6, 6881, 1 ],
  [ 6, 6888, 2 ], [ 6, 6891, 1 ], [ 6, 6892, 1 ], [ 6, 6893, 1 ],
  [ 6, 6894, 1 ], [ 6, 6897, 1 ], [ 6, 6897, 3 ], [ 6, 6898, 1 ],
  [ 6, 6899, 1 ], [ 6, 6899, 3 ], [ 6, 6901, 1 ], [ 6, 6901, 2 ],
  [ 6, 6901, 3 ], [ 6, 6901, 4 ], [ 6, 6912, 1 ], [ 6, 6912, 3 ],
  [ 6, 6913, 1 ], [ 6, 6913, 3 ], [ 6, 6914, 1 ], [ 6, 6914, 3 ],
  [ 6, 6915, 1 ], [ 6, 6915, 3 ], [ 6, 6918, 1 ], [ 6, 6918, 3 ],
  [ 6, 6919, 1 ], [ 6, 6919, 3 ] ]
gap> List(ns6_16m,StructureDescription);
[ "C6 x D8", "D8 x S3", "D8 x S3", "D8 x S3", "D8 x S3", "D8 x S3",
  "D8 x S3", "C2 x ((C6 x C2) : C2)", "C2 x D24", "D8 x S3", "D8 x S3",
  "D8 x S3", "D8 x S3", "C2 x ((C6 x C2) : C2)", "C2 x S4", "C2 x SL(2,3)",
  "GL(2,3)", "GL(2,3)", "C2 x SL(2,3)", "C2 x SL(2,3)", "GL(2,3)",
  "GL(2,3)", "C6 x SL(2,3)", "C3 x GL(2,3)", "C3 x GL(2,3)", "SL(2,3) x S3",
  "S3 x SL(2,3)", "(C3 x SL(2,3)) : C2", "(C3 x SL(2,3)) : C2",
  "C2 x SL(2,3)", "C2 x SL(2,3)", "C6 x Q8", "SL(2,3) : C2", "C3 x QD16",
  "C3 x QD16", "C3 x QD16", "C3 x QD16", "Q8 x S3", "Q8 x S3",
  "C2 x (C3 : Q8)", "Q8 x S3", "Q8 x S3", "GL(2,3)", "GL(2,3)", "GL(2,3)",
  "GL(2,3)", "(C3 : C8) : C2", "(C3 : C8) : C2", "(C3 : C8) : C2",
  "(C3 : C8) : C2", "C24 : C2", "C24 : C2", "C24 : C2", "C24 : C2",
  "(C3 x Q8) : C2", "(C3 x Q8) : C2", "(C3 x Q8) : C2", "(C3 x Q8) : C2" ]
gap> List(ns6_16m,IdSmallGroup);
[ [ 48, 45 ], [ 48, 38 ], [ 48, 38 ], [ 48, 38 ], [ 48, 38 ], [ 48, 38 ],
  [ 48, 38 ], [ 48, 43 ], [ 48, 36 ], [ 48, 38 ], [ 48, 38 ], [ 48, 38 ],
  [ 48, 38 ], [ 48, 43 ], [ 48, 48 ], [ 48, 32 ], [ 48, 29 ], [ 48, 29 ],
  [ 48, 32 ], [ 48, 32 ], [ 48, 29 ], [ 48, 29 ], [ 144, 156 ],
  [ 144, 122 ], [ 144, 122 ], [ 144, 128 ], [ 144, 128 ], [ 144, 125 ],
  [ 144, 125 ], [ 48, 32 ], [ 48, 32 ], [ 48, 46 ], [ 48, 33 ], [ 48, 26 ],
  [ 48, 26 ], [ 48, 26 ], [ 48, 26 ], [ 48, 40 ], [ 48, 40 ], [ 48, 34 ],
  [ 48, 40 ], [ 48, 40 ], [ 48, 29 ], [ 48, 29 ], [ 48, 29 ], [ 48, 29 ],
  [ 48, 16 ], [ 48, 16 ], [ 48, 16 ], [ 48, 16 ], [ 48, 6 ], [ 48, 6 ],
  [ 48, 6 ], [ 48, 6 ], [ 48, 17 ], [ 48, 17 ], [ 48, 17 ], [ 48, 17 ] ]

gap> nbc6_32m:=Filtered(GL6Z,x->Order(x) mod 64=32 and Order(x)>32
> and not IsBicyclic(x));; # |G|=32m
gap> Length(nbc6_32m);
10216
gap> Collected(List(nbc6_32m,Order));
[ [ 96, 7629 ], [ 160, 67 ], [ 288, 2103 ], [ 480, 98 ], [ 672, 1 ],
  [ 864, 227 ], [ 1440, 75 ], [ 2592, 14 ], [ 10080, 2 ] ]
gap> nbc6_32m_2:=Filtered(nbc6_32m,
> x->CaratZClassNumber(SylowSubgroup(x,2)) in ns6_32i);;
gap> Length(nbc6_32m_2);
177
gap> Collected(List(nbc6_32m_2,Order));
[ [ 96, 116 ], [ 288, 50 ], [ 864, 9 ], [ 2592, 2 ] ]
gap> nbc6_32m_2_27:=Filtered(nbc6_32m_2,x->Order(x) mod 27=0);; # the case 27 | |G|
gap> Length(nbc6_32m_2_27);
11
gap> nbc6_32m_2_27h1:=List(nbc6_32m_2_27,x->Filtered(H1(x),y->y>1)); # H1(G,M)
[ [  ], [  ], [  ], [  ], [  ], [  ], [  ], [ 3 ], [  ], [  ], [  ] ]
gap> nbc6_32m_2_27_n:=List(nbc6_32m_2_27,x->Filtered(NormalSubgroups(x),
> y->Order(y)*2=Order(x)));; # N with [G:N]=2
gap> List(nbc6_32m_2_27_n,Length);
[ 3, 3, 7, 7, 3, 3, 3, 3, 3, 3, 3 ]
gap> nbc6_32m_2_27_n2:=List(nbc6_32m_2_27_n,x->Filtered(x,y->B0(y)=[]));; # N with M^N=0
gap> List(nbc6_32m_2_27_n2,Length);
[ 3, 3, 7, 7, 3, 3, 3, 3, 3, 3, 3 ]
gap> nbc6_32m_2_27_n2h1:=List(nbc6_32m_2_27_n2,x->List(x,y->Filtered(H1(y),z->z>1))); # H1(N,M)
[ [ [  ], [  ], [  ] ], [ [ 3 ], [  ], [  ] ],
  [ [  ], [  ], [  ], [  ], [  ], [  ], [  ] ],
  [ [  ], [  ], [ 3 ], [  ], [  ], [  ], [  ] ], [ [  ], [  ], [ 3 ] ],
  [ [  ], [  ], [ 3 ] ], [ [  ], [ 3 ], [  ] ], [ [ 3 ], [ 3 ], [ 3 ] ],
  [ [  ], [  ], [ 3 ] ], [ [ 3 ], [  ], [  ] ], [ [  ], [ 3 ], [  ] ] ]
gap> nbc6_32m_2_9:=Filtered(nbc6_32m_2,x->Order(x) mod 27>0);; # the case 27 not | |G|
gap> Length(nbc6_32m_2_9);
166
gap> ns6_32m:=Filtered(nbc6_32m_2_9,x->H2nrM(x).H2nrM<>[]);; # computing H2nr(G,M)
gap> Length(ns6_32m);
46
gap> Collected(List(ns6_32m,Order));
[ [ 96, 39 ], [ 288, 7 ] ]
gap> ns6_32mi:=List(ns6_32m,CaratZClassNumber);
[ [ 6, 570, 5 ], [ 6, 2792, 3 ], [ 6, 2799, 5 ], [ 6, 2802, 4 ],
  [ 6, 5155, 19 ], [ 6, 5156, 19 ], [ 6, 5189, 19 ], [ 6, 5192, 19 ],
  [ 6, 5196, 27 ], [ 6, 5197, 27 ], [ 6, 5198, 27 ], [ 6, 5200, 27 ],
  [ 6, 5755, 1 ], [ 6, 6120, 1 ], [ 6, 6120, 2 ], [ 6, 6124, 1 ],
  [ 6, 6124, 2 ], [ 6, 6125, 1 ], [ 6, 6125, 2 ], [ 6, 6126, 1 ],
  [ 6, 6126, 2 ], [ 6, 6519, 1 ], [ 6, 6521, 1 ], [ 6, 6748, 1 ],
  [ 6, 6758, 1 ], [ 6, 6764, 1 ], [ 6, 6764, 2 ], [ 6, 6765, 1 ],
  [ 6, 6765, 2 ], [ 6, 6766, 1 ], [ 6, 7036, 1 ], [ 6, 7079, 2 ],
  [ 6, 7080, 1 ], [ 6, 7081, 1 ], [ 6, 7081, 2 ], [ 6, 7092, 1 ],
  [ 6, 7093, 1 ], [ 6, 7095, 1 ], [ 6, 7095, 3 ], [ 6, 7096, 1 ],
  [ 6, 7096, 3 ], [ 6, 7097, 1 ], [ 6, 7097, 3 ], [ 6, 7098, 1 ],
  [ 6, 7098, 3 ], [ 6, 7100, 1 ] ]
gap> List(ns6_32m,StructureDescription);
[ "C2 x S3 x D8", "((C4 x C2) : C4) : C3", "((C4 x C4) : C3) : C2",
  "((C4 x C4) : C3) : C2", "D8 x A4", "D8 x A4", "(C2 x C2 x A4) : C2",
  "(C2 x C2 x A4) : C2", "(C2 x C2 x A4) : C2", "(C2 x C2 x A4) : C2",
  "(C2 x S4) : C2", "(C2 x S4) : C2", "C2 x GL(2,3)", "C2 x C2 x SL(2,3)",
  "C2 x C2 x SL(2,3)", "C2 x GL(2,3)", "C2 x GL(2,3)", "C2 x GL(2,3)",
  "C2 x GL(2,3)", "C2 x GL(2,3)", "C2 x GL(2,3)", "C4 x SL(2,3)",
  "SL(2,3) : C4", "C6 x GL(2,3)", "C2 x SL(2,3) x S3", "GL(2,3) x S3",
  "GL(2,3) x S3", "GL(2,3) x S3", "GL(2,3) x S3",
  "C2 x ((C3 x SL(2,3)) : C2)", "C6 x QD16", "GL(2,3) : C2", "C2 x Q8 x S3",
  "C2 x GL(2,3)", "C2 x GL(2,3)", "C2 x ((C3 : C8) : C2)", "C2 x (C24 : C2)",
  "QD16 x S3", "S3 x QD16", "QD16 x S3", "S3 x QD16", "QD16 x S3",
  "S3 x QD16", "QD16 x S3", "S3 x QD16", "C2 x ((C3 x Q8) : C2)" ]
gap> List(ns6_32m,IdSmallGroup);
[ [ 96, 209 ], [ 96, 3 ], [ 96, 72 ], [ 96, 64 ], [ 96, 197 ], [ 96, 197 ],
  [ 96, 195 ], [ 96, 195 ], [ 96, 195 ], [ 96, 195 ], [ 96, 187 ],
  [ 96, 187 ], [ 96, 189 ], [ 96, 198 ], [ 96, 198 ], [ 96, 189 ],
  [ 96, 189 ], [ 96, 189 ], [ 96, 189 ], [ 96, 189 ], [ 96, 189 ],
  [ 96, 69 ], [ 96, 66 ], [ 288, 900 ], [ 288, 922 ], [ 288, 851 ],
  [ 288, 851 ], [ 288, 851 ], [ 288, 851 ], [ 288, 911 ], [ 96, 180 ],
  [ 96, 193 ], [ 96, 212 ], [ 96, 189 ], [ 96, 189 ], [ 96, 140 ],
  [ 96, 109 ], [ 96, 120 ], [ 96, 120 ], [ 96, 120 ], [ 96, 120 ],
  [ 96, 120 ], [ 96, 120 ], [ 96, 120 ], [ 96, 120 ], [ 96, 148 ] ]

gap> nbc6_64m:=Filtered(GL6Z,x->Order(x) mod 128=64 and Order(x)>64
> and not IsBicyclic(x));; # |G|=64m
gap> Length(nbc6_64m);
5107
gap> Collected(List(nbc6_64m,Order));
[ [ 192, 4114 ], [ 320, 60 ], [ 576, 832 ], [ 960, 36 ], [ 1728, 48 ],
  [ 2880, 8 ], [ 5184, 7 ], [ 25920, 2 ] ]
gap> nbc6_64m_2:=Filtered(nbc6_64m,
> x->CaratZClassNumber(SylowSubgroup(x,2)) in ns6_64i);;
gap> Length(nbc6_64m_2);
59
gap> Collected(List(nbc6_64m_2,Order));
[ [ 192, 47 ], [ 576, 11 ], [ 1728, 1 ] ]
gap> nbc6_64m_2_27:=Filtered(nbc6_64m_2,x->Order(x) mod 27=0);; # the case 27 | |G|
gap> Length(nbc6_64m_2_27);
1
gap> nbc6_64m_2_27h1:=List(nbc6_64m_2_27,x->Filtered(H1(x),y->y>1)); # H1(G,M)
[ [  ] ]
gap> nbc6_64m_2_27_n:=List(nbc6_64m_2_27,x->Filtered(NormalSubgroups(x),
> y->Order(y)*2=Order(x)));; # N with [G:N]=2
gap> List(nbc6_64m_2_27_n,Length);
[ 7 ]
gap> nbc6_64m_2_27_n2:=List(nbc6_64m_2_27_n,x->Filtered(x,y->B0(y)=[]));; # N with M^N=0
gap> List(nbc6_64m_2_27_n2,Length);
[ 7 ]
gap> nbc6_64m_2_27_n2h1:=List(nbc6_64m_2_27_n2,x->List(x,y->Filtered(H1(y),z->z>1))); # H1(N,M)
[ [ [  ], [  ], [  ], [  ], [ 3 ], [  ], [  ] ] ]
gap> nbc6_64m_2_9:=Filtered(nbc6_64m_2,x->Order(x) mod 27>0);; # the case 27 not | |G|
gap> Length(nbc6_64m_2_9);
58
gap> ns6_64m:=Filtered(nbc6_64m_2_9,x->H2nrM(x).H2nrM<>[]);; # computing H2nr(G,M)
gap> Length(ns6_64m);
12
gap> Collected(List(ns6_64m,Order));
[ [ 192, 11 ], [ 576, 1 ] ]
gap> ns6_64mi:=List(ns6_64m,CaratZClassNumber);
[ [ 6, 2729, 6 ], [ 6, 5060, 27 ], [ 6, 5069, 27 ], [ 6, 5877, 1 ],
  [ 6, 5877, 2 ], [ 6, 6246, 1 ], [ 6, 6248, 1 ], [ 6, 6251, 1 ],
  [ 6, 6251, 2 ], [ 6, 6252, 1 ], [ 6, 6714, 1 ], [ 6, 6946, 1 ] ]
gap> List(ns6_64m,StructureDescription);
[ "(((C4 x C2) : C4) : C3) : C2", "D8 x S4", "D8 x S4", "C2 x C2 x GL(2,3)",
  "C2 x C2 x GL(2,3)", "SL(2,3) x D8", "C4 x GL(2,3)",
  "(C2 x C2 x SL(2,3)) : C2", "(C2 x C2 x SL(2,3)) : C2",
  "(C2 x GL(2,3)) : C2", "C2 x QD16 x S3", "C2 x GL(2,3) x S3" ]
gap> List(ns6_64m,IdSmallGroup);
[ [ 192, 197 ], [ 192, 1472 ], [ 192, 1472 ], [ 192, 1475 ], [ 192, 1475 ],
  [ 192, 1004 ], [ 192, 951 ], [ 192, 980 ], [ 192, 980 ], [ 192, 952 ],
  [ 192, 1317 ], [ 576, 8325 ] ]

gap> nbc6_128m:=Filtered(GL6Z,x->Order(x) mod 256=128 and Order(x)>128
> and not IsBicyclic(x));; # |G|=128m
gap> Length(nbc6_128m);
1786
gap> Collected(List(nbc6_128m,Order));
[ [ 384, 1278 ], [ 640, 36 ], [ 1152, 385 ], [ 1920, 44 ], [ 3456, 36 ],
  [ 10368, 1 ], [ 51840, 6 ] ]
gap> nbc6_128m_2:=Filtered(nbc6_128m,
> x->CaratZClassNumber(SylowSubgroup(x,2)) in ns6_128i);;
gap> Length(nbc6_128m_2);
6
gap> Collected(List(nbc6_128m_2,Order));
[ [ 384, 5 ], [ 1152, 1 ] ]
gap> ns6_128m:=Filtered(nbc6_128m_2,x->H2nrM(x).H2nrM<>[]);; # computing H2nr(G,M)
gap> Length(ns6_128m);
1
gap> Collected(List(ns6_128m,Order));
[ [ 384, 1 ] ]
gap> ns6_128mi:=List(ns6_128m,CaratZClassNumber);
[ [ 6, 6380, 1 ] ]
gap> List(ns6_128m,StructureDescription);
[ "GL(2,3) x D8" ]
gap> List(ns6_128m,IdSmallGroup);
[ [ 384, 17972 ] ]

gap> ns6:=Union(ns6_3i,ns6_8i,ns6_16i,ns6_32i,ns6_64i,ns6_128i,
> ns6_27mi, ns6_8mi,ns6_16mi,ns6_32mi,ns6_64mi,ns6_128mi);;
gap> Length(ns6);
1051
gap> Collected(List(ns6,x->Order(CaratMatGroupZClass(x[1],x[2],x[3]))));
[ [ 8, 96 ], [ 16, 346 ], [ 24, 34 ], [ 27, 2 ], [ 32, 347 ], [ 48, 51 ],
  [ 54, 2 ], [ 64, 95 ], [ 72, 1 ], [ 96, 39 ], [ 128, 11 ], [ 144, 7 ],
  [ 192, 11 ], [ 288, 7 ], [ 384, 1 ], [ 576, 1 ] ]

# Step 3
gap> NS6:=Intersection(ns6,f6);
[ [ 6, 199, 11 ], [ 6, 200, 11 ], [ 6, 225, 11 ], [ 6, 225, 37 ],
  [ 6, 233, 36 ], [ 6, 234, 23 ], [ 6, 235, 11 ], [ 6, 236, 24 ],
  [ 6, 367, 24 ], [ 6, 368, 24 ], [ 6, 2400, 78 ], [ 6, 2400, 90 ],
  [ 6, 2400, 107 ], [ 6, 2400, 120 ], [ 6, 2401, 58 ], [ 6, 2401, 61 ],
  [ 6, 2401, 64 ], [ 6, 2402, 28 ], [ 6, 2402, 42 ], [ 6, 2403, 13 ],
  [ 6, 2403, 17 ], [ 6, 2404, 31 ], [ 6, 2404, 38 ], [ 6, 2404, 56 ],
  [ 6, 2404, 65 ], [ 6, 2404, 77 ], [ 6, 2404, 78 ], [ 6, 2405, 47 ],
  [ 6, 2405, 49 ], [ 6, 2407, 12 ], [ 6, 2407, 24 ], [ 6, 2407, 38 ],
  [ 6, 2407, 47 ], [ 6, 2407, 62 ], [ 6, 2407, 63 ], [ 6, 2409, 35 ],
  [ 6, 2412, 35 ], [ 6, 2412, 61 ], [ 6, 2412, 63 ], [ 6, 2415, 16 ],
  [ 6, 2415, 22 ], [ 6, 2415, 24 ], [ 6, 2418, 12 ], [ 6, 2418, 16 ],
  [ 6, 2419, 16 ], [ 6, 2419, 22 ], [ 6, 2419, 24 ], [ 6, 2420, 39 ],
  [ 6, 2420, 51 ], [ 6, 2421, 12 ], [ 6, 2421, 24 ], [ 6, 2424, 12 ],
  [ 6, 2424, 23 ], [ 6, 2424, 42 ], [ 6, 2424, 43 ], [ 6, 2424, 59 ],
  [ 6, 2424, 63 ], [ 6, 2432, 38 ], [ 6, 2434, 60 ], [ 6, 2435, 65 ],
  [ 6, 2438, 71 ], [ 6, 2438, 75 ], [ 6, 2439, 58 ], [ 6, 2439, 61 ],
  [ 6, 2439, 64 ], [ 6, 2442, 47 ], [ 6, 2442, 49 ], [ 6, 2445, 23 ],
  [ 6, 2445, 24 ], [ 6, 2445, 25 ], [ 6, 2447, 23 ], [ 6, 2447, 45 ],
  [ 6, 2450, 58 ], [ 6, 2450, 61 ], [ 6, 2450, 64 ], [ 6, 2455, 19 ],
  [ 6, 2455, 22 ], [ 6, 2455, 25 ], [ 6, 2461, 24 ], [ 6, 2465, 16 ],
  [ 6, 2468, 19 ], [ 6, 2469, 23 ], [ 6, 2469, 24 ], [ 6, 2469, 25 ],
  [ 6, 2469, 41 ], [ 6, 2469, 53 ], [ 6, 2470, 103 ], [ 6, 2470, 106 ],
  [ 6, 2470, 109 ], [ 6, 2471, 23 ], [ 6, 2471, 24 ], [ 6, 2471, 25 ],
  [ 6, 2471, 41 ], [ 6, 2471, 52 ], [ 6, 2471, 71 ], [ 6, 2471, 72 ],
  [ 6, 2471, 114 ], [ 6, 2471, 118 ], [ 6, 2472, 23 ], [ 6, 2472, 24 ],
  [ 6, 2472, 25 ], [ 6, 2472, 41 ], [ 6, 2472, 53 ], [ 6, 2476, 23 ],
  [ 6, 2476, 24 ], [ 6, 2476, 25 ], [ 6, 2478, 23 ], [ 6, 2478, 24 ],
  [ 6, 2478, 25 ], [ 6, 2480, 23 ], [ 6, 2480, 24 ], [ 6, 2480, 25 ],
  [ 6, 2481, 100 ], [ 6, 2481, 103 ], [ 6, 2481, 106 ], [ 6, 2482, 23 ],
  [ 6, 2482, 24 ], [ 6, 2482, 77 ], [ 6, 2482, 80 ], [ 6, 2482, 100 ],
  [ 6, 2482, 103 ], [ 6, 2482, 106 ], [ 6, 2483, 23 ], [ 6, 2483, 24 ],
  [ 6, 2483, 25 ], [ 6, 2483, 38 ], [ 6, 2483, 47 ], [ 6, 2483, 62 ],
  [ 6, 2483, 63 ], [ 6, 2483, 79 ], [ 6, 2484, 23 ], [ 6, 2484, 24 ],
  [ 6, 2484, 74 ], [ 6, 2484, 80 ], [ 6, 2484, 82 ], [ 6, 2486, 23 ],
  [ 6, 2486, 25 ], [ 6, 2486, 74 ], [ 6, 2486, 80 ], [ 6, 2487, 23 ],
  [ 6, 2487, 24 ], [ 6, 2487, 74 ], [ 6, 2487, 80 ], [ 6, 2487, 82 ],
  [ 6, 2488, 12 ], [ 6, 2488, 25 ], [ 6, 2489, 23 ], [ 6, 2489, 24 ],
  [ 6, 2489, 25 ], [ 6, 2489, 45 ], [ 6, 2489, 53 ], [ 6, 2490, 84 ],
  [ 6, 2490, 87 ], [ 6, 2490, 90 ], [ 6, 2491, 81 ], [ 6, 2491, 84 ],
  [ 6, 2491, 87 ], [ 6, 2492, 58 ], [ 6, 2492, 61 ], [ 6, 2492, 64 ],
  [ 6, 2492, 81 ], [ 6, 2492, 84 ], [ 6, 2492, 87 ], [ 6, 2492, 108 ],
  [ 6, 2492, 114 ], [ 6, 2496, 58 ], [ 6, 2496, 61 ], [ 6, 2496, 64 ],
  [ 6, 2498, 73 ], [ 6, 2498, 76 ], [ 6, 2500, 44 ], [ 6, 2500, 50 ],
  [ 6, 2500, 52 ], [ 6, 2500, 66 ], [ 6, 2500, 68 ], [ 6, 2500, 70 ],
  [ 6, 2500, 71 ], [ 6, 2502, 15 ], [ 6, 2504, 32 ], [ 6, 2504, 37 ],
  [ 6, 2505, 45 ], [ 6, 2505, 48 ], [ 6, 2505, 51 ], [ 6, 2506, 71 ],
  [ 6, 2506, 75 ], [ 6, 2506, 77 ], [ 6, 2508, 16 ], [ 6, 2508, 22 ],
  [ 6, 2508, 24 ], [ 6, 2508, 68 ], [ 6, 2508, 71 ], [ 6, 2508, 74 ],
  [ 6, 2508, 75 ], [ 6, 2508, 76 ], [ 6, 2508, 77 ], [ 6, 2509, 16 ],
  [ 6, 2509, 22 ], [ 6, 2509, 24 ], [ 6, 2509, 48 ], [ 6, 2509, 51 ],
  [ 6, 2512, 38 ], [ 6, 2512, 40 ], [ 6, 2512, 42 ], [ 6, 2512, 43 ],
  [ 6, 2516, 38 ], [ 6, 2517, 45 ], [ 6, 2537, 60 ], [ 6, 2543, 45 ],
  [ 6, 2553, 58 ], [ 6, 2553, 61 ], [ 6, 2553, 64 ], [ 6, 2560, 19 ],
  [ 6, 2560, 22 ], [ 6, 2560, 25 ], [ 6, 2566, 52 ], [ 6, 2566, 100 ],
  [ 6, 2568, 23 ], [ 6, 2568, 24 ], [ 6, 2568, 25 ], [ 6, 2575, 102 ],
  [ 6, 2578, 103 ], [ 6, 2582, 45 ], [ 6, 2619, 23 ], [ 6, 2630, 4 ],
  [ 6, 2630, 30 ], [ 6, 2633, 7 ], [ 6, 2634, 6 ], [ 6, 2634, 12 ],
  [ 6, 2634, 20 ], [ 6, 2645, 12 ], [ 6, 2646, 5 ], [ 6, 2648, 26 ],
  [ 6, 2651, 5 ], [ 6, 2652, 5 ], [ 6, 2658, 26 ], [ 6, 2659, 12 ],
  [ 6, 2660, 4 ], [ 6, 2662, 52 ], [ 6, 2662, 64 ], [ 6, 2664, 8 ],
  [ 6, 2679, 14 ], [ 6, 2683, 23 ], [ 6, 2693, 35 ], [ 6, 2694, 34 ],
  [ 6, 2695, 20 ], [ 6, 2702, 23 ], [ 6, 2702, 54 ], [ 6, 2703, 50 ],
  [ 6, 2705, 35 ], [ 6, 2706, 14 ], [ 6, 2708, 3 ], [ 6, 2729, 6 ],
  [ 6, 2792, 3 ], [ 6, 2799, 5 ], [ 6, 2802, 4 ], [ 6, 2865, 1 ],
  [ 6, 2865, 3 ], [ 6, 2899, 3 ], [ 6, 2899, 5 ], [ 6, 4687, 19 ],
  [ 6, 4687, 20 ], [ 6, 4688, 16 ], [ 6, 4691, 11 ], [ 6, 4691, 18 ],
  [ 6, 4692, 11 ], [ 6, 4692, 13 ], [ 6, 4695, 3 ], [ 6, 4697, 9 ],
  [ 6, 4701, 7 ], [ 6, 4761, 32 ], [ 6, 4764, 32 ], [ 6, 4765, 78 ],
  [ 6, 4770, 74 ], [ 6, 4774, 39 ], [ 6, 4780, 39 ], [ 6, 4809, 32 ],
  [ 6, 4810, 32 ], [ 6, 4812, 32 ], [ 6, 4813, 32 ], [ 6, 4814, 39 ],
  [ 6, 4825, 44 ], [ 6, 4825, 54 ], [ 6, 4825, 55 ], [ 6, 4825, 56 ],
  [ 6, 4825, 70 ], [ 6, 4825, 71 ], [ 6, 4827, 99 ], [ 6, 4827, 102 ],
  [ 6, 4827, 103 ], [ 6, 4827, 128 ], [ 6, 4827, 129 ], [ 6, 4827, 130 ],
  [ 6, 4827, 150 ], [ 6, 4827, 151 ], [ 6, 4827, 152 ], [ 6, 4827, 156 ],
  [ 6, 4827, 157 ], [ 6, 4827, 158 ], [ 6, 4828, 99 ], [ 6, 4828, 102 ],
  [ 6, 4828, 103 ], [ 6, 4828, 106 ], [ 6, 4828, 108 ], [ 6, 4828, 110 ],
  [ 6, 4828, 111 ], [ 6, 4828, 112 ], [ 6, 4828, 113 ], [ 6, 4828, 114 ],
  [ 6, 4828, 115 ], [ 6, 4828, 116 ], [ 6, 4828, 117 ], [ 6, 4828, 128 ],
  [ 6, 4828, 129 ], [ 6, 4828, 130 ], [ 6, 4829, 128 ], [ 6, 4829, 129 ],
  [ 6, 4829, 130 ], [ 6, 4830, 106 ], [ 6, 4830, 110 ], [ 6, 4830, 129 ],
  [ 6, 4830, 130 ], [ 6, 4830, 140 ], [ 6, 4830, 143 ], [ 6, 4830, 158 ],
  [ 6, 4830, 281 ], [ 6, 4830, 324 ], [ 6, 4831, 106 ], [ 6, 4831, 108 ],
  [ 6, 4831, 129 ], [ 6, 4831, 130 ], [ 6, 4831, 146 ], [ 6, 4831, 152 ],
  [ 6, 4831, 155 ], [ 6, 4832, 207 ], [ 6, 4832, 213 ], [ 6, 4832, 219 ],
  [ 6, 4833, 47 ], [ 6, 4833, 48 ], [ 6, 4833, 49 ], [ 6, 4833, 77 ],
  [ 6, 4833, 103 ], [ 6, 4833, 104 ], [ 6, 4833, 106 ], [ 6, 4833, 107 ],
  [ 6, 4834, 215 ], [ 6, 4834, 216 ], [ 6, 4834, 217 ], [ 6, 4837, 62 ],
  [ 6, 4837, 65 ], [ 6, 4837, 70 ], [ 6, 4837, 75 ], [ 6, 4837, 94 ],
  [ 6, 4837, 99 ], [ 6, 4837, 102 ], [ 6, 4837, 108 ], [ 6, 4837, 123 ],
  [ 6, 4837, 126 ], [ 6, 4837, 195 ], [ 6, 4837, 235 ], [ 6, 4839, 180 ],
  [ 6, 4839, 183 ], [ 6, 4839, 188 ], [ 6, 4839, 193 ], [ 6, 4839, 213 ],
  [ 6, 4839, 216 ], [ 6, 4839, 222 ], [ 6, 4839, 225 ], [ 6, 4841, 77 ],
  [ 6, 4841, 102 ], [ 6, 4849, 153 ], [ 6, 4849, 156 ], [ 6, 4849, 159 ],
  [ 6, 4850, 102 ], [ 6, 4850, 207 ], [ 6, 4853, 47 ], [ 6, 4853, 48 ],
  [ 6, 4853, 49 ], [ 6, 4853, 102 ], [ 6, 4853, 103 ], [ 6, 4853, 104 ],
  [ 6, 4853, 105 ], [ 6, 4853, 106 ], [ 6, 4853, 107 ], [ 6, 4856, 215 ],
  [ 6, 4856, 216 ], [ 6, 4856, 217 ], [ 6, 4870, 200 ], [ 6, 4870, 205 ],
  [ 6, 4870, 209 ], [ 6, 4871, 102 ], [ 6, 4872, 112 ], [ 6, 4873, 112 ],
  [ 6, 4877, 151 ], [ 6, 4892, 48 ], [ 6, 4892, 58 ], [ 6, 4892, 67 ],
  [ 6, 4892, 68 ], [ 6, 4892, 87 ], [ 6, 4892, 88 ], [ 6, 4892, 89 ],
  [ 6, 4892, 96 ], [ 6, 4892, 102 ], [ 6, 4892, 103 ], [ 6, 4892, 108 ],
  [ 6, 4892, 114 ], [ 6, 4892, 115 ], [ 6, 4892, 141 ], [ 6, 4892, 154 ],
  [ 6, 4892, 163 ], [ 6, 4892, 181 ], [ 6, 4892, 182 ], [ 6, 5060, 27 ],
  [ 6, 5069, 27 ], [ 6, 5155, 19 ], [ 6, 5156, 19 ], [ 6, 5189, 19 ],
  [ 6, 5192, 19 ], [ 6, 5196, 27 ], [ 6, 5197, 27 ], [ 6, 5198, 27 ],
  [ 6, 5200, 27 ], [ 6, 5518, 3 ], [ 6, 5518, 7 ], [ 6, 5531, 6 ],
  [ 6, 5574, 11 ], [ 6, 5641, 3 ], [ 6, 5645, 3 ], [ 6, 5750, 3 ],
  [ 6, 5775, 11 ], [ 6, 5775, 24 ], [ 6, 5782, 17 ], [ 6, 5789, 11 ],
  [ 6, 5831, 5 ], [ 6, 5831, 6 ], [ 6, 5831, 7 ], [ 6, 5832, 5 ],
  [ 6, 5832, 6 ], [ 6, 5832, 7 ], [ 6, 5834, 9 ], [ 6, 5836, 4 ],
  [ 6, 5836, 10 ], [ 6, 5839, 5 ], [ 6, 5839, 6 ], [ 6, 5839, 7 ],
  [ 6, 5840, 5 ], [ 6, 5842, 10 ], [ 6, 5842, 12 ], [ 6, 5842, 13 ],
  [ 6, 5842, 24 ], [ 6, 5844, 9 ], [ 6, 5844, 13 ], [ 6, 5846, 23 ],
  [ 6, 5847, 17 ], [ 6, 5848, 5 ], [ 6, 5849, 5 ], [ 6, 5849, 11 ],
  [ 6, 5850, 5 ], [ 6, 5851, 5 ], [ 6, 5852, 4 ], [ 6, 5852, 5 ],
  [ 6, 5852, 6 ], [ 6, 5907, 26 ], [ 6, 5907, 27 ], [ 6, 5908, 4 ],
  [ 6, 5908, 18 ], [ 6, 5908, 21 ], [ 6, 5908, 22 ], [ 6, 5908, 35 ],
  [ 6, 5909, 25 ], [ 6, 5909, 28 ], [ 6, 5909, 31 ], [ 6, 5910, 23 ],
  [ 6, 5910, 24 ], [ 6, 5910, 26 ], [ 6, 5910, 31 ], [ 6, 5910, 32 ],
  [ 6, 5910, 38 ], [ 6, 5919, 11 ], [ 6, 5924, 4 ], [ 6, 5924, 10 ],
  [ 6, 5926, 5 ], [ 6, 5938, 11 ], [ 6, 5939, 6 ], [ 6, 5941, 4 ],
  [ 6, 5941, 5 ], [ 6, 5941, 6 ], [ 6, 5946, 4 ], [ 6, 5947, 4 ],
  [ 6, 5949, 4 ], [ 6, 5949, 5 ], [ 6, 5949, 6 ], [ 6, 5956, 5 ],
  [ 6, 5956, 6 ], [ 6, 5957, 5 ], [ 6, 5957, 6 ], [ 6, 5958, 5 ],
  [ 6, 5959, 5 ], [ 6, 5962, 11 ], [ 6, 5966, 5 ], [ 6, 6018, 22 ],
  [ 6, 6020, 20 ], [ 6, 6031, 22 ], [ 6, 6031, 25 ], [ 6, 6035, 24 ],
  [ 6, 6035, 25 ], [ 6, 6035, 26 ], [ 6, 6044, 4 ], [ 6, 6044, 5 ],
  [ 6, 6056, 11 ], [ 6, 6060, 11 ], [ 6, 6063, 5 ], [ 6, 6063, 23 ],
  [ 6, 6065, 11 ], [ 6, 6065, 25 ], [ 6, 6065, 31 ], [ 6, 6067, 17 ],
  [ 6, 6069, 11 ], [ 6, 6069, 18 ], [ 6, 6069, 25 ], [ 6, 6071, 17 ],
  [ 6, 6072, 5 ], [ 6, 6078, 9 ], [ 6, 6078, 22 ], [ 6, 6078, 23 ],
  [ 6, 6079, 24 ], [ 6, 6080, 5 ], [ 6, 6100, 5 ], [ 6, 6100, 6 ],
  [ 6, 6100, 7 ], [ 6, 6101, 4 ], [ 6, 6101, 6 ], [ 6, 6145, 8 ],
  [ 6, 6148, 15 ], [ 6, 6167, 4 ], [ 6, 6200, 7 ], [ 6, 6201, 20 ],
  [ 6, 6222, 2 ], [ 6, 6222, 5 ], [ 6, 6223, 3 ], [ 6, 6224, 2 ],
  [ 6, 6225, 2 ], [ 6, 6226, 2 ], [ 6, 6226, 4 ], [ 6, 6323, 9 ],
  [ 6, 6324, 2 ], [ 6, 6324, 9 ], [ 6, 6324, 13 ], [ 6, 6325, 2 ],
  [ 6, 6325, 5 ], [ 6, 6325, 12 ], [ 6, 6326, 4 ], [ 6, 6329, 2 ],
  [ 6, 6329, 3 ], [ 6, 6337, 5 ], [ 6, 6339, 3 ], [ 6, 6339, 7 ],
  [ 6, 6341, 2 ], [ 6, 6342, 10 ], [ 6, 6343, 7 ], [ 6, 6343, 9 ],
  [ 6, 6344, 4 ], [ 6, 6345, 5 ], [ 6, 6345, 6 ], [ 6, 6346, 3 ],
  [ 6, 6346, 5 ], [ 6, 6346, 6 ], [ 6, 6347, 2 ], [ 6, 6347, 3 ],
  [ 6, 6350, 11 ], [ 6, 6351, 8 ], [ 6, 6351, 13 ], [ 6, 6352, 7 ],
  [ 6, 6354, 9 ], [ 6, 6354, 10 ], [ 6, 6411, 9 ], [ 6, 6412, 6 ],
  [ 6, 6424, 4 ], [ 6, 6428, 4 ], [ 6, 6440, 8 ], [ 6, 6441, 4 ],
  [ 6, 6442, 4 ], [ 6, 6443, 4 ], [ 6, 6444, 7 ], [ 6, 6445, 6 ],
  [ 6, 6445, 8 ], [ 6, 6445, 9 ], [ 6, 6449, 7 ], [ 6, 6451, 18 ],
  [ 6, 6451, 21 ], [ 6, 6454, 15 ], [ 6, 6459, 8 ], [ 6, 6464, 6 ],
  [ 6, 6465, 6 ], [ 6, 6466, 7 ], [ 6, 6474, 7 ], [ 6, 6474, 10 ],
  [ 6, 6737, 2 ], [ 6, 6880, 2 ], [ 6, 6888, 2 ], [ 6, 6901, 2 ],
  [ 6, 6901, 4 ], [ 6, 7079, 2 ], [ 6, 7081, 2 ] ]
gap> Length(NS6);
603
gap> Collected(List(NS6,x->Order(CaratMatGroupZClass(x[1],x[2],x[3]))));
[ [ 8, 33 ], [ 16, 192 ], [ 24, 11 ], [ 27, 2 ], [ 32, 254 ], [ 48, 7 ],
  [ 54, 2 ], [ 64, 76 ], [ 96, 13 ], [ 128, 10 ], [ 192, 3 ] ]
gap> List(NS6,x->H2nrM(CaratMatGroupZClass(x[1],x[2],x[3])).H2nrM);
[ [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 3 ], [ 3 ], [ 3 ], [ 3 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ], [ 2, 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ] ]
gap> Collected(last);
[ [ [ 2 ], 576 ], [ [ 2, 2 ], 23 ], [ [ 3 ], 4 ] ]
gap> NS51:=Intersection(ns6,f51);
[ [ 6, 2322, 4 ], [ 6, 2323, 16 ], [ 6, 2326, 14 ], [ 6, 2332, 12 ],
  [ 6, 2336, 16 ], [ 6, 2352, 23 ], [ 6, 2359, 19 ], [ 6, 2400, 76 ],
  [ 6, 2400, 103 ], [ 6, 2401, 47 ], [ 6, 2403, 8 ], [ 6, 2404, 27 ],
  [ 6, 2405, 39 ], [ 6, 2407, 10 ], [ 6, 2412, 53 ], [ 6, 2415, 10 ],
  [ 6, 2418, 10 ], [ 6, 2419, 10 ], [ 6, 2420, 37 ], [ 6, 2421, 10 ],
  [ 6, 2424, 57 ], [ 6, 2438, 66 ], [ 6, 2439, 47 ], [ 6, 2442, 39 ],
  [ 6, 2450, 47 ], [ 6, 2455, 8 ], [ 6, 2469, 39 ], [ 6, 2470, 92 ],
  [ 6, 2471, 112 ], [ 6, 2472, 39 ], [ 6, 2484, 68 ], [ 6, 2487, 68 ],
  [ 6, 2488, 8 ], [ 6, 2490, 73 ], [ 6, 2492, 47 ], [ 6, 2496, 47 ],
  [ 6, 2500, 38 ], [ 6, 2505, 34 ], [ 6, 2508, 10 ], [ 6, 2509, 10 ],
  [ 6, 2553, 47 ], [ 6, 2560, 8 ], [ 6, 4682, 3 ], [ 6, 4687, 10 ],
  [ 6, 4691, 4 ], [ 6, 4692, 5 ], [ 6, 4761, 19 ], [ 6, 4761, 22 ],
  [ 6, 4761, 25 ], [ 6, 4764, 19 ], [ 6, 4764, 22 ], [ 6, 4764, 25 ],
  [ 6, 4765, 65 ], [ 6, 4770, 62 ], [ 6, 4773, 19 ], [ 6, 4774, 23 ],
  [ 6, 4774, 57 ], [ 6, 4778, 47 ], [ 6, 4780, 23 ], [ 6, 4780, 24 ],
  [ 6, 4780, 25 ], [ 6, 4785, 16 ], [ 6, 4809, 12 ], [ 6, 4809, 19 ],
  [ 6, 4809, 53 ], [ 6, 4809, 64 ], [ 6, 4810, 19 ], [ 6, 4810, 22 ],
  [ 6, 4810, 25 ], [ 6, 4812, 19 ], [ 6, 4812, 22 ], [ 6, 4812, 25 ],
  [ 6, 4813, 12 ], [ 6, 4813, 19 ], [ 6, 4814, 23 ], [ 6, 4814, 24 ],
  [ 6, 4814, 25 ], [ 6, 4825, 16 ], [ 6, 4827, 31 ], [ 6, 4827, 51 ],
  [ 6, 4827, 60 ], [ 6, 4827, 97 ], [ 6, 4827, 100 ], [ 6, 4827, 101 ],
  [ 6, 4828, 12 ], [ 6, 4828, 31 ], [ 6, 4828, 97 ], [ 6, 4828, 100 ],
  [ 6, 4828, 101 ], [ 6, 4829, 31 ], [ 6, 4830, 31 ], [ 6, 4830, 78 ],
  [ 6, 4830, 230 ], [ 6, 4831, 31 ], [ 6, 4831, 54 ], [ 6, 4832, 178 ],
  [ 6, 4833, 43 ], [ 6, 4833, 44 ], [ 6, 4833, 45 ], [ 6, 4833, 63 ],
  [ 6, 4834, 152 ], [ 6, 4837, 34 ], [ 6, 4837, 43 ], [ 6, 4837, 51 ],
  [ 6, 4837, 181 ], [ 6, 4839, 152 ], [ 6, 4839, 161 ], [ 6, 4839, 166 ],
  [ 6, 4839, 169 ], [ 6, 4841, 51 ], [ 6, 4849, 62 ], [ 6, 4853, 43 ],
  [ 6, 4853, 44 ], [ 6, 4853, 45 ], [ 6, 4856, 152 ], [ 6, 4870, 169 ],
  [ 6, 4892, 23 ], [ 6, 4892, 41 ], [ 6, 4892, 51 ], [ 6, 4892, 61 ],
  [ 6, 4892, 83 ], [ 6, 5641, 2 ], [ 6, 5649, 2 ], [ 6, 5650, 2 ],
  [ 6, 5678, 7 ], [ 6, 5679, 4 ], [ 6, 5694, 2 ], [ 6, 5750, 2 ],
  [ 6, 5751, 2 ], [ 6, 5831, 2 ], [ 6, 5831, 3 ], [ 6, 5832, 2 ],
  [ 6, 5832, 3 ], [ 6, 5839, 2 ], [ 6, 5839, 3 ], [ 6, 5848, 2 ],
  [ 6, 5849, 2 ], [ 6, 5850, 2 ], [ 6, 5851, 2 ], [ 6, 5852, 2 ],
  [ 6, 5907, 17 ], [ 6, 5908, 14 ], [ 6, 5909, 18 ], [ 6, 5910, 17 ],
  [ 6, 5910, 19 ], [ 6, 5941, 2 ], [ 6, 5946, 2 ], [ 6, 5947, 2 ],
  [ 6, 5949, 2 ], [ 6, 5956, 2 ], [ 6, 5956, 3 ], [ 6, 5957, 2 ],
  [ 6, 5957, 3 ], [ 6, 5958, 3 ], [ 6, 5959, 3 ], [ 6, 6031, 17 ],
  [ 6, 6035, 14 ], [ 6, 6044, 2 ], [ 6, 6100, 2 ], [ 6, 6100, 3 ],
  [ 6, 6101, 2 ] ]
gap> Length(NS51);
161
gap> Collected(List(NS51,x->Order(CaratMatGroupZClass(x[1],x[2],x[3]))));
[ [ 8, 28 ], [ 16, 83 ], [ 32, 45 ], [ 64, 5 ] ]
gap> List(NS51,x->H2nrM(CaratMatGroupZClass(x[1],x[2],x[3])).H2nrM);
[ [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ] ]
gap> Collected(last);
[ [ [ 2 ], 153 ], [ [ 2, 2 ], 8 ] ]
gap> NS42:=Intersection(ns6,f42);
[ [ 6, 199, 5 ], [ 6, 200, 5 ], [ 6, 206, 5 ], [ 6, 207, 5 ], [ 6, 225, 5 ],
  [ 6, 225, 31 ], [ 6, 233, 11 ], [ 6, 233, 30 ], [ 6, 234, 17 ],
  [ 6, 234, 37 ], [ 6, 235, 5 ], [ 6, 235, 31 ], [ 6, 236, 5 ],
  [ 6, 236, 18 ], [ 6, 242, 5 ], [ 6, 242, 18 ], [ 6, 283, 5 ],
  [ 6, 367, 5 ], [ 6, 367, 18 ], [ 6, 368, 5 ], [ 6, 368, 18 ],
  [ 6, 410, 5 ], [ 6, 420, 5 ], [ 6, 424, 5 ], [ 6, 424, 18 ],
  [ 6, 425, 5 ], [ 6, 425, 18 ], [ 6, 428, 5 ], [ 6, 570, 5 ],
  [ 6, 2400, 71 ], [ 6, 2400, 100 ], [ 6, 2404, 30 ], [ 6, 2404, 53 ],
  [ 6, 2407, 5 ], [ 6, 2407, 34 ], [ 6, 2418, 11 ], [ 6, 2420, 32 ],
  [ 6, 2421, 5 ], [ 6, 2424, 5 ], [ 6, 2424, 11 ], [ 6, 2424, 58 ],
  [ 6, 2445, 5 ], [ 6, 2469, 5 ], [ 6, 2469, 34 ], [ 6, 2471, 5 ],
  [ 6, 2471, 34 ], [ 6, 2471, 40 ], [ 6, 2471, 113 ], [ 6, 2472, 5 ],
  [ 6, 2472, 34 ], [ 6, 2476, 5 ], [ 6, 2478, 5 ], [ 6, 2480, 5 ],
  [ 6, 2483, 5 ], [ 6, 2483, 34 ], [ 6, 2488, 5 ], [ 6, 2489, 5 ],
  [ 6, 2568, 5 ], [ 6, 2633, 2 ], [ 6, 2634, 2 ], [ 6, 2634, 15 ],
  [ 6, 4691, 10 ], [ 6, 4691, 26 ], [ 6, 4749, 10 ], [ 6, 4761, 31 ],
  [ 6, 4764, 31 ], [ 6, 4809, 31 ], [ 6, 4810, 31 ], [ 6, 4812, 31 ],
  [ 6, 4813, 31 ], [ 6, 4825, 28 ], [ 6, 4825, 36 ], [ 6, 4825, 42 ],
  [ 6, 4827, 98 ], [ 6, 4828, 98 ], [ 6, 4828, 105 ], [ 6, 4828, 107 ],
  [ 6, 4828, 109 ], [ 6, 4830, 109 ], [ 6, 4830, 280 ], [ 6, 4831, 107 ],
  [ 6, 4833, 46 ], [ 6, 4837, 58 ], [ 6, 4837, 61 ], [ 6, 4837, 194 ],
  [ 6, 4839, 176 ], [ 6, 4841, 75 ], [ 6, 4853, 46 ], [ 6, 4892, 57 ],
  [ 6, 4892, 86 ], [ 6, 4892, 95 ], [ 6, 4892, 107 ], [ 6, 5831, 4 ],
  [ 6, 5832, 4 ], [ 6, 5839, 4 ], [ 6, 5840, 4 ], [ 6, 5848, 4 ],
  [ 6, 5849, 4 ], [ 6, 5850, 4 ], [ 6, 5851, 4 ], [ 6, 5852, 3 ],
  [ 6, 5877, 2 ], [ 6, 5941, 3 ], [ 6, 5946, 3 ], [ 6, 5947, 3 ],
  [ 6, 5949, 3 ], [ 6, 5956, 4 ], [ 6, 5957, 4 ], [ 6, 5958, 4 ],
  [ 6, 5959, 4 ], [ 6, 6002, 2 ], [ 6, 6004, 2 ], [ 6, 6044, 3 ],
  [ 6, 6100, 4 ], [ 6, 6101, 3 ], [ 6, 6120, 2 ], [ 6, 6124, 2 ],
  [ 6, 6125, 2 ], [ 6, 6126, 2 ], [ 6, 6167, 3 ], [ 6, 6224, 1 ],
  [ 6, 6225, 1 ], [ 6, 6226, 1 ], [ 6, 6226, 5 ], [ 6, 6246, 1 ],
  [ 6, 6248, 1 ], [ 6, 6251, 1 ], [ 6, 6251, 2 ], [ 6, 6252, 1 ],
  [ 6, 6326, 3 ], [ 6, 6329, 1 ], [ 6, 6333, 4 ], [ 6, 6334, 3 ],
  [ 6, 6343, 6 ], [ 6, 6343, 8 ], [ 6, 6344, 3 ], [ 6, 6347, 1 ],
  [ 6, 6347, 4 ], [ 6, 6354, 6 ], [ 6, 6354, 8 ], [ 6, 6355, 6 ],
  [ 6, 6355, 8 ], [ 6, 6380, 1 ], [ 6, 6424, 3 ], [ 6, 6428, 3 ],
  [ 6, 6440, 5 ], [ 6, 6440, 7 ], [ 6, 6441, 3 ], [ 6, 6442, 3 ],
  [ 6, 6443, 3 ], [ 6, 6444, 6 ], [ 6, 6444, 8 ], [ 6, 6445, 5 ],
  [ 6, 6445, 7 ], [ 6, 6519, 1 ], [ 6, 6521, 1 ], [ 6, 6571, 1 ],
  [ 6, 6577, 1 ], [ 6, 6578, 1 ], [ 6, 6584, 1 ], [ 6, 6584, 2 ],
  [ 6, 6592, 1 ], [ 6, 6592, 2 ], [ 6, 6714, 1 ], [ 6, 6737, 1 ],
  [ 6, 6738, 1 ], [ 6, 6739, 1 ], [ 6, 6740, 1 ], [ 6, 6740, 3 ],
  [ 6, 6741, 1 ], [ 6, 6748, 1 ], [ 6, 6758, 1 ], [ 6, 6764, 1 ],
  [ 6, 6764, 2 ], [ 6, 6765, 1 ], [ 6, 6765, 2 ], [ 6, 6766, 1 ],
  [ 6, 6880, 1 ], [ 6, 6881, 1 ], [ 6, 6891, 1 ], [ 6, 6892, 1 ],
  [ 6, 6893, 1 ], [ 6, 6894, 1 ], [ 6, 6897, 1 ], [ 6, 6897, 3 ],
  [ 6, 6898, 1 ], [ 6, 6899, 1 ], [ 6, 6899, 3 ], [ 6, 6901, 1 ],
  [ 6, 6901, 3 ], [ 6, 6912, 1 ], [ 6, 6912, 3 ], [ 6, 6913, 1 ],
  [ 6, 6913, 3 ], [ 6, 6914, 1 ], [ 6, 6914, 3 ], [ 6, 6915, 1 ],
  [ 6, 6915, 3 ], [ 6, 6918, 1 ], [ 6, 6918, 3 ], [ 6, 6919, 1 ],
  [ 6, 6919, 3 ], [ 6, 6946, 1 ], [ 6, 6977, 1 ], [ 6, 7036, 1 ],
  [ 6, 7080, 1 ], [ 6, 7081, 1 ], [ 6, 7092, 1 ], [ 6, 7093, 1 ],
  [ 6, 7095, 1 ], [ 6, 7095, 3 ], [ 6, 7096, 1 ], [ 6, 7096, 3 ],
  [ 6, 7097, 1 ], [ 6, 7097, 3 ], [ 6, 7098, 1 ], [ 6, 7098, 3 ],
  [ 6, 7100, 1 ] ]
gap> Length(NS42);
218
gap> Collected(List(NS42,x->Order(CaratMatGroupZClass(x[1],x[2],x[3]))));
[ [ 8, 13 ], [ 16, 47 ], [ 24, 22 ], [ 32, 38 ], [ 48, 39 ], [ 64, 13 ],
  [ 72, 1 ], [ 96, 21 ], [ 128, 1 ], [ 144, 7 ], [ 192, 7 ], [ 288, 7 ],
  [ 384, 1 ], [ 576, 1 ] ]
gap> List(NS42,x->H2nrM(CaratMatGroupZClass(x[1],x[2],x[3])).H2nrM);
[ [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ],
  [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ],
  [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2, 2 ], [ 2, 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ] ]
gap> Collected(last);
[ [ [ 2 ], 182 ], [ [ 2, 2 ], 36 ] ]
gap> NS411:=Intersection(ns6,f411);
[ [ 6, 4732, 5 ], [ 6, 4735, 5 ], [ 6, 4749, 5 ], [ 6, 4761, 8 ],
  [ 6, 4764, 8 ], [ 6, 4780, 5 ], [ 6, 4809, 8 ], [ 6, 4809, 46 ],
  [ 6, 4810, 8 ], [ 6, 4812, 8 ], [ 6, 4813, 8 ], [ 6, 4814, 5 ],
  [ 6, 4827, 10 ], [ 6, 4828, 10 ], [ 6, 4833, 5 ], [ 6, 4837, 12 ],
  [ 6, 4839, 130 ], [ 6, 4853, 5 ], [ 6, 4892, 8 ], [ 6, 5641, 1 ],
  [ 6, 5649, 1 ], [ 6, 5650, 1 ], [ 6, 5651, 1 ], [ 6, 5652, 1 ],
  [ 6, 5669, 1 ], [ 6, 5694, 1 ], [ 6, 5710, 1 ], [ 6, 5713, 1 ],
  [ 6, 5714, 1 ], [ 6, 5750, 1 ], [ 6, 5751, 1 ], [ 6, 5755, 1 ],
  [ 6, 5831, 1 ], [ 6, 5832, 1 ], [ 6, 5839, 1 ], [ 6, 5840, 1 ],
  [ 6, 5848, 1 ], [ 6, 5849, 1 ], [ 6, 5850, 1 ], [ 6, 5851, 1 ],
  [ 6, 5852, 1 ], [ 6, 5877, 1 ], [ 6, 5941, 1 ], [ 6, 5946, 1 ],
  [ 6, 5947, 1 ], [ 6, 5949, 1 ], [ 6, 5956, 1 ], [ 6, 5957, 1 ],
  [ 6, 5958, 1 ], [ 6, 5959, 1 ], [ 6, 6002, 1 ], [ 6, 6004, 1 ],
  [ 6, 6044, 1 ], [ 6, 6100, 1 ], [ 6, 6101, 1 ], [ 6, 6120, 1 ],
  [ 6, 6124, 1 ], [ 6, 6125, 1 ], [ 6, 6126, 1 ] ]
gap> Length(NS411);
59
gap> Collected(List(NS411,x->Order(CaratMatGroupZClass(x[1],x[2],x[3]))));
[ [ 8, 14 ], [ 16, 22 ], [ 24, 1 ], [ 32, 10 ], [ 48, 5 ], [ 64, 1 ],
  [ 96, 5 ], [ 192, 1 ] ]
gap> List(NS411,x->H2nrM(CaratMatGroupZClass(x[1],x[2],x[3])).H2nrM);
[ [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ],
  [ 2, 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ],
  [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2 ], [ 2 ], [ 2, 2 ], [ 2, 2 ], [ 2, 2 ],
  [ 2 ], [ 2 ], [ 2 ] ]
gap> Collected(last);
[ [ [ 2 ], 46 ], [ [ 2, 2 ], 13 ] ]
gap> NS33:=Intersection(ns6,f33);
[ [ 6, 4809, 28 ], [ 6, 4809, 69 ], [ 6, 4813, 28 ], [ 6, 4828, 104 ],
  [ 6, 4892, 47 ] ]
gap> Length(NS33);
5
gap> Collected(List(NS33,x->Order(CaratMatGroupZClass(x[1],x[2],x[3]))));
[ [ 8, 4 ], [ 16, 1 ] ]
gap> List(NS33,x->H2nrM(CaratMatGroupZClass(x[1],x[2],x[3])).H2nrM);
[ [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ] ]
gap> Collected(last);
[ [ [ 2 ], 5 ] ]
gap> NS321:=Intersection(ns6,f321);
[ [ 6, 4809, 11 ], [ 6, 4809, 52 ], [ 6, 4813, 11 ], [ 6, 4828, 11 ],
  [ 6, 4892, 22 ] ]
gap> Length(NS321);
5
gap> Collected(List(NS321,x->Order(CaratMatGroupZClass(x[1],x[2],x[3]))));
[ [ 8, 4 ], [ 16, 1 ] ]
gap> List(NS321,x->H2nrM(CaratMatGroupZClass(x[1],x[2],x[3])).H2nrM);
[ [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ] ]
gap> Collected(last);
[ [ [ 2 ], 5 ] ]
gap> Union(NS6,NS51,NS42,NS411,NS33,NS321)=ns6;
true
gap> sdp51:=List(NS5,x->List([Group([],[[1]]),Group([[[-1]]])],
> y->AllSubdirectProducts(CaratMatGroupZClass(x[1],x[2],x[3]),y)));;
gap> sdp51i:=List(sdp51,l1->List(l1,l2->List(l2,g->CaratZClassNumber(p2m(g)))));;
gap> Length(Concatenation(Concatenation(sdp51i)));
161
gap> Length(NS51);
161
gap> Set(Concatenation(Concatenation(sdp51i)))=NS51;
true
gap> sdp42:=List(NS4,x->List(b2,
> y->AllSubdirectProducts(MatGroupZClass(x[1],x[2],x[3],x[4]),
> MatGroupZClass(y[1],y[2],y[3],y[4]))));;
gap> sdp42i:=List(sdp42,l1->List(l1,l2->List(l2,g->CaratZClassNumber(p2m(g)))));;
gap> Length(Concatenation(Concatenation(sdp42i)));
191
gap> Length(NS42);
218
gap> NS42new:=Difference(NS42,Concatenation(Concatenation(sdp42i)));
[ [ 6, 2418, 11 ], [ 6, 2424, 11 ], [ 6, 2424, 58 ], [ 6, 2471, 40 ],
  [ 6, 2471, 113 ], [ 6, 2483, 5 ], [ 6, 2483, 34 ], [ 6, 2488, 5 ],
  [ 6, 2489, 5 ], [ 6, 2633, 2 ], [ 6, 2634, 2 ], [ 6, 2634, 15 ],
  [ 6, 4825, 28 ], [ 6, 4825, 36 ], [ 6, 4825, 42 ], [ 6, 4828, 105 ],
  [ 6, 4828, 107 ], [ 6, 4828, 109 ], [ 6, 4830, 109 ], [ 6, 4830, 280 ],
  [ 6, 4831, 107 ], [ 6, 4837, 61 ], [ 6, 4837, 194 ], [ 6, 4841, 75 ],
  [ 6, 4892, 57 ], [ 6, 4892, 95 ], [ 6, 4892, 107 ] ]
gap> Length(NS42new);
27
gap> NS42newg:=List(NS42new,x->CaratMatGroupZClass(x[1],x[2],x[3]));;
gap> List(NS42newg,StructureDescription);
[ "C4 : C4", "(C4 x C2) : C2", "(C4 x C2) : C2", "(C2 x C2 x C2 x C2) : C2",
  "(C2 x C2 x C2 x C2) : C2", "(C2 x C2 x C2 x C2) : C2",
  "(C2 x C2 x C2 x C2) : C2", "(C4 x C2 x C2) : C2", "(C4 x C2 x C2) : C2",
  "C4 : C4", "(C4 x C2) : C2", "(C4 x C2) : C2", "C2 x D8", "C2 x D8",
  "C2 x D8", "C2 x D8", "C2 x D8", "C2 x D8", "C2 x D8", "C2 x D8",
  "C2 x D8", "C2 x D8", "C2 x D8", "C2 x D8", "D8", "D8", "D8" ]
gap> List(NS42newg,IdSmallGroup);
[ [ 16, 4 ], [ 16, 3 ], [ 16, 3 ], [ 32, 27 ], [ 32, 27 ], [ 32, 27 ],
  [ 32, 27 ], [ 32, 28 ], [ 32, 28 ], [ 16, 4 ], [ 16, 3 ], [ 16, 3 ],
  [ 16, 11 ], [ 16, 11 ], [ 16, 11 ], [ 16, 11 ], [ 16, 11 ], [ 16, 11 ],
  [ 16, 11 ], [ 16, 11 ], [ 16, 11 ], [ 16, 11 ], [ 16, 11 ], [ 16, 11 ],
  [ 8, 3 ], [ 8, 3 ], [ 8, 3 ] ]
gap> NS42newg1:=List(NS42newg,x->PartialMatrixGroup(x,[1..2]));;
gap> NS42newg2:=List(NS42newg,x->PartialMatrixGroup(x,[3..6]));;
gap> NS42newg12:=List([1..27],x->DirectSumMatrixGroup([NS42newg1[x],NS42newg2[x]]));;
gap> List(NS42newg12,CaratZClassNumber)=NS42new;
true
gap> List(NS42newg1,CrystCatZClassNumber);
[ [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ],
  [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ],
  [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ],
  [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ],
  [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ],
  [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ],
  [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ] ]
gap> List(NS42newg2,CrystCatZClassNumber);
[ [ 4, 12, 2, 6 ], [ 4, 12, 2, 6 ], [ 4, 12, 2, 6 ], [ 4, 12, 5, 10 ],
  [ 4, 12, 5, 10 ], [ 4, 12, 5, 10 ], [ 4, 12, 5, 10 ], [ 4, 12, 5, 10 ],
  [ 4, 12, 5, 10 ], [ 4, 18, 1, 3 ], [ 4, 18, 1, 3 ], [ 4, 18, 1, 3 ],
  [ 4, 5, 2, 8 ], [ 4, 5, 2, 8 ], [ 4, 5, 2, 8 ], [ 4, 6, 2, 10 ],
  [ 4, 6, 2, 10 ], [ 4, 6, 2, 10 ], [ 4, 6, 2, 10 ], [ 4, 6, 2, 10 ],
  [ 4, 6, 2, 10 ], [ 4, 5, 2, 8 ], [ 4, 5, 2, 8 ], [ 4, 5, 2, 8 ],
  [ 4, 5, 1, 12 ], [ 4, 5, 1, 12 ], [ 4, 5, 1, 12 ] ]
gap> List(NS42newg1,StructureDescription);
[ "D8", "D8", "D8", "D8", "D8", "D8", "D8", "D8", "D8", "D8", "D8", "D8",
  "D8", "D8", "D8", "D8", "D8", "D8", "D8", "D8", "D8", "D8", "D8", "D8",
  "D8", "D8", "D8" ]
gap> List(NS42newg2,StructureDescription);
[ "C4 x C2", "C4 x C2", "C4 x C2", "C2 x D8", "C2 x D8", "C2 x D8",
  "C2 x D8", "C2 x D8", "C2 x D8", "C4 x C2", "C4 x C2", "C4 x C2",
  "C2 x C2 x C2", "C2 x C2 x C2", "C2 x C2 x C2", "C2 x C2 x C2",
  "C2 x C2 x C2", "C2 x C2 x C2", "C2 x C2 x C2", "C2 x C2 x C2",
  "C2 x C2 x C2", "C2 x C2 x C2", "C2 x C2 x C2", "C2 x C2 x C2", "C2 x C2",
  "C2 x C2", "C2 x C2" ]
gap> List([1..27],x->[Order(NS42newg1[x]),Order(NS42newg2[x]),Order(NS42newg12[x])]);
[ [ 8, 8, 16 ], [ 8, 8, 16 ], [ 8, 8, 16 ], [ 8, 16, 32 ], [ 8, 16, 32 ],
  [ 8, 16, 32 ], [ 8, 16, 32 ], [ 8, 16, 32 ], [ 8, 16, 32 ], [ 8, 8, 16 ],
  [ 8, 8, 16 ], [ 8, 8, 16 ], [ 8, 8, 16 ], [ 8, 8, 16 ], [ 8, 8, 16 ],
  [ 8, 8, 16 ], [ 8, 8, 16 ], [ 8, 8, 16 ], [ 8, 8, 16 ], [ 8, 8, 16 ],
  [ 8, 8, 16 ], [ 8, 8, 16 ], [ 8, 8, 16 ], [ 8, 8, 16 ], [ 8, 4, 8 ],
  [ 8, 4, 8 ], [ 8, 4, 8 ] ]
gap> sdp411:=List(NS4,x->List(b11,
> y->AllSubdirectProducts(MatGroupZClass(x[1],x[2],x[3],x[4]),
> MatGroupZClass(y[1],y[2],y[3],y[4]))));;
gap> sdp411i:=List(sdp411,l1->List(l1,l2->List(l2,g->CaratZClassNumber(p2m(g)))));;
gap> Length(Concatenation(Concatenation(sdp411i)));
59
gap> Length(NS411);
59
gap> Set(Concatenation(Concatenation(sdp411i)))=NS411;
true
gap> NS33g:=List(NS33,x->CaratMatGroupZClass(x[1],x[2],x[3]));;
gap> List(NS33g,StructureDescription);
[ "D8", "D8", "D8", "C2 x D8", "D8" ]
gap> List(NS33g,IdSmallGroup);
[ [ 8, 3 ], [ 8, 3 ], [ 8, 3 ], [ 16, 11 ], [ 8, 3 ] ]
gap> GL3Z:=Flat(List([1..7],x->List([1..NrQClassesCrystalSystem(3,x)],
> y->List([1..NrZClassesQClass(3,x,y)],z->MatGroupZClass(3,x,y,z)))));
gap> D4_GL3Z:=Filtered(GL3Z,x->IdSmallGroup(x)=[8,3]);
[ MatGroupZClass( 3, 4, 4, 1 ), MatGroupZClass( 3, 4, 4, 2 ),
  MatGroupZClass( 3, 4, 5, 1 ), MatGroupZClass( 3, 4, 5, 2 ),
  MatGroupZClass( 3, 4, 6, 1 ), MatGroupZClass( 3, 4, 6, 2 ),
  MatGroupZClass( 3, 4, 6, 3 ), MatGroupZClass( 3, 4, 6, 4 ) ]
gap> sdp33a:=List(D4_GL3Z,x->AllSubdirectProducts(x,MatGroupZClass(3,3,1,3)));;
gap> List(sdp33a,Length);
[ 5, 5, 5, 5, 5, 5, 5, 5 ]
gap> sdp33ai:=List(sdp33a,x->List(x,y->CaratZClassNumber(p2m(y))));;
gap> List(sdp33ai,x->Intersection(x,NS33));
[ [  ], [ [ 6, 4813, 28 ] ], [  ], [ [ 6, 4892, 47 ] ], [  ], [  ],
  [ [ 6, 4809, 28 ] ], [ [ 6, 4809, 69 ] ] ]
gap> C2xD4_GL3Z:=Filtered(GL3Z,x->IdSmallGroup(x)=[16,11]);
[ MatGroupZClass( 3, 4, 7, 1 ), MatGroupZClass( 3, 4, 7, 2 ) ]
gap> sdp33b:=List(C2xD4_GL3Z,x->AllSubdirectProducts(x,MatGroupZClass(3,3,1,3)));;
gap> List(sdp33b,Length);
[ 15, 15 ]
gap> sdp33bi:=List(sdp33b,x->List(x,y->CaratZClassNumber(p2m(y))));;
gap>
gap> List(sdp33bi,x->Intersection(x,NS33));
[ [  ], [ [ 6, 4828, 104 ] ] ]
gap> sdp321:=List(NS32,x->List([Group([],[[1]]),Group([[[-1]]])],
> y->AllSubdirectProducts(CaratMatGroupZClass(x[1],x[2],x[3]),y)));;
gap> sdp321i:=List(sdp321,l1->List(l1,l2->List(l2,g->CaratZClassNumber(p2m(g)))));
[ [ [ [ 6, 4892, 22 ] ],
      [ [ 6, 4828, 11 ], [ 6, 4809, 11 ], [ 6, 4813, 11 ], [ 6, 4809, 52 ] ] ]
 ]
gap> Length(Concatenation(Concatenation(sdp321i)));
5
gap> Length(NS321);
5
gap> Set(Concatenation(Concatenation(sdp321i)))=NS321;
true

# Step 4
gap> LoadPackage("HAP");
true
gap> GL6Q:=List([1..7103],x->CaratMatGroupZClass(6,x,1));;
gap> nb6:=Filtered(GL6Q,x->BogomolovMultiplier(x)<>[]);
[ <matrix group of size 64 with 3 generators>,
  <matrix group of size 64 with 3 generators>,
  <matrix group of size 64 with 3 generators> ]
gap> List(nb6,BogomolovMultiplier);
[ [ 2 ], [ 2 ], [ 2 ] ]
gap> nb6i:=List(nb6,CaratQClassNumber);
[ [ 6, 6458 ], [ 6, 6459 ], [ 6, 6464 ] ]
gap> List(nb6i,x->CaratNrZClasses(x[1],x[2]));
[ 8, 8, 8 ]
gap> Filtered(f6,x->[x[1],x[2]] in nb6i);
[ [ 6, 6458, 2 ], [ 6, 6458, 4 ], [ 6, 6458, 6 ], [ 6, 6458, 8 ],
  [ 6, 6459, 2 ], [ 6, 6459, 4 ], [ 6, 6459, 6 ], [ 6, 6459, 8 ],
  [ 6, 6464, 2 ], [ 6, 6464, 4 ], [ 6, 6464, 6 ], [ 6, 6464, 8 ] ]
gap> Filtered(f51,x->[x[1],x[2]] in nb6i);
[  ]
gap> Filtered(f42,x->[x[1],x[2]] in nb6i);
[ [ 6, 6458, 1 ], [ 6, 6458, 3 ], [ 6, 6458, 5 ], [ 6, 6458, 7 ],
  [ 6, 6459, 1 ], [ 6, 6459, 3 ], [ 6, 6459, 5 ], [ 6, 6459, 7 ],
  [ 6, 6464, 1 ], [ 6, 6464, 3 ], [ 6, 6464, 5 ], [ 6, 6464, 7 ] ]
gap> Filtered(f33,x->[x[1],x[2]] in nb6i);
[  ]
gap> Filtered(f321,x->[x[1],x[2]] in nb6i);
[  ]
gap> Filtered(f3111,x->[x[1],x[2]] in nb6i);
[  ]
gap> Filtered(f222,x->[x[1],x[2]] in nb6i);
[  ]
gap> Filtered(f2211,x->[x[1],x[2]] in nb6i);
[  ]
gap> Filtered(f21111,x->[x[1],x[2]] in nb6i);
[  ]
gap> Filtered(f111111,x->[x[1],x[2]] in nb6i);
[  ]
gap> nb6z:=List(nb6i,x->List([1..CaratNrZClasses(x[1],x[2])],
> y->CaratMatGroupZClass(x[1],x[2],y)));;
gap> List(nb6z,x->List(x,IsInvertibleF));
[ [ true, false, true, false, false, false, false, false ],
  [ true, false, true, false, false, false, false, false ],
  [ true, false, true, false, false, false, false, false ] ]
gap> List(nb6z,x->List(x,y->H2nrM(y).H2nrM));
[ [ [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ] ],
  [ [  ], [  ], [  ], [  ], [  ], [  ], [  ], [ 2 ] ],
  [ [  ], [  ], [  ], [  ], [  ], [ 2 ], [  ], [  ] ] ]
gap> nb6z42:=List(nb6z,x->List([1,3,5,7],y->x[y]));;
gap> nb6z42_1:=List(nb6z42,x->List(x,y->PartialMatrixGroup(y,[1..4])));;
gap> nb6z42_2:=List(nb6z42,x->List(x,y->PartialMatrixGroup(y,[5..6])));;
gap> List([1..3],x->List([1..4],y->CaratZClassNumber(
> DirectSumMatrixGroup([nb6z42_1[x][y],nb6z42_2[x][y]]))));
[ [ [ 6, 6458, 1 ], [ 6, 6458, 3 ], [ 6, 6458, 5 ], [ 6, 6458, 7 ] ],
  [ [ 6, 6459, 1 ], [ 6, 6459, 3 ], [ 6, 6459, 5 ], [ 6, 6459, 7 ] ],
  [ [ 6, 6464, 1 ], [ 6, 6464, 3 ], [ 6, 6464, 5 ], [ 6, 6464, 7 ] ] ]
gap> List([1..3],x->List([1..4],y->CrystCatZClassNumber(nb6z42_1[x][y])));
[ [ [ 4, 32, 6, 1 ], [ 4, 32, 6, 1 ], [ 4, 32, 6, 2 ], [ 4, 32, 6, 2 ] ],
  [ [ 4, 32, 6, 1 ], [ 4, 32, 6, 1 ], [ 4, 32, 6, 2 ], [ 4, 32, 6, 2 ] ],
  [ [ 4, 32, 6, 1 ], [ 4, 32, 6, 1 ], [ 4, 32, 6, 2 ], [ 4, 32, 6, 2 ] ] ]
gap> List([1..3],x->List([1..4],y->CrystCatZClassNumber(nb6z42_2[x][y])));
[ [ [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ] ],
  [ [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ] ],
  [ [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ], [ 2, 3, 2, 1 ] ] ]
gap> [4,32,6,1] in N4;
false
gap> [4,32,6,1] in I4;
false
gap> [4,32,6,2] in N4;
true
\end{verbatim}

\bigskip
As mentioned before, multiplicative invariant fields arising from distinct lattices may be stably isomorphic. In following theorem, the stable isomorphisms of (1), (3), (4), (5) were already known in \cite[Theorems 6.2, 6.3 and 6.4, and their proof]{HKK}.

\begin{theorem}\label{equiv}
The following fields $K$ are stably equivalent each other:\\
{\rm (1)} $\bm{C}(G)$ where $G$ is a group of order $64$ which belongs to the $16$th isoclinism class $\Phi_{16}$ (see the $9$ groups defined in Lemma 5.5 of \cite{CHKK});\\
{\rm (2)} $\bm{C}(x_1,x_2,x_3,x_4)^{D_4}$
%where $M$ is a $D_4$-lattice of rank $4$. The action of
where $D_4=\langle\sigma,\tau\rangle$ acts on
$\bm{C}(x_1,x_2,x_3,x_4)$ by
\begin{align*}
&\sigma: x_1\mapsto x_2x_3, x_2\mapsto x_1x_3, x_3\mapsto x_4, x_4\mapsto \tfrac{1}{x_3},\\
&\tau: x_1\mapsto \tfrac{1}{x_2}, x_2\mapsto\tfrac{1}{x_1},
x_3\mapsto\tfrac{1}{x_4}, x_4\mapsto\tfrac{1}{x_3}.
\end{align*}
{\rm (3)} $\bm{C}(y_1,y_2,y_3,y_4,y_5)^{D_4}$ where $D_4=\langle\sigma,\tau\rangle$ acts on $\bm{C}(y_1,y_2,y_3,y_4,y_5)$ by
\begin{align*}
&\sigma: y_1\mapsto y_2, y_2\mapsto y_1, y_3\mapsto \tfrac{1}{y_1y_2y_3},
y_4\mapsto y_5, y_5\mapsto \tfrac{1}{y_4},\\
&\tau: y_1\mapsto y_3, y_2\mapsto \tfrac{1}{y_1y_2y_3}, y_3\mapsto y_1,
y_4\mapsto y_5, y_5\mapsto y_4.
\end{align*}
{\rm (4)} $\bm{C}(z_1,z_2,z_3,z_4)^{C_2\times C_2}$ where
$C_2\times C_2=\langle\sigma,\tau\rangle$ acts on
$\bm{C}(z_1,z_2,z_3,z_4)$ by
\begin{align*}
&\sigma: z_1\mapsto z_2, z_2\mapsto z_1, z_3\mapsto \tfrac{1}{z_1z_2z_3},
z_4\mapsto \tfrac{-1}{z_4},\\
&\tau: z_1\mapsto z_3, z_2\mapsto \tfrac{1}{z_1z_2z_3}, z_3\mapsto z_1,
z_4\mapsto -z_4.
\end{align*}
{\rm (5)} $\bm{C}(w_1,w_2,w_3,w_4)^{C_2}$ where
$C_2=\langle\sigma\rangle$ acts on
$\bm{C}(w_1,w_2,w_3,w_4)$ by
\begin{align*}
&\sigma: w_1\mapsto -w_1, w_2\mapsto \tfrac{w_4}{w_2},
w_3\mapsto \tfrac{(w_4-1)(w_4-w_1^2)}{w_3}, w_4\mapsto w_4.
\end{align*}
In particular, the unramified cohomology groups
$H_u^i(K,\bm{Q}/\bm{Z})$ of the fields $K$
in {\rm (1)}--{\rm (5)} are coincide and
${\rm Br}_u(K)\simeq \bm{Z}/2\bm{Z}$.
\end{theorem}
\begin{proof}
The equivalent (1) $\Leftrightarrow$ (3) $\Leftrightarrow$ (4)
$\Leftrightarrow$ (5) is already known
(see \cite[Theorems 6.2, 6.3 and 6.4, and their proofs]{HKK}).
We will show that (2) $\Leftrightarrow$ (4). Let $x_1, x_2, x_3, x_4$ be given in (2).
Define
$u_1=\frac{x_1x_4(x_3+1)}{x_4+1}$,
$u_2=\frac{x_2}{x_1}$,
$u_3=\frac{x_3+1}{x_3-1}\frac{x_4+1}{x_4-1}$,
$u_4=\frac{x_3+1}{x_3-1}/\frac{x_4+1}{x_4-1}$.
Because of $\sigma^2: x_1\mapsto x_1x_3x_4$,
$x_2\mapsto x_2x_3x_4$,
$x_3\mapsto\tfrac{1}{x_3}$, $x_4\mapsto\tfrac{1}{x_4}$,
we have $\bm{C}(x_1,x_2,x_3,x_4)^{\langle\sigma^2\rangle}
=\bm{C}(u_1,u_2,u_3,u_4)$
and the actions of $\sigma$ and $\tau$ on $\bm{C}(u_1,u_2,u_3,u_4)$
are given by
\begin{align*}
\sigma:\ &u_1\mapsto\frac{u_1u_2(u_3u_4-1)}{(u_3-u_4)u_4},
u_2\mapsto \frac{1}{u_2}, u_3\mapsto -u_3, u_4\mapsto -\frac{1}{u_4},\\
\tau:\ &u_1\mapsto \frac{1}{u_1u_2}, u_2\mapsto u_2,
u_3\mapsto u_3, u_4\mapsto\frac{1}{u_4}.
\end{align*}
Define
\begin{align*}
z_1=u_1,
z_2=\frac{u_1u_2(u_3u_4-1)}{(u_3-u_4)u_4},
z_3=\frac{1}{u_1u_2},
z_4=\frac{u_4+1}{u_4-1}.
\end{align*}
Then $\bm{C}(u_1,u_2,u_3,u_4)=\bm{C}(z_1,z_2,z_3,z_4)$
and the actions of $\sigma$ and $\tau$ on $\bm{C}(z_1,z_2,z_3,z_4)$
are exactly the same as in (4).
Note that the unramified Brauer groups are isomorphic for stably isomorphic fields by \cite[Proposition 2.2]{Sa3} or \cite[Proposition 1.2]{CTO}. The last statement follows from Theorem \ref{t1.5} (2).
\end{proof}


%------------------------------------S6
%\ssection{}
%\cchapter{Elementary abelian cases}
\section{Classification of elementary abelian groups $(C_2)^k$ in $GL_n(\bZ)$ with $n\leq 7$}\label{seC}

After we finished the proof of Theorem \ref{t1.5}, we examined the groups obtained in Section 9. It was found that the elementary abelian $2$-group $(C_2)^3$ didn't appear on the lists. But Theorem \ref{thB1} tells us that some faithful lattice $M$ of this group will produce an example that the unramified Brauer group of $\bm{C}(M)^G$ is non-trivial where $G=(C_2)^3$. So we searched $G$-lattices of rank $7$. To our surprise, such lattices had not been explored before. This led to the study of elementary abelian $2$-groups in $GL_n(\bZ)$ with $n\leq 7$ and the associated unramified Brauer groups.

In this section, we will classify
elementary abelian groups $(C_2)^k$ in $GL_n(\bZ)$ with $n\leq 7$; the study of unramified Brauer groups is postponed till the next section.

\medskip
First we recall some terminology. Two finite subgroups in $GL_n(\bZ)$ are called $\bQ$-conjugate if they are conjugate by some matrix in $GL_n(\bQ)$; they are $\bZ$-conjugate if they are conjugate by some matrix in $GL_n(\bZ)$. Thus $\bQ$-conjugation defines an equivalence relation on the set of finite subgroups of $GL_n(\bZ)$; an equivalence class is called a $\bQ$-class in $GL_n(\bZ)$. Similarly for a $\bZ$-class in $GL_n(\bZ)$.

Let $G_{2^n}$ be the subgroup in $GL_n(\bZ)$ generated by the $n$ diagonal matrices
${\rm Diag}(-1,1,\ldots,1)$, ${\rm Diag}(1,-1,1,$ $\ldots,1),\ldots, {\rm Diag}(1,\ldots,1,-1)$. We will show that any finite subgroup $G$ in $GL_n(\bZ)$ with $G \simeq (C_2)^k$ ($k$ is some positive integer) is $\bQ$-conjugate to a subgroup of $G_{2^n}$. In fact, all the matrices of $G$ can be diagonalized simultaneously within $GL_n(\bQ)$. In other words, $G$ is $\bQ$-conjugate to a subgroup consisting of diagonal matrices, which is just some subgroup of $G_{2^n}$.

The main idea of the proof of Theorem \ref{t5.1} is to show that $\bQ$-conjugation is the same as $S_n$-equivalence (for the definition of $S_7$-equivalence see Step 2 in the proof of Theorem \ref{t5.1}). The general result for any positive integer $n$ is proved in Theorem \ref{t5.2} which relies on a theorem proved in coding theory \cite{BBFKKW}. Although no essential idea of error-correcting codes is used in the proof of Theorem 6.8.4 of \cite[page 551]{BBFKKW}, we choose to present Theorem \ref{t5.1} for $n=7$ along the traditional mathematical arguments. It has a bonus that the proof provides for each $\bQ$-class a set of complete invariants, the trace vector $L_G$ and the numerical invariants $T^1_G$ and $T^3_G$ : Any two elementary abelian $2$-groups $G_1$ and $G_2$ in $GL_7(\bZ)$ are $\bQ$-conjugate if and only if they have the same invariants (see Steps $3$ and $4$ in the proof of Theorem \ref{t5.1}).

\begin{theorem}\label{t5.1}~\\
{\rm (1)} There exist
$3$ $($resp. $2$$)$ $\bZ$-classes
forming
$2$ $($resp. $1$$)$ $\bQ$-classes
of groups
$(C_2)^k$ in $GL_2(\bZ)$ for $k=1$ $($resp. $2$$)$.\\
{\rm (2)} There exist
$5$ $($resp. $11$, $4$$)$ $\bZ$-classes
forming
$3$ $($resp. $3$, $1$$)$ $\bQ$-classes
of groups
$(C_2)^k$ in $GL_3(\bZ)$ for $k=1$ $($resp. $2$, $3$$)$.\\
{\rm (3)} There exist
$8$ $($resp. $37$, $39$, $8$$)$ $\bZ$-classes
forming
$4$ $($resp. $6$,  $4$, $1$$)$ $\bQ$-classes
of groups
$(C_2)^k$ in $GL_4(\bZ)$ for $k=1$ $($resp. $2$, $3$, $4$$)$.\\
{\rm (4)} There exist
$11$ $($resp. $99$, $263$, $138$, $16$$)$ $\bZ$-classes
forming
$5$ $($resp. $10$,  $10$, $5$, $1$$)$ $\bQ$-classes
of groups
$(C_2)^k$ in $GL_5(\bZ)$ for $k=1$ $($resp. $2$, $3$, $4$, $5$$)$.\\
{\rm (5)} There exist
$15$ $($resp. $255$, $1649$, $1947$, $511$, $36$$)$ $\bZ$-classes
forming
$6$ $($resp. $16$,  $22$, $16$, $6$, $1$$)$ $\bQ$-classes
of groups
$(C_2)^k$ in $GL_6(\bZ)$ for $k=1$ $($resp. $2$, $3$, $4$, $5$, $6$$)$.\\
{\rm (6)} There exist
$19$ $($resp. $608$, $10645$, $29442$, $15248$, $2016$, $80$$)$ $\bZ$-classes
forming
$7$ $($resp. $23$,  $43$, $43$, $23$, $7$, $1$$)$ $\bQ$-classes
of groups
$(C_2)^k$ in $GL_7(\bZ)$ for $k=1$ $($resp. $2$, $3$, $4$, $5$, $6$, $7$$)$.
\end{theorem}

\begin{proof}
(1)--(5): $2\leq n\leq 6$.
We can use the CARAT package \cite{CARAT}
of GAP which has a database of all $\bZ$-classes and
$\bQ$-classes of finite subgroup of $GL_n(\bZ)$ $(n\leq 6)$ up to conjugacy.
For GAP ID and CARAT ID, see Hoshi-Yamasaki \cite[Chapter 3]{HY}.

(6): $n=7$. No database for rank $n=7$ in CARAT was created. We should work out it ourselves. Note that the main job is to find $\bQ$-classes. Once a $\bQ$-class is find, we may use the CARAT function {\tt ZClassRepsQClass} of GAP to split the $\bQ$-class into a union of $\bZ$-classes. So we will concentrate to find all the $\bQ$-classes of subgroups $\simeq (C_2)^k$ in the following steps..

Step 1.
Let $G_{128}$ be the diagonal subgroup of $GL_7(\bZ)$ of order $128$ which is generated by the diagonal matrices ${\rm Diag}(-1,1,1,1,1,1,1)$, ${\rm Diag}(1,-1,1,1,1,1,1),\ldots, {\rm Diag}(1,1,1,1,1,1,-1)$. %in $GL_7(\bZ)$.

Via the group isomorphism $\{-1, 1 \} \to \bF_2$, subgroups $G_{128}$ correspond bijective to vector subspaces of $(\bF_2)^7$. It is not difficult to determine the number of subgroups of $G_{128}$ with order $2^k$ (because we may determine that for the vector subspaces of $(\bF_2)^7$); for examples, the number of subgroups of order $4$ is $127 \cdot 126/((4-1)(4-2))= 2667$. It follows that there exist $127$
(resp. $2667$, $11811$, $11811$, $2667$, $127$) subgroups in $G_{128}$, which are
of order $2$ (resp. $4$, $8$, $16$, $32$, $64$).

\medskip
Step 2.

Consider the equivalence relation defined on the set of all subgroups of elementary abelian $2$-groups of $GL_7(\bZ)$. Since every such subgroup is $\bQ$-conjugate to some subgroup of $G_{128}$, we may as well consider the restriction of this equivalence relation to the set of all subgroups of $G_{128}$. Clearly the numbers of equivalence classes of these two equivalence relations are the same.

Now we consider a coarser equivalence relation on the set of subgroups of $G_{128}$. Let $S_7$ be the subgroup of $GL_7(\bZ)$ consisting of all the permutation matrices; $S_7$ is isomorphic to the symmetric group in $7$ letters as an abstract group. Two subgroups $G_1, G_2\subset G_{128}$ are called $S_7$-equivalent if there is some element $t \in S_7$ such that $G_2= t \cdot G_1 \cdot t^{-1}$. Note that $S_7$-equivalence implies $\bQ$-conjugation, but the converse is not obvious. The advantage of considering $S_7$-equivalence is that, (i) the group $S_7$ is a finite group, and (ii) for any $t \in S_7$, any subgroup $G$ of $G_{128}$, the group $t \cdot G \cdot t^{-1}$ is always a subgroup of $G_{128}$. Thus we may find all the $S_7$-equivalence classes easily with the help of computers. In Step 3 and Step 4 we will show that $\bQ$-conjugation for subgroups of $G_{128}$ is necessarily $S_7$-equivalent.

\medskip
Step 3.

For a group $G\subset G_{128}$, define the trace vector $L_G$ associated to $G$. Explicitly, $L_G=[ t_{-7}, t_{-5}, t_{-3}, t_{-1}, t_1, t_3, t_5, t_7 ]$
$\in \bm{Z}^8$ as follows: $t_m$
is the number of elements in $G$ whose trace is $m$. Note that the trace of an element in $G$ is always an odd integer; moreover, if two groups are $\bQ$-conjugate, then they have the same trace vector.

We claim that, if $G_1, G_2$ are subgroups of $G_{128}$ isomorphic to $(C_2)^k$ ($1 \le k\le 6$), then the following two statements are equivalent, (i) $G_1$ and $G_2$ are $S_7$-equivalent, (ii) $G_1$ and $G_2$ are $\bQ$-conjugate. In fact, we will prove this by showing that, in ``most" situations (including the cases $k \neq 3,4$), (i) and (ii) are equivalent to : (iii) $L_{G_1}= L_{G_2}$.

Clearly, (i) $\Rightarrow$ (ii), and (ii) $\Rightarrow$ (iii). It remains to show that (iii) $\Rightarrow$ (i) in ``most" situations, and to show that (ii) $\Rightarrow$ (i) in the remaining situations.

\medskip
Let $X(k)$ be the set of all subgroups of $G_{128}$ isomorphic to $(C_2)^k$ ($1 \le k \le 6$ and $k\neq 3, 4$). We define the $L_G$-equivalence on $X(k)$ : If $G_1, G_2 \in X(k)$, $G_1$ and $G_2$ are $L_G$-equivalent if $L_{G_1}= L_{G_2}$. Thus $X(k)$ is partitioned into a finite disjoint union of $L_G$-equivalence classes; for simplicity, we call these $L_G$-equivalence classes the $L_G$-orbits. Clearly, each $L_G$-orbit is stable under the conjugation actions of $S_7$; namely, each $L_G$-orbit is a union of some $S_7$-equivalence classes. By computer computation, each $L_G$-orbit consists only one $S_7$-equivalence class. This finishes the proof.

\medskip
Step 4.
The situation for subgroup $\simeq (C_2)^3$ is slightly different and the proof may be modified as follows (the proof for subgroup $\simeq (C_2)^4$ is similar and is omitted).

As before, let $X(3)$ be the subgroups $\simeq (C_2)^3$ in $G_{128}$ and define the $L_G$-orbits as in Step 3. Computer computation shows that there are forty-one $L_G$-orbits. Moreover, each $L_G$-orbit consists only one $S_7$-equivalence class except two $L_G$-orbits. Thus the proof of (iii) $\Rightarrow$ (i) is finished for these good $L_G$-orbits. The exceptional cases are the $L_G$-orbits with trace vector $L_G= [0,1,2,1,2,1,0,1]$ and $L_G=[0,1,0,3,0,3,0,1]$.

\medskip
We will discuss the $L_G$-orbit with $L_G= [0,1,2,1,2,1,0,1]$ first.

{}From the trace vector, we know that, if $G$ belongs to this $L_G$-orbit, then there are precisely three distinct elements $x, y \in G$ with trace$(x)=$trace$(y)=1$ (where trace$(x)$ denotes the trace of the matrix $x$). Define another invariant of the group $G$. Define $T_G ^1=$trace$(xy)$. Clearly $T_G ^1$ is the same for all $\bQ$-conjugate groups. In fact, if $G$ is a groups in this $L_G$-orbit, $T_G ^1$ is $3$ or $-1$. Thus the $L_G$-orbit is the disjoint union of two subsets $Y_1$ and $Y_2$ where each group $G$ in $Y_1$ (resp. $Y_2$) has
$T_G ^1$ equal to $3$ (resp. $-1$). We find that $Y_i$ is a union of $\bQ$-classes for $i=1,2$. Now $S_7$ acts on elements of $Y_i$ by conjugation. By computer computation, $S_7$ is transitive on $Y_i$. In other words, $Y_i$ is just a single $\bQ$-class and is also a single $S_7$-equivalence class. This finishes the proof of (ii) $\Rightarrow$ (i).

\medskip
Now consider the $L_G$-orbit with trace vector $L_G=[0,1,0,3,0,3,0,1]$. If $G$ belongs to this $L_G$-orbit, there are precisely three distinct elements $x, y, z \in G$ with trace$(x)=$trace$(y)=$trace$(z)=3$. Note that the traces of $xy, xz, yz$ are the same. Define $T_G ^3=$trace$(xy)$. Note that $T_G ^3$ is the same for all $\bQ$-conjugate groups; it is either $3$ or $-1$. Thus this $L_G$-orbit is the disjoint union of two subsets $Z_1$ and $Z_2$. As before, each of $Z_i$ is a single $\bQ$-class and is also a single $S_7$-equivalence class. Done.

\medskip
Now we may understand $\bQ$-classes of subgroups isomorphic to $(C_2)^k$ via $S_7$-equivalence classes of subgroups of $G_{128}$.

Conclusion : There exist
$7$ $($resp. $23$,  $43$, $43$, $23$, $7$, $1$$)$ $\bQ$-classes
of groups
$(C_2)^k$ in $GL_7(\bZ)$ for $k=1$ $($resp. $2$, $3$, $4$, $5$, $6$, $7$$)$
with invariants $L_G$, $T^1_G$ and $T^3_G$ (see Table $4$).
\end{proof}
\newpage

%%%%%%%%%%%%%%%%%%%

Table $4$: All $\bZ$-classes of $(C_2)^k$ of rank $7$
with complete invariants $L_G$, $T^1_G$, $T^3_G$.\vspace*{2mm}\\
%{\footnotesize
\begin{tabular}{lr}
$L_G$ with $G\simeq C_2$
& \# $\bm{Z}$-classes \\\hline %& \# $G$'s with $H_u^2(G,M)\neq 0$ \\\hline
$[ 1, 0, 0, 0, 0, 0, 0, 1 ]$ & 1 \\% & 0 \\
$[ 0, 1, 0, 0, 0, 0, 0, 1 ]$ & 2 \\% & 0 \\
$[ 0, 0, 1, 0, 0, 0, 0, 1 ]$ & 3 \\% & 0 \\
$[ 0, 0, 0, 1, 0, 0, 0, 1 ]$ & 4 \\% & 0 \\
$[ 0, 0, 0, 0, 1, 0, 0, 1 ]$ & 4 \\% & 0 \\
$[ 0, 0, 0, 0, 0, 1, 0, 1 ]$ & 3 \\% & 0 \\
$[ 0, 0, 0, 0, 0, 0, 1, 1 ]$ & 2 \\% & 0 \\
\hline
Total & 19 %& 0
%\end{tabular}
%\begin{tabular}{lcc}
\\
\\
$L_G$ with $G\simeq (C_2)^2$
& \# $\bm{Z}$-classes \\\hline%& \# $G$'s with $H_u^2(G,M)\neq 0$ \\\hline
$[ 1, 1, 0, 0, 0, 0, 1, 1 ]$ & 2 \\% & 0 \\
$[ 1, 0, 1, 0, 0, 1, 0, 1 ]$ & 3 \\% & 0 \\
$[ 1, 0, 0, 1, 1, 0, 0, 1 ]$ & 4 \\% & 0 \\
$[ 0, 1, 1, 0, 1, 0, 0, 1 ]$ & 12 \\% & 0 \\
$[ 0, 1, 1, 0, 0, 0, 1, 1 ]$ & 7 \\% & 0 \\
$[ 0, 1, 0, 1, 0, 1, 0, 1 ]$ & 12 \\% & 0 \\
$[ 0, 1, 0, 2, 0, 0, 0, 1 ]$ & 13 \\% & 0 \\
$[ 0, 1, 0, 0, 2, 0, 0, 1 ]$ & 13 \\% & 0 \\
$[ 0, 2, 0, 0, 0, 1, 0, 1 ]$ & 6 \\% & 0 \\
$[ 0, 0, 1, 1, 1, 0, 0, 1 ]$ & 82 \\% & 0 \\
$[ 0, 0, 1, 1, 0, 0, 1, 1 ]$ & 12 \\% & 0 \\
$[ 0, 0, 1, 0, 1, 1, 0, 1 ]$ & 26 \\% & 0 \\
$[ 0, 0, 2, 1, 0, 0, 0, 1 ]$ & 20 \\% & 0 \\
$[ 0, 0, 2, 0, 0, 1, 0, 1 ]$ & 29 \\% & 0 \\
$[ 0, 0, 0, 1, 1, 0, 1, 1 ]$ & 16 \\% & 0 \\
$[ 0, 0, 0, 1, 2, 0, 0, 1 ]$ & 112 \\% & 0 \\
$[ 0, 0, 0, 1, 0, 2, 0, 1 ]$ & 20 \\% & 0 \\
$[ 0, 0, 0, 2, 0, 1, 0, 1 ]$ & 60 \\% & 0 \\
$[ 0, 0, 0, 3, 0, 0, 0, 1 ]$ & 62 \\% & 0 \\
$[ 0, 0, 0, 0, 1, 1, 1, 1 ]$ & 12 \\% & 0 \\
$[ 0, 0, 0, 0, 2, 1, 0, 1 ]$ & 60 \\% & 0 \\
$[ 0, 0, 0, 0, 0, 1, 2, 1 ]$ & 6 \\% & 0 \\
$[ 0, 0, 0, 0, 0, 3, 0, 1 ]$ & 19 \\% & 0 \\
\hline
Total & 608 %& 0
\\
\\
\\
\\
\\
\\
\\
\\
\\
\\
\\
\end{tabular}\hspace*{4mm}
\begin{tabular}{llr}
$L_G$ with $G\simeq (C_2)^3$
& & \# $\bm{Z}$-classes \\\hline%& \# $G$'s with $H_u^2(G,M)\neq 0$ & $H_u^2(G,M)$  \\\hline
$[ 1, 1, 1, 1, 1, 1, 1, 1 ]$ & & 12\\% & 0 & \\
$[ 1, 1, 0, 2, 2, 0, 1, 1 ]$ & & 13\\% & 0 & \\
$[ 1, 2, 1, 0, 0, 1, 2, 1 ]$ & & 6\\% & 0 & \\
$[ 1, 0, 1, 2, 2, 1, 0, 1 ]$ & & 60\\% & 0 & \\
$[ 1, 0, 2, 1, 1, 2, 0, 1 ]$ & & 20\\% & 0 & \\
$[ 1, 0, 3, 0, 0, 3, 0, 1 ]$ & & 19\\% & 0 & \\
$[ 1, 0, 0, 3, 3, 0, 0, 1 ]$ & & 62\\% & 0 & \\
$[ 0, 1, 1, 1, 2, 1, 1, 1 ]$ & & 80\\% & 0 & \\
$[ 0, 1, 1, 2, 3, 0, 0, 1 ]$ & & 380\\% & 1 & $\bm{Z}/2\bm{Z}$ \\
$[ 0, 1, 2, 1, 2, 1, 0, 1 ]$ & $T^1_G=3\ \ $ & 208\\% & 0 & \\
$[ 0, 1, 2, 1, 2, 1, 0, 1 ]$ & $T^1_G=-1$ & 107\\% & 0 & \\
$[ 0, 1, 2, 1, 0, 1, 2, 1 ]$ & & 28\\% & 0 & \\
$[ 0, 1, 2, 2, 1, 0, 1, 1 ]$ & & 80\\% & 0 & \\
$[ 0, 1, 0, 1, 4, 1, 0, 1 ]$ & & 279\\% & 0 & \\
$[ 0, 1, 0, 3, 0, 3, 0, 1 ]$ & $T^3_G=3\ \ $ & 113\\% & 0 & \\
$[ 0, 1, 0, 3, 0, 3, 0, 1 ]$ & $T^3_G=-1$  & 58\\% & 0 & \\
$[ 0, 1, 0, 5, 0, 1, 0, 1 ]$ & & 279\\% & 1 & $\bm{Z}/2\bm{Z}$ \\
$[ 0, 2, 1, 0, 3, 1, 0, 1 ]$ & & 58\\% & 0 & \\
$[ 0, 2, 2, 0, 1, 1, 1, 1 ]$ & & 28\\% & 0 & \\
$[ 0, 2, 0, 3, 0, 2, 0, 1 ]$ & & 58\\% & 0 & \\
$[ 0, 3, 0, 1, 0, 3, 0, 1 ]$ & & 18\\% & 0 & \\
$[ 0, 0, 1, 1, 2, 2, 1, 1 ]$ & & 107\\% & 0 & \\
$[ 0, 0, 1, 2, 1, 1, 2, 1 ]$ & & 58\\% & 0 & \\
$[ 0, 0, 1, 2, 3, 1, 0, 1 ]$ & & 1919\\% & 0 & \\
$[ 0, 0, 1, 3, 2, 0, 1, 1 ]$ & & 415\\% & 0 & \\
$[ 0, 0, 1, 0, 3, 3, 0, 1 ]$ & & 221\\% & 0 & \\
$[ 0, 0, 2, 1, 2, 2, 0, 1 ]$ & & 429\\% & 0 & \\
$[ 0, 0, 2, 2, 1, 1, 1, 1 ]$ & & 208\\% & 0 & \\
$[ 0, 0, 2, 3, 2, 0, 0, 1 ]$ & & 1000\\% & 4 & $\bm{Z}/2\bm{Z}$ \\
$[ 0, 0, 3, 2, 1, 1, 0, 1 ]$ & & 429\\% & 2 & $\bm{Z}/2\bm{Z}$ \\
$[ 0, 0, 3, 3, 0, 0, 1, 1 ]$ & & 58\\% & 0 & \\
$[ 0, 0, 3, 0, 1, 3, 0, 1 ]$ & & 113\\% & 0 & \\
$[ 0, 0, 4, 1, 0, 2, 0, 1 ]$ & & 92\\% & 0 & \\
$[ 0, 0, 0, 1, 2, 2, 2, 1 ]$ & & 58\\% & 0 & \\
$[ 0, 0, 0, 1, 4, 2, 0, 1 ]$ & & 691\\% & 0 & \\
$[ 0, 0, 0, 1, 0, 6, 0, 1 ]$ & & 60\\% & 0 & \\
$[ 0, 0, 0, 2, 3, 1, 1, 1 ]$ & & 432\\% & 0 & \\
$[ 0, 0, 0, 3, 4, 0, 0, 1 ]$ & & 1077\\% & 0 & \\
$[ 0, 0, 0, 3, 0, 4, 0, 1 ]$ & & 221\\% & 0 & \\
$[ 0, 0, 0, 5, 0, 2, 0, 1 ]$ & & 691\\% & 0 & \\
$[ 0, 0, 0, 7, 0, 0, 0, 1 ]$ & & 269\\% & 1 & $(\bm{Z}/2\bm{Z})^{\oplus 2}$ \\
$[ 0, 0, 0, 0, 1, 3, 3, 1 ]$ & & 18\\% & 0 & \\
$[ 0, 0, 0, 0, 3, 3, 1, 1 ]$ & & 113\\% & 0 & \
\hline
Total & & 10645 %& 9
\end{tabular}

\vspace*{2mm}
\noindent
%$(1)$ (resp. $(1^\prime)$) is the case where
%the is trace of the product of two distinct elements with trace $1$ is
%$3$ (resp. $-1$).\\
%$(2)$ (resp. $(2^\prime)$) is the case where
%the trace of the product of two distinct elements with trace $3$ is
%$3$ (resp. $-1$).\\
$L_G=[ t_{-7}, t_{-5}, t_{-3}, t_{-1}, t_1, t_3, t_5, t_7 ]$
$\in \bm{Z}^8$ is the list of $t_m$ which
is the number of elements of $G$ whose trace is $m$.\\
$T^i_G$ is the trace of the product of two distinct elements
with trace $i$.

\begin{tabular}{llr}
$L_G$ with $G\simeq (C_2)^4$
& & \# $\bm{Z}$-classes \\\hline%& \# $G$'s with $H_u^2(G,M)\neq 0$ \\\hline
$[ 1, 1, 1, 5, 5, 1, 1, 1 ]$ & & 279 \\% & 0 \\
$[ 1, 1, 3, 3, 3, 3, 1, 1 ]$ & $T^3_G=3\ \ $ & 113 \\% & 0 \\
$[ 1, 1, 3, 3, 3, 3, 1, 1 ]$ & $T^3_G=-1$ & 58 \\% & 0 \\
$[ 1, 2, 2, 3, 3, 2, 2, 1 ]$ & & 58 \\% & 0 \\
$[ 1, 3, 3, 1, 1, 3, 3, 1 ]$ & & 18 \\% & 0 \\
$[ 1, 0, 2, 5, 5, 2, 0, 1 ]$ & & 691 \\% & 0 \\
$[ 1, 0, 4, 3, 3, 4, 0, 1 ]$ & & 221 \\% & 0 \\
$[ 1, 0, 6, 1, 1, 6, 0, 1 ]$ & & 60 \\% & 0 \\
$[ 1, 0, 0, 7, 7, 0, 0, 1 ]$ & & 269 \\% & 0 \\
$[ 0, 1, 1, 3, 6, 3, 1, 1 ]$ & & 886 \\% & 0 \\
$[ 0, 1, 2, 3, 4, 3, 2, 1 ]$ & & 270 \\% & 0 \\
$[ 0, 1, 2, 5, 6, 1, 0, 1 ]$ & & 2823 \\% & 0 \\
$[ 0, 1, 3, 3, 2, 3, 3, 1 ]$ & & 109 \\% & 0 \\
$[ 0, 1, 3, 5, 4, 1, 1, 1 ]$ & & 1878 \\% & 0 \\
$[ 0, 1, 4, 3, 4, 3, 0, 1 ]$ & $T^3_G=3\ \ $ & 883 \\% & 0 \\
$[ 0, 1, 4, 3, 4, 3, 0, 1 ]$ & $T^3_G=-1$ & 670 \\% & 0 \\
$[ 0, 1, 4, 5, 2, 1, 2, 1 ]$ & & 270 \\% & 0 \\
$[ 0, 1, 0, 3, 8, 3, 0, 1 ]$ & & 789 \\% & 0 \\
$[ 0, 1, 0, 7, 0, 7, 0, 1 ]$ & & 380 \\% & 0 \\
$[ 0, 1, 0, 11, 0, 3, 0, 1 ]$ & & 789 \\% & 0 \\
$[ 0, 2, 2, 3, 6, 2, 0, 1 ]$ & & 1170 \\% & 0 \\
$[ 0, 2, 3, 3, 4, 2, 1, 1 ]$ & & 422 \\% & 0 \\
$[ 0, 2, 4, 3, 2, 2, 2, 1 ]$ & & 141 \\% & 0 \\
$[ 0, 2, 0, 9, 0, 4, 0, 1 ]$ & & 574 \\% & 0 \\
$[ 0, 3, 2, 1, 6, 3, 0, 1 ]$ & & 144 \\% & 0 \\
$[ 0, 3, 3, 1, 4, 3, 1, 1 ]$ & & 109 \\% & 0 \\
$[ 0, 3, 0, 7, 0, 5, 0, 1 ]$ & & 144 \\% & 0 \\
$[ 0, 4, 0, 5, 0, 6, 0, 1 ]$ & & 56 \\% & 0 \\
$[ 0, 0, 1, 1, 6, 6, 1, 1 ]$ & & 380 \\% & 0 \\
$[ 0, 0, 1, 3, 4, 4, 3, 1 ]$ & & 214 \\% & 0 \\
$[ 0, 0, 1, 5, 6, 2, 1, 1 ]$ & & 3055 \\% & 0 \\
$[ 0, 0, 2, 3, 6, 4, 0, 1 ]$ & & 2534 \\% & 0 \\
$[ 0, 0, 2, 5, 4, 2, 2, 1 ]$ & & 1170 \\% & 0 \\
$[ 0, 0, 3, 3, 4, 4, 1, 1 ]$ & & 883 \\% & 0 \\
$[ 0, 0, 3, 7, 4, 0, 1, 1 ]$ & & 1037 \\% & 0 \\
$[ 0, 0, 4, 1, 4, 6, 0, 1 ]$ & & 361 \\% & 0 \\
$[ 0, 0, 4, 5, 4, 2, 0, 1 ]$ & & 2867 \\% & 0 \\
$[ 0, 0, 5, 5, 2, 2, 1, 1 ]$ & & 670 \\% & 0 \\
$[ 0, 0, 6, 3, 2, 4, 0, 1 ]$ & & 558 \\% & 0 \\
$[ 0, 0, 0, 1, 4, 6, 4, 1 ]$ & & 56 \\% & 0 \\
$[ 0, 0, 0, 3, 6, 4, 2, 1 ]$ & & 574 \\% & 0 \\
$[ 0, 0, 0, 5, 0, 10, 0, 1 ]$ & & 145 \\% & 0 \\
$[ 0, 0, 0, 9, 0, 6, 0, 1 ]$ & & 664 \\% & 0 \\
\hline
Total & & 29442 %& 0
\end{tabular}\hspace*{4mm}
\begin{tabular}{lr}
$L_G$ with $G\simeq (C_2)^5$
& \# $\bm{Z}$-classes \\\hline%& \# $G$'s with $H_u^2(G,M)\neq 0$ \\\hline
$[ 1, 1, 3, 11, 11, 3, 1, 1 ]$ & 789 \\% & 0 \\
$[ 1, 1, 7, 7, 7, 7, 1, 1 ]$ & 380 \\% & 0 \\
$[ 1, 2, 4, 9, 9, 4, 2, 1 ]$ & 574 \\% & 0 \\
$[ 1, 3, 5, 7, 7, 5, 3, 1 ]$ & 144 \\% & 0 \\
$[ 1, 4, 6, 5, 5, 6, 4, 1 ]$ & 56 \\% & 0 \\
$[ 1, 0, 6, 9, 9, 6, 0, 1 ]$ & 664 \\% & 0 \\
$[ 1, 0, 10, 5, 5, 10, 0, 1 ]$ & 145 \\% & 0 \\
$[ 0, 1, 2, 7, 12, 7, 2, 1 ]$ & 1034 \\% & 0 \\
$[ 0, 1, 4, 7, 8, 7, 4, 1 ]$ & 360 \\% & 0 \\
$[ 0, 1, 6, 11, 8, 3, 2, 1 ]$ & 1860 \\% & 0 \\
$[ 0, 1, 8, 7, 8, 7, 0, 1 ]$ & 983 \\% & 0 \\
$[ 0, 1, 0, 15, 0, 15, 0, 1 ]$ & 206 \\% & 0 \\
$[ 0, 2, 5, 9, 10, 4, 1, 1 ]$ & 2499 \\% & 0 \\
$[ 0, 2, 7, 9, 6, 4, 3, 1 ]$ & 557 \\% & 0 \\
$[ 0, 3, 4, 7, 12, 5, 0, 1 ]$ & 899 \\% & 0 \\
$[ 0, 3, 6, 7, 8, 5, 2, 1 ]$ & 557 \\% & 0 \\
$[ 0, 3, 0, 19, 0, 9, 0, 1 ]$ & 521 \\% & 0 \\
$[ 0, 4, 5, 5, 10, 6, 1, 1 ]$ & 360 \\% & 0 \\
$[ 0, 5, 0, 15, 0, 11, 0, 1 ]$ & 144 \\% & 0 \\
$[ 0, 0, 1, 5, 10, 10, 5, 1 ]$ & 144 \\% & 0 \\
$[ 0, 0, 3, 9, 10, 6, 3, 1 ]$ & 1183 \\% & 0 \\
$[ 0, 0, 5, 5, 10, 10, 1, 1 ]$ & 557 \\% & 0 \\
$[ 0, 0, 9, 9, 6, 6, 1, 1 ]$ & 632 \\% & 0 \\
\hline
Total & 15248 %& 0
%\end{tabular}
%\begin{tabular}{lcc}
\\
\\
$L_G$ with $G\simeq (C_2)^6$
& \# $\bm{Z}$-classes \\\hline%& \# $G$'s with $H_u^2(G,M)\neq 0$ \\\hline
$[ 1, 1, 15, 15, 15, 15, 1, 1 ]$ & 206 \\% & 0 \\
$[ 1, 3, 9, 19, 19, 9, 3, 1 ]$ & 521 \\% & 0 \\
$[ 1, 5, 11, 15, 15, 11, 5, 1 ]$ & 144 \\% & 0 \\
$[ 0, 1, 6, 15, 20, 15, 6, 1 ]$ & 203 \\% & 0 \\
$[ 0, 3, 12, 19, 16, 9, 4, 1 ]$ & 491 \\% & 0 \\
$[ 0, 5, 10, 15, 20, 11, 2, 1 ]$ & 371 \\% & 0 \\
$[ 0, 7, 0, 35, 0, 21, 0, 1 ]$ & 80 \\% & 0 \\
\hline
Total & 2016 %& 0
%\end{tabular}
%\begin{tabular}{lcc}
\\
\\
$L_G$ with $G\simeq (C_2)^7$
& \# $\bm{Z}$-classes \\\hline%& \# $G$'s with $H_u^2(G,M)\neq 0$ \\\hline
$[ 1, 7, 21, 35, 35, 21, 7, 1 ]$ & 80 \\%& 0 \\
\hline
Total & 80 %& 0
\\
\\
\\
\\
\\
\\
\\
\end{tabular}

\vspace*{2mm}
\noindent
%$(3)$ (resp. $(3^\prime)$) is the case where
%the trace of the product of two distinct elements with trace $3$ is
%$3$ (resp. $-1$).\\
%$(4)$ (resp. $(4^\prime)$) is the case where
%the trace of the product of two distinct elements with trace $3$ is
%$3$ (resp. $-1$).\\
$L_G=[ t_{-7}, t_{-5}, t_{-3}, t_{-1}, t_1, t_3, t_5, t_7 ]$
$\in \bm{Z}^8$ is the list of $t_m$ which
is the number of elements of $G$ whose trace is $m$.\\
$T^i_G$ is the trace of the product of two distinct elements
with trace $i$.\\
%}
%%%%%%%%%%%%%%%%%%%%%%%5

The related functions we need are available from\\
{\tt http://www.math.h.kyoto-u.ac.jp/\~{}yamasaki/Algorithm/MultInvField/}.
For GAP ID and CARAT ID, see Hoshi-Yamasaki \cite[Chapter 3]{HY}.
\footnote{
Before computation of CARAT,
we should change the limit 1000 to 10000
in the source files of the following folders of CARAT:
functions/Graph/lattices.c,
functions/Graph/super-k-groups-fcts.c,
functions/ZZ/ZZ.c.}

\begin{verbatim}
gap> Read("crystcat.gap");
gap> Read("caratnumber.gap");
gap> Read("KS.gap");

# (1)-(5): 2<=n<=6
gap> GL2Q:=Concatenation(List([1..4],x->List([1..NrQClassesCrystalSystem(2,x)],y->[2,x,y])));;
gap> Length(GL2Q);
10
gap> C2_GL2Q:=Filtered(GL2Q,x->IdSmallGroup(MatGroupZClass(x[1],x[2],x[3],1))=[2,1]);
[ [ 2, 1, 2 ], [ 2, 2, 1 ] ]
gap> List(last,x->NrZClassesQClass(x[1],x[2],x[3]));
[ 1, 2 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of C2
[ 2, 3 ]
gap> C2xC2_GL2Q:=Filtered(GL2Q,x->IdSmallGroup(MatGroupZClass(x[1],x[2],x[3],1))=[4,2]);
[ [ 2, 2, 2 ] ]
gap> List(last,x->NrZClassesQClass(x[1],x[2],x[3]));
[ 2 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^2
[ 1, 2 ]

gap> GL3Q:=Concatenation(List([1..7],x->List([1..NrQClassesCrystalSystem(3,x)],y->[3,x,y])));;
gap> Length(GL3Q);
32
gap> C2_GL3Q:=Filtered(GL3Q,x->IdSmallGroup(MatGroupZClass(x[1],x[2],x[3],1))=[2,1]);
[ [ 3, 1, 2 ], [ 3, 2, 1 ], [ 3, 2, 2 ] ]
gap> List(last,x->NrZClassesQClass(x[1],x[2],x[3]));
[ 1, 2, 2 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of C2
[ 1, 5 ]
gap> C2xC2_GL3Q:=Filtered(GL3Q,x->IdSmallGroup(MatGroupZClass(x[1],x[2],x[3],1))=[4,2]);
[ [ 3, 2, 3 ], [ 3, 3, 1 ], [ 3, 3, 2 ] ]
gap> List(last,x->NrZClassesQClass(x[1],x[2],x[3]));
[ 2, 4, 5 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^2
[ 3, 11 ]
gap> C2xC2xC2_GL3Q:=Filtered(GL3Q,x->IdSmallGroup(MatGroupZClass(x[1],x[2],x[3],1))=[8,5]);
[ [ 3, 3, 3 ] ]
gap> List(last,x->NrZClassesQClass(x[1],x[2],x[3]));
[ 4 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^3
[ 1, 4 ]

gap> GL4Q:=Concatenation(List([1..33],x->List([1..NrQClassesCrystalSystem(4,x)],y->[4,x,y])));;
gap> Length(GL4Q);
227
gap> C2_GL4Q:=Filtered(GL4Q,x->IdSmallGroup(MatGroupZClass(x[1],x[2],x[3],1))=[2,1]);
[ [ 4, 1, 2 ], [ 4, 2, 1 ], [ 4, 2, 2 ], [ 4, 3, 1 ] ]
gap> List(last,x->NrZClassesQClass(x[1],x[2],x[3]));
[ 1, 2, 2, 3 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of C2
[ 4, 8 ]
gap> C2xC2_GL4Q:=Filtered(GL4Q,x->IdSmallGroup(MatGroupZClass(x[1],x[2],x[3],1))=[4,2]);
[ [ 4, 2, 3 ], [ 4, 3, 2 ], [ 4, 4, 1 ], [ 4, 4, 2 ], [ 4, 4, 3 ],
  [ 4, 5, 1 ] ]
gap> List(last,x->NrZClassesQClass(x[1],x[2],x[3]));
[ 2, 3, 6, 7, 6, 13 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^2
[ 6, 37 ]
gap> C2xC2xC2_GL4Q:=Filtered(GL4Q,x->IdSmallGroup(MatGroupZClass(x[1],x[2],x[3],1))=[8,5]);
[ [ 4, 4, 4 ], [ 4, 5, 2 ], [ 4, 6, 1 ], [ 4, 6, 2 ] ]
gap> List(last,x->NrZClassesQClass(x[1],x[2],x[3]));
[ 6, 9, 12, 12 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^3
[ 4, 39 ]
gap> C2xC2xC2xC2_GL4Q:=Filtered(GL4Q,x->IdSmallGroup(MatGroupZClass(x[1],x[2],x[3],1))=[16,14]);
[ [ 4, 6, 3 ] ]
gap> List(last,x->NrZClassesQClass(x[1],x[2],x[3]));
[ 8 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^4
[ 1, 8 ]

gap> C2_GL5Q:=Filtered([1..955],x->Order(CaratMatGroupZClass(5,x,1))=2);
[ 2, 3, 4, 6, 7 ]
gap> List(last,x->CaratNrZClasses(5,x));
[ 1, 2, 2, 3, 3 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of C2
[ 5, 11 ]
gap> C2xC2_GL5Q:=Filtered([1..955],x->Order(CaratMatGroupZClass(5,x,1))=4
> and IdSmallGroup(CaratMatGroupZClass(5,x,1))=[4,2]);
[ 5, 8, 9, 10, 11, 13, 14, 15, 18, 19 ]
gap> List(last,x->CaratNrZClasses(5,x));
[ 2, 3, 6, 7, 6, 9, 9, 11, 28, 18 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^2
[ 10, 99 ]
gap> C2xC2xC2_GL5Q:=Filtered([1..955],x->Order(CaratMatGroupZClass(5,x,1))=8
> and IdSmallGroup(CaratMatGroupZClass(5,x,1))=[8,5]);
[ 12, 16, 20, 21, 22, 23, 24, 30, 31, 32 ]
gap> List(last,x->CaratNrZClasses(5,x));
[ 6, 9, 18, 17, 17, 27, 27, 33, 49, 60 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^3
[ 10, 263 ]
gap> C2xC2xC2xC2_GL5Q:=Filtered([1..955],x->Order(CaratMatGroupZClass(5,x,1))=16
> and IdSmallGroup(CaratMatGroupZClass(5,x,1))=[16,14]);
[ 17, 25, 26, 27, 28 ]
gap> List(last,x->CaratNrZClasses(5,x));
[ 17, 33, 42, 16, 30 ]
gap> Sum(last);
138
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^4
[ 5, 138 ]
gap> C2xC2xC2xC2xC2_GL5Q:=Filtered([1..955],x->Order(CaratMatGroupZClass(5,x,1))=32
> and IdSmallGroup(CaratMatGroupZClass(5,x,1))=[32,51]);
[ 29 ]
gap> List(last,x->CaratNrZClasses(5,x));
[ 16 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^5
[ 1, 16 ]

gap> C2_GL6Q:=Filtered([1..7103],x->Order(CaratMatGroupZClass(6,x,1))=2);
[ 1, 2, 4, 5, 11, 2710 ]
gap> List(last,x->CaratNrZClasses(6,x));
[ 2, 2, 3, 3, 4, 1 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^3
[ 6, 15 ]
gap> C2xC2_GL6Q:=Filtered([1..7103],x->Order(CaratMatGroupZClass(6,x,1))=4
> and IdSmallGroup(CaratMatGroupZClass(6,x,1))=[4,2]);
[ 3, 6, 7, 8, 9, 12, 13, 14, 15, 16, 4618, 4619, 4625, 4626, 4629, 4630 ]
gap> List(last,x->CaratNrZClasses(6,x));
[ 2, 3, 7, 6, 6, 4, 12, 12, 12, 12, 19, 29, 12, 17, 50, 52 ]
gap> Sum(last);
255
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^2
[ 16, 255 ]
gap> C2xC2xC2_GL6Q:=Filtered([1..7103],x->Order(CaratMatGroupZClass(6,x,1))=8
> and IdSmallGroup(CaratMatGroupZClass(6,x,1))=[8,5]);
[ 10, 17, 4620, 4621, 4622, 4623, 4624, 4627, 4631, 4632, 4633, 4634, 4635,
  4644, 4645, 4646, 4647, 4648, 4649, 4650, 4664, 4665 ]
gap> List(last,x->CaratNrZClasses(6,x));
[ 6, 12, 19, 18, 18, 28, 28, 12, 39, 48, 50, 50, 48, 101, 83, 53, 101, 189,
  101, 189, 325, 131 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^3
[ 22, 1649 ]
gap> C2xC2xC2xC2_GL6Q:=Filtered([1..7103],x->Order(CaratMatGroupZClass(6,x,1))=16
> and IdSmallGroup(CaratMatGroupZClass(6,x,1))=[16,14]);
[ 4617, 4628, 4636, 4637, 4638, 4639, 4640, 4641, 4642, 4651, 4652, 4653,
  4654, 4655, 4656, 4657 ]
gap> List(last,x->CaratNrZClasses(6,x));
[ 18, 37, 53, 101, 97, 97, 49, 49, 127, 86, 76, 273, 189, 273, 313, 109 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^4
[ 16, 1947 ]
gap> C2xC2xC2xC2xC2_GL6Q:=Filtered([1..7103],x->Order(CaratMatGroupZClass(6,x,1))=32
> and IdSmallGroup(CaratMatGroupZClass(6,x,1))=[32,51]);
[ 4643, 4658, 4659, 4660, 4661, 4662 ]
gap> List(last,x->CaratNrZClasses(6,x));
[ 49, 37, 134, 75, 141, 75 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^5
[ 6, 511 ]
gap> C2xC2xC2xC2xC2xC2_GL6Q:=Filtered([1..7103],x->Order(CaratMatGroupZClass(6,x,1))=64
> and IdSmallGroup(CaratMatGroupZClass(6,x,1))=[64,267]);
[ 4663 ]
gap> List(last,x->CaratNrZClasses(6,x));
[ 36 ]
gap> [Length(last),Sum(last)]; # # of Q-classes and Z-classes of (C2)^6
[ 1, 36 ]
\end{verbatim}

\bigskip
%gap> Read("caratnumber.gap");
%gap> Read("KS.gap");

\begin{verbatim}
# (6): n=7
gap> I7:=IdentityMat(7);;
gap> G128:=Group(List(I7,x->DiagonalMat([1,1,1,1,1,1,1]-2*x)));
<matrix group with 7 generators>
gap> G128s:=NormalSubgroups(G128);;
gap> Length(G128s);
29212

gap> G128s2:=Filtered(G128s,x->Order(x)=2);; # |G|=2
gap> Length(last);
127
gap> Sch:=Set(G128s2,x->Collected(List(x,Trace)));
[ [ [ -7, 1 ], [ 7, 1 ] ], [ [ -5, 1 ], [ 7, 1 ] ], [ [ -3, 1 ], [ 7, 1 ] ],
  [ [ -1, 1 ], [ 7, 1 ] ], [ [ 1, 1 ], [ 7, 1 ] ], [ [ 3, 1 ], [ 7, 1 ] ],
  [ [ 5, 1 ], [ 7, 1 ] ] ]
gap> Length(Sch);
7
gap> Schg:=List(Sch,x->Filtered(G128s2,y->Collected(List(y,Trace))=x));;
gap> S7:=Group(List(GeneratorsOfGroup(SymmetricGroup(7)),x->PermutationMat(x,7)));
<matrix group with 2 generators>
gap> Schgo:=List(Schg,x->Orbits(S7,List(x,Set),OnSets));;
gap> List(Schgo,Length);
[ 1, 1, 1, 1, 1, 1, 1 ]
gap> Schgo2:=List(Schgo,x->List(x,y->First(G128s2,z->Set(z) in y)));;
gap> G2Qc:=Flat(Schgo2);;
gap> Length(G2Qc); # # of Q-classes of C2
7

gap> G2Zc:=[];
[  ]
gap> P:=Group([[[0,1],[1,0]]]);
Group([ [ [ 0, 1 ], [ 1, 0 ] ] ])
gap> D:=Group([[[1,0],[0,-1]]]);
Group([ [ [ 1, 0 ], [ 0, -1 ] ] ])
gap> G2Zc[1]:=[Group(-IdentityMat(7))];
[ <matrix group with 1 generators> ]
gap> List(G2Zc[1],x->List(x,Trace));
[ [ -7, 7 ] ]
gap> G2Zc[2]:=[DirectSumMatrixGroup([Group(-IdentityMat(5)),D]),
> DirectSumMatrixGroup([Group(-IdentityMat(5)),P])];
[ <matrix group with 1 generators>, <matrix group with 1 generators> ]
gap> List(G2Zc[2],x->List(x,Trace));
[ [ -5, 7 ], [ -5, 7 ] ]
gap> G2Zc[3]:=[DirectSumMatrixGroup([Group(-IdentityMat(3)),D,D]),
> DirectSumMatrixGroup([Group(-IdentityMat(3)),D,P]),
> DirectSumMatrixGroup([Group(-IdentityMat(3)),P,P])];
[ <matrix group with 1 generators>, <matrix group with 1 generators>,
  <matrix group with 1 generators> ]
gap> List(G2Zc[3],x->List(x,Trace));
[ [ -3, 7 ], [ -3, 7 ], [ -3, 7 ] ]
gap> G2Zc[4]:=[DirectSumMatrixGroup([Group(-IdentityMat(1)),D,D,D]),
> DirectSumMatrixGroup([Group(-IdentityMat(1)),D,D,P]),
> DirectSumMatrixGroup([Group(-IdentityMat(1)),D,P,P]),
> DirectSumMatrixGroup([Group(-IdentityMat(1)),P,P,P])];
[ <matrix group with 1 generators>, <matrix group with 1 generators>,
  <matrix group with 1 generators>, <matrix group with 1 generators> ]
gap> List(G2Zc[4],x->List(x,Trace));
[ [ -1, 7 ], [ -1, 7 ], [ -1, 7 ], [ -1, 7 ] ]
gap> G2Zc[5]:=[DirectSumMatrixGroup([Group(IdentityMat(1)),D,D,D]),
> DirectSumMatrixGroup([Group(IdentityMat(1)),D,D,P]),
> DirectSumMatrixGroup([Group(IdentityMat(1)),D,P,P]),
> DirectSumMatrixGroup([Group(IdentityMat(1)),P,P,P])];
[ <matrix group with 1 generators>, <matrix group with 1 generators>,
  <matrix group with 1 generators>, <matrix group with 1 generators> ]
gap> List(G2Zc[5],x->List(x,Trace));
[ [ 1, 7 ], [ 1, 7 ], [ 1, 7 ], [ 1, 7 ] ]
gap> G2Zc[6]:=[DirectSumMatrixGroup([Group(IdentityMat(3)),D,D]),
> DirectSumMatrixGroup([Group(IdentityMat(3)),D,P]),
> DirectSumMatrixGroup([Group(IdentityMat(3)),P,P])];
[ <matrix group with 1 generators>, <matrix group with 1 generators>,
  <matrix group with 1 generators> ]
gap> List(G2Zc[6],x->List(x,Trace));
[ [ 3, 7 ], [ 3, 7 ], [ 3, 7 ] ]
gap> G2Zc[7]:=[DirectSumMatrixGroup([Group(IdentityMat(5)),D]),
> DirectSumMatrixGroup([Group(IdentityMat(5)),P])];
[ <matrix group with 1 generators>, <matrix group with 1 generators> ]
gap> List(G2Zc[7],x->List(x,Trace));
[ [ 5, 7 ], [ 5, 7 ] ]
gap> List(G2Zc,Length);
[ 1, 2, 3, 4, 4, 3, 2 ]
gap> Sum(last); # # of Z-classes of C2
19

gap> G128s4:=Filtered(G128s,x->Order(x)=4);; # |G|=4
gap> Length(last);
2667
gap> Sch:=Set(G128s4,x->Collected(List(x,Trace)));
[ [ [ -7, 1 ], [ -5, 1 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -7, 1 ], [ -3, 1 ], [ 3, 1 ], [ 7, 1 ] ],
  [ [ -7, 1 ], [ -1, 1 ], [ 1, 1 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 1 ], [ 1, 1 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 1 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -1, 1 ], [ 3, 1 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -1, 2 ], [ 7, 1 ] ], [ [ -5, 1 ], [ 1, 2 ], [ 7, 1 ] ],
  [ [ -5, 2 ], [ 3, 1 ], [ 7, 1 ] ],
  [ [ -3, 1 ], [ -1, 1 ], [ 1, 1 ], [ 7, 1 ] ],
  [ [ -3, 1 ], [ -1, 1 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -3, 1 ], [ 1, 1 ], [ 3, 1 ], [ 7, 1 ] ],
  [ [ -3, 2 ], [ -1, 1 ], [ 7, 1 ] ], [ [ -3, 2 ], [ 3, 1 ], [ 7, 1 ] ],
  [ [ -1, 1 ], [ 1, 1 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -1, 1 ], [ 1, 2 ], [ 7, 1 ] ], [ [ -1, 1 ], [ 3, 2 ], [ 7, 1 ] ],
  [ [ -1, 2 ], [ 3, 1 ], [ 7, 1 ] ], [ [ -1, 3 ], [ 7, 1 ] ],
  [ [ 1, 1 ], [ 3, 1 ], [ 5, 1 ], [ 7, 1 ] ], [ [ 1, 2 ], [ 3, 1 ], [ 7, 1 ] ]
    , [ [ 3, 1 ], [ 5, 2 ], [ 7, 1 ] ], [ [ 3, 3 ], [ 7, 1 ] ] ]
gap> Length(Sch);
23
gap> Schg:=List(Sch,x->Filtered(G128s4,y->Collected(List(y,Trace))=x));;
gap> S7:=Group(List(GeneratorsOfGroup(SymmetricGroup(7)),x->PermutationMat(x,7)));
<matrix group with 2 generators>
gap> Schgo:=List(Schg,x->Orbits(S7,List(x,Set),OnSets));;
gap> List(Schgo,Length);
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ]
gap> Schgo2:=List(Schgo,x->List(x,y->First(G128s4,z->Set(z) in y)));;
gap> G4Qc:=Flat(Schgo2);;
gap> Length(G4Qc); # # of Q-classes of (C2)^2
23

gap> G4Zc:=[]
[  ]
gap> M:=Group([[[1]],[[-1]]]);
Group([ [ [ 1 ] ], [ [ -1 ] ] ])
gap> P:=Group([[[0,1],[1,0]],-IdentityMat(2)]);
Group([ [ [ 0, 1 ], [ 1, 0 ] ], [ [ -1, 0 ], [ 0, -1 ] ] ])
gap> D:=Group([[[1,0],[0,-1]],-IdentityMat(2)]);
Group([ [ [ 1, 0 ], [ 0, -1 ] ], [ [ -1, 0 ], [ 0, -1 ] ] ])
gap> G4Zc[1]:=[DirectSumMatrixGroup([M,M,M,M,M,D]),
> DirectSumMatrixGroup([M,M,M,M,M,P])];
[ <matrix group with 2 generators>, <matrix group with 2 generators> ]
gap> List(G4Zc[1],x->List(x,Trace));
[ [ -7, -5, 5, 7 ], [ -7, -5, 5, 7 ] ]
gap> G4Zc[2]:=[DirectSumMatrixGroup([M,M,M,D,D]),
> DirectSumMatrixGroup([M,M,M,D,P]),
> DirectSumMatrixGroup([M,M,M,P,P])];
[ <matrix group with 2 generators>, <matrix group with 2 generators>,
  <matrix group with 2 generators> ]
gap> List(G4Zc[2],x->List(x,Trace));
[ [ -7, -3, 3, 7 ], [ -7, -3, 3, 7 ], [ -7, -3, 3, 7 ] ]
gap> G4Zc[3]:=[DirectSumMatrixGroup([M,D,D,D]),
> DirectSumMatrixGroup([M,D,D,P]),
> DirectSumMatrixGroup([M,D,P,P]),
> DirectSumMatrixGroup([M,P,P,P])];
[ <matrix group with 2 generators>, <matrix group with 2 generators>,
  <matrix group with 2 generators>, <matrix group with 2 generators> ]
gap> List(G4Zc[3],x->List(x,Trace));
[ [ -7, -1, 1, 7 ], [ -7, -1, 1, 7 ], [ -7, -1, 1, 7 ], [ -7, -1, 1, 7 ] ]
gap> for i in [4..23] do G4Zc[i]:=ZClassRepsQClass(G4Qc[i]); od;
gap> List(G4Zc,Length);
[ 2, 3, 4, 12, 7, 12, 13, 13, 6, 82, 12, 26, 20, 29, 16, 112, 20, 60, 62, 12,
  60, 6, 19 ]
gap> Sum(last); # # of Z-classes of (C2)^2
608

gap> G128s8:=Filtered(G128s,x->Order(x)=8);; # |G|=8
gap> Length(last);
11811
gap> Sch:=Set(G128s8,x->Collected(List(x,Trace)));
[ [ [ -7, 1 ], [ -5, 1 ], [ -3, 1 ], [ -1, 1 ], [ 1, 1 ], [ 3, 1 ], [ 5, 1 ],
      [ 7, 1 ] ],
  [ [ -7, 1 ], [ -5, 1 ], [ -1, 2 ], [ 1, 2 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -7, 1 ], [ -5, 2 ], [ -3, 1 ], [ 3, 1 ], [ 5, 2 ], [ 7, 1 ] ],
  [ [ -7, 1 ], [ -3, 1 ], [ -1, 2 ], [ 1, 2 ], [ 3, 1 ], [ 7, 1 ] ],
  [ [ -7, 1 ], [ -3, 2 ], [ -1, 1 ], [ 1, 1 ], [ 3, 2 ], [ 7, 1 ] ],
  [ [ -7, 1 ], [ -3, 3 ], [ 3, 3 ], [ 7, 1 ] ],
  [ [ -7, 1 ], [ -1, 3 ], [ 1, 3 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 1 ], [ -1, 1 ], [ 1, 2 ], [ 3, 1 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 1 ], [ -1, 2 ], [ 1, 3 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 2 ], [ -1, 1 ], [ 1, 2 ], [ 3, 1 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 2 ], [ -1, 1 ], [ 3, 1 ], [ 5, 2 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 2 ], [ -1, 2 ], [ 1, 1 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -1, 1 ], [ 1, 4 ], [ 3, 1 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -1, 3 ], [ 3, 3 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -1, 5 ], [ 3, 1 ], [ 7, 1 ] ],
  [ [ -5, 2 ], [ -3, 1 ], [ 1, 3 ], [ 3, 1 ], [ 7, 1 ] ],
  [ [ -5, 2 ], [ -3, 2 ], [ 1, 1 ], [ 3, 1 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -5, 2 ], [ -1, 3 ], [ 3, 2 ], [ 7, 1 ] ],
  [ [ -5, 3 ], [ -1, 1 ], [ 3, 3 ], [ 7, 1 ] ],
  [ [ -3, 1 ], [ -1, 1 ], [ 1, 2 ], [ 3, 2 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -3, 1 ], [ -1, 2 ], [ 1, 1 ], [ 3, 1 ], [ 5, 2 ], [ 7, 1 ] ],
  [ [ -3, 1 ], [ -1, 2 ], [ 1, 3 ], [ 3, 1 ], [ 7, 1 ] ],
  [ [ -3, 1 ], [ -1, 3 ], [ 1, 2 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -3, 1 ], [ 1, 3 ], [ 3, 3 ], [ 7, 1 ] ],
  [ [ -3, 2 ], [ -1, 1 ], [ 1, 2 ], [ 3, 2 ], [ 7, 1 ] ],
  [ [ -3, 2 ], [ -1, 2 ], [ 1, 1 ], [ 3, 1 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -3, 2 ], [ -1, 3 ], [ 1, 2 ], [ 7, 1 ] ],
  [ [ -3, 3 ], [ -1, 2 ], [ 1, 1 ], [ 3, 1 ], [ 7, 1 ] ],
  [ [ -3, 3 ], [ -1, 3 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -3, 3 ], [ 1, 1 ], [ 3, 3 ], [ 7, 1 ] ],
  [ [ -3, 4 ], [ -1, 1 ], [ 3, 2 ], [ 7, 1 ] ],
  [ [ -1, 1 ], [ 1, 2 ], [ 3, 2 ], [ 5, 2 ], [ 7, 1 ] ],
  [ [ -1, 1 ], [ 1, 4 ], [ 3, 2 ], [ 7, 1 ] ], [ [ -1, 1 ], [ 3, 6 ], [ 7, 1 ] ]
    , [ [ -1, 2 ], [ 1, 3 ], [ 3, 1 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -1, 3 ], [ 1, 4 ], [ 7, 1 ] ], [ [ -1, 3 ], [ 3, 4 ], [ 7, 1 ] ],
  [ [ -1, 5 ], [ 3, 2 ], [ 7, 1 ] ], [ [ -1, 7 ], [ 7, 1 ] ],
  [ [ 1, 1 ], [ 3, 3 ], [ 5, 3 ], [ 7, 1 ] ],
  [ [ 1, 3 ], [ 3, 3 ], [ 5, 1 ], [ 7, 1 ] ] ]
gap> Length(Sch);
41
gap> Schg:=List(Sch,x->Filtered(G128s8,y->Collected(List(y,Trace))=x));;
gap> S7:=Group(List(GeneratorsOfGroup(SymmetricGroup(7)),x->PermutationMat(x,7)));
<matrix group with 2 generators>
gap> Schgo:=List(Schg,x->Orbits(S7,List(x,Set),OnSets));;
gap> List(Schgo,Length);
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ]
gap> Filtered([1..Length(last)],x->last[x]>1);
[ 10, 14 ]
gap> Schgo2:=List(Schgo,x->List(x,y->First(G128s8,z->Set(z) in y)));;
gap> G10a:=Schgo2[10][1];
<matrix group of size 8 with 3 generators>
gap> G10b:=Schgo2[10][2];
<matrix group of size 8 with 3 generators>
gap> G14a:=Schgo2[14][1];
<matrix group of size 8 with 3 generators>
gap> G14b:=Schgo2[14][2];
<matrix group of size 8 with 3 generators>
gap> e10a:=Elements(G10a);;
gap> e10b:=Elements(G10b);;
gap> e14a:=Elements(G14a);;
gap> e14b:=Elements(G14b);;
gap> Collected(List(e10a,Trace));
[ [ -5, 1 ], [ -3, 2 ], [ -1, 1 ], [ 1, 2 ], [ 3, 1 ], [ 7, 1 ] ]
gap> e10at1:=Filtered(e10a,x->Trace(x)=1);;
gap> List(e10at1,x->List(e10at1,y->Trace(x*y)));
[ [ 7, 3 ], [ 3, 7 ] ]
gap> Collected(List(e10b,Trace));
[ [ -5, 1 ], [ -3, 2 ], [ -1, 1 ], [ 1, 2 ], [ 3, 1 ], [ 7, 1 ] ]
gap> e10bt1:=Filtered(e10b,x->Trace(x)=1);;
gap> List(e10bt1,x->List(e10bt1,y->Trace(x*y)));
[ [ 7, -1 ], [ -1, 7 ] ]
gap> Collected(List(e14a,Trace));
[ [ -5, 1 ], [ -1, 3 ], [ 3, 3 ], [ 7, 1 ] ]
gap> e14at3:=Filtered(e14a,x->Trace(x)=3);;
gap> List(e14at3,x->List(e14at3,y->Trace(x*y)));
[ [ 7, 3, 3 ], [ 3, 7, 3 ], [ 3, 3, 7 ] ]
gap> Collected(List(e14b,Trace));
[ [ -5, 1 ], [ -1, 3 ], [ 3, 3 ], [ 7, 1 ] ]
gap> e14bt3:=Filtered(e14b,x->Trace(x)=3);;
gap> List(e14bt3,x->List(e14bt3,y->Trace(x*y)));
[ [ 7, -1, -1 ], [ -1, 7, -1 ], [ -1, -1, 7 ] ]
gap> G8Qc:=Flat(Schgo2);;
gap> Length(G8Qc);
43

gap> G8Zc:=List(G8Qc,ZClassRepsQClass);;
gap> List(G8Zc,Length);
[ 12, 13, 6, 60, 20, 19, 62, 80, 380, 208, 107, 28, 80, 279, 113, 58, 279,
  58, 28, 58, 18, 107, 58, 1919, 415, 221, 429, 208, 1000, 429, 58, 113, 92,
  58, 691, 60, 432, 1077, 221, 691, 269, 18, 113 ]
gap> Sum(last); # # of Z-classes of (C2)^3
10645

gap> G128s16:=Filtered(G128s,x->Order(x)=16);; # |G|=16
gap> Length(last);
11811
gap> Sch:=Set(G128s16,x->Collected(List(x,Trace)));
[ [ [ -7, 1 ], [ -5, 1 ], [ -3, 1 ], [ -1, 5 ], [ 1, 5 ], [ 3, 1 ], [ 5, 1 ],
      [ 7, 1 ] ],
  [ [ -7, 1 ], [ -5, 1 ], [ -3, 3 ], [ -1, 3 ], [ 1, 3 ], [ 3, 3 ], [ 5, 1 ],
      [ 7, 1 ] ],
  [ [ -7, 1 ], [ -5, 2 ], [ -3, 2 ], [ -1, 3 ], [ 1, 3 ], [ 3, 2 ], [ 5, 2 ],
      [ 7, 1 ] ],
  [ [ -7, 1 ], [ -5, 3 ], [ -3, 3 ], [ -1, 1 ], [ 1, 1 ], [ 3, 3 ], [ 5, 3 ],
      [ 7, 1 ] ],
  [ [ -7, 1 ], [ -3, 2 ], [ -1, 5 ], [ 1, 5 ], [ 3, 2 ], [ 7, 1 ] ],
  [ [ -7, 1 ], [ -3, 4 ], [ -1, 3 ], [ 1, 3 ], [ 3, 4 ], [ 7, 1 ] ],
  [ [ -7, 1 ], [ -3, 6 ], [ -1, 1 ], [ 1, 1 ], [ 3, 6 ], [ 7, 1 ] ],
  [ [ -7, 1 ], [ -1, 7 ], [ 1, 7 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 1 ], [ -1, 3 ], [ 1, 6 ], [ 3, 3 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 2 ], [ -1, 3 ], [ 1, 4 ], [ 3, 3 ], [ 5, 2 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 2 ], [ -1, 5 ], [ 1, 6 ], [ 3, 1 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 3 ], [ -1, 3 ], [ 1, 2 ], [ 3, 3 ], [ 5, 3 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 3 ], [ -1, 5 ], [ 1, 4 ], [ 3, 1 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 4 ], [ -1, 3 ], [ 1, 4 ], [ 3, 3 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 4 ], [ -1, 5 ], [ 1, 2 ], [ 3, 1 ], [ 5, 2 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -1, 3 ], [ 1, 8 ], [ 3, 3 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -1, 7 ], [ 3, 7 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -1, 11 ], [ 3, 3 ], [ 7, 1 ] ],
  [ [ -5, 2 ], [ -3, 2 ], [ -1, 3 ], [ 1, 6 ], [ 3, 2 ], [ 7, 1 ] ],
  [ [ -5, 2 ], [ -3, 3 ], [ -1, 3 ], [ 1, 4 ], [ 3, 2 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -5, 2 ], [ -3, 4 ], [ -1, 3 ], [ 1, 2 ], [ 3, 2 ], [ 5, 2 ], [ 7, 1 ] ],
  [ [ -5, 2 ], [ -1, 9 ], [ 3, 4 ], [ 7, 1 ] ],
  [ [ -5, 3 ], [ -3, 2 ], [ -1, 1 ], [ 1, 6 ], [ 3, 3 ], [ 7, 1 ] ],
  [ [ -5, 3 ], [ -3, 3 ], [ -1, 1 ], [ 1, 4 ], [ 3, 3 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -5, 3 ], [ -1, 7 ], [ 3, 5 ], [ 7, 1 ] ],
  [ [ -5, 4 ], [ -1, 5 ], [ 3, 6 ], [ 7, 1 ] ],
  [ [ -3, 1 ], [ -1, 1 ], [ 1, 6 ], [ 3, 6 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -3, 1 ], [ -1, 3 ], [ 1, 4 ], [ 3, 4 ], [ 5, 3 ], [ 7, 1 ] ],
  [ [ -3, 1 ], [ -1, 5 ], [ 1, 6 ], [ 3, 2 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -3, 2 ], [ -1, 3 ], [ 1, 6 ], [ 3, 4 ], [ 7, 1 ] ],
  [ [ -3, 2 ], [ -1, 5 ], [ 1, 4 ], [ 3, 2 ], [ 5, 2 ], [ 7, 1 ] ],
  [ [ -3, 3 ], [ -1, 3 ], [ 1, 4 ], [ 3, 4 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -3, 3 ], [ -1, 7 ], [ 1, 4 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -3, 4 ], [ -1, 1 ], [ 1, 4 ], [ 3, 6 ], [ 7, 1 ] ],
  [ [ -3, 4 ], [ -1, 5 ], [ 1, 4 ], [ 3, 2 ], [ 7, 1 ] ],
  [ [ -3, 5 ], [ -1, 5 ], [ 1, 2 ], [ 3, 2 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -3, 6 ], [ -1, 3 ], [ 1, 2 ], [ 3, 4 ], [ 7, 1 ] ],
  [ [ -1, 1 ], [ 1, 4 ], [ 3, 6 ], [ 5, 4 ], [ 7, 1 ] ],
  [ [ -1, 3 ], [ 1, 6 ], [ 3, 4 ], [ 5, 2 ], [ 7, 1 ] ],
  [ [ -1, 5 ], [ 3, 10 ], [ 7, 1 ] ], [ [ -1, 9 ], [ 3, 6 ], [ 7, 1 ] ] ]
gap> Length(Sch);
41
gap> Schg:=List(Sch,x->Filtered(G128s16,y->Collected(List(y,Trace))=x));;
gap> S7:=Group(List(GeneratorsOfGroup(SymmetricGroup(7)),x->PermutationMat(x,7)));
<matrix group with 2 generators>
gap> Schgo:=List(Schg,x->Orbits(S7,List(x,Set),OnSets));;
gap> List(Schgo,Length);
[ 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ]
gap> Filtered([1..Length(last)],x->last[x]>1);
[ 2, 14 ]
gap> Schgo2:=List(Schgo,x->List(x,y->First(G128s16,z->Set(z) in y)));;
gap> G2a:=Schgo2[2][1];
<matrix group of size 16 with 4 generators>
gap> G2b:=Schgo2[2][2];
<matrix group of size 16 with 4 generators>
gap> G14a:=Schgo2[14][1];
<matrix group of size 16 with 4 generators>
gap> G14b:=Schgo2[14][2];
<matrix group of size 16 with 4 generators>
gap> e2a:=Elements(G2a);;
gap> e2b:=Elements(G2b);;
gap> e14a:=Elements(G14a);;
gap> e14b:=Elements(G14b);;
gap> Collected(List(e2a,Trace));
[ [ -7, 1 ], [ -5, 1 ], [ -3, 3 ], [ -1, 3 ], [ 1, 3 ], [ 3, 3 ], [ 5, 1 ],
  [ 7, 1 ] ]
gap> e2at3:=Filtered(e2a,x->Trace(x)=3);;
gap> List(e2at3,x->List(e2at3,y->Trace(x*y)));
[ [ 7, 3, 3 ], [ 3, 7, 3 ], [ 3, 3, 7 ] ]
gap> Collected(List(e2b,Trace));
[ [ -7, 1 ], [ -5, 1 ], [ -3, 3 ], [ -1, 3 ], [ 1, 3 ], [ 3, 3 ], [ 5, 1 ],
  [ 7, 1 ] ]
gap> e2bt3:=Filtered(e2b,x->Trace(x)=3);;
gap> List(e2bt3,x->List(e2bt3,y->Trace(x*y)));
[ [ 7, -1, -1 ], [ -1, 7, -1 ], [ -1, -1, 7 ] ]
gap> Collected(List(e14a,Trace));
[ [ -5, 1 ], [ -3, 4 ], [ -1, 3 ], [ 1, 4 ], [ 3, 3 ], [ 7, 1 ] ]
gap> e14at3:=Filtered(e14a,x->Trace(x)=3);;
gap> List(e14at3,x->List(e14at3,y->Trace(x*y)));
[ [ 7, 3, 3 ], [ 3, 7, 3 ], [ 3, 3, 7 ] ]
gap> Collected(List(e14b,Trace));
[ [ -5, 1 ], [ -3, 4 ], [ -1, 3 ], [ 1, 4 ], [ 3, 3 ], [ 7, 1 ] ]
gap> e14bt3:=Filtered(e14b,x->Trace(x)=3);;
gap> List(e14bt3,x->List(e14bt3,y->Trace(x*y)));
[ [ 7, -1, -1 ], [ -1, 7, -1 ], [ -1, -1, 7 ] ]
gap> G16Qc:=Flat(Schgo2);;
gap> Length(G16Qc); # # of Q-classes of (C2)^4
43

gap> G16Zc:=List(G16Qc,ZClassRepsQClass);;
gap> List(G16Zc,Length);
[ 279, 113, 58, 58, 18, 691, 221, 60, 269, 886, 270, 2823, 109, 1878, 883,
  670, 270, 789, 380, 789, 1170, 422, 141, 574, 144, 109, 144, 56, 380, 214,
  3055, 2534, 1170, 883, 1037, 361, 2867, 670, 558, 56, 574, 145, 664 ]
gap> Sum(last); # # of Z-classes of (C2)^4
29442

gap> G128s32:=Filtered(G128s,x->Order(x)=32);; # |G|=32
gap> Length(last);
2667
gap> Sch:=Set(G128s32,x->Collected(List(x,Trace)));
[ [ [ -7, 1 ], [ -5, 1 ], [ -3, 3 ], [ -1, 11 ], [ 1, 11 ], [ 3, 3 ],
      [ 5, 1 ], [ 7, 1 ] ],
  [ [ -7, 1 ], [ -5, 1 ], [ -3, 7 ], [ -1, 7 ], [ 1, 7 ], [ 3, 7 ], [ 5, 1 ],
      [ 7, 1 ] ],
  [ [ -7, 1 ], [ -5, 2 ], [ -3, 4 ], [ -1, 9 ], [ 1, 9 ], [ 3, 4 ], [ 5, 2 ],
      [ 7, 1 ] ],
  [ [ -7, 1 ], [ -5, 3 ], [ -3, 5 ], [ -1, 7 ], [ 1, 7 ], [ 3, 5 ], [ 5, 3 ],
      [ 7, 1 ] ],
  [ [ -7, 1 ], [ -5, 4 ], [ -3, 6 ], [ -1, 5 ], [ 1, 5 ], [ 3, 6 ], [ 5, 4 ],
      [ 7, 1 ] ],
  [ [ -7, 1 ], [ -3, 6 ], [ -1, 9 ], [ 1, 9 ], [ 3, 6 ], [ 7, 1 ] ],
  [ [ -7, 1 ], [ -3, 10 ], [ -1, 5 ], [ 1, 5 ], [ 3, 10 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 2 ], [ -1, 7 ], [ 1, 12 ], [ 3, 7 ], [ 5, 2 ], [ 7, 1 ] ]
    , [ [ -5, 1 ], [ -3, 4 ], [ -1, 7 ], [ 1, 8 ], [ 3, 7 ], [ 5, 4 ],
      [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 6 ], [ -1, 11 ], [ 1, 8 ], [ 3, 3 ], [ 5, 2 ], [ 7, 1 ] ]
    , [ [ -5, 1 ], [ -3, 8 ], [ -1, 7 ], [ 1, 8 ], [ 3, 7 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -1, 15 ], [ 3, 15 ], [ 7, 1 ] ],
  [ [ -5, 2 ], [ -3, 5 ], [ -1, 9 ], [ 1, 10 ], [ 3, 4 ], [ 5, 1 ], [ 7, 1 ] ]
    , [ [ -5, 2 ], [ -3, 7 ], [ -1, 9 ], [ 1, 6 ], [ 3, 4 ], [ 5, 3 ],
      [ 7, 1 ] ],
  [ [ -5, 3 ], [ -3, 4 ], [ -1, 7 ], [ 1, 12 ], [ 3, 5 ], [ 7, 1 ] ],
  [ [ -5, 3 ], [ -3, 6 ], [ -1, 7 ], [ 1, 8 ], [ 3, 5 ], [ 5, 2 ], [ 7, 1 ] ],
  [ [ -5, 3 ], [ -1, 19 ], [ 3, 9 ], [ 7, 1 ] ],
  [ [ -5, 4 ], [ -3, 5 ], [ -1, 5 ], [ 1, 10 ], [ 3, 6 ], [ 5, 1 ], [ 7, 1 ] ]
    , [ [ -5, 5 ], [ -1, 15 ], [ 3, 11 ], [ 7, 1 ] ],
  [ [ -3, 1 ], [ -1, 5 ], [ 1, 10 ], [ 3, 10 ], [ 5, 5 ], [ 7, 1 ] ],
  [ [ -3, 3 ], [ -1, 9 ], [ 1, 10 ], [ 3, 6 ], [ 5, 3 ], [ 7, 1 ] ],
  [ [ -3, 5 ], [ -1, 5 ], [ 1, 10 ], [ 3, 10 ], [ 5, 1 ], [ 7, 1 ] ],
  [ [ -3, 9 ], [ -1, 9 ], [ 1, 6 ], [ 3, 6 ], [ 5, 1 ], [ 7, 1 ] ] ]
gap> Length(Sch);
23
gap> Schg:=List(Sch,x->Filtered(G128s32,y->Collected(List(y,Trace))=x));;
gap> S7:=Group(List(GeneratorsOfGroup(SymmetricGroup(7)),x->PermutationMat(x,7)));
<matrix group with 2 generators>
gap> Schgo:=List(Schg,x->Orbits(S7,List(x,Set),OnSets));;
gap> List(Schgo,Length);
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ]
gap> Schgo2:=List(Schgo,x->List(x,y->First(G128s32,z->Set(z) in y)));;
gap> G32Qc:=Flat(Schgo2);;
gap> Length(G32Qc); # # of Q-classes of (C2)^5
23

gap> G32Zc:=List(G32Qc,ZClassRepsQClass);;
gap> List(G32Zc,Length);
[ 789, 380, 574, 144, 56, 664, 145, 1034, 360, 1860, 983, 206, 2499, 557,
  899, 557, 521, 360, 144, 144, 1183, 557, 632 ]
gap> Sum(last); # # of Z-classes of (C2)^5
15248

gap> G128s64:=Filtered(G128s,x->Order(x)=64);; # |G|=64
gap> Length(last);
127
gap> Sch:=Set(G128s64,x->Collected(List(x,Trace)));
[ [ [ -7, 1 ], [ -5, 1 ], [ -3, 15 ], [ -1, 15 ], [ 1, 15 ], [ 3, 15 ],
      [ 5, 1 ], [ 7, 1 ] ],
  [ [ -7, 1 ], [ -5, 3 ], [ -3, 9 ], [ -1, 19 ], [ 1, 19 ], [ 3, 9 ],
      [ 5, 3 ], [ 7, 1 ] ],
  [ [ -7, 1 ], [ -5, 5 ], [ -3, 11 ], [ -1, 15 ], [ 1, 15 ], [ 3, 11 ],
      [ 5, 5 ], [ 7, 1 ] ],
  [ [ -5, 1 ], [ -3, 6 ], [ -1, 15 ], [ 1, 20 ], [ 3, 15 ], [ 5, 6 ],
      [ 7, 1 ] ],
  [ [ -5, 3 ], [ -3, 12 ], [ -1, 19 ], [ 1, 16 ], [ 3, 9 ], [ 5, 4 ],
      [ 7, 1 ] ],
  [ [ -5, 5 ], [ -3, 10 ], [ -1, 15 ], [ 1, 20 ], [ 3, 11 ], [ 5, 2 ],
      [ 7, 1 ] ], [ [ -5, 7 ], [ -1, 35 ], [ 3, 21 ], [ 7, 1 ] ] ]
gap> Length(Sch);
7
gap> Schg:=List(Sch,x->Filtered(G128s64,y->Collected(List(y,Trace))=x));;
gap> S7:=Group(List(GeneratorsOfGroup(SymmetricGroup(7)),x->PermutationMat(x,7)));
<matrix group with 2 generators>
gap> Schgo:=List(Schg,x->Orbits(S7,List(x,Set),OnSets));;
gap> List(Schgo,Length);
[ 1, 1, 1, 1, 1, 1, 1 ]
gap> Schgo2:=List(Schgo,x->List(x,y->First(G128s64,z->Set(z) in y)));;
gap> G64Qc:=Flat(Schgo2);;
gap> Length(G64Qc); # # of Q-classes of (C2)^6
7

gap> G64Zc:=List(G64Qc,ZClassRepsQClass);;
gap> List(G64Zc,Length);
[ 206, 521, 144, 203, 491, 371, 80 ]
gap> Sum(last); # # of Z-classes of (C2)^6
2016

gap> G128s128:=Filtered(G128s,x->Order(x)=128);; # |G|=128
gap> Length(last);
1
gap> G128Qc:=[G128];;
gap> Length(G128Qc); # # of Q-classes of (C2)^7
1

gap> G128Zc:=List(G128Qc,ZClassRepsQClass);;
gap> List(G128Zc,Length);
[ 80 ]
gap> Sum(last); # # of Z-classes of (C2)^7
80
\end{verbatim}

\bigskip

The remaining part of this section is devoted to the study of $\bQ$-classes
of elementary abelian $2$-groups of $GL_n(\bZ)$ where $n$ is any positive
integer.

Recall that $G_{2^n}$ is the subgroup of $GL_n(\bZ)$ generated by the diagonal
matrices ${\rm Diag}(-1,1,1,1,1,1,1)$, %${\rm Diag}(1,-1,1,1,1,1,1),
$\ldots$, ${\rm Diag}(1,1,1,1,1,1,-1)$.
Since any elementary abelian $2$-group of $GL_n(\bZ)$ is $\bQ$-conjugate to
a subgroup of $G_{2^n}$, it suffices to study $\bQ$-classes of subgroups
in $G_{2^n}$.

As in Step 2 of the proof of Theorem \ref{t5.1}, we define $S_n$-equivalence
where $S_n$ is the subgroup of all the permutation matrices in $GL_n(\bZ)$.
Explicitly, two subgroups $H_1$ and $H_2$ of $G_{2^n}$ are $S_n$-equivalent
if there exists some element $t\in S_n$ such that
$H_2=t\cdot H_1\cdot t^{-1}$.

Clearly, ``$S_n$-equivalent'' $\Rightarrow$ ``$\bQ$-conjugation''.
The following theorem shows that the converse is also true.
Once we have this result, we may find all the $S_n$-equivalence classes,
and thus all the $\bQ$-classes, with the aid of the computer.
%
\begin{theorem}\label{t5.2}
Let $k$ be an integer with $1\leq k\leq n$,
$X(n,k):=\{H : H\ {\rm is\ a\ subgroup\ of\ }G_{2^n}\
{\rm and\ }H\simeq(C_2)^k\}$.
For any $H_1,H_2\in X(n,k)$, $H_1$ and $H_2$ are $\bQ$-conjugate
if and only if they are $S_n$-equivalent.
\end{theorem}
%
\begin{proof}
Step 1.
Let $\Phi:G_{2^n}\rightarrow(\bF_2)^n$ be the correspondence induced
by the group isomorphism $\{-1,1\}\rightarrow (\bF_2)^n$ as in Step 1
of the proof of Theorem \ref{t5.1}.
If $H\in X(n,k)$, then $\Phi(H)$ is a vector subspace of dimension $k$
in $(\bF_2)^n$.
Define $H(n,k):=\{W:W\ {\rm is\ a\ subspace\ of}\ (\bF_2)^n\ {\rm and}\ {\rm dim}_{\bF_2}W=k\}$.
For any vector $w\in (\bF_2)^n$, define the weight of $w$, denoted by
${\rm wt}(w)$, as ${\rm wt}(w)=\#\{w_i:w_i\neq 0\}$
if $w=(w_1,\ldots,w_n)\in(\bF_2)^n$.
It is easy to see that if $x\in G_{2^n}$, then ${\rm wt}(\Phi(x))=l
\Leftrightarrow {\rm trace}(x)=n-2l$.
We remark that if
$W\in H(n,k)$, $W$ is called a binary $(n,k)$-code in \cite{BBFKKW}.
For any $W_1, W_2\in H(n,k)$, a local isometry of $W_1$ and $W_2$ is a
linear isomorphism $\varphi:W_1\rightarrow W_2$ such that
${\rm wt}(\varphi(w))={\rm wt}(w)$ for any $w\in W_1$ \cite[page 549]{BBFKKW}.
Because we consider binary codes, i.e. the base field is $\bF_2$, there is no difference between linear maps and semilinear maps, which
are emphasized in \cite{BBFKKW}.
The reader may find the notion of isometries (instead of local isometries!) in
\cite[page 30 and page 40]{BBFKKW}; we will not use isometries in our proof.

\medskip
Step 2.
By abusing the notation, we will denote $S_n$ the symmetric group of
permutations on $n$ letters $\{1,2,\ldots,n\}$.
Thus, if $\sigma\in S_n$, then $\sigma$ induces a linear isomorphism on
$(\bF_2)^n$ by $\sigma(v)=(v_{\sigma(1)},\ldots,v_{\sigma(n)})$ if
$v=(v_1,\ldots,v_n)\in (\bF_2)^n$.
Using this linear isomorphism, we define an equivalence relation on $H(n,k)$.
For any $W_1, W_2\in H(n,k)$, $W_1$ is $S_n$-equivalent to $W_2$
if there is some $\sigma\in S_n$ such that $\sigma(W_1)=W_2$.
It is easy to verify if $t\in S_n$ is a permutation matrix associated to
the permutation $\sigma$, and $H_1, H_2\in X(n,k)$, then
$H_2=t\cdot H_1\cdot t^{-1}$ if and only if $\sigma(\Phi(H_1))=\Phi(H_2)$.

\medskip
Step 3.
Let $W_1,W_2\in H(n,k)$.
If $W_1$ is $S_n$-equivalent to $W_2$, it is clear that $W_1$ and $W_2$
are locally isometric.
The converse is true by \cite[page 551, Theorem 6.8.4]{BBFKKW}.
That is, $W_1$ is $S_n$-equivalent to $W_2$ if and only if they are
locally isometric.
This result is the key tool for Step 4..

\medskip
Step 4.
Now we come to the proof of this theorem.
It suffices to show that, if $H_1$ and $H_2$ are $\bQ$-conjugate,
then they are $S_n$-equivalent.
Suppose that $g\in GL_n(\bQ)$ and $H_2=g\cdot H_1\cdot g^{-1}$.
Then ${\rm trace}(x)={\rm trace}(g\cdot x\cdot g^{-1})$ for all $x\in H_1$.
It follows that the conjugation map $x\mapsto g\cdot x\cdot g^{-1}$
induces a local isometry from $\Phi(H_1)$ to $\Phi(H_2)$.
By the result in Step 3 (i.e. \cite[page 551, Theorem 6.8.4]{BBFKKW}),
$\Phi(H_1)$ and $\Phi(H_2)$ are $S_n$-equivalent.
It follows that $H_1$ and $H_2$ are $S_n$-equivalent by Step 2.
\end{proof}
%
\begin{remark}
{}From the above proof, we find that the following numbers are the same :
the number of $\bQ$-classes in $X(n,k)$, the number of $S_n$-equivalence classes of $X(n,k)$,
the number of local isometry classes of $H(n,k)$, and the number of $S_n$-equivalence classes of
$H(n,k)$.
A list of the number of the local isometry classes of $H(n,k)$ (for $1\leq n\leq 14$)
may be found in \cite[page 446, Table 6.2]{BBFKKW}.
\end{remark}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%\ssection{Elementary abelian groups $G$ with $H_u^2(G,M)\neq 0$}
\section{The case $H_u^2(G,M)\neq 0$ where $G=(C_2)^3$ or $A_6$}\label{seAbelianA6}

In Section 4 we have found the list of all the groups isomorphic to $(C_2)^3$ up to conjugation in $GL_7(\bZ)$. We will find the unramified Brauer groups of the multiplicative invariant fields associated to these groups in this section.

Note that, if $G$ is abelian, then $\bC(G)$ is $\bC$-rational and $H_u^2(G,\bm{Q}/\bm{Z})=0$ by Theorem \ref{thFi}. Thus ${\rm Br}_u(\bm{C}(M)^G)=H_u^2(G,M)$.
We will find that there exist exactly $9$ groups
$G\leq GL_7(\bm{Z})$ such that $G \simeq (C_2)^3$ and $H_u^2(G,M)\neq 0$.

At the end of this section, we give an example of two $G$-lattices $M$ with
non-trivial unramified Brauer group $H_u^2(G,M)\neq 0$
where $G \simeq A_6$ is the alternating group of degree $6$
and ${\rm rank}_\bZ M =9$ (see Theorem \ref{t5.5}). Note that $B_0(G)=0$ for any non-abelian simple group $G$ by Kunyavskii's Theorem \cite{Ku}; our example illustrates the situation of the multiplicative invariant fields.

\begin{theorem}\label{t5.4}
Let $G$ be an elementary abelian group of order $2^n$ in $GL_7(\bm{Z})$ and
$M$ be the associated $G$-lattice of rank $7$.
Then %$H_u^2(G,M)\neq 0$
${\rm Br}_u(\bm{C}(M)^G)\neq 0$ if and only if $G$ is isomorphic up to conjugation to one of the nine groups $G_1,\ldots,G_9$ in $GL_7(\bm{Z})$ where each of $G_i$ is isomorphic to $(C_2)^3$ as an abstract group. Moreover, ${\rm Br}_u(\bm{C}(M)^{G_i})=H_u^2(G_i,M)\simeq \bZ/2\bZ$
$($resp. $\bZ/2\bZ\oplus\bZ/2\bZ)$$)$ for $1\leq i\leq 8$
$($resp. $i=9$$)$. These groups $G_1,\ldots,G_9$ are defined as follows:
\begin{align*}
G_1&=
\left\langle\left(
\begin{smallmatrix}
0 & 1 & -1 & 0 & 0 & 0 & 0 \\
1 & 0 & 1 & 0 & 0 & 0 & 0 \\
0 & 0 & 1 & 0 & 0 & 0 & 0 \\
0 & 0 & 0 & 1 & 0 & 0 & 0 \\
0 & 0 & -1 & 0 & -1 & 0 & 1 \\
0 & 0 & 0 & 0 & 0 & -1 & 1 \\
0 & 0 & 0 & 0 & 0 & 0 & 1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
0 & -1 & 0 & 0 & 0 & 0 & 0 \\
-1 & 0 & 0 & 0 & 0 & 0 & 0 \\
0 & 0 & 1 & 0 & 0 & 0 & 0 \\
0 & 0 & 1 & -1 & 0 & 0 & 0 \\
0 & 0 & 0 & 0 & 1 & 0 & -1 \\
0 & 0 & 0 & 0 & 0 & 1 & -1 \\
0 & 0 & 0 & 0 & 0 & 0 & -1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
-1 & 0 & 0 & 0 & 0 & 0 & 0 \\
0 & -1 & 0 & 0 & 0 & 0 & 0 \\
0 & 0 & -1 & 0 & 0 & 0 & 0 \\
0 & 0 & -1 & 1 & 0 & 0 & -1 \\
0 & 0 & 1 & 0 & 1 & 0 & -1 \\
0 & 0 & 0 & 0 & 0 & -1 & 0\\
0 & 0 & 0 & 0 & 0 & 0 & -1
\end{smallmatrix}\right)
\right\rangle,\\
G_2&=
\left\langle\left(
\begin{smallmatrix}
0 & -1 & 0 & 0 & 0 & 0 & 1\\
-1 & 0 & 0 & 0 & 0 & 0 & -1\\
0 & 0 & -1 & 0 & 0 & 0 & 0\\
0 & 0 & 1 & 0 & -1 & 0 & -1\\
0 & 0 & -1 & -1 & 0 & 0 & 1\\
0 & 0 & 0 & 0 & 0 & 1 & -1\\
0 & 0 & 0 & 0 & 0 & 0 & -1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
0 & -1 & 0 & 0 & 0 & 0 & 1\\
-1 & 0 & 0 & 0 & 0 & 0 & -1\\
0 & 0 & 0 & 1 & 1 & 0 & 0\\
0 & 0 & 1 & 0 & -1 & 0 & -1\\
0 & 0 & 0 & 0 & 1 & 0 & 1\\
0 & 0 & 0 & 0 & 0 & -1 & 0\\
0 & 0 & 0 & 0 & 0 & 0 & -1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
0 & 1 & 0 & 0 & 0 & 0 & 0\\
1 & 0 & 0 & 0 & 0 & 0 & 0\\
0 & 0 & 0 & 1 & 1 & 0 & 0\\
0 & 0 & 0 & -1 & 0 & 0 & 0\\
0 & 0 & 1 & 1 & 0 & 0 & 0\\
0 & 0 & 0 & 0 & 0 & 1 & -1\\
0 & 0 & 0 & 0 & 0 & 0 & -1
\end{smallmatrix}\right)
\right\rangle,\\
G_3&=
\left\langle\left(
\begin{smallmatrix}
-1 & 0 & 0 & 0 & 0 & 0 & 0\\
0 & 0 & -1 & -1 & 0 & 0 & 0\\
0 & 0 & -1 & 0 & 0 & 0 & 0\\
0 & -1 & 1 & 0 & 0 & 0 & 0\\
0 & 0 & 0 & 0 & 0 & 1 & 1\\
0 & 0 & 0 & 0 & 1 & 0 & -1\\
0 & 0 & 0 & 0 & 0 & 0 & 1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
-1 & 0 & 0 & 0 & 0 & 0 & 0\\
0 & 0 & -1 & -1 & 0 & 0 & 0\\
0 & -1 & 0 & -1 & -1 & 1 & 1\\
0 & 0 & 0 & 1 & 1 & -1 & -1\\
0 & 0 & 0 & 0 & -1 & 0 & 0\\
0 & 0 & 0 & 0 & 0 & -1 & 0\\
0 & 0 & 0 & 0 & 0 & 0 & -1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
1 & 0 & 0 & 0 & 0 & 0 & 0\\
0 & 0 & 1 & 1 & 0 & 0 & 0\\
1 & 0 & 1 & 0 & -1 & 1 & 1\\
-1 & 1 & -1 & 0 & 1 & -1 & -1\\
1 & 0 & 0 & 0 & 0 & 1 & 1\\
-1 & 0 & 0 & 0 & 0 & -1 & 0\\
0 & 0 & 0 & 0 & 1 & 1 & 0
\end{smallmatrix}\right)
\right\rangle,\\
G_4&=
\left\langle\left(
\begin{smallmatrix}
-1 & 0 & 0 & 0 & 0 & 0 & -1\\
0 & -1 & 0 & 0 & 0 & 0 & 1\\
0 & 0 & -1 & 0 & 0 & 0 & -1\\
0 & 0 & -1 & 0 & -1 & 0 & -1\\
0 & 0 & 1 & -1 & 0 & 0 & 0\\
0 & 0 & 0 & 0 & 0 & 1 & 0\\
0 & 0 & 0 & 0 & 0 & 0 & 1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
0 & -1 & 0 & 0 & 0 & 0 & 0\\
-1 & 0 & 0 & 0 & 0 & 0 & 0\\
0 & 0 & -1 & 0 & 0 & 0 & -1\\
0 & 0 & 0 & -1 & 0 & 0 & -1\\
0 & 0 & 0 & 0 & -1 & 0 & 0\\
0 & 0 & 0 & 0 & 0 & -1 & 1\\
0 & 0 & 0 & 0 & 0 & 0 & 1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
1 & 0 & 0 & 0 & 0 & 0 & 1\\
0 & 1 & 0 & 0 & 0 & 0 & -1\\
0 & 0 & 0 & 1 & 1 & 0 & 1\\
0 & 0 & 0 & 1 & 0 & 0 & 1\\
0 & 0 & 1 & -1 & 0 & 0 & 0\\
0 & 0 & 0 & 0 & 0 & -1 & 0\\
0 & 0 & 0 & 0 & 0 & 0 & -1
\end{smallmatrix}\right)
\right\rangle,\\
G_5&=
\left\langle\left(
\begin{smallmatrix}
0 & -1 & 0 & 0 & 0 & 0 & 0\\
-1 & 0 & 0 & 0 & 0 & 0 & 0\\
0 & 0 & -1 & 0 & 0 & 0 & 1\\
0 & 0 & 1 & 0 & -1 & 0 & 0\\
0 & 0 & -1 & -1 & 0 & 0 & 1\\
0 & 0 & 0 & 0 & 0 & -1 & 1\\
0 & 0 & 0 & 0 & 0 & 0 & 1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
-1 & 0 & 0 & 0 & 0 & 0 & 1\\
0 & -1 & 0 & 0 & 0 & 0 & -1\\
0 & 0 & -1 & 0 & 0 & 0 & 1\\
0 & 0 & 0 & -1 & 0 & 0 & 0\\
0 & 0 & 0 & 0 & -1 & 0 & 1\\
0 & 0 & 0 & 0 & 0 & 1 & 0\\
0 & 0 & 0 & 0 & 0 & 0 & 1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
0 & 1 & 0 & 0 & 0 & 0 & 0\\
1 & 0 & 0 & 0 & 0 & 0 & 0\\
0 & 0 & 0 & 1 & 1 & 0 & -1\\
0 & 0 & 1 & 0 & -1 & 0 & 0\\
0 & 0 & 0 & 0 & 1 & 0 & -1\\
0 & 0 & 0 & 0 & 0 & 1 & -1\\
0 & 0 & 0 & 0 & 0 & 0 & -1
\end{smallmatrix}\right)
\right\rangle,\\
G_6&=
\left\langle\left(
\begin{smallmatrix}
0 & 1 & 1 & 1 & 0 & 0 & 0\\
1 & 0 & 1 & 0 & 0 & 0 & 0\\
0 & 0 & -1 & -1 & 0 & 0 & 0\\
0 & 0 & 0 & 1 & 0 & 0 & 0\\
0 & 0 & 0 & -1 & -1 & 0 & 0\\
0 & 0 & 0 & -1 & -1 & 0 & 1\\
0 & 0 & 0 & 0 & -1 & 1 & 0
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
0 & -1 & -1 & 0 & 1 & 1 & -1\\
0 & -1 & 0 & -1 & 0 & 0 & 0\\
-1 & 1 & 0 & -1 & -1 & -1 & 1\\
0 & 0 & 0 & 1 & 0 & 0 & 0\\
0 & 0 & 0 & -1 & -1 & 0 & 0\\
0 & 0 & 0 & -1 & 0 & -1 & 0\\
0 & 0 & 0 & 0 & 0 & 0 & -1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
0 & -1 & -1 & -1 & 0 & 0 & 0\\
-1 & 0 & -1 & 0 & 0 & 0 & 0\\
0 & 0 & 1 & 1 & 0 & 0 & 0\\
0 & 0 & 0 & -1 & 0 & 0 & 0\\
0 & 0 & 0 & 1 & 0 & 1 & -1\\
0 & 0 & 0 & 1 & 0 & 1 & 0\\
0 & 0 & 0 & 0 & -1 & 1 & 0
\end{smallmatrix}\right)
\right\rangle,\\
G_7&=
\left\langle\left(
\begin{smallmatrix}
0 & 1 & 0 & 0 & 0 & 0 & 0\\
1 & 0 & 0 & 0 & 0 & 0 & 0\\
0 & 0 & -1 & 0 & 0 & 0 & 0\\
0 & 0 & 0 & -1 & 0 & 0 & 0\\
0 & 0 & 0 & 0 & -1 & 0 & 0\\
0 & 0 & 0 & 0 & 0 & 1 & -1\\
0 & 0 & 0 & 0 & 0 & 0 & -1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
0 & 1 & 0 & 0 & 0 & 0 & 0\\
1 & 0 & 0 & 0 & 0 & 0 & 0\\
0 & 0 & 0 & 1 & 1 & 0 & 0\\
0 & 0 & 0 & -1 & 0 & 0 & 0\\
0 & 0 & 1 & 1 & 0 & 0 & 0\\
0 & 0 & 0 & 0 & 0 & -1 & 0\\
0 & 0 & 0 & 0 & 0 & 0 & -1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
0 & -1 & 0 & 0 & 0 & 0 & 1\\
-1 & 0 & 0 & 0 & 0 & 0 & -1\\
0 & 0 & 0 & 1 & 1 & 0 & 0\\
0 & 0 & 1 & 0 & -1 & 0 & -1\\
0 & 0 & 0 & 0 & 1 & 0 & 1\\
0 & 0 & 0 & 0 & 0 & 1 & -1\\
0 & 0 & 0 & 0 & 0 & 0 & -1
\end{smallmatrix}\right)
\right\rangle,\\
G_8&=
\left\langle\left(
\begin{smallmatrix}
-1 & 0 & 0 & 0 & 0 & 0 & -1\\
0 & -1 & 0 & 0 & 0 & 0 & 1\\
0 & 0 & -1 & 0 & 0 & 0 & -1\\
0 & 0 & 0 & -1 & 0 & 0 & 0\\
0 & 0 & 0 & 0 & -1 & 0 & 1\\
0 & 0 & 0 & 0 & 0 & 1 & 0\\
0 & 0 & 0 & 0 & 0 & 0 & 1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
-1 & 0 & 0 & 0 & 0 & 0 & -1\\
0 & -1 & 0 & 0 & 0 & 0 & 1\\
0 & 0 & 0 & -1 & -1 & 0 & 0\\
0 & 0 & 0 & -1 & 0 & 0 & 0\\
0 & 0 & -1 & 1 & 0 & 0 & 0\\
0 & 0 & 0 & 0 & 0 & -1 & 1\\
0 & 0 & 0 & 0 & 0 & 0 & 1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
0 & -1 & 0 & 0 & 0 & 0 & 1\\
-1 & 0 & 0 & 0 & 0 & 0 & -1\\
0 & 0 & 0 & -1 & -1 & 0 & 1\\
0 & 0 & -1 & 0 & -1 & 0 & 0\\
0 & 0 & 0 & 0 & 1 & 0 & -1\\
0 & 0 & 0 & 0 & 0 & 1 & -1\\
0 & 0 & 0 & 0 & 0 & 0 & -1
\end{smallmatrix}\right)
\right\rangle,\\
G_9&=
\left\langle\left(
\begin{smallmatrix}
1 & -1 & -1 & 1 & 0 & 1 & 0\\
-1 & 0 & 0 & 0 & -1 & -1 & 0\\
-1 & 0 & -1 & -1 & 0 & 1 & -1\\
-1 & 1 & 0 & -1 & -1 & -1 & 0\\
0 & 0 & 1 & 0 & 0 & -1 & 1\\
-1 & 0 & 0 & -1 & 0 & 0 & -1\\
0 & 0 & 1 & 0 & 1 & -1 & 0
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
0 & 1 & 1 & 0 & 0 & 0 & 1\\
1 & 1 & 0 & -1 & 0 & 1 & 1\\
1 & 0 & 0 & 1 & -1 & 0 & 0\\
0 & 0 & 0 & -1 & 0 & 0 & 0\\
0 & 1 & 0 & -1 & 0 & 0 & 1\\
0 & 0 & -1 & 0 & -1 & 0 & -1\\
-1 & -1 & 0 & 0 & 1 & -1 & -1
\end{smallmatrix}\right),\left(
\begin{smallmatrix}
0 & 1 & 0 & 0 & -1 & -1 & 0\\
1 & 0 & 1 & 0 & 0 & 0 & 1\\
0 & 1 & 1 & -1 & 1 & 0 & 1\\
1 & 0 & 0 & 0 & 0 & 1 & 1\\
0 & 0 & 0 & 0 & -1 & 0 & 0\\
0 & 0 & 1 & 0 & 1 & 0 & 1\\
0 & -1 & -1 & 1 & 0 & 1 & -1
\end{smallmatrix}\right)
\right\rangle.
\end{align*}

\end{theorem}
\begin{proof}
As noted before, $G$ is an abelian group and therefore $B_0(G)=H_u^2(G,\bm{Q}/\bm{Z})$ is trivial. Hence ${\rm Br}_u(\bm{C}(M)^G)=H_u^2(G,M)$. From now on we focus on the computation of $H_u^2(G,M)$.

When ${\rm rank}_\bm{Z} M\leq 3$, it follows from Theorem \ref{thHaj87} and
Theorem \ref{thHKHR} that $\bm{C}(M)^G$ is $\bm{C}$-rational.
Hence $H_u^2(G,M)=0$.
%
When $4\leq {\rm rank}_\bm{Z} M\leq 6$, it follows from Theorem \ref{t1.5}
(see Theorems \ref{thm1}, \ref{thm2}, \ref{thm3} for details)
that $H_u^2(G,M)=0$.
%

\medskip
Hence we assume that ${\rm rank}_\bm{Z} M=7$ from now on.
For $|G|\leq 4$, it follows from Theorem \ref{thB1} that $H_u^2(G,M)=0$.
For $8\leq |G|\leq 128$, we can apply the function {\tt H2nrM} given
in Section \ref{seGAP} to those groups $\simeq (C_2)^k$ classified in Theorem \ref{t5.1}.
Then we obtain that only the following $9$ groups $G\simeq (C_2)^3$
satisfy $H_u^2(G,M)\neq 0$.
\begin{center}
\begin{tabular}{lcccc}
$L_G$ with $G\simeq (C_2)^3$
& & \# $\bm{Z}$-classes & \# $G$'s with $H_u^2(G,M)\neq 0$ & $H_u^2(G,M)$  \\\hline
$[ 0, 1, 1, 2, 3, 0, 0, 1 ]$ & & 380 & 1 & $\bm{Z}/2\bm{Z}$ \\
$[ 0, 1, 0, 5, 0, 1, 0, 1 ]$ & & 279 & 1 & $\bm{Z}/2\bm{Z}$ \\
$[ 0, 0, 2, 3, 2, 0, 0, 1 ]$ & & 1000 & 4 & $\bm{Z}/2\bm{Z}$ \\
$[ 0, 0, 3, 2, 1, 1, 0, 1 ]$ & & 429 & 2 & $\bm{Z}/2\bm{Z}$ \\
$[ 0, 0, 0, 7, 0, 0, 0, 1 ]$ & & 269 & 1 & $(\bm{Z}/2\bm{Z})^{\oplus 2}$ \\
\end{tabular}
\end{center}
\end{proof}

\begin{verbatim}
gap> LoadPackage("carat");
true
gap> Read("res.gap");

gap> G8Zc:=List(G8Qc,ZClassRepsQClass);;
gap> List(G8Zc,Length);
[ 12, 13, 6, 60, 20, 19, 62, 80, 380, 208, 107, 28, 80, 279, 113, 58, 279,
  58, 28, 58, 18, 107, 58, 1919, 415, 221, 429, 208, 1000, 429, 58, 113, 92,
  58, 691, 60, 432, 1077, 221, 691, 269, 18, 113 ]
gap> Sum(last);
10645
gap> G8H2nr:=List(G8Zc,x->Filtered(x,y->H2nrM(y).H2nrM<>[]));; # computing H2nr(G,M)
gap> G8H2nr;
[ [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ],
  [ <matrix group of size 8 with 3 generators> ], [  ], [  ], [  ], [  ],
  [  ], [  ], [  ], [ <matrix group of size 8 with 3 generators> ], [  ],
  [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ],
  [ <matrix group of size 8 with 3 generators>,
      <matrix group of size 8 with 3 generators>,
      <matrix group of size 8 with 3 generators>,
      <matrix group of size 8 with 3 generators> ],
  [ <matrix group of size 8 with 3 generators>,
      <matrix group of size 8 with 3 generators> ], [  ], [  ], [  ], [  ],
  [  ], [  ], [  ], [  ], [  ], [  ],
  [ <matrix group of size 8 with 3 generators> ], [  ], [  ] ]
gap> List(G8H2nr,Length);
[ 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0,
  0, 0, 0, 4, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0 ]
gap> Sum(last);
9
gap> G8H2nrs:=Flat(G8H2nr);;
gap> List(G8H2nrs,x->H2nrM(x).H2nrM);
[ [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2 ], [ 2, 2 ] ]
gap> for i in G8H2nrs do Print(GeneratorsOfGroup(i),"\n"); od;
[ [ [ 0, 1, -1, 0, 0, 0, 0 ],
    [ 1, 0, 1, 0, 0, 0, 0 ],
    [ 0, 0, 1, 0, 0, 0, 0 ],
    [ 0, 0, 0, 1, 0, 0, 0 ],
    [ 0, 0, -1, 0, -1, 0, 1 ],
    [ 0, 0, 0, 0, 0, -1, 1 ],
    [ 0, 0, 0, 0, 0, 0, 1 ] ],
  [ [ 0, -1, 0, 0, 0, 0, 0 ],
    [ -1, 0, 0, 0, 0, 0, 0 ],
    [ 0, 0, 1, 0, 0, 0, 0 ],
    [ 0, 0, 1, -1, 0, 0, 0 ],
    [ 0, 0, 0, 0, 1, 0, -1 ],
    [ 0, 0, 0, 0, 0, 1, -1 ],
    [ 0, 0, 0, 0, 0, 0, -1 ] ],
  [ [ -1, 0, 0, 0, 0, 0, 0 ],
    [ 0, -1, 0, 0, 0, 0, 0 ],
    [ 0, 0, -1, 0, 0, 0, 0 ],
    [ 0, 0, -1, 1, 0, 0, -1 ],
    [ 0, 0, 1, 0, 1, 0, -1 ],
    [ 0, 0, 0, 0, 0, -1, 0 ],
    [ 0, 0, 0, 0, 0, 0, -1 ] ] ]
[ [ [ 0, -1, 0, 0, 0, 0, 1 ],
    [ -1, 0, 0, 0, 0, 0, -1 ],
    [ 0, 0, -1, 0, 0, 0, 0 ],
    [ 0, 0, 1, 0, -1, 0, -1 ],
    [ 0, 0, -1, -1, 0, 0, 1 ],
    [ 0, 0, 0, 0, 0, 1, -1 ],
    [ 0, 0, 0, 0, 0, 0, -1 ] ],
  [ [ 0, -1, 0, 0, 0, 0, 1 ],
    [ -1, 0, 0, 0, 0, 0, -1 ],
    [ 0, 0, 0, 1, 1, 0, 0 ],
    [ 0, 0, 1, 0, -1, 0, -1 ],
    [ 0, 0, 0, 0, 1, 0, 1 ],
    [ 0, 0, 0, 0, 0, -1, 0 ],
    [ 0, 0, 0, 0, 0, 0, -1 ] ],
  [ [ 0, 1, 0, 0, 0, 0, 0 ],
    [ 1, 0, 0, 0, 0, 0, 0 ],
    [ 0, 0, 0, 1, 1, 0, 0 ],
    [ 0, 0, 0, -1, 0, 0, 0 ],
    [ 0, 0, 1, 1, 0, 0, 0 ],
    [ 0, 0, 0, 0, 0, 1, -1 ],
    [ 0, 0, 0, 0, 0, 0, -1 ] ] ]
[ [ [ -1, 0, 0, 0, 0, 0, 0 ],
    [ 0, 0, -1, -1, 0, 0, 0 ],
    [ 0, 0, -1, 0, 0, 0, 0 ],
    [ 0, -1, 1, 0, 0, 0, 0 ],
    [ 0, 0, 0, 0, 0, 1, 1 ],
    [ 0, 0, 0, 0, 1, 0, -1 ],
    [ 0, 0, 0, 0, 0, 0, 1 ] ],
  [ [ -1, 0, 0, 0, 0, 0, 0 ],
    [ 0, 0, -1, -1, 0, 0, 0 ],
    [ 0, -1, 0, -1, -1, 1, 1 ],
    [ 0, 0, 0, 1, 1, -1, -1 ],
    [ 0, 0, 0, 0, -1, 0, 0 ],
    [ 0, 0, 0, 0, 0, -1, 0 ],
    [ 0, 0, 0, 0, 0, 0, -1 ] ],
  [ [ 1, 0, 0, 0, 0, 0, 0 ],
    [ 0, 0, 1, 1, 0, 0, 0 ],
    [ 1, 0, 1, 0, -1, 1, 1 ],
    [ -1, 1, -1, 0, 1, -1, -1 ],
    [ 1, 0, 0, 0, 0, 1, 1 ],
    [ -1, 0, 0, 0, 0, -1, 0 ],
    [ 0, 0, 0, 0, 1, 1, 0 ] ] ]
[ [ [ -1, 0, 0, 0, 0, 0, -1 ],
    [ 0, -1, 0, 0, 0, 0, 1 ],
    [ 0, 0, -1, 0, 0, 0, -1 ],
    [ 0, 0, -1, 0, -1, 0, -1 ],
    [ 0, 0, 1, -1, 0, 0, 0 ],
    [ 0, 0, 0, 0, 0, 1, 0 ],
    [ 0, 0, 0, 0, 0, 0, 1 ] ],
  [ [ 0, -1, 0, 0, 0, 0, 0 ],
    [ -1, 0, 0, 0, 0, 0, 0 ],
    [ 0, 0, -1, 0, 0, 0, -1 ],
    [ 0, 0, 0, -1, 0, 0, -1 ],
    [ 0, 0, 0, 0, -1, 0, 0 ],
    [ 0, 0, 0, 0, 0, -1, 1 ],
    [ 0, 0, 0, 0, 0, 0, 1 ] ],
  [ [ 1, 0, 0, 0, 0, 0, 1 ],
    [ 0, 1, 0, 0, 0, 0, -1 ],
    [ 0, 0, 0, 1, 1, 0, 1 ],
    [ 0, 0, 0, 1, 0, 0, 1 ],
    [ 0, 0, 1, -1, 0, 0, 0 ],
    [ 0, 0, 0, 0, 0, -1, 0 ],
    [ 0, 0, 0, 0, 0, 0, -1 ] ] ]
[ [ [ 0, -1, 0, 0, 0, 0, 0 ],
    [ -1, 0, 0, 0, 0, 0, 0 ],
    [ 0, 0, -1, 0, 0, 0, 1 ],
    [ 0, 0, 1, 0, -1, 0, 0 ],
    [ 0, 0, -1, -1, 0, 0, 1 ],
    [ 0, 0, 0, 0, 0, -1, 1 ],
    [ 0, 0, 0, 0, 0, 0, 1 ] ],
  [ [ -1, 0, 0, 0, 0, 0, 1 ],
    [ 0, -1, 0, 0, 0, 0, -1 ],
    [ 0, 0, -1, 0, 0, 0, 1 ],
    [ 0, 0, 0, -1, 0, 0, 0 ],
    [ 0, 0, 0, 0, -1, 0, 1 ],
    [ 0, 0, 0, 0, 0, 1, 0 ],
    [ 0, 0, 0, 0, 0, 0, 1 ] ],
  [ [ 0, 1, 0, 0, 0, 0, 0 ],
    [ 1, 0, 0, 0, 0, 0, 0 ],
    [ 0, 0, 0, 1, 1, 0, -1 ],
    [ 0, 0, 1, 0, -1, 0, 0 ],
    [ 0, 0, 0, 0, 1, 0, -1 ],
    [ 0, 0, 0, 0, 0, 1, -1 ],
    [ 0, 0, 0, 0, 0, 0, -1 ] ] ]
[ [ [ 0, 1, 1, 1, 0, 0, 0 ],
    [ 1, 0, 1, 0, 0, 0, 0 ],
    [ 0, 0, -1, -1, 0, 0, 0 ],
    [ 0, 0, 0, 1, 0, 0, 0 ],
    [ 0, 0, 0, -1, -1, 0, 0 ],
    [ 0, 0, 0, -1, -1, 0, 1 ],
    [ 0, 0, 0, 0, -1, 1, 0 ] ],
  [ [ 0, -1, -1, 0, 1, 1, -1 ],
    [ 0, -1, 0, -1, 0, 0, 0 ],
    [ -1, 1, 0, -1, -1, -1, 1 ],
    [ 0, 0, 0, 1, 0, 0, 0 ],
    [ 0, 0, 0, -1, -1, 0, 0 ],
    [ 0, 0, 0, -1, 0, -1, 0 ],
    [ 0, 0, 0, 0, 0, 0, -1 ] ],
  [ [ 0, -1, -1, -1, 0, 0, 0 ],
    [ -1, 0, -1, 0, 0, 0, 0 ],
    [ 0, 0, 1, 1, 0, 0, 0 ],
    [ 0, 0, 0, -1, 0, 0, 0 ],
    [ 0, 0, 0, 1, 0, 1, -1 ],
    [ 0, 0, 0, 1, 0, 1, 0 ],
    [ 0, 0, 0, 0, -1, 1, 0 ] ] ]
[ [ [ 0, 1, 0, 0, 0, 0, 0 ],
    [ 1, 0, 0, 0, 0, 0, 0 ],
    [ 0, 0, -1, 0, 0, 0, 0 ],
    [ 0, 0, 0, -1, 0, 0, 0 ],
    [ 0, 0, 0, 0, -1, 0, 0 ],
    [ 0, 0, 0, 0, 0, 1, -1 ],
    [ 0, 0, 0, 0, 0, 0, -1 ] ],
  [ [ 0, 1, 0, 0, 0, 0, 0 ],
    [ 1, 0, 0, 0, 0, 0, 0 ],
    [ 0, 0, 0, 1, 1, 0, 0 ],
    [ 0, 0, 0, -1, 0, 0, 0 ],
    [ 0, 0, 1, 1, 0, 0, 0 ],
    [ 0, 0, 0, 0, 0, -1, 0 ],
    [ 0, 0, 0, 0, 0, 0, -1 ] ],
  [ [ 0, -1, 0, 0, 0, 0, 1 ],
    [ -1, 0, 0, 0, 0, 0, -1 ],
    [ 0, 0, 0, 1, 1, 0, 0 ],
    [ 0, 0, 1, 0, -1, 0, -1 ],
    [ 0, 0, 0, 0, 1, 0, 1 ],
    [ 0, 0, 0, 0, 0, 1, -1 ],
    [ 0, 0, 0, 0, 0, 0, -1 ] ] ]
[ [ [ -1, 0, 0, 0, 0, 0, -1 ],
    [ 0, -1, 0, 0, 0, 0, 1 ],
    [ 0, 0, -1, 0, 0, 0, -1 ],
    [ 0, 0, 0, -1, 0, 0, 0 ],
    [ 0, 0, 0, 0, -1, 0, 1 ],
    [ 0, 0, 0, 0, 0, 1, 0 ],
    [ 0, 0, 0, 0, 0, 0, 1 ] ],
  [ [ -1, 0, 0, 0, 0, 0, -1 ],
    [ 0, -1, 0, 0, 0, 0, 1 ],
    [ 0, 0, 0, -1, -1, 0, 0 ],
    [ 0, 0, 0, -1, 0, 0, 0 ],
    [ 0, 0, -1, 1, 0, 0, 0 ],
    [ 0, 0, 0, 0, 0, -1, 1 ],
    [ 0, 0, 0, 0, 0, 0, 1 ] ],
  [ [ 0, -1, 0, 0, 0, 0, 1 ],
    [ -1, 0, 0, 0, 0, 0, -1 ],
    [ 0, 0, 0, -1, -1, 0, 1 ],
    [ 0, 0, -1, 0, -1, 0, 0 ],
    [ 0, 0, 0, 0, 1, 0, -1 ],
    [ 0, 0, 0, 0, 0, 1, -1 ],
    [ 0, 0, 0, 0, 0, 0, -1 ] ] ]
[ [ [ 1, -1, -1, 1, 0, 1, 0 ],
    [ -1, 0, 0, 0, -1, -1, 0 ],
    [ -1, 0, -1, -1, 0, 1, -1 ],
    [ -1, 1, 0, -1, -1, -1, 0 ],
    [ 0, 0, 1, 0, 0, -1, 1 ],
    [ -1, 0, 0, -1, 0, 0, -1 ],
    [ 0, 0, 1, 0, 1, -1, 0 ] ],
  [ [ 0, 1, 1, 0, 0, 0, 1 ],
    [ 1, 1, 0, -1, 0, 1, 1 ],
    [ 1, 0, 0, 1, -1, 0, 0 ],
    [ 0, 0, 0, -1, 0, 0, 0 ],
    [ 0, 1, 0, -1, 0, 0, 1 ],
    [ 0, 0, -1, 0, -1, 0, -1 ],
    [ -1, -1, 0, 0, 1, -1, -1 ] ],
  [ [ 0, 1, 0, 0, -1, -1, 0 ],
    [ 1, 0, 1, 0, 0, 0, 1 ],
    [ 0, 1, 1, -1, 1, 0, 1 ],
    [ 1, 0, 0, 0, 0, 1, 1 ],
    [ 0, 0, 0, 0, -1, 0, 0 ],
    [ 0, 0, 1, 0, 1, 0, 1 ],
    [ 0, -1, -1, 1, 0, 1, -1 ] ] ]

gap> G16Zc:=List(G16Qc,ZClassRepsQClass);;
gap> List(G16Zc,Length);
[ 279, 113, 58, 58, 18, 691, 221, 60, 269, 886, 270, 2823, 109, 1878, 883,
  670, 270, 789, 380, 789, 1170, 422, 141, 574, 144, 109, 144, 56, 380, 214,
  3055, 2534, 1170, 883, 1037, 361, 2867, 670, 558, 56, 574, 145, 664 ]
gap> Sum(last);
29442
gap> G16H2nr:=List(G16Zc,x->Filtered(x,y->H2nrM(y).H2nrM<>[]));;
gap> G16H2nr;
[ [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ],
  [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ],
  [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ],
  [  ], [  ], [  ], [  ], [  ], [  ], [  ] ]

gap> G32Zc:=List(G32Qc,ZClassRepsQClass);;
gap> List(G32Zc,Length);
[ 789, 380, 574, 144, 56, 664, 145, 1034, 360, 1860, 983, 206, 2499, 557,
  899, 557, 521, 360, 144, 144, 1183, 557, 632 ]
gap> Sum(last);
15248
gap> G32H2nr:=List(G32Zc,x->Filtered(x,y->H2nrM(y).H2nrM<>[]));;
gap> G32H2nr;
[ [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ],
  [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ], [  ] ]

gap> G64Zc:=List(G64Qc,ZClassRepsQClass);;
gap> List(G64Zc,Length);
[ 206, 521, 144, 203, 491, 371, 80 ]
gap> Sum(last);
2016
gap> G64H2nr:=List(G64Zc,x->Filtered(x,y->H2nrM(y).H2nrM<>[]));;
gap> G64H2nr;
[ [  ], [  ], [  ], [  ], [  ], [  ], [  ] ]

gap> G128Zc:=List(G128Qc,ZClassRepsQClass);;
gap> List(G128Zc,Length);
[ 80 ]
gap> Sum(last);
80
gap> G128H2nr:=List(G128Zc,x->Filtered(x,y->H2nrM(y).H2nrM<>[]));;
gap> G128H2nr;
[ [  ] ]
\end{verbatim}~\\

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

We remark that
all the $G$-lattices $M$ with ${\rm rank}_\bZ M\leq 6$ and $H_u^2(G,M)\neq 0$
in Theorem \ref{t1.5}, Theorems \ref{thm1}, \ref{thm2}, \ref{thm3} satisfy the condition that $G$ is non-abelian and solvable. In the following we will give examples of $G$-lattices $M$ with $H_u^2(G,M)\neq 0$ where $G$ is non-abelian simple; in fact, we choose $G=A_6\simeq PSL_2(\bF_9)$.

\begin{theorem}\label{t5.5}
Let $A_6$ be the alternating group of degree $6$. Embed $A_6$ into $S_{10}$ through the isomorphism $A_6\simeq PSL_2(\bF_9)$, which acts on the projective line $\bm{P}^1 _{\bF_9}$ via fractional linear transformations. Thus we may regard $A_6$ as a transitive subgroup of $S_{10}$.  Let $N=\oplus_{1\leq i\leq 10}\bZ\cdot x_i$ be the  $S_{10}$-lattice defined by $\sigma \cdot x_i = x_{\sigma(i)}$ for any $\sigma \in S_{10}$; it becomes an $A_6$-lattice by restricting the action of $S_{10}$ to $A_6$. Define $M=N/(\bZ\cdot \sum_{i=1}^{10}x_i)$ with ${\rm rank}_\bZ M=9$.
There exist exactly six $A_6$-lattices $M=M_1$, $M_2,\ldots,M_6$
which are $\bQ$-conjugate but not $\bZ$-conjugate to each other; in fact, all these $M_i$ form a single $\bQ$-class, but this $\bQ$-class consists of six $\bZ$-classes.
Then we have
\begin{align*}
H_u^2(A_6,M_1)\simeq H_u^2(A_6,M_3)\simeq\bZ/2\bZ,\quad
H_u^2(A_6,M_i)=0\ {\rm for}\ i=2,4,5,6.
\end{align*}

In particular, $\bC(M_1)^{A_6}$ and $\bC(M_3)^{A_6}$
are not retract $\bC$-rational.

Furthermore the lattices $M_1$ and $M_3$ may be distinguished by the Tate cohomology groups,
\begin{align*}
H^1(A_6,M_1)=0,\ \widehat{H}^{-1}(A_6,M_1)=\bZ/10\bZ,\
H^1(A_6,M_3)=\bZ/5\bZ,\ \widehat{H}^{-1}(A_6,M_3)=\bZ/2\bZ.
\end{align*}
\end{theorem}
%
\begin{proof}
Let $G\leq S_{10}$ be the $26$th transitive subgroup $10T26$
of $S_{10}$ which is isomorphic to the alternating group $A_6$ of degree $6$
(see \cite{BM07}, \cite{GAP}).
We take the corresponding $A_6$-lattice $N=\oplus_{1\leq i\leq 10}\bZ\cdot x_i$
with ${\rm rank}_\bZ N=10$ and $M=N/(\bZ\cdot \sum_{i=1}^{10}x_i)$
with ${\rm rank}_\bZ M=9$.

We remark that the $G$-lattice $M$ is the restriction to $A_6$ of an $S_{10}$-lattice which is the character lattice of the norm one torus $R_{K/k}^{(1)}(\bG_m)$ where $K/k$ is some non-Galois extension of degree $10$ (see \cite[Chapter 8]{HY}).

We can take such an $M$ in GAP
by using the command ${\tt Norm1TorusJ}(10,26)$
in ${\tt FlabbyResolution.gap}$ which is available from
{\tt http://www.math.h.kyoto-u.ac.jp/\~{}yamasaki/Algorithm/MultInvField/}.
%
Then just applying the function ${\tt H2nrM}$,
we find that $H_u^2(G,M)\simeq\bZ/2\bZ$.

Using the command {\tt ZClassRepsQClass} of CARAT package \cite{CARAT}
of GAP, we can split the $\bQ$-class of $M$ into six $\bZ$-classes.
Then just apply the function ${\tt H2nrM}$ to determine $H_u^2(A_6,M_i)$
$(1\leq i\leq 6)$.
We can distinguish the six $\bZ$-classes according to their
cohomologies $H^1$ and $\widehat{H}^{-1}$ as below.
\end{proof}

\medskip

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{verbatim}
gap> Read("FlabbyResolution.gap");
gap> Read("res.gap");
gap> G:=Norm1TorusJ(10,26);
<matrix group with 3 generators>
gap> StructureDescription(G);
"A6"
gap> H2nrM(G).H2nrM;
[ 2 ]

gap> Gz:=ZClassRepsQClass(G);;
gap> List(Gz,x->H2nrM(x).H2nrM);
[ [ 2 ], [  ], [ 2 ], [  ], [  ], [  ] ]

gap> List(Gz,x->Filtered(H1(x),y->y>1));
[ [  ], [  ], [ 5 ], [ 2 ], [ 5 ], [ 10 ] ]
gap> List(Gz,x->Filtered(Hminus1(x),y->y>1));
[ [ 10 ], [ 5 ], [ 2 ], [ 5 ], [  ], [  ] ]
gap> Filtered(H1(G),x->x>1);
[  ]
gap> Filtered(Hminus1(G),x->x>1);
[ 10 ]
\end{verbatim}

\medskip

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%------------------------------------S5
%\ssection{}
%\cchapter{Theorems}
\section{Some lattices of rank $2n+2, 4n$, and $p(p-1)$}\label{seHigher}

Motivated by Theorem \ref{t1.5} we will construct in this section lattices of rank $2n+2, 4n, p(p-1)$ with non-trivial unramified Brauer groups (where $n$ is any positive integer and $p$ is any odd prime number).

Before the construction, we note a variation of Theorem \ref{thSa4}.
{}From Theorem \ref{thSa4}, $H_u^2(G,M)$ may be  obtained as
\[
H_u^2(G,M)=\bigcap_{A} {\rm Ker}(
{\rm res} : H^2(G,M)\rightarrow H^2(A,M))
\]
where $A$ runs over {\it maximal} bicyclic subgroups of $G$. If $B\leq A$, then
${\rm Ker}(
{\rm res} : H^2(G,M)\rightarrow H^2(A,M))\leq
{\rm Ker}(
{\rm res} : H^2(G,M)\rightarrow H^2(B,M))$
(see also Definition \ref{d1.4}).
Hence in order to find $H_u^2(G,M)$, it suffices to evaluate
${\rm Ker}(
{\rm res} : H^2(G,M)\rightarrow H^2(H,M))$
for each maximal bicyclic subgroup $H\leq G$.

\begin{definition}\label{defD4n}
Let $G=\langle \sigma,\tau: \sigma^{4n}=\tau^2=1,
\tau^{-1}\sigma\tau=\sigma^{-1}\rangle\simeq D_{4n}$,
the dihedral group of order $8n$ where $n$ is any positive integer.
Define a $G$-lattice of rank $2n+2$ as follows:
$M=(\oplus_{1\leq i\leq 2n}\bZ\cdot x_i)\oplus(\oplus_{1\leq j\leq 2}\bZ
\cdot y_j)$ such that
\begin{align*}
\sigma&:x_1\mapsto x_2\mapsto\cdots\mapsto x_{2n}\mapsto -x_1,
y_1\mapsto y_2+x_1, y_2\mapsto y_1+x_1,\\
\tau&:x_i\leftrightarrow -x_{2n+1-i}\ (1\leq i\leq 2n),
y_1\mapsto -y_2, y_2\mapsto -y_1.
\end{align*}
In matrix forms with respect to the cases $x_1,\ldots,x_{2n}, y_1,y_2$,
the actions of $\sigma$ and $\tau$ are given as
\begin{align*}
\sigma=\left(
\begin{array}{cccc|cc}
 & 1 & & & & \\
 & & \ddots & & &\\
 &  & & 1 & &\\
 -1 & & & & &\\\hline
1 & 0 & \cdots & 0& 0 &1 \\
1 & 0 & \cdots & 0& 1 & 0
\end{array}
\right),
\tau=
\left(
\begin{array}{cccc|cc}
 &  & & -1 & &  \\
 & & \reflectbox{$\ddots$} & & &\\
 & \reflectbox{$\ddots$} & &  &  &\\
-1 & & & &  & \\\hline
 &  & & & 0 &-1 \\
 &  & & & -1 & 0
\end{array}
\right)\in GL_{2n+2}(\bZ).
\end{align*}
\end{definition}

The following theorem gives a generalization
of the case of the dihedral groups $D_4$ and $D_8$
with GAP ID (4,12,4,12) and CARAT ID (6,5574,11)
in Theorem \ref{t1.5} (2) and (4) respectively
(see Table 1 and Table 3-1-1). When $G=D_m$ the dihedral group of order $2m$, note that $\bm{C}(G)$ is rational by \cite[Proposition 2.6]{CHK}. Thus $B_0(G)=0$ and ${\rm Br}_u(\bm{C}(M)^G)=H^2_u(G, M)$.

%\begin{theorem}
%Let $D_{4n}=\langle \sigma,\tau: \sigma^{4n}=\tau^2=1,
%\tau^{-1}\sigma\tau=\sigma^{-1}\rangle\leq GL_{2n+2}(\bm{Z})$
%be the dihedral group of order $8n$
%and $M$ be the associated faithful $D_{4n}$-lattice where
%\begin{align*}
%\sigma=\left(
%\begin{array}{cc|cccc}
% 0 & 1 & 1 & 0 & \cdots & 0 \\
% 1 & 0 & 1 & 0 & \cdots & 0 \\\hline
% 0 & 0 &  & 1 &  \\
%\vdots & \vdots &  & & \ddots &\\
%\vdots & \vdots &  &  & & 1\\
%0 & 0 & -1 & & &
%\end{array}
%\right),
%\tau=
%\left(
%\begin{array}{cc|cccc}
% 0 & -1 & 0 & \cdots & \cdots & 0 \\
%-1 & 0 & 0 & \cdots & \cdots & 0 \\\hline
% 0 & 0 &  &  & & -1 \\
%\vdots & \vdots & & & \reflectbox{$\ddots$} &\\
%\vdots & \vdots &  & \reflectbox{$\ddots$} &  & \\
%0 & 0 & -1 & & &
%\end{array}
%\right).
%\end{align*}
%Then $H_u^2(D_{4n},M)\simeq \bm{Z}/2\bm{Z}$.
%In particular, $\bm{C}(M)^{D_{4n}}$ is not retract $\bm{C}$-rational.
%\end{theorem}

\begin{theorem}\label{thmD4n}
Let $G=\langle \sigma,\tau: \sigma^{4n}=\tau^2=1,
\tau^{-1}\sigma\tau=\sigma^{-1}\rangle\simeq D_{4n}$,
the dihedral group of order $8n$ where $n$ is any positive integer.
Let $M$ be the $G$-lattice of rank $2n+2$ defined in Definition \ref{defD4n}.
Then $H_u^2(G,M)\simeq \bZ/2\bZ$.
Consequently, $\bC(M)^G$ is not retract $\bC$-rational.
\end{theorem}
\begin{proof}
As mentioned above, we will use the formula
\begin{align*}
H_u^2(G,M)=\bigcap_{H} {\rm Ker}(
{\rm res} : H^2(G,M)\rightarrow H^2(H,M))
\end{align*}
where $H$ runs over all the maximal bicyclic subgroups of $G$.
Note that there are three kinds of maximal bicyclic subgroups
$H$ of $G$: $H=\langle\sigma\rangle\simeq C_{4n}$,
$H=\langle\sigma^{2n},\sigma^{2i}\tau\rangle$ where $0\leq i\leq 2n$, and
$H=\langle\sigma^{2n},\sigma^{2i+1}\tau\rangle$ where $0\leq i\leq 2n$.
We will evaluate the subgroup
${\rm Ker}({\rm res}: H^2(G,M)\rightarrow H^2(H,M))$ for each of such
maximal bicyclic subgroups.
Define $M^\prime=\oplus_{1\leq i\leq 2n}\bZ\cdot x_i$ be the
$G$-sublattice of $M$.
We will prove $H_u^2(G,M)\simeq\bZ/2\bZ$ by showing\\
(a) $H^2(G,M^\prime)\simeq\bZ/2\bZ$, and\\
(b) the natural homomorphism $H^2(G,M^\prime)\rightarrow H^2(G,M)$
induces an isomorphism $H^2(G,M^\prime)\simeq H^2_u(G,M)$.\\

Step 1.
Let $N$ be a normal subgroup of $G$.
By Theorem \ref{thDHW}, we have the $7$-term exact sequence
\begin{align*}
0 &\to H^1(G/N,M^N) \to H^1(G,M)\to H^1(N,M)^{G/N} \to H^2(G/N,M^N) \\
&\to H^2(G,M)_1
%\xrightarrow{\rho}
\to H^1(G/N,H^1(N,M))
%\xrightarrow{\lambda}
\to H^3(G/N,M^N)
\end{align*}
where $H^2(G,M)_1={\rm Ker}({\rm res}: H^2(G,M)\to H^2(N,M))$.

We recall a formula to evaluate $H^1(\pi,M)$ where
$\pi=\langle\sigma\rangle\simeq C_m$ and $M$ is a $\bZ[\pi]$-module.
Define a morphism ${\rm Norm}:M\rightarrow M$ by
$\mathrm{Norm}(x)=x+\sigma\cdot x+\sigma^2\cdot x+\cdots+\sigma^{m-1}\cdot x$
for any $x\in M$.
Let ${\rm Ker}(\mathrm{Norm})=\{x\in M:\mathrm{Norm}(x)=0\}$,
${\rm Image}(\sigma-1)=\{\sigma\cdot x-x:x\in M\}$.
If $\beta$ is a $1$-cocycle in $Z^1(\pi,M)$,
we denote by $[\beta]$ the associated cohomology class of $\beta$ in
$H^1(\pi,M)$.
The following result is well-known:
$H^1(\pi,M)\simeq{\rm Ker(Norm)}/{\rm Image}(\sigma-1)$.
The explicit isomorphism is given as follows:
For any $x\in {\rm Ker(Norm)}$,
define a $1$-cocycle $\beta_x$ by $\beta_x(\sigma)=x$,
$\beta_x(\sigma^i)=x+\sigma\cdot x+\cdots+\sigma^{i-1}\cdot x$
for $1\leq i\leq m$.
Then the isomorphism is given by $[\beta_x]\mapsto \overline{x}$.
For details, see Step 3 of the proof of Theorem 5.4 in
\cite[page 706]{HKKu}.

Now we turn to the group $\pi=\langle\sigma,\tau:\sigma^m=\tau^2=1,
\tau^{-1}\sigma\tau=\sigma^{-1}\rangle\simeq D_m$,
the dihedral group of order $2m$.
Then $\pi$ acts on $H^1(\langle\sigma\rangle,M)$ with
$\sigma$ acts on $H^1(\langle\sigma\rangle,M)$ trivially.
The action of $\tau$ on ${\rm Ker(Norm)}/{\rm Image}(\sigma-1)$ is
induced from that of $\tau$ on $H^1(\langle\sigma\rangle,M)$.
In particular, if $x\in {\rm Ker(Norm)}$ and $\beta$ is the $1$-cocyle
corresponding to $x$, i.e. $\beta=\beta_x$, then
${}^\tau\beta(\sigma)=\tau\cdot(\beta(\tau^{-1}\sigma\tau))
=\tau\cdot\beta(\sigma^{-1})=\tau(x+\sigma\cdot x+\cdots+\sigma^{n-2}\cdot x)
=-\tau\cdot(\sigma^{-1}\cdot x)$.
Note that $\tau\cdot(\sigma^{-1}\cdot x)=\sigma\cdot(\tau\cdot x)=[\sigma\cdot(\tau\cdot x)-\tau\cdot x]+\tau\cdot x$.
It follows that the cohomology class $[{}^\tau\beta]$ corresponds to
$-\overline{\tau\cdot x}\in {\rm Ker(Norm)}/{\rm Image}(\sigma-1)$.

Similarly, if $\pi=\langle\sigma,\tau:\sigma^2=\tau^2=1, \sigma\tau=\tau\sigma\rangle$ is the Klein four group and ${\rm Norm}(x)=x+\sigma\cdot x$ is the norm
map associated to the subgroup $\langle\sigma\rangle$ of $\pi$, then for any $x\in {\rm Ker(Norm)}$,
$\tau\cdot\overline{x}=\overline{\tau\cdot x}\in {\rm Ker(Norm)}/{\rm Image}(\sigma-1)$.\\

Step 2.
{}From now on till the end of the proof of this theorem,
$G=\langle\sigma,\tau:\sigma^{4n}
=\tau^2=1,\tau^{-1}\sigma\ta=\sigma^{-1}\rangle\simeq D_{4n}$ and $M$ is the $G$-lattice
defined in the theorem.

We claim that the natural map $H^2(G,M^\prime)\rightarrow H^2(G,M)$
is injective; in fact, this injection induces an isomorphism
$H^2(G,M^\prime)\xrightarrow{\sim}{\rm Ker}({\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma\rangle,M))$.
Moreover, $H^2(G,M^\prime)\simeq\bZ/2\bZ$.

(i) We will prove that $H^2(G,M^\prime)\rightarrow H^2(G,M)$ is injective.

Define $M^{\prime\prime}=M/M^\prime=\bZ\cdot y_1\oplus\bZ\cdot y_2$ where
$\sigma:y_1\leftrightarrow y_2$, $\tau:y_1\mapsto -y_2, y_2\mapsto -y_1$
(note that these $y_1,y_2\in M^{\prime\prime}$ are the images of
$y_1,y_2\in M$).

The exact sequence $0\rightarrow M^\prime\rightarrow M\rightarrow M^{\prime\prime}\rightarrow 0$ gives rise to the exact sequence
\begin{align*}
H^0(G,M^{\prime\prime})\rightarrow H^1(G,M^\prime)\rightarrow
H^1(G,M)\rightarrow H^1(G,M^{\prime\prime})\rightarrow H^2(G,M^\prime)\rightarrow H^2(G,M)\rightarrow\cdots.
\end{align*}
Note that $H^0(G,M^{\prime\prime})={M^{\prime\prime}}^G=0$.
As to $H^1(G,M^{\prime\prime})$, we use the exact sequence
\begin{align*}
0\rightarrow H^1(G/\langle\sigma\rangle, {M^{\prime\prime}}^{\langle\sigma\rangle})\rightarrow H^1(G,M^{\prime\prime})\rightarrow H^1(\langle\sigma\rangle,M^{\prime\prime})^{G/\langle\sigma\rangle}.
\end{align*}
Apply Step 1.
Note that $1+\sigma+\sigma^2+\cdots+\sigma^{4n-1}(y_i)=2n(y_1+y_2)$.
Hence $H^1(\langle\sigma\rangle,M^{\prime\prime})=0$.
It follows that $H^1(G, M^{\prime\prime})\simeq H^1(G/\langle\sigma\rangle, {M^{\prime\prime}}^{\langle\sigma\rangle})=H^1(G/\langle\sigma\rangle, \bZ\cdot(y_1+y_2))\simeq\bZ/2\bZ$.

Now we compute $H^1(G,M^\prime)$.
Because $\sigma^{2n}:x_i\mapsto -x_i$ for $1\leq i\leq 2n$,
it follows that ${M^\prime}^{\langle\sigma\rangle}=0$.
{}From the sequence
\begin{align*}
H^1(G/\langle\sigma\rangle, {M^{\prime}}^{\langle\sigma\rangle})\rightarrow H^1(G, M^{\prime})\rightarrow H^1(\langle\sigma\rangle, M^{\prime})^{G/\langle\sigma\rangle}\rightarrow H^2(G/\langle\sigma\rangle, {M^\prime}^{\langle\sigma\rangle}),
\end{align*}
we find that $H^1(G, M^\prime)\simeq H^1(\langle\sigma\rangle, M^\prime)^{G/\langle\sigma\rangle}$.
By Step 1, $H^1(\langle\sigma\rangle, M^\prime)\simeq{\rm Ker(Norm)}/{\rm Image}(\sigma-1)=\langle x_i:1\leq i\leq 2n\rangle/\langle x_1-x_2,\ldots,x_{2n-1}-x_{2n},x_{2n}+x_1\rangle\simeq\bZ/2\bZ\cdot \overline{x_1}$.
The action of $G/\langle\sigma\rangle\simeq\langle\tau\rangle$ is given by
$\tau\cdot\overline{x_1}=\overline{\tau\cdot x_1}=\overline{x_2}
=\overline{x_1}$ by Step 1 again.
Hence $H^1(G,M^\prime)\simeq H^1(\langle\sigma\rangle,M^\prime)^{G/\langle\sigma\rangle}\simeq\bZ/2\bZ$.

We turn to $H^1(G,M)$.
It is not difficult to verify that
$M^{\langle\sigma\rangle}=\bZ\cdot w$ where
$w=y_1+y_2+\sum_{1\leq i\leq 2n}x_i$.
Note that $\tau\cdot w=-w$.
{}From the exact sequence
\begin{align*}
0\rightarrow H^1(G/\langle\sigma\rangle, M^{\langle\sigma\rangle})\rightarrow H^1(G, M)\rightarrow H^1(\langle\sigma\rangle, M)^{G/\langle\sigma\rangle}\rightarrow H^2(G/\langle\sigma\rangle, M^{\langle\sigma\rangle}),
\end{align*}
we find that $H^1(G/\langle\sigma\rangle, M^{\langle\sigma\rangle})
=\bZ/2\bZ\cdot\overline{w}\simeq\bZ/2\bZ$,
$H^2(G/\langle\sigma\rangle, M^{\langle\sigma\rangle})
\simeq \widehat H^0(G/\langle\sigma\rangle, \bZ\cdot w)=0$,
$H^1(\langle\sigma\rangle, M)={\rm Ker(Norm)}/{\rm Image}(\sigma-1)
=\langle x_i,y_1-y_2:1\leq i\leq 2n\rangle/\langle x_1-x_2,\ldots, x_{2n-1}-x_{2n},x_{2n}+x_1,y_1-y_2+x_1\rangle\simeq \bZ/2\bZ\cdot\overline{x_1}$
with $\tau\cdot\overline{x_1}=\overline{x_1}$.
Hence $H^1(\langle\sigma\rangle, M)^{G/\langle\sigma\rangle}\simeq\bZ/2\bZ$
.
It follows that $H^1(G,M)$ is an abelian group of over $4$.

Now, in the exact sequence
\begin{align*}
 H^0(G,M^{\prime\prime})\rightarrow
H^1(G,M^\prime)\rightarrow
H^1(G,M)\xrightarrow{g_1}
H^1(G,M^{\prime\prime})\xrightarrow{g_2}
H^2(G,M^{\prime})\xrightarrow{g_3} H^2(G,M),
\end{align*}
we have $H^0(G,M^{\prime\prime})=0$, $H^1(G,M^\prime)\simeq\bZ/2\bZ\simeq
H^1(G,M^{\prime\prime})$, $|H^1(G,M)|=4$.
Thus $g_1$ is surjective and $g_2$ is the zero map.
It follows that $g_3$ is injective.

(ii) We will show that the above $g_3$ induces an injection of
$H^2(G,M^\prime)$ into
${\rm Ker}({\rm res}: H^2(G,M)\rightarrow H^2(\langle\sigma\rangle, M))$.

For this assertion, it suffices to show that the composite map
$H^2(G, M^\prime)\rightarrow H^2(G, M)\rightarrow H^2(\langle\sigma\rangle, M)$ is the zero map.
Consider the commutative diagram
\begin{align*}
\xymatrix@R=15pt@C=8pt{
& H^2(G,M^{\prime}) \ar[r] \ar[d]^{\rm res} & H^2(G,M) \ar[d]^{\rm res} \\
& H^2(\langle\sigma\rangle,M^{\prime}) \ar[r] & H^2(\langle\sigma\rangle,M).
}
\end{align*}
Since $H^2(\langle\sigma\rangle,M^\prime)\simeq\widehat H^0(\langle\sigma\rangle, {M^\prime}^{\langle\sigma\rangle})=0$
(remember that ${M^\prime}^{\langle\sigma\rangle}=0$, a fact verified in (i)),
it follows that $H^2(G,M^\prime)\rightarrow H^2(\langle\sigma\rangle, M)$
is the zero map.

(iii) We will show that $H^2(G,M^\prime)\simeq\bZ/2\bZ$.

Use the exact sequence
\begin{align*}
H^2(G/\langle\sigma\rangle, {M^\prime}^{\langle\sigma\rangle})&\to
L_1:={\rm Ker}({\rm res}:H^2(G,M^\prime)\to H^2(\langle\sigma\rangle, M^\prime))\\
&\to H^1(G/\langle\sigma\rangle, H^1(\langle\sigma\rangle, M^\prime))
\to H^3(G/\langle\sigma\rangle, {M^\prime}^{\langle\sigma\rangle}).
\end{align*}
As shown in (ii), $H^2(\langle\sigma\rangle, M^\prime)=0$.
Hence $L_1=H^2(G,M^\prime)$.
Since ${M^\prime}^{\langle\sigma\rangle}=0$, we find that
$H^2(G,M)\simeq H^1(G/\langle\sigma\rangle, H^1(\langle\sigma\rangle, M^\prime))$.

It remains to show that $H^1(G/\langle\sigma\rangle, H^1(\langle\sigma\rangle, M^\prime))\simeq\bZ/2\bZ$.
We have proved in (i) that $H^1(\langle\sigma\rangle, M^\prime)\simeq\bZ/2\bZ\cdot \overline{x_1}$ and $\tau\cdot\overline{x_1}=\overline{x_1}$.
Thus $H^1(G/\langle\sigma\rangle, H^1(\langle\sigma\rangle, M^\prime))=H^1(G/\langle\sigma\rangle, \bZ/2\bZ\cdot\overline{x_1})=\bZ/2\bZ\cdot \overline{x_1}\simeq \bZ/2\bZ$.

(iv)  We will show that $H^2(G, M^\prime)\rightarrow {\rm Ker}({\rm res}: H^2(G,M)\rightarrow H^2(\langle\sigma\rangle, M))$ is an isomorphism.

Call $L_2:={\rm Ker}({\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma\rangle, M))$.

By (ii), $H^2(G,M^\prime)$ is a subgroup of $L_2$.
Thus $|L_2|\geq 2$.
We will show that $|L_2|\leq 2$.
This will finish the proof that $H^2(G,M^\prime)\simeq L_2$.

Use the exact sequence
\begin{align*}
H^2(G/\langle\sigma\rangle, M^{\langle\sigma\rangle})\to
L_2:={\rm Ker}({\rm res}:H^2(G,M)\to H^2(\langle\sigma\rangle, M))
\to H^1(G/\langle\sigma\rangle, H^1(\langle\sigma\rangle, M)).
\end{align*}
We have proved in (i) that
$M^{\langle\sigma\rangle}=\bZ\cdot w$ where
$w=y_1+y_2+\sum_{1\leq i\leq 2n}x_i$ and $\tau\cdot w=-w$.
Hence $H^2(G/\langle\sigma\rangle, M^{\langle\sigma\rangle})
=H^2(G/\langle\sigma\rangle, \bZ\cdot w)\simeq\widehat H^0(\langle\tau\rangle, \bZ\cdot w)=0$.
Recall also the result $H^1(\langle\sigma\rangle, M)=\bZ/2\bZ\cdot\overline{x_1}$ with $\tau\cdot\overline{x_1}=\overline{x_1}$ which is proved in (i).
We find that $H^1(G/\langle\sigma\rangle, H^1(\langle\sigma\rangle, M))
\simeq H^1(\langle\tau\rangle, \bZ/2\bZ\cdot\overline{x_1})\simeq\bZ/2\bZ$.
Hence the result. \\

Step 3.
We will show that the injection
$g_3:H^2(G, M^\prime)\rightarrow H^2(G,M)$ (see (i) of Step 2)
induces an injection of $H^2(G, M^\prime)$ into ${\rm Ker}({\rm res}:
H^2(G,M)\rightarrow H^2(\langle\sigma^{2n},\sigma^{2i}\tau\rangle, M))$
for any $1\leq i\leq 2n$.

Define $L_3={\rm Ker}({\rm res}: H^2(G,M)\rightarrow H^2(\langle\sigma^{2n},\tau\rangle, M))$.

We will show that $H^2(G, M^\prime)$ is mapped into $L_3$ via $g_3$.
The proof for the situation of $\langle\sigma^{2n},\sigma^{2i}\tau\rangle$
(where $1\leq i\leq 2n-1$) is similar and is omitted.

To show that $g_3(H^2(G, M^\prime))\subset L_3$,
it suffices to show that $H^2(G, M^\prime)\xrightarrow{g_3} H^2(G,M)
\xrightarrow{\rm res} H^2(\langle\sigma^{2n},\tau\rangle, M)$ is the zero map.
Consider the commutative diagram
\begin{align*}
\xymatrix@R=15pt@C=8pt{
& H^2(G,M^{\prime}) \ar[r] \ar[d]^{\rm res} & H^2(G,M) \ar[d]^{\rm res} \\
& H^2(\langle\sigma^{2n},\tau\rangle,M^{\prime}) \ar[r] & H^2(\langle\sigma^{2n},\tau\rangle,M).
}
\end{align*}
We will show that $H^2(\langle\sigma^{2n},\tau\rangle, M^\prime)=0$.

Use the exact sequence
\[
H^2(\langle\sigma^{2n},\tau\rangle/\langle\sigma^{2n}\rangle, {M^\prime}^{\langle\sigma^{2n}\rangle})\rightarrow H^2(\langle\sigma^{2n},\tau\rangle, M^\prime)\rightarrow H^1(\langle\sigma^{2n},\tau\rangle/\langle\sigma^{2n}\rangle, H^1(\langle\sigma^{2n}\rangle, M^\prime)).
\]
Note that $\sigma^{2n}:x_i\mapsto -x_i$.
Hence ${M^\prime}^{\langle\sigma^{2n}\rangle}=0$ and
$H^2(\langle\sigma^{2n},\tau\rangle/\langle\sigma^{2n}\rangle, {M^\prime}^{\langle\sigma^{2n}\rangle})=0$.
On the other hand, $H^1(\langle\sigma^{2n}\rangle, M^\prime)\simeq
{\rm Ker}({\rm Norm})/{\rm Image}(\sigma-1)\simeq\oplus_{1\leq i\leq 2n}\bZ/2\bZ\cdot\overline{x_i}$ where $\tau\cdot\overline{x_i}=\overline{x_{2n-i}}$.

Thus $H^1(\langle\sigma^{2n},\tau\rangle/\langle\sigma^{2n}\rangle, H^1(\langle\sigma^{2n}\rangle, M^\prime))\simeq H^1(\langle\tau\rangle, \oplus_{1\leq i\leq 2n}\bZ/2\bZ\cdot\overline{x_i})=0$. Done.\\

Step 4.
We will show that the injection $g_3:H^2(G,M^\prime)\rightarrow H^2(G,M)$
induces an injection of $H^2(G,M^\prime)$ into $L_4:={\rm Ker}({\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma^{2n}, \sigma\tau\rangle,M))$.
The situation for $\langle\sigma^{2n}, \sigma^{2i+1}\tau\rangle$
(where $1\leq i\leq 2n-1$) is similar and is omitted.

Once this step is finishes, we find that
$g_3(H^2(G, M^\prime))\subset H_u^2(G,M)$.
On the other hand, by Step 2, we know that $g_3(H^2(G,M^\prime))=
{\rm Ker}({\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma\rangle, M))\supset H_u^2(G,M)$.
Hence $H_u^2(G,M)=g_3(H^2(G,M^\prime))\simeq\bZ/2\bZ$.

To show that $G_3(H^2(G, M^\prime))\subset L_4$, it suffices to prove that
$H^2(G, M^\prime)\xrightarrow{g_3}H^2(G,M)\xrightarrow{\rm res} H^2(\langle\sigma^{2n},\sigma\tau\rangle, M)$ is the zero map.
Consider the commutative diagram
\begin{align*}
\xymatrix@R=15pt@C=8pt{
& H^2(G,M^{\prime}) \ar[r]^{g_3} \ar[d]^{\rm res} & H^2(G,M) \ar[d]^{\rm res} \\
& H^2(\langle\sigma^{2n},\sigma\tau\rangle,M^{\prime}) \ar[r]^{h_3} & H^2(\langle\sigma^{2n},\sigma\tau\rangle,M).
}
\end{align*}
We will show that $h_3$ is the zero map.
Once we obtain this result, the proof is finished .

For convenience, write $H:=\langle\sigma^{2n},\sigma\tau\rangle$
and denote $\lambda_1=\sigma^{2n}$, $\lambda_2=\sigma\tau$,
$\lambda_3=\lambda_1\lambda_2$.
{}From the exact sequence $0\rightarrow M^\prime\rightarrow M\rightarrow M^{\prime\prime}\rightarrow 0$, we have the exact sequence
\[
\cdots\rightarrow H^1(H, M^{\prime\prime})\xrightarrow{h_2} H^2(H, M^\prime)
\xrightarrow{h_3} H^2(H, M)\rightarrow\cdots.
\]
We will prove that the connecting homomorphism $h_2$ is surjective.
Thus $h_3$ is the zero map.

(i) We recall the action of $H=\langle\lambda_1,\lambda_2\rangle$ on $M$.
It is given by
\begin{align*}
\lambda_1 &: x_i\mapsto -x_i\ (1\leq i\leq 2n),
y_j\mapsto y_j+\sum_{1\leq i\leq 2n}x_i\ (j=1,2),\\
\lambda_2 &: x_1\mapsto x_1, x_i\mapsto -x_{2n+2-i}\ (2\leq i\leq 2n),
y_j\mapsto -y_j-x_1\ (j=1,2),\\
\lambda_3 &: x_1\mapsto -x_1, x_i\mapsto x_{2n+2-i}\ (2\leq i\leq 2n),
y_j\mapsto -y_j+\sum_{2\leq i\leq 2n}x_i\ (j=1,2).
\end{align*}
The action of $H$ on $M^{\prime\prime}$ is even simpler:
For $1\leq j\leq 2$,
\begin{align*}
\lambda_1 : y_j\mapsto y_j,\quad
\lambda_2=\lambda_3 : y_j\mapsto -y_j.
\end{align*}

(ii) We will show that $H^2(H,M^\prime)\simeq\bZ/2\bZ$.

By the exact sequence
\begin{align*}
H^2(H/\langle\lambda_2\rangle, {M^\prime}^{\langle\lambda_2\rangle})&\to
{\rm Ker}({\rm res}:H^2(H,M^\prime)\to H^2(\langle\lambda_2\rangle, M^\prime))\\
&\to H^1(H/\langle\lambda_2\rangle, H^1(\langle\lambda_2\rangle, M^\prime))
\to H^3(H/\langle\lambda_2\rangle, {M^\prime}^{\langle\lambda_2\rangle})\to\cdots,
\end{align*}
since ${M^\prime}^{\langle\lambda_2\rangle}=0$, we find that
$H^2(H,M^\prime)\simeq H^1(H/\langle\lambda_2\rangle, H^1(\langle\lambda_2\rangle, M^\prime))$.

Using the same method as in Step 1, it is not difficult to prove
that $H^1(H/\langle\lambda_2\rangle, H^1(\langle\lambda_2\rangle, M^\prime))
\simeq\bZ/2\bZ$.

(iii) We will show that $H^1(H, M^{\prime\prime})\simeq (\bZ/2\bZ)^{\oplus 2}$
and find explicitly a $1$-cocycle $\gamma:H\rightarrow M^{\prime\prime}$
such that $[\gamma]\neq 0$ in $H^1(H,M^{\prime\prime})$.

{}From the exact sequence
\begin{align*}
0 \rightarrow H^1(H/\langle\lambda_2\rangle, {M^{\prime\prime}}^{\langle\lambda_2\rangle})\rightarrow
H^1(H, M^{\prime\prime})\xrightarrow{h_1}
H^1(\langle\lambda_2\rangle, {M^{\prime\prime}})^{H/\langle\lambda_2\rangle}
\rightarrow H^2(H/\langle\lambda_2\rangle, {M^{\prime\prime}}^{\langle\lambda_2\rangle})\rightarrow \cdots,
\end{align*}
since ${M^{\prime\prime}}^{\langle\lambda_2\rangle}=0$,
we find that $H^1(H,M^{\prime\prime})\xrightarrow{h_1} H^1(\langle\lambda_2\rangle, M^{\prime\prime})^{H/\langle\lambda_2\rangle}$ is an isomorphism.
Note that $h_1$ is the restriction map.

As in Step 1, it can be shown that $H^1(\langle\lambda_2\rangle, M^{\prime\prime})^{H/\langle\lambda_2\rangle}\simeq\bZ/2\bZ\cdot\overline{y_1}\oplus\bZ/2\bZ\cdot\overline{y_2}$.

The $1$-cochain $\overline{\gamma}:\langle\lambda_2\rangle\rightarrow M^{\prime\prime}$ defined by $\overline{\gamma}(1)=0$ and
$\overline{\gamma}(\lambda_2)=y_1$ is a $1$-cocycle and it corresponds to
the element $\overline{y_1}\in {\rm Ker}({\rm Norm})/{\rm Image}(\lambda_2-1)$.
We will lift the $1$-cocycle $\overline{\gamma}$ to a $1$-cocycle
$\gamma : H\rightarrow M^{\prime\prime}$.
Define $\gamma(1)=\gamma(\lambda_1)=0$, $\gamma(\lambda_2)=\gamma(\lambda_3)=y_1$.
It is easy to verify that $\gamma$ is a $1$-cocycle and its restriction to
$\langle\lambda_2\rangle$ is $\overline{\gamma}$.
Thus $[\gamma]\neq 0$.

(iv) We will find a $2$-cocycle $\alpha:H\times H\rightarrow M^\prime$
such that $h_2([\gamma])=[\alpha]\in H^2(H,M^\prime)$
(remember that $h_2$ is the connecting homomorphism).

By the standard method (see \cite[page 122]{HS}, for example),
the $2$-cocycle $\alpha$ can be found as follows.
For each $\lambda\in H$, find a preimage of $\gamma(\lambda)$ in $M$;
in other words, define a $1$-cochain $\beta:H\rightarrow M$ such that
$\beta(1)=0$ and the image of $\beta(\lambda)$ in $M^{\prime\prime}$
is $\gamma(\lambda)$.
Then define $\alpha:H\times H\rightarrow M$ by
\begin{align}
\alpha(\lambda_i,\lambda_j)=\lambda_i\cdot\beta(\lambda_j)-\beta(\lambda_i\lambda_j)+\beta(\lambda_i)\label{FormulaA}
\end{align}
where $\lambda_i, \lambda_j\in H$.
It can be shown that $\alpha(\lambda_i,\lambda_j)\in M^\prime$
and $\alpha$ is a $2$-cocycle, i.e. $[\alpha]\in H^2(H,M^\prime)$.

Return to the concrete case $\gamma:H\rightarrow M^{\prime\prime}$
where $\gamma(1)=\gamma(\lambda_1)=0$,
$\gamma(\lambda_2)=\gamma(\lambda_3)=y_1$.
We define $\beta:H\rightarrow M$ by $\beta(1)=\beta(\lambda_1)=0$,
$\beta(\lambda_2)=\beta(\lambda_3)=y_1$.

Remember that $\beta(\lambda_i)\in M$ (instead of $M^{\prime\prime})$.
By Formula (\ref{FormulaA}), we find that the normalized $2$-cocycle
$\alpha: H\times H\rightarrow M^\prime$ is given by
\begin{align*}
&\alpha(\lambda_1,\lambda_1)=0,\
\alpha(\lambda_2,\lambda_2)=-x_1,\
\alpha(\lambda_3,\lambda_3)=\sum_{2\leq i\leq 2n}x_i,\\
&\alpha(\lambda_1,\lambda_2)=\sum_{1\leq i\leq 2n}x_i,\
\alpha(\lambda_2,\lambda_1)=0,\
\alpha(\lambda_1,\lambda_3)=\sum_{1\leq i\leq 2n}x_i,\\
&\alpha(\lambda_3,\lambda_1)=0,\
\alpha(\lambda_2,\lambda_3)=-x_1,\
\alpha(\lambda_3,\lambda_2)=\sum_{2\leq i\leq 2n}x_i.
\end{align*}

(v) We will show that $[\alpha]\neq 0$ in $H^2(H,M^\prime)$.

Assume this result.
Since $H^2(H,M^\prime)\simeq\bZ/2\bZ$ by (ii), it follows that $H^2(H,M^\prime)$ is generated by $[\alpha]$.
As $[\alpha]=h_2([\gamma])$, we find that $h_2$ is surjective.

It remains to show that $\alpha$ is not a $2$-coboundary. Suppose not.
There is a normalized $1$-cochain $\delta:H\rightarrow M^\prime$
whose differential is $\alpha$.
Write $\delta(\lambda_i)=v_i\in M^\prime$.
Then the differential of $\delta$ is given by
\begin{align*}
(\lambda_i,\lambda_j)\mapsto\lambda_i\cdot v_j-\delta(\lambda_i\lambda_j)+v_i.
\end{align*}

Write $v_2=\sum_{1\leq i\leq 2n}c_ix_i$. Because $\delta$ is a normalized $1$-cochain, we have $\delta (\lambda^2)= \delta(1)=0$. Thus the differential of $\delta$ for $(\lambda_2,\lambda_2)$ is given by $(\lambda_2,\lambda_2)\mapsto\lambda_2\cdot (\sum_{1\leq i\leq 2n}c_ix_i)+\sum_{1\leq i\leq 2n}c_ix_i=2c_1x_1$.
If $\alpha$ is the differential of $\delta$, we get
$\alpha(\lambda_2,\lambda_2)=2c_1x_1$.
But we have shown that $\alpha(\lambda_2,\lambda_2)=-x_1\not\in 2M^\prime$.
Hence $[\alpha]\neq 0$ in $H^2(H,M^\prime)$.
\end{proof}

Now we turn to the quasi-dihedral group of order $16n$,
$QD_{8n}=\langle \sigma,\tau: \sigma^{8n}=\tau^2=1,
\tau^{-1}\sigma\tau=\sigma^{4n-1}\rangle$
where $n$ is any positive integer.
Note that the subgroup $\langle\sigma^2,\sigma\tau\rangle$ of $QD_{8n}$
satisfies the relations $(\sigma^2)^{4n}=(\sigma\tau)^4=1$,
$(\sigma^2)^{2n}=(\sigma\tau)^2$ and
$(\sigma\tau)^{-1}\cdot\sigma^2\cdot(\sigma\tau)=(\sigma^2)^{-1}$.
Thus the generalized quaternion group of order $8n$,
denoted by $Q_{8n}$, may also be defined as the subgroup
$\langle\sigma^2,\sigma\tau\rangle$ of $QD_{8n}$.


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{remark}
Some authors define the quasi-dihedral groups for $2$-groups only. However, we allow the order of quasi-dihedral groups may be $16, 32, 48, 64, 80,$ etc..
\end{remark}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{definition}\label{defQDQ}
(1) Let $n$ be any positive integer and $G=\langle \sigma,\tau: \sigma^{8n}=\tau^2=1,
\tau^{-1}\sigma\tau=\sigma^{4n-1}\rangle\simeq QD_{8n}$
%=\leq GL_{4n}(\bm{Z})$
be the quasi-dihedral group of order $16n$.
Define a $G$-lattice $M$ of rank $4n$ as follows:
$M=\oplus_{1\leq i\leq 2n}(\bZ\cdot x_i\oplus\bZ\cdot y_i)$
such that
\begin{align*}
\sigma:&\  x_1\mapsto y_1\mapsto x_2\mapsto y_2\mapsto\cdots\mapsto
x_{2n}\mapsto y_{2n}\mapsto -x_1,\\
\tau:&\ x_1\mapsto (x_1-y_1)+(x_2-y_2)+\cdots+(x_{2n-1}-y_{2n-1})+x_{2n},\\
&\ y_1\mapsto (x_1-y_1)+(x_2-y_2)+\cdots+(x_{2n-1}-y_{2n-1})+y_{2n},\\
&\ x_i\mapsto (x_1-y_1)+\cdots+(x_{2n-i}-y_{2n-i})+x_{2n+1-i}-(x_{2n+2-i}-y_{2n+2-i})-\cdots-(x_{2n}-y_{2n}),\\
&\ y_i\mapsto (x_1-y_1)+\cdots+(x_{2n-i}-y_{2n-i})+y_{2n+1-i}-(x_{2n+2-i}-y_{2n+2-i})-\cdots-(x_{2n}-y_{2n}),\\
&{\rm where}\ 2\leq i\leq 2n-1,\\
&\ x_{2n}\mapsto x_1-(x_2-y_2)-\cdots-(x_{2n}-y_{2n}),\\
&\ y_{2n}\mapsto y_1-(x_2-y_2)-\cdots-(x_{2n}-y_{2n}).
\end{align*}
In matrix forms with respect to the bases $x_1,y_1,\ldots,x_{2n},y_{2n}$,
the actions of $\sigma$ and $\tau$ are given as
\begin{align*}
\sigma=\left(
\begin{array}{cccc}
  & 1 &  &  \\
& & \ddots &\\
& & & 1 \\
-1 &  & &
\end{array}
\right),\
\tau=
\left(
\begin{array}{cccc}
 A & \cdots & A & I \\
 \vdots & \reflectbox{$\ddots$} & \reflectbox{$\ddots$} & -A \\
 A & \reflectbox{$\ddots$} & \reflectbox{$\ddots$} & \vdots \\
I & -A & \cdots & -A
\end{array}
\right),
\end{align*}
where
\begin{align*}
A=
\left(
\begin{array}{cc}
1 & -1\\
1 & -1
\end{array}
\right),\
I=
\left(
\begin{array}{cc}
1 & 0\\
0 & 1
\end{array}
\right)\in GL_2(\bZ).
\end{align*}
(2) Let $\widehat G=\langle\sigma^2,\sigma\tau\rangle\simeq Q_{8n}\leq G$
be the generalized quaternion group of order $8n$ where $n$ is any positive integer.
Define a $G$-lattice $\widehat M$ by
the restriction of $G$-lattice $M$ to $\widehat G$, i.e.
$\widehat M={\rm Res}^G_{\widehat G}(M)$.
\end{definition}
%

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
The following theorem is a generalization
of the cases $QD_8$ and $Q_8$
of the GAP IDs (4,32,3,2) and (4,32,1,2)
in Theorem \ref{t1.5} (2) respectively (see Table 1). When $G=QD_{8n}$ the quasi-dihedral group of order $16n$, note that $\bm{C}(G)$ is rational by similar proof as in \cite[Proposition 2.6]{CHK}. Thus $B_0(G)=0$ and ${\rm Br}_u(\bm{C}(M)^G)=H^2_u(G, M)$. The similar result and argument are valid for the case $G=Q_{8n}$ the generalized quaternion group of order $8n$. In short, we will concentrate on $H^2_u(G, M)$ for both groups $G=QD_{8n}$ and $G=Q_{8n}$.

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{theorem}\label{thmQDQ}
{\rm (1)} Let $n$ be any positive integer and $G=\langle \sigma,\tau: \sigma^{8n}=\tau^2=1,
\tau^{-1}\sigma\tau=\sigma^{4n-1}\rangle\simeq QD_{8n}$
be the quasi-dihedral group of order $16n$.
Let $M$ be the $G$-lattice of rank $4n$ defined in Definition \ref{defQDQ}.
Then $H_u^2(G,M)\simeq \bm{Z}/2\bm{Z}$.
Consequently, $\bm{C}(M)^{G}$ is not retract $\bm{C}$-rational.\\
{\rm (2)}
Let $\widehat G=\langle\sigma^2,\sigma\tau\rangle\simeq Q_{8n}\leq G$ be the
generalized quaternion group of order $8n$.
Let $\widehat M={\rm Res}^G_{\widehat G}(M)$ be the $\widehat G$-lattice
of rank $4n$ defined in Definition \ref{defQDQ}.
Then $H_u^2(\widehat G,\widehat M)\simeq\bm{Z}/2\bm{Z}\oplus\bm{Z}/2\bm{Z}$.
Consequently,
$\bm{C}(\widehat M)^{\widehat G}$ is not retract $\bm{C}$-rational.
\end{theorem}
%
\begin{proof}
The proof is similar to that of Theorem \ref{thmD4n}.

(1) The case $G=\langle \sigma, \tau \rangle$.

There are three kinds of maximal bicyclic subgroups $H$ of $G$:
$H=\langle\sigma\rangle\simeq C_{8n}$,
$H=\langle\sigma^{4k+1}\tau\rangle\simeq C_4$ or
$\langle\sigma^{4k+3+4n}\tau\rangle\simeq C_4$, and
$H=\langle\sigma^{4n},\sigma^{2k}\tau\rangle\simeq C_2\times C_2$.

Note that $\sigma^{4n}:x_i\mapsto -x_i$, $y_i\mapsto -y_i$.
Thus $M^{\langle\sigma^{4n}\rangle}=0$.

By the same method as in the proof of Theorem \ref{thmD4n},
we find that $H^2(G,M)={\rm Ker}({\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma\rangle,M))$ and ${\rm Ker}({\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma\rangle, M))\simeq H^1(G/\langle\sigma\rangle, H^1(\langle\sigma\rangle,M))\simeq\bZ/2\bZ\cdot\overline{x_1}\simeq\bZ/2\bZ$.

Since $(\sigma^{4k+1}\tau)^2=\sigma^{4n}=(\sigma^{4k+3+4n}\tau)^2$,
it follows that $H^2(\langle\sigma^{4k+1}\tau\rangle,M)=0=H^2(\langle\sigma^{4k+3-4n}\tau\rangle, M)$.
Hence $H^2(G,M)={\rm Ker}({\rm res}:H^2(G,M)\rightarrow H^2(H,M))$
where $H=\langle\sigma^{4k+1}\tau\rangle$ or $\langle\sigma^{4k+3+4n}\tau\rangle$.

Finally, consider the situation ${\rm Ker}({\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma^{4n},\sigma^{2k}\tau\rangle,M)$.
We will show that $H^2(\langle\sigma^{4n},\tau\rangle, M)=0$.
The proof of $H^2(\langle\sigma^{4n},\sigma^{2k}\tau\rangle, M)=0$
(where $1\leq k\leq 4n-1$)
is similar; alternatively, since $\langle\sigma^{4n},\tau\rangle$ and
$\langle\sigma^{4n},\sigma^{2k}\tau\rangle$ are conjugate, we may apply
\cite[page 116, Proposition 3]{Se} to finish the proof.

Once the above assertion is proved, we find that
$H^2(G,M)={\rm Ker}({\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma^{4n},\sigma^{2k}\tau\rangle,M))$ again.
Hence $H^2(G,M)=H_u^2(G,M)$ and $H_u^2(G,M)\simeq\bZ/2\bZ$.

Now we proceed to prove $H^2(\langle\sigma^{4n},\tau\rangle,M)=0$.

Use the exact sequence
\begin{align*}
\cdots&\rightarrow H^2(\langle\sigma^{4n},\tau\rangle/\langle\sigma^{4n}\rangle,M^{\langle\sigma^{4n}\rangle})\rightarrow H^2(\langle\sigma^{4n},\tau\rangle,M)\rightarrow H^1(\langle\sigma^{4n},\tau\rangle/\langle\sigma^{4n}\rangle, H^1(\langle\sigma^{4n}\rangle,M))\\
&\rightarrow H^3(\langle\sigma^{4n},\tau\rangle/\langle\sigma^{4n}\rangle,M^{\langle\sigma^{4n}\rangle})\rightarrow\cdots.
\end{align*}
As $M^{\langle\sigma^{4n}\rangle}=0$, it follows that $H^2(\langle\sigma^{4n},\tau\rangle,M)\simeq H^1(\langle\sigma^{4n},\tau\rangle/\langle\sigma^{4n}\rangle,H^1(\sigma^{4n}\rangle,M))$.

Note that $H^1(\langle\sigma^{4n}\rangle,M)\simeq{\rm Ker}(1+\sigma^{4n})/{\rm Image}(1-\sigma^{4n})=\langle x_i,y_i:1\leq i\leq 2n\rangle/\langle 2x_i,2y_i: 1\leq i\leq 2n\rangle\simeq\oplus_{1\leq i\leq 2n}(\bZ/2\bZ\cdot\overline{x_i}\oplus\bZ/2\bZ\cdot\overline{y_i})$ where $\tau\cdot\overline{x_i}=\overline{\tau\cdot x_i}$, $\tau\cdot\overline{y_i}=\overline{\tau\cdot y_i}$ by Step 1
in the proof of Theorem \ref{thmD4n}.

Since the coefficient ring of $\oplus_{1\leq i\leq 2n}(\bZ/2\bZ\cdot\overline{x_i}\oplus\bZ/2\bZ\cdot\overline{y_i})$ is $\bZ/2\bZ$, we find that
$\overline{\tau\cdot x_i}=\overline{x_{2n+1-i}}+\sum_{j\neq 2n+1-i}\overline{x_j+y_j}$.
Similarly for $\overline{\tau\cdot y_i}$.
Define $\overline{u_i}=\overline{x_{2n+1-i}}+\sum_{1\leq j\leq 2n\atop j\neq 2n+1-i}(\overline{x_j}+\overline{y_j})$ for $1\leq i\leq n$, $\overline{v_i}=\overline{y_{2n+1-i}}+\sum{1\leq j\leq 2n\atop j\neq 2n+1-i}(\overline{x_j}+\overline{y_j})$ for $1\leq i\leq n$.
Then $\tau:\overline{x_i}\leftrightarrow \overline{u_i}$,
$\overline{y_i}\leftrightarrow\overline{v_i}$.

Let $T$ be the coefficient matrix of $x_1$, $y_1$, $x_2$, $y_2,\ldots, x_n$, $y_n$, $u_1$, $v_1$, $u_2$, $v_2,\ldots,u_n$, $v_n$ with respect to the basis
$x_1$, $y_1,\ldots,x_{2n}$, $y_{2n}$.
For example, when $n=2$, $T$ is of the form
\begin{align*}
\left(
\begin{array}{cccc|cccc}
1&0&0&0&0&0&0&0\\
0&1&0&0&0&0&0&0\\
0&0&1&0&0&0&0&0\\
0&0&0&1&0&0&0&0\\\hline
1&1&1&1&1&1&1&0\\
1&1&1&1&1&1&0&1\\
1&1&1&1&1&0&1&1\\
1&1&1&1&0&1&1&1
\end{array}
\right).
\end{align*}
It is easy to verify that ${\rm det}(T)=1\in\bZ/2\bZ$.
Thus $\langle\overline{x_1},\overline{y_1},\ldots,\overline{x_n},\overline{y_n},\overline{u_1},\overline{v_1},\ldots,\overline{u_n},\overline{v_n}\rangle=\langle\overline{x_1},\overline{y_1},\ldots,\overline{x_{2n}},\overline{y_{2n}}\rangle$ over $\bZ/2\bZ$.

Note that $H^1(\langle\tau\rangle,\bZ/2\bZ\cdot\overline{x_i}\oplus\bZ/2\bZ\cdot\overline{u_i})=0=H^1(\langle\tau\rangle,\bZ/2\bZ\cdot\overline{y_i}\oplus\bZ/2\bZ\cdot\overline{v_i})$ for $1\leq i\leq n$.

Hence $H^1(\langle\sigma^{4n},\tau\rangle/\langle\sigma^{4n}\rangle, H^1(\langle\sigma^{4n}\rangle, M))=0$.

\medskip
(2) Now consider the case $\widehat{G}=\langle\sigma^2,\sigma\tau\rangle$ and $\widehat{M}={\rm Res}^G_{\widehat{G}}(M)$.

 There are three kinds of maximal bicyclic subgroups $H$ of $\widehat{G}$:
$H=\langle\sigma^2\rangle\simeq C_{4n}$,
$H=\langle\sigma^{4k+1}\tau\rangle\simeq C_4$, and
$H=\langle\sigma^{4k+3}\tau\rangle\simeq C_4$.

It is not difficult to show that $H^2(\widehat{G}, \widehat{M})={\rm Ker}({\rm res}:H^2(\widehat{G}, \widehat{M})\rightarrow H^2(\langle\sigma^2\rangle, \widehat{M}))\simeq H^1(\widehat{G}/\langle\sigma^2\rangle, H^1(\langle\sigma^2\rangle, \widehat{M}))$.
But $H^1(\langle\sigma^2\rangle, \widehat{M})\simeq\bZ/2\bZ\cdot\overline{x_1}\oplus\bZ/2\bZ\cdot\overline{y_1}$ with $\sigma\tau:\overline{x_1}\mapsto\overline{x_1}$, $\overline{y_1}\mapsto\overline{y_1}$.
Hence $H^1(\widehat{G}/\langle\sigma^2\rangle, H^1(\langle\sigma^2\rangle, \widehat{M})\simeq\bZ/2\bZ\oplus\bZ/2\bZ$.

Moreover, $H^2(\langle\sigma^{4k+1}\tau\rangle, \widehat{M})=0=H^2(\langle\sigma^{4k+3}\tau\rangle, \widehat{M})$ because $(\sigma^{4k+1}\tau)^2=\sigma^{4n}=(\sigma^{4k+3}\tau)^2$ and $\widehat{M}^{\langle\sigma^{4n}\rangle}=0$.
Thus $H_u^2(\widehat{G}, \widehat{M})=H^2(\widehat{G}, \widehat{M})\simeq\bZ/2\bZ\oplus\bZ/2\bZ$.
\end{proof}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{definition}\label{defCp2p}
Let $p$ be an odd prime number,
$G=\langle \sigma,\tau: \sigma^{p^2}=\tau^p=1,
\tau^{-1}\sigma\tau=\sigma^{p+1}\rangle\simeq C_{p^2}\rtimes C_p$.
Define a $G$-lattice $M$ of rank $p(p-1)$ as follows:
$M=\oplus_{0\leq i\leq p-1}(\oplus_{1\leq j\leq p-1}\bZ\cdot x_j^{(i)})$
and $x_0^{(i)}=-\sum_{1\leq j\leq p-1}x_j^{(i)}$ such that
\begin{align*}
\sigma:&\  x_j^{(i)}\mapsto x_j^{(i+1)}\quad {\rm for}\quad 0\leq i\leq p-2,\
0\leq j\leq p-1,\\
&\ x_j^{(p-1)}\mapsto x_{j+1}^{(0)}\quad {\rm for}\quad 0\leq j\leq p-1,\\
\tau:&\ x_j^{(0)}\mapsto -\sum_{1\leq i\leq p-1}x_j^{(i)},\\
&\ x_j^{(k)}\mapsto -\sum_{0\leq i\leq k-1}x_{j+k+1}^{(i)}-\sum_{k+1\leq i\leq p-1}x_{j+k}^{(i)}\quad {\rm for}\quad 1\leq k\leq p-2,\ 0\leq j\leq p-1,\\
&\ x_j^{(p-1)}\mapsto -\sum_{0\leq i\leq p-2}x_j^{(i)}\quad {\rm for}\quad 0\leq j\leq p-1
\end{align*}
where the $i,i$ in $x_j^{(i)}$ are taken modulo $p$
(note that $\sum_{0\leq j\leq p-1}x_j^{(i)}=0$ for any $0\leq i\leq p-1$).

In matrix forms with respect to the bases $x_1^{(0)},\ldots,x_{p-1}^{(0)},x_1^{(1)},\ldots,x_{p-1}^{(1)},\ldots,x_1^{(p-1)},\ldots,x_{p-1}^{(p-1)}$,
the actions of $\sigma$ and $\tau$ are given as
\begin{align*}
\sigma=\left(
\begin{array}{cccc}
  & I &  &  \\
& & \ddots &\\
& & & I \\
A &  & &
\end{array}
\right),\
\tau=
\left(
\begin{array}{cccccc}
 O & -I & -I & \cdots & -I & -I  \\
 -A^2 & O & -A & \cdots & -A & -A\\
 -A^3 & -A^3 & O & -A^2 & \cdots & -A^2\\
 \vdots & \vdots & \ddots & \ddots & \ddots & \vdots \\
-A^{p-1} & -A^{p-1} & \cdots & -A^{p-1} & O & -A^{p-2}\\
-I & -I & \cdots & -I & -I & O
\end{array}
\right)
\end{align*}
where
\begin{align*}
A=
\left(
\begin{array}{cccc}
  & 1 &  &  \\
& & \ddots &\\
& & & 1 \\
-1 & -1 & \cdots & -1
\end{array}
\right)\in GL_{p-1}(\bZ)
\end{align*}
and $I$ (resp. $O$) $\in GL_{p-1}(\bZ)$
is the identity (resp. the zero) matrix.
\end{definition}

The following theorem gives a generalization
of the case $G=C_9\rtimes C_3$ of the CARAT ID (6,2865,3)
of Theorem \ref{t1.5} (4) (see Table 3-1-1). When $G$ is the group order $p^3$ in Theorem \ref{thmCp2p}, note that $\bm{C}(G)$ is rational by \cite[Theorem 2.3]{CK}. Thus $B_0(G)=0$ and ${\rm Br}_u(\bm{C}(M)^G)=H^2_u(G, M)$.

\begin{theorem}\label{thmCp2p}
Let $p$ be an odd prime number and
$G=\langle \sigma,\tau: \sigma^{p^2}=\tau^p=1,
\tau^{-1}\sigma\tau=\sigma^{p+1}\rangle\simeq C_{p^2}\rtimes C_p$.
Let $M$ be the $G$-lattice of rank $p(p-1)$
defined in Definition \ref{defCp2p}.
Then $H_u^2(G,M)\simeq\bZ/p\bZ$.
Consequently, $\bm{C}(M)^{G}$ is not retract $\bm{C}$-rational.\\
\end{theorem}
\begin{proof}
There are $p+1$ maximal bicyclic subgroups of $G$: $\langle\sigma\rangle\simeq C_{p^2}$, $\langle\sigma^p,\sigma^i\tau\rangle\simeq C_p\times C_p$ where $0\leq i\leq p-1$.

\medskip
Step 1. We will prove that $H^2(G,M)={\rm Ker}({\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma\rangle, M))\simeq\bZ/p\bZ$.

Note that $\sigma^p:x_j^{(i)}\mapsto x_{j+1}^{(i)}$ for $0\leq i,j\leq p-1$.
However, the linear map $y_1\mapsto y_2\mapsto \cdots\mapsto y_{p-1}\mapsto -y_1-y_2-\cdots-y_{p-1}$ has no eigen value equal to $1$.
Hence $M^{\langle\sigma^p\rangle}=0$.

Use the exact sequence
\begin{align*}
\cdots\to
&\ H^2(G/\langle\sigma^p\rangle, M^{\langle\sigma\rangle})\to
{\rm Ker}({\rm res}:H^2(G, M)\to H^2(\langle\sigma^p\rangle, M))\\
\to &\ H^1(G/\langle\sigma^p\rangle, H^1(\langle\sigma^p\rangle, M))
\to H^3(G/\langle\sigma^p\rangle, M^{\langle\sigma^p\rangle}).
\end{align*}
We find that $H^2(G,M)={\rm Ker}({\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma^p\rangle, M))\xrightarrow{\sim} H^1(G/\langle\sigma^p\rangle, H^1(\langle\sigma^p\rangle,M))$.

It remains to show that $H^1(G/\langle\sigma^p\rangle, H^1(\langle\sigma^p\rangle, M))\simeq\bZ/p\bZ$.

\medskip
By Step 1 in the proof of Theorem \ref{thmD4n}, $H^1(\langle\sigma^p\rangle,M)={\rm Ker}({\rm Norm})/{\rm Image}(\sigma^p-1)=\langle x_j^{(i)}:0\leq i,j\leq p-1\rangle/\langle x_j^{(i)}-x_{j+1}^{(i)}:0\leq i,j\leq p-1\rangle\simeq\oplus_{0\leq i\leq p-1}\bZ/p\bZ\cdot\overline{x_1^{(i)}}$
(note that $x_{p-1}^{(i)}-x_0^{(i)}=2x_{p-1}^{(i)}+ \sum_{1 \le j \le p-2}x_j^{(i)}$ and $p x_{p-1}^{(i)}\in {\rm Image}(\sigma^p-1))$ and
$\sigma\cdot\overline{x_1^{(i)}}=\overline{x_1^{(i+1)}}$,
$\tau\cdot\overline{x_1^{(i)}}=-\sum_{0\leq l\leq p-1\atop l\neq i}\overline{x_1^{(l)}}$.

Now we compute $H^1(G/\langle\sigma^p\rangle, \oplus_{0\leq i\leq p-1}\bZ/p\bZ\cdot\overline{x_1^{(i)}})$.
Call $M_1=\oplus_{0\leq i\leq p-1}\bZ/p\bZ\cdot\overline{x_1^{(i)}}$.
We use the exact sequence
\begin{align*}
0\rightarrow H^1(G/\langle\sigma\rangle, M_1^{\langle\sigma\rangle})\rightarrow H^1(G/\langle\sigma^p\rangle, M_1)\rightarrow H^1(\langle\sigma\rangle/\langle\sigma^p\rangle, M_1)^{G/\langle\sigma\rangle}.
\end{align*}
Define $w:=\sum_{0\leq i\leq p-1}\overline{x_1^{(i)}}$.
It is routine to verify that $M_1^{\langle\sigma\rangle}=\bZ/p\bZ\cdot w$ and
$\tau\cdot w=w$.
Hence $H^1(G/\langle\sigma\rangle, M_1^{\langle\sigma\rangle})\simeq\bZ/p\bZ\cdot w\simeq\bZ/p\bZ$.

On the other hand, it is also routine to show that if $v=\sum_{0\leq i\leq p-1}c_i\overline{x_1^{(i)}}\in\oplus_{0\leq i\leq p-1}\bZ/p\bZ\cdot\overline{x_1^{(i)}}$ and $(1+\sigma+\cdots+\sigma^{p-1})(v)=0$,
then $\sum_{0\leq i\leq p-1}c_i=0$.
It follows that $H^1(\langle\sigma\rangle,M_1)={\rm Ker}({\rm Norm})/{\rm Image}(\sigma-1)=\langle \overline{x_1^{(i)}}-\overline{x_1^{(i+1)}}:0\leq i\leq p-1\rangle/\langle \overline{x_1^{(i)}}-\overline{x_1^{(i+1)}}:0\leq i\leq p-1\rangle=0$.
Thus $H^1(G/\langle\sigma^p\rangle, M_1)\simeq H^1(G/\langle\sigma\rangle, M_1^{\langle\sigma\rangle})\simeq\bZ/p\bZ$.

\medskip
Step 2.
We will prove that $H^2(\langle\sigma^p,\tau\rangle, M)\simeq(\bZ/p\bZ)^{\oplus (p-1)}$ and $H^2(\langle\sigma^p,\sigma^i\tau\rangle, M)=0$ for $1\leq i\leq p-1$.

Remember that $M^{\langle\sigma^p\rangle}=0$.
Hence $H^2(\langle\sigma^p,\tau\rangle, M)\simeq H^1(\langle\sigma^p,\tau\rangle/\langle\sigma^p\rangle, H^1(\langle\sigma^p\rangle, M))$.

Note that $H^1(\langle\sigma^p\rangle, M)\simeq\oplus_{0\leq i\leq p-1}\bZ/p\bZ\cdot\overline{x_1^{(i)}}$ with $\tau\cdot\overline{x_1^{(i)}}=-\sum_{l\neq i}\overline{x_1^{(l)}}$, which is shown in the previous step.
Write $M_1=\oplus_{0\leq i\leq p-1}\bZ/p\bZ\cdot\overline{x_1^{(i)}}$.
We will prove that $H^1(\langle\sigma^p,\tau\rangle/\langle\sigma^p\rangle, M_1)\simeq (\bZ/p\bZ)^{\oplus (p-1)}$.

Define $w=\sum_{0\leq i\leq p-1}\overline{x_1^{(i)}}$.
Then $\tau\cdot\overline{x_1^{(i)}}=\overline{x_1^{(i)}}-w$.
Hence $(1+\tau+\cdots+\tau^{p-1})(\overline{x_1^{(i)}})=0$ for all $0\leq i\leq p-1$.
Thus $H^1(\langle\sigma^p,\tau\rangle/\langle\sigma^p\rangle, M_1)\simeq{\rm Ker}({\rm Norm})/{\rm Image}(\tau-1)=\langle\overline{x_1^{(i)}}:0\leq i\leq p-1\rangle/\langle w\rangle\simeq \oplus_{1\leq i\leq p-1}\bZ/p\bZ\cdot\overline{x_1^{(i)}}\simeq (\bZ/p\bZ)^{\oplus (p-1)}$.

We turn to $H^2(\langle\sigma^p,\sigma^i\tau\rangle, M)$ where $1\leq i\leq p-1$.
As before, $H^2(\langle\sigma^p,\sigma^i\tau\rangle, M)\simeq H^1(\langle\sigma^p,\sigma^i\tau\rangle/\langle\sigma^p\rangle, H^1(\langle\sigma^p\rangle,$ $M))\simeq H^1(\langle\sigma^p,\sigma^i\tau\rangle/\langle\sigma^p\rangle, M_1)$ where $M_1=\oplus_{0\leq i\leq p-1}\bZ/p\bZ\cdot\overline{x_1^{(i)}}$ and $\sigma\cdot\overline{x_1^{(i)}}=\overline{x_1^{(i+1)}}$, $\tau\cdot\overline{x_1^{(i)}}=\overline{x_1^{(i)}}-w$ with $w=\sum_{0\leq l\leq p-1}\overline{x_1^{(l)}}$ as before.
Then $\sigma^i\tau:\overline{x_1^{(l)}}\mapsto\overline{x_1^{(l+i)}}-w$.
Note that $(1+\sigma^i\tau+(\sigma^i\tau)^2+\cdots+(\sigma^i\tau)^{p-1})\cdot \overline{x_1^{(l)}}=w$.
Thus, if $v=\sum_{0\leq l\leq p-1}c_l\overline{x_1^{(l)}}\in M_1$,
then $(1+\sigma^i\tau+(\sigma^i\tau)^2+\cdots+(\sigma^i\tau)^{p-1})\cdot v=0$ if and only if $\sum_{0\leq l\leq p-1}c_l=0$.
Thus $H^1(\langle\sigma^p,\sigma^i\tau\rangle/\langle\sigma^p\rangle, M_1)\simeq{\rm Ker}({\rm Norm})/{\rm Image}(\sigma^i\tau-1)=\langle\overline{x_1^{(l)}}-\overline{x_1^{(0)}}:1\leq l\leq p-1\rangle/\langle\overline{x_1^{(l+i)}}-\overline{x_1^{(l)}}-w:0\leq l\leq p-1\rangle$.
In the next step, we will show that $\langle\overline{x_1^{(l)}}-\overline{x_1^{(0)}}:1\leq l\leq p-1\rangle=\langle\overline{x_1^{(l+i)}}-\overline{x_1^{(l)}}-w:0\leq l\leq p-1\rangle$.
Thus $H^1(\langle\sigma^p,\sigma^i\tau\rangle/\langle\sigma^p\rangle, M_1))=0$.

\medskip
Step 3.
Suppose that $V$ is a vector subspace of the vector space $\oplus_{0\leq l\leq p-1}\bZ/p\bZ\cdot\overline{x_1^{(l)}}$ over $\bZ/p\bZ$ defined as $V=\langle\overline{x_1^{(l)}}-\overline{x_1^{(0)}}:1\leq l\leq p-1\rangle$ and $W$ is a subspace of $V$ defined as $W=\langle\overline{x_1^{(l+i)}}-\overline{x_1^{(l)}}-w:0\leq l\leq p-1\rangle$ where $w=\sum_{0\leq l\leq p-1}\overline{x_1^{(l)}}$ and $i$ is an integer $1\leq i\leq p-1$ (${\rm mod} \, p$).
We will show that $V=W$.

For simplicity, we consider the case $i=1$.
The proof for the case $2\leq i\leq p-1$ is similar (by adjusting the indices, for example).

Write $y_l=\overline{x_1^{(l)}}-\overline{x_1^{(0)}}$ for $1\leq l\leq p-1$.
Then $\{y_1,\ldots,y_{p-1}\}$ is a basis of $V$ over $\bZ/p\bZ$.

Define $v_0=\overline{x_1^{(1)}}-\overline{x_1^{(0)}}-w$, $v_l=\overline{x_1^{(l+1)}}-\overline{x_1^{(l)}}-w$ (where $1\leq l\leq p-2$), $v_{p-1}=\overline{x_1^{(0)}}-\overline{x_1^{(p-1)}}-w$.
Then $W=\langle v_l:0\leq l\leq p-1\rangle$.
Note that $w=\sum_{0\leq l\leq p-1}\overline{x_1^{(l)}}=\sum_{1\leq l\leq p-1}(\overline{x^{(l)}}-\overline{x_0^{(0)}})=\sum_{1\leq l\leq p-1}y_l$.

Define $z_0=v_0=y_1-w=-y_2-y_3-\cdots -y_{p-1}$,
$z_1=-v_1+v_2=y_1-2y_2+y_3$,
$z_l=-v_l+v_{l+1}=y_l-2y_{l+1}+y_{l+2}$ (where $1\leq l\leq p-3$),
$z_{p-2}=-v_{p-2}+v_{p-1}=y_{p-2}-2y_{p-1}$.

Consider the quotient space $V/W$.
We will prove by induction that $y_k\equiv(p-k)y_{p-1}\ ({\rm modulo}\ W)$
for $1\leq k\leq p-1$.

The case $y_{p-1}\equiv y_{p-1}\ ({\rm modulo}\ W)$ is automatic.
The case $y_{p-2}\equiv 2y_{p-1}\ ({\rm modulo}\ W)$ follows from $y_{p-2}-2y_{p-1}=z_{p-2}\in W$.
Inductively, if $y_{k+l}\equiv (p-k-l)y_{p-1}\ ({\rm modulo}\ W)$ for $l=1$ and $2$, then we use the formula $z_k=y_k-2y_{k+1}+y_{k+2}\in W$.
Thus $y_k\equiv 2y_{k+1}-y_{k+2}\equiv (p-k)y_{p-1}\ ({\rm modulo}\ W)$.
Finally, we get $y_1\equiv (p-1)y_{p-1}\ ({\rm modulo}\ W)$.

Now we use the fact that $z_0=-y_2-y_3-\cdots-y_{p-1}\in W$.
We find that $-[(p-2)+(p-3)+\cdots+2+1]y_{p-1}\equiv 0\ ({\rm modulo}\ W)$,
i.e. $-((p-1)(p-2)/2)\cdot y_{p-1}\in W$.
Since $(p-1)(p-2)/2\neq 0$ in $\bZ/p\bZ$, we find that $y_{p-1}\in W$.
Once we know that $y_{p-1}\in W$, we know $y_l\in W$ for $1\leq l\leq p-2$ by
using the formulae $z_{p-2}, z_{p-3},\ldots, z_2, z_1$.
Done.

\medskip
Step 4.
We will show that the restriction map ${\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma^p,\sigma^i\tau\rangle, M)$ is the zero map where $0\leq i\leq p-1$.
Once we finish it, then we find that $H^2(G,M)=H_u^2(G,M)\simeq \bZ/p\bZ$
(by combining the result of Step 1).

When $1\leq i\leq p-1$, the map ${\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma^p,\sigma^i\tau\rangle, M)$ is the zero map because $H^2(\langle\sigma^p,\sigma^i\tau\rangle, M)=0$ by Step 2.

It remains to show that ${\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma^p,\tau\rangle, M)$ is the zero map also.
We will show that ${\rm Ker}({\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma^p,\tau\rangle, M))\simeq\bZ/p\bZ$.
Assume this.
Since $H^2(G,M)\simeq \bZ/p\bZ$ by Step 1, it follows that ${\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma^p,\tau\rangle, M)$ is the zero map.

We will use the exact sequence
\begin{align*}
\cdots\to
&\ H^2(G/\langle\sigma^p,\tau\rangle, M^{\langle\sigma^p,\tau\rangle})\to
{\rm Ker}({\rm res}:H^2(G, M)\to H^2(\langle\sigma^p,\tau\rangle, M))\\
\to &\ H^1(G/\langle\sigma^p,\tau\rangle, H^1(\langle\sigma^p,\tau\rangle, M))
\to H^3(G/\langle\sigma^p,\tau\rangle, M^{\langle\sigma^p,\tau\rangle}).
\end{align*}

Since $M^{\langle\sigma^p\rangle}=0$, it follows that ${\rm Ker}({\rm res}:H^2(G,M)\rightarrow H^2(\langle\sigma^p,\tau\rangle, M))\simeq H^1(G/\langle\sigma^p,\tau\rangle, H^1(\langle\sigma^p,\tau\rangle, M))$.

In Step 2, we have shown that $H^1(\langle\sigma^p\rangle,M)\simeq\oplus_{0\leq i\leq p-1}\bZ/p\bZ\cdot\overline{x_1^{(i)}}$ with $\sigma\cdot\overline{x_1^{(i)}}=\overline{x_1^{(i+1)}}$, $\tau\cdot\overline{x_1^{(i)}}=-\sum_{0\leq l\leq p-1\atop l\neq i}\overline{x_1^{(l)}}$.
Use the exact sequence
\begin{align*}
0\to H^1(\langle\sigma^p,\tau\rangle/\langle\sigma^p\rangle, M^{\langle\sigma^p\rangle})\to H^1(\langle\sigma^p,\tau\rangle, M)\to H^1(\langle\sigma^p\rangle,M)^{\langle\sigma^p,\tau\rangle/\langle\sigma^p\rangle}\to H^2(\langle\sigma^p,\tau\rangle/\langle\sigma^p\rangle, M^{\langle\sigma^p\rangle})\to \cdots.
\end{align*}
Since $M^{\langle\sigma^p\rangle}=0$,
it follows that $H^1(\langle\sigma^p,\tau\rangle, M)\xrightarrow{\sim} H^1(\langle\sigma^p\rangle, M)^{\langle\sigma^p,\tau\rangle/\langle\sigma^p\rangle}\simeq(\oplus_{0\leq i\leq p-1}\bZ/p\bZ\cdot\overline{x_1^{(i)}})^{\langle\tau\rangle}=\oplus_{1\leq \i\leq p-1}\bZ/p\bZ\cdot y_i$ where $y_i=\overline{x_1^{(i)}}-\overline{x_1^{(i-1)}}$ for $1\leq i\leq p-1$.

Let $\overline{\sigma}$ be the image of $\sigma$ in
$G/\langle\sigma^p,\tau\rangle$.
Note that $\overline{\sigma}:y_1\mapsto y_2\mapsto\cdots\mapsto y_{p-1}\mapsto -y_1-y_2-\cdots-y_{p-1}$.
Hence $(1+\overline{\sigma}+\overline{\sigma}^2+\cdots+\overline{\sigma}^{p-1})\cdot y_i=0$ for all $1\leq i\leq p-1$.
It follows that $H^1(G/\langle\sigma^p,\tau\rangle,H^1(\langle\sigma^p,\tau\rangle,M))\simeq H^1(\langle\overline{\sigma}\rangle,\oplus_{1\leq i\leq p-1}\bZ/p\bZ\cdot y_i)\simeq {\rm Ker}({\rm Norm})/{\rm Image}(\overline{\sigma}-1)=\langle y_i:1\leq i\leq p-1\rangle/\langle y_i-y_{i+1}:1\leq i\leq p-1\rangle\simeq\bZ/p\bZ\cdot\overline{y_1}\simeq\bZ/p\bZ$.
\end{proof}


Finally we will relate the lattices we consider with their flabby classes. Recall some notion of the theory of flabby (flasque) $G$-lattices developed by Endo and Miyata, Voskresnskii, Colliot-Th\'el\`ene and Sansuc \cite[Vo, CTS]{EM}. The reader is referred to \cite{Sw} for a quick review of this theory.


\begin{defn} \label{d7.1}
Let $G$ be a finite group and $M$ be a $G$-lattice.
$M$ is called a permutation lattice if $M$ has a $\bm{Z}$-basis permuted by $G$.
A $G$-lattice $M$ is called an invertible lattice if it is a direct summand of some permutation lattice.
A $G$-lattice $M$ is called a flabby lattice if $H^{-1}(G',M)=0$ for all subgroup $G'$ of $G$;
it is called a coflabby lattice if $H^1(G',M)=0$ for all subgroups $G'$ of $G$.
For the basic properties of $G$-lattices, see \cite[Sw]{CTS}.
\end{defn}

%-------------------d2.3
\begin{defn} \label{d7.2}
Let $G$ be a finite group.
Two $G$-lattices $M_1$ and $M_2$ are called similar, denoted by $M_1\sim M_2$,
if $M_1\oplus Q_1\simeq M_2\oplus Q_2$ for some permutation lattices $Q_1$ and $Q_2$.
The flabby class monoid $F_G$ consists of all the similarity classes of flabby $G$-lattices under the addition described below.
Explicitly, if $M$ is a flabby $G$-lattice,
then $[M]\in F_G$ denotes the similarity class containing $M$;
the addition in $F_G$ is defined as: $[M_1]+[M_2]=[M_1\oplus M_2]$.
Note that $[M]=0$ in $F_G$,
i.e.\ $[M]$ is the zero element in $F_G$, if and only if $M\oplus Q$ is isomorphic to a permutation lattice where $Q$ is some permutation lattice.
See \cite{Sw} for details.
\end{defn}

%-----------------d2.4
\begin{defn} \label{d7.3}
Let $G$ be a finite group, $M$ be a $G$-lattice.
The $M$ have a flabby resolution,
i.e.\ there is an exact sequence of $G$-lattices:
$0\to M\to Q\to E\to 0$ where $Q$ is a permutation lattice and $E$ is a flabby lattice \cite[Lemma 1.1; CTS; Sw]{EM}.

Although the above flabby resolution is not unique, the class $[E]\in F_G$ is uniquely determined by $M$.
Thus we define the flabby class of $M$, denoted as $[M]^{fl}$, by $[M]^{fl}=[E]\in F_G$ (see \cite{Sw}).
Sometimes we say that $[M]^{fl}$ is permutation or invertible if the class $[E]$ contains a permutation lattice or an invertible lattice.
\end{defn}

Recall the multiplicative fixed fields associated to algebraic tori. In Definition \ref{d1.2}, for any $G$-lattice $M$ and any field $k$, we define the field $k(M)$ on which $G$ acts multiplicatively; note that $G$ acts trivially on $k$. Suppose that we replace the field $k$ by another field $K$ such that $K$ is a finite Galois extension of a field $k$ with ${\rm Gal}(K/k)=G$. We may define the field $K(M)$ on which $G$ acts multiplicatively in a similar way; this time $G$ acts faithfully on $K$. In fact, the fixed field $K(M)^G$ is the function field of an algebraic torus which is defined over $k$,
split by $K$ and with character module $M$ (see \cite[Sw]{Vo}). A rationality criterion for algebraic tori is known:

\begin{theorem} \label{t7.4}
Let $K/k$ be a finite Galois extension with $G={\rm Gal}(K/k)$.
Let $M$ be a $G$-lattice.
\begin{enumerate}
\item[$(1)$] {\rm (\cite[Theorem 1.6; Vo; Le, Theorem 1.7]{EM1})}
The fixed field $K(M)^G$ is stably rational over $k$ if and only if $[M]^{fl}=0$ in $F_G$.
\item[$(2)$] {\rm (\cite[Theorem 1.3]{Sa3})}
Assume that $k$ is an infinite field.
Then the fixed field $K(M)^G$ is retract rational over $k$ if and only if $[M]^{fl}$ is invertible.
\end{enumerate}
\end{theorem}

Here is an analogous result for $\bm{C}(M)^G$
(be aware that $G$ acts trivially on $\bC$).

\begin{theorem} \label{t7.5}
Let $G$ be a finite group and $M$ be a faithful $G$-lattice.
\begin{enumerate}
\item[$(1)$] {\rm (\cite[Theorem 5.4]{Ka})}
Assume that $[M]^{fl}$ is invertible. Then $\bC(M)^G$ is retract $\bC$-rational if and only if $\bC(G)$ is retract $\bC$-rational.
\item[$(2)$] Assume that $[M]^{fl}=0$ and $\bC(G)$ is stably $\bC$-rational. Then $\bC(M)^G$ is also stably $\bC$-rational.
\end{enumerate}
\end{theorem}

\begin{proof}
For the proof of (2), consider the fixed field $\bC(M \oplus \bZ [G])^G$. It is not difficult to see that $\bC(M)^G$ is stably isomorphic to $\bC(\bZ [G])(M)^G$ (see the first paragraph of the proof in \cite[Proposition 2.2]{CHK}). Since $[M]^{fl}=0$, it follows that $\bC(\bZ [G])(M)^G$ is stably rational over $\bC(\bZ [G])^G=\bC(G)$ by Theorem \ref{t7.4}.
\end{proof}

\begin{remark}
(1) The $G$-lattices $M$ considered in Section $3$ and Theorems \ref{thmD4n},
\ref{thmQDQ}, \ref{thmCp2p} are faithful lattices. Thus we may apply  Theorem \ref{t7.5} to them. As to the question whether $\bC(G)$ is retract rational, the readers may consult \cite{Ka1} and \cite{Ka}. In particular, if $G$ is a finite group containing an abelian normal subgroup $N$ such that $G/N$ is a cyclic group, then $\bC(G)$ is retract rational by \cite[Theorem 5.10]{Ka}. This result provides an alternative proof that $B_0(G)=0$ if $G$ is a dihedral group, a quasi-dihedral group, or a generalized quaternion group. \\
(2) In general, if $M$ is a $G$-lattice, define
$H= \{\tau \in G: \tau \, {\rm acts} \, {\rm trivially} \, {\rm on} \, M \}$.
Then  $[M]^{fl}$ is invertible when $M$ is regarded as a $G$-lattice if and only if so is $[M]^{fl}$ when $M$ is regarded as a $G/H$-lattice by \cite[page 180]{CTS}. But it is unnecessary that the retract rationality of $\bC(G)$ always implies that of $\bC(G/H)$ (see \cite[Theorem 3.1]{Sa5}). \\
(3) Again consider the general case where $M$ is any $G$-lattice. If it is assumed that all the Sylow subgroups of $G$ are cyclic groups, then $\bC(M)^G$ is retract rational by \cite[Theorem 6.6]{Ka}. Note that we don't assume that $[M]^{fl}$ is invertible, because it is a consequence of \cite[Theorem 1.5]{EM}.
\end{remark}

\begin{corollary}\label{t7.6}
Let $M$ be a faithful $G$-lattice such that $\bC(G)$ is retract $\bC$-rational and $H^2_u (G, M) \neq 0$. Then $[M]^{fl}$ is not invertible. In particular, if $M$ is one of the $G$-lattices in Theorems \ref{thmD4n},
\ref{thmQDQ}, \ref{thmCp2p}, then $[M]^{fl}$ is not invertible.
\end{corollary}

\begin{proof}
If $[M]^{fl}$ is invertible, then we may apply Theorem \ref{t7.5}. Since $\bC(G)$ is retract rational, so is $\bC(M)^G$. It follows that $H^2_u(G,M)=0$ by Definition \ref{d1.12}. This leads to a contradiction.
\end{proof}



%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\section{GAP computation: An algorithm to compute $H_u^2(G,M)$}\label{seGAP}

The following function {\tt H2nrM(g)} of GAP \cite{GAP} returns
$H_u^2(G,M)$ for $G$-lattice $M$ with $G\leq GL_n(\bm{Z})$
for ${\tt g}=G$.
The functions below, e.g. {\tt H2nrM(g)}, are available from\\
{\tt http://www.math.h.kyoto-u.ac.jp/\~{}yamasaki/Algorithm/MultInvField/}.\\

\begin{verbatim}
BlockList:= function(L,n)
    local l,m;
    l:=Length(L);
    m:=l/n;
    return List([1..n],x->L{[(x-1)*m+1..x*m]});
end;

IsBicyclic:= function(g)
    local f3,p;
    if not IsAbelian(g) then
        return false;
    fi;
    f3:=Filtered(Collected(Factors(Order(g))),x->x[2]>2);
    for p in f3 do
        if Length(AbelianInvariants(SylowSubgroup(g,p[1])))>2 then
            return false;
        fi;
    od;
    return true;
end;

FindGenFiniteAbelian:= function(g)
    local e,a,ga,iso;
    e:=AbelianInvariants(g);
    if Length(e)>1 then
        e:=SmithNormalFormIntegerMat(DiagonalMat(e));
        e:=List([1..Length(e)],x->e[x][x]);
        e:=Filtered(e,x->x>1);
    fi;
    a:=AbelianGroup(e);
    ga:=GeneratorsOfGroup(a);
    iso:=IsomorphismGroups(a,g);
    return List(ga,x->Image(iso,x));
end;

EltFiniteAbelian:= function(g,c)
    local gg,F,gF,hom,cF,e;
    gg:=GeneratorsOfGroup(g);
    F:=FreeGroup(Length(gg));
    gF:=GeneratorsOfGroup(F);
    hom:=GroupHomomorphismByImages(F,g,gF,gg);
    cF:=PreImagesRepresentative(hom,c);
    e:=List(gF,x->ExponentSumWord(cF,x));
    return e;
end;

CheckSNF:= function(m)
    local s,r;
    s:=SmithNormalFormIntegerMat(m);
    r:=Rank(s);
    if r=0 then
        return 0;
    else
        return s[r][r];
    fi;
end;

Z2value:= function(z,eg,gg)
    local og,zmat,i1,i2,i3,i,j2,j3,s,s1,s2;
    og:=Length(eg);
    zmat:=NullMat(og,og);
    for j2 in [1..Length(gg)] do
        i2:=Position(eg,gg[j2]);
        zmat{[1..og]}{[i2]}:=z{[1..og]}{[j2]};
    od;
    s:=gg;
    s1:=gg;
    s2:=[];
    repeat
        for j2 in s1 do
            i2:=Position(eg,j2);
            for j3 in gg do
                if not j2*j3 in Concatenation(s,s2) then
                    Add(s2,j2*j3);
                    i3:=Position(eg,j3);
                    i:=Position(eg,j2*j3);
                    for i1 in [1..og] do
                        zmat[i1][i]:=zmat[i1][i2]*j3
                            +zmat[Position(eg,eg[i1]*j2)][i3]-zmat[i2][i3];
                    od;
                fi;
            od;
        od;
        s1:=s2;
        s:=Union(s,s1);
        s2:=[];
    until s1=[];
    return zmat;
end;

H2nrM:= function(g)
    local d,gg,og,eg,h,gh,oh,eh,j1,j2,j,i1,i2,l0,l1,l2,m0,m1,m2,m,
        zero,sg,sh,h2g,h2gg,h2h,z,zmat,zmats,s,res,ress,
        Hg,Hgg,K,ga,iso,Hh,Hhg,hom,Kg;
    d:=Length(Identity(g));
    gg:=GeneratorsOfGroup(g);
    og:=Order(g);
    if gg=[] or og=1 then
        return rec(H2G:=[],H2Ggen:=[],H2nrM:=[],H2nrMgen:=[]);
    fi;
    eg:=Elements(g);
    l0:=[]; l1:=[]; l2:=[];
    j:=0;
    for j1 in eg do
        for j2 in gg do
            j:=j+1;
            Add(l0,[Position(eg,j2),j,Identity(g)]);
            Add(l1,[Position(eg,j1*j2),j,Identity(g)]);
            Add(l2,[Position(eg,j1),j,j2]);
        od;
    od;
    m0:=BlockMatrix(l0,og,og*Length(gg));
    m1:=BlockMatrix(l1,og,og*Length(gg));
    m2:=BlockMatrix(l2,og,og*Length(gg));
    m:=MatrixByBlockMatrix(m0-m1+m2);
    zero:=Flat(List([0..Order(gg[1])-2],
        x->List([1..d],y->(Position(eg,gg[1]^x)-1)*Length(gg)*d+y)));
    m:=NullspaceIntMat(m{[1..Length(m)]}{zero})*m;
    m:=LatticeBasis(m);
    z:=1;
    while m<>[] and z<=og*Length(gg) do
        zero:=[(z-1)*d+1..z*d];
        l0:=m{[1..Length(m)]}{zero};
        if CheckSNF(l0)=1 then
            m:=NullspaceIntMat(l0)*m;
        fi;
        z:=z+1;
    od;
    if m=[] then
        return rec(H2G:=[],H2Ggen:=[],H2nrM:=[],H2nrMgen:=[]);
    fi;
    sg:=SmithNormalFormIntegerMatTransforms(m);
    h2g:=Filtered(List([1..sg.rank],x->sg.normal[x][x]),y->y>1);
    m:=Inverse(sg.coltrans);
    h2gg:=List([sg.rank-Length(h2g)+1..sg.rank],x->m[x]);
    h2gg:=List(h2gg,x->BlockList(x,og));
    h2gg:=List(h2gg,x->List(x,y->BlockList(y,Length(gg))));
    zmats:=List(h2gg,x->Z2value(x,eg,gg));
    Hg:=AbelianGroup(h2g);
    Hgg:=GeneratorsOfGroup(Hg);
    K:=Hg;
    if ValueOption("fromperm")=true or ValueOption("FromPerm")=true then
        iso:=IsomorphismPermGroup(g);
        ga:=List(ConjugacyClassesSubgroups(Range(iso)),Representative);
        ga:=Filtered(ga,IsBicyclic);
        ga:=Concatenation(List(ga,x->ConjugateSubgroups(Image(iso),x)));
        ga:=List(ga,x->PreImage(iso,x));
    else
        ga:=List(ConjugacyClassesSubgroups(g),Representative);
        ga:=Filtered(ga,IsBicyclic);
        ga:=Concatenation(List(ga,x->ConjugateSubgroups(g,x)));
    fi;
    ga:=Filtered(ga,x->Order(x)>1);
    for h in ga do
        gh:=FindGenFiniteAbelian(h);
        oh:=Order(h);
        eh:=Elements(h);
        l0:=[]; l1:=[]; l2:=[];
        j:=0;
        for j1 in eh do
            for j2 in gh do
                j:=j+1;
                Add(l0,[Position(eh,j2),j,Identity(h)]);
                Add(l1,[Position(eh,j1*j2),j,Identity(h)]);
                Add(l2,[Position(eh,j1),j,j2]);
            od;
        od;
        m0:=BlockMatrix(l0,oh,oh*Length(gh));
        m1:=BlockMatrix(l1,oh,oh*Length(gh));
        m2:=BlockMatrix(l2,oh,oh*Length(gh));
        m:=MatrixByBlockMatrix(m0-m1+m2);
        sh:=SmithNormalFormIntegerMatTransforms(m);
        h2h:=Filtered(List([1..sh.rank],x->sh.normal[x][x]),y->y>1);
        if h2h<>[] then
            Hh:=AbelianGroup(h2h);
            Hhg:=GeneratorsOfGroup(Hh);
            ress:=[];
            for zmat in zmats do
                res:=List(eh,x->List(gh,
                    y->zmat[Position(eg,x)][Position(eg,y)]));
                res:=Flat(res)*sh.coltrans;
                res:=Product([1..Length(h2h)],
                    x->Hhg[x]^res[sh.rank-Length(h2h)+x]);
                Add(ress,res);
            od;
            hom:=GroupHomomorphismByImages(Hg,Hh,Hgg,ress);
            K:=Intersection(K,Kernel(hom));
            if Order(K)=1 then
                return rec(H2G:=h2g,H2Ggen:=h2gg,H2nrM:=[],H2nrMgen:=[]);
            fi;
        fi;
    od;
    Kg:=FindGenFiniteAbelian(K);
    return rec(H2G:=h2g,H2Ggen:=h2gg,H2nrM:=List(Kg,Order),
        H2nrMgen:=List(Kg,x->EltFiniteAbelian(Hg,x)));
end;
\end{verbatim}

\bigskip

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\section{Tables: multiplicative invariant fields with non-trivial unramified Brauer groups}\label{seTables}

Table $1$: $M$ is indecomposable of rank $4$ ($5$ cases with $H_u^2(G,\bm{Q}/\bm{Z})=0$)\vspace*{2mm}\\
\begin{tabular}{lllll}
\hline
$G(n,i)$ & $G$ & GAP ID & $H_u^2(G,M)$\\\hline
$(8,3)$ & $D_4$ & $(4,12,4,12)$ & $\bZ/2\bZ$\\
$(8,4)$ & $Q_8$ & $(4,32,1,2)$ & $(\bZ/2\bZ)^{\oplus 2}$\\
$(16,8)$ & $QD_8$ & $(4,32,3,2)$ & $\bZ/2\bZ$\\
$(24,3)$ & $SL_2(\bm{F}_3)$ & $(4,33,3,1)$ & $(\bZ/2\bZ)^{\oplus 2}$\\
$(48,29)$ & $GL_2(\bm{F}_3)$ & $(4,33,6,1)$ & $\bZ/2\bZ$\\
\end{tabular}\\

Table $2$-$1$: $M$ is indecomposable of rank $5$ ($27$ cases with $H_u^2(G,\bm{Q}/\bm{Z})=0$)\vspace*{2mm}\\
\begin{tabular}{lllll}
\hline
$G(n,i)$ & $G$ & CARAT ID & $H_u^2(G,M)$\\\hline
$(8,3)$ & $D_4$ & $(5,39,5)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(5,99,23)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(5,99,24)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(5,99,25)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(5,100,12)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(5,100,23)$ & $\bm{Z}/2\bm{Z}$\\
$(8,4)$ & $Q_8$ & $(5,773,4)$ & $(\bZ/2\bZ)^{\oplus 2}$\\
$(8,4)$ & $Q_8$ & $(5,774,4)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(5,109,5)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(5,116,20)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(5,118,18)$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(5,105,5)$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(5,672,2)$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(5,673,2)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4\times C_2$ & $(5,71,19)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4\times C_2$ & $(5,73,37)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4\times C_2$ & $(5,76,49)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4\times C_2$ & $(5,76,50)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4\times C_2$ & $(5,76,51)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4\times C_2$ & $(5,79,18)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4\times C_2$ & $(5,119,4)$ & $\bm{Z}/2\bm{Z}$\\
$(16,12)$ & $Q_8\times C_2$ & $(5,664,2)$ & $(\bZ/2\bZ)^{\oplus 2}$\\
$(32,6)$ & $((C_4\times C_2) \rtimes C_2) \rtimes C_2$ & $(5,704,3)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4\times C_2) \rtimes C_2) \rtimes C_2$ & $(5,706,8)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(5,142,14)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2\times C_2) \rtimes C_2$ & $(5,140,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8\times C_2$ & $(5,721,2)$ & $\bm{Z}/2\bm{Z}$\\\hline
\end{tabular}\\

Table $2$-$2$: $M=M_1\oplus M_2$ is decomposable of rank $5=4+1$
and $M_1$ is in Table $1$ ($18$ cases with $H_u^2(G,\bm{Q}/\bm{Z})=0$)\vspace*{2mm}\\
\begin{tabular}{lllllll}
\hline
$G(n,i)$ & $G$ & CARAT ID & $M_1\oplus M_2$\quad $(G_i=G|_{M_i})$& $[|G_1|,|G_2|]$ & $H_u^2(G,M)$\\\hline
$(8,3)$ & $D_4$ & $(5,63,12)$ & $(4,12,4,12)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(5,65,12)$ & $(4,12,4,12)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(5,99,5)$ & $(4,12,4,12)\oplus\bm{Z}$ & $[8,1]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(5,100,5)$ & $(4,12,4,12)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,4)$ & $Q_8$ & $(5,773,3)$ & $(4,32,1,2)\oplus\bm{Z}$ & $[8,1]$ & $(\bZ/2\bZ)^{\oplus 2}$\\
$(8,4)$ & $Q_8$ & $(5,774,3)$ & $(4,32,1,2)\oplus\bm{Z}^-$ & $[8,2]$ & $(\bZ/2\bZ)^{\oplus 2}$\\
$(16,8)$ & $QD_8$ & $(5,672,1)$ & $(4,32,3,2)\oplus\bm{Z}$ & $[8,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(5,673,1)$ & $(4,32,3,2)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(5,674,1)$ & $(4,32,3,2)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(5,675,1)$ & $(4,32,3,2)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4\times C_2$ & $(5,76,31)$ & $(4,12,4,12)\times\{\pm 1\}$
& $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,12)$ & $Q_8\times C_2$ & $(5,664,1)$ & $(4,32,1,2)\times\{\pm 1\}$
& $[8,2]$ &$(\bZ/2\bZ)^{\oplus 2}$\\
$(24,3)$ & $SL_2(\bm{F}_3)$ & $(5,691,1)$ & $(4,33,3,1)\oplus\bm{Z}$ & $[24,1]$
& $(\bZ/2\bZ)^{\oplus 2}$\\
$(32,40)$ & $QD_8\times C_2$ & $(5,721,1)$ & $(4,32,3,2)\times\{\pm 1\}$
& $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(48,29)$ & $GL_2(\bm{F}_3)$ & $(5,733,1)$ & $(4,33,6,1)\oplus\bm{Z}^-$ & $[48,2]$ & $\bm{Z}/2\bm{Z}$\\
$(48,29)$ & $GL_2(\bm{F}_3)$ & $(5,734,1)$ & $(4,33,6,1)\oplus\bm{Z}$ & $[48,1]$ & $\bm{Z}/2\bm{Z}$\\
$(48,32)$ & $SL_2(\bm{F}_3)\times C_2$ & $(5,730,1)$ & $(4,33,3,1)\times\{\pm 1\}$ & $[24,2]$ & $(\bZ/2\bZ)^{\oplus 2}$\\
$(96,189)$ & $GL_2(\bm{F}_3)\times C_2$ & $(5,776,1)$ & $(4,33,6,1)\times\{\pm 1\}$ & $[48,2]$ & $\bm{Z}/2\bm{Z}$\\\hline
\end{tabular}\\

Table $2$-$3$: $M=M_1\oplus M_2$ is decomposable of rank $5=3+2$ ($1$ case
with $H_u^2(G,\bm{Q}/\bm{Z})=0$)\vspace*{2mm}\\
\begin{tabular}{lllllll}
\hline
$G(n,i)$ & $G$ & CARAT ID & $M_1\oplus M_2$\quad $(G_i=G|_{M_i})$& $[|G_1|,|G_2|]$ & $H_u^2(G,M)$\\\hline
$(8,3)$ & $D_4$ & $(5,100,11)$ & $(3,3,1,3)\oplus (2,3,2,1)$ & $[4,8]$ & $\bm{Z}/2\bm{Z}$\\\hline
\end{tabular}
%\\

\newpage
Table $3$-$1$-$1$: $M$ is indecomposable of rank $6$ ($601$ cases with $H_u^2(G,\bm{Q}/\bm{Z})=0$)
\vspace*{-5mm}\\
%\begin{tabular}{lllllll}
\begin{longtable}{lllllll}
\hline
$G(n,i)$ & $G$ & CARAT ID & $H_u^2(G,M)$\\\hline
$(8,3)$ & $D_4$ & $(6,4691,11)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4691,18)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4692,11)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4692,13)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4809,32)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4810,32)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4812,32)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4813,32)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4814,39)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,48)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,58)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,67)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,68)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,87)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,88)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,89)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,96)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,102)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,103)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,108)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,114)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,115)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,141)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,154)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,163)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,181)$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,182)$ & $\bm{Z}/2\bm{Z}$\\
$(8,4)$ & $Q_8$ & $(6,5750,3)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(8,4)$ & $Q_8$ & $(6,6100,5)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(8,4)$ & $Q_8$ & $(6,6100,6)$ & $\bm{Z}/2\bm{Z}$\\
$(8,4)$ & $Q_8$ & $(6,6100,7)$ & $\bm{Z}/2\bm{Z}$\\
$(8,4)$ & $Q_8$ & $(6,6101,4)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(8,4)$ & $Q_8$ & $(6,6101,6)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2400,78)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2400,90)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2400,107)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2400,120)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2401,58)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2401,61)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2401,64)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2403,13)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2403,17)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2404,31)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2404,38)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2404,56)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2404,65)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2404,77)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2404,78)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2415,16)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2415,22)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2415,24)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2421,12)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2421,24)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2424,12)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2424,23)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2424,42)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2424,43)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2424,59)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2424,63)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2630,4)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2630,30)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2634,6)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2634,12)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2634,20)$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,4697,9)$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,2418,12)$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,2418,16)$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,2419,16)$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,2419,22)$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,2419,24)$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,2420,39)$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,2420,51)$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,2633,7)$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,4695,3)$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,6224,2)$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,6225,2)$ & $\bm{Z}/2\bm{Z}$\\
$(16,6)$ & $C_8 \rtimes C_2$ & $(6,5836,4)$ & $\bm{Z}/2\bm{Z}$\\
$(16,6)$ & $C_8 \rtimes C_2$ & $(6,5836,10)$ & $\bm{Z}/2\bm{Z}$\\
$(16,6)$ & $C_8 \rtimes C_2$ & $(6,6222,2)$ & $\bm{Z}/2\bm{Z}$\\
$(16,6)$ & $C_8 \rtimes C_2$ & $(6,6222,5)$ & $\bm{Z}/2\bm{Z}$\\
$(16,6)$ & $C_8 \rtimes C_2$ & $(6,6223,3)$ & $\bm{Z}/2\bm{Z}$\\
$(16,7)$ & $D_8$ & $(6,5574,11)$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5839,5)$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5839,6)$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5839,7)$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5840,5)$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5848,5)$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5849,5)$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5849,11)$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5850,5)$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5851,5)$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,6226,2)$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,6226,4)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2402,28)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2402,42)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2405,47)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2405,49)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2407,12)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2407,24)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2407,38)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2407,47)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2407,62)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2407,63)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2409,35)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2412,35)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2412,61)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2412,63)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4687,19)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4687,20)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4688,16)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4761,32)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4764,32)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4765,78)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4770,74)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4774,39)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4780,39)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4825,44)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4825,54)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4825,55)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4825,56)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4825,70)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4825,71)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,99)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,102)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,103)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,128)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,129)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,130)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,150)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,151)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,152)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,156)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,157)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,158)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,99)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,102)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,103)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,106)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,108)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,110)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,111)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,112)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,113)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,114)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,115)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,116)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,117)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,128)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,129)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,130)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4829,128)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4829,129)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4829,130)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4830,106)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4830,110)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4830,129)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4830,130)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4830,140)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4830,143)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4830,158)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4830,281)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4830,324)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4831,106)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4831,108)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4831,129)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4831,130)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4831,146)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4831,152)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4831,155)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4832,207)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4832,213)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4832,219)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4833,47)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4833,48)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4833,49)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4833,77)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4833,103)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4833,104)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4833,106)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4833,107)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4834,215)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4834,216)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4834,217)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,62)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,65)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,70)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,75)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,94)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,99)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,102)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,108)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,123)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,126)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,195)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,235)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4839,180)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4839,183)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4839,188)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4839,193)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4839,213)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4839,216)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4839,222)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4839,225)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4841,77)$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4841,102)$ & $\bm{Z}/2\bm{Z}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5641,3)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5831,5)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5831,6)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5831,7)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5832,5)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5832,6)$ & $\bm{Z}/2\bm{Z}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5832,7)$ & $\bm{Z}/2\bm{Z}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5852,4)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5852,5)$ & $\bm{Z}/2\bm{Z}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5852,6)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,13)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,5645,3)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,13)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,5834,9)$ & $\bm{Z}/2\bm{Z}$\\
$(16,13)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,5842,10)$ & $\bm{Z}/2\bm{Z}$\\
$(16,13)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,5842,12)$ & $\bm{Z}/2\bm{Z}$\\
$(16,13)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,5842,13)$ & $\bm{Z}/2\bm{Z}$\\
$(16,13)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,5842,24)$ & $\bm{Z}/2\bm{Z}$\\
$(16,13)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,5844,9)$ & $\bm{Z}/2\bm{Z}$\\
$(16,13)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,5844,13)$ & $\bm{Z}/2\bm{Z}$\\
$(16,13)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,5846,23)$ & $\bm{Z}/2\bm{Z}$\\
$(16,13)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,5847,17)$ & $\bm{Z}/2\bm{Z}$\\
$(24,3)$ & $SL_2(\bm{F}_3)$ & $(6,6737,2)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(24,6)$ & $D_{12}$ & $(6,233,36)$ & $\bm{Z}/2\bm{Z}$\\
$(24,6)$ & $D_{12}$ & $(6,234,23)$ & $\bm{Z}/2\bm{Z}$\\
$(24,8)$ & $(C_6 \times C_2) \rtimes C_2$ & $(6,225,11)$ & $\bm{Z}/2\bm{Z}$\\
$(24,8)$ & $(C_6 \times C_2) \rtimes C_2$ & $(6,225,37)$ & $\bm{Z}/2\bm{Z}$\\
$(24,8)$ & $(C_6 \times C_2) \rtimes C_2$ & $(6,235,11)$ & $\bm{Z}/2\bm{Z}$\\
$(24,8)$ & $(C_6 \times C_2) \rtimes C_2$ & $(6,236,24)$ & $\bm{Z}/2\bm{Z}$\\
$(24,10)$ & $D_4 \times C_3$ & $(6,199,11)$ & $\bm{Z}/2\bm{Z}$\\
$(24,10)$ & $D_4 \times C_3$ & $(6,200,11)$ & $\bm{Z}/2\bm{Z}$\\
$(24,12)$ & $S_4$ & $(6,5518,3)$ & $\bm{Z}/2\bm{Z}$\\
$(24,12)$ & $S_4$ & $(6,5518,7)$ & $\bm{Z}/2\bm{Z}$\\
$(27,4)$ & $C_9 \rtimes C_3$ & $(6,2865,1)$ & $\bm{Z}/3\bm{Z}$\\
$(27,4)$ & $C_9 \rtimes C_3$ & $(6,2865,3)$ & $\bm{Z}/3\bm{Z}$\\
$(32,2)$ & $(C_4 \times C_2) \rtimes C_4$ & $(6,2646,5)$ & $\bm{Z}/2\bm{Z}$\\
$(32,2)$ & $(C_4 \times C_2) \rtimes C_4$ & $(6,2652,5)$ & $\bm{Z}/2\bm{Z}$\\
$(32,2)$ & $(C_4 \times C_2) \rtimes C_4$ & $(6,2659,12)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5907,26)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5907,27)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5908,4)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5908,18)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5908,21)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5908,22)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5908,35)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5909,25)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5909,28)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5909,31)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5910,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5910,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5910,26)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5910,31)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5910,32)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5910,38)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,6323,9)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,6324,2)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,6324,9)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,6324,13)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,6339,3)$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,6339,7)$ & $\bm{Z}/2\bm{Z}$\\
$(32,7)$ & $(C_8 \rtimes C_2) \rtimes C_2$ & $(6,5924,4)$ & $\bm{Z}/2\bm{Z}$\\
$(32,7)$ & $(C_8 \rtimes C_2) \rtimes C_2$ & $(6,5924,10)$ & $\bm{Z}/2\bm{Z}$\\
$(32,7)$ & $(C_8 \rtimes C_2) \rtimes C_2$ & $(6,6325,2)$ & $\bm{Z}/2\bm{Z}$\\
$(32,7)$ & $(C_8 \rtimes C_2) \rtimes C_2$ & $(6,6325,5)$ & $\bm{Z}/2\bm{Z}$\\
$(32,7)$ & $(C_8 \rtimes C_2) \rtimes C_2$ & $(6,6325,12)$ & $\bm{Z}/2\bm{Z}$\\
$(32,7)$ & $(C_8 \rtimes C_2) \rtimes C_2$ & $(6,6342,10)$ & $\bm{Z}/2\bm{Z}$\\
$(32,10)$ & $Q_8 \rtimes C_4$ & $(6,6329,2)$ & $\bm{Z}/2\bm{Z}$\\
$(32,10)$ & $Q_8 \rtimes C_4$ & $(6,6329,3)$ & $\bm{Z}/2\bm{Z}$\\
$(32,10)$ & $Q_8 \rtimes C_4$ & $(6,6347,2)$ & $\bm{Z}/2\bm{Z}$\\
$(32,10)$ & $Q_8 \rtimes C_4$ & $(6,6347,3)$ & $\bm{Z}/2\bm{Z}$\\
$(32,11)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,5962,11)$ & $\bm{Z}/2\bm{Z}$\\
$(32,11)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,5966,5)$ & $\bm{Z}/2\bm{Z}$\\
$(32,11)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,6337,5)$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2434,60)$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2435,65)$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2438,71)$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2438,75)$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2439,58)$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2439,61)$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2439,64)$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2450,58)$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2450,61)$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2450,64)$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2517,45)$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2648,26)$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2658,26)$ & $\bm{Z}/2\bm{Z}$\\
$(32,23)$ & $(C_4 \rtimes C_4)\times C_2$ & $(6,2455,19)$ & $\bm{Z}/2\bm{Z}$\\
$(32,23)$ & $(C_4 \rtimes C_4)\times C_2$ & $(6,2455,22)$ & $\bm{Z}/2\bm{Z}$\\
$(32,23)$ & $(C_4 \rtimes C_4)\times C_2$ & $(6,2455,25)$ & $\bm{Z}/2\bm{Z}$\\
$(32,23)$ & $(C_4 \rtimes C_4)\times C_2$ & $(6,2516,38)$ & $\bm{Z}/2\bm{Z}$\\
$(32,23)$ & $(C_4 \rtimes C_4)\times C_2$ & $(6,2645,12)$ & $\bm{Z}/2\bm{Z}$\\
$(32,25)$ & $D_4 \times C_4$ & $(6,2445,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,25)$ & $D_4 \times C_4$ & $(6,2445,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,25)$ & $D_4 \times C_4$ & $(6,2445,25)$ & $\bm{Z}/2\bm{Z}$\\
$(32,25)$ & $D_4 \times C_4$ & $(6,2447,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,25)$ & $D_4 \times C_4$ & $(6,2447,45)$ & $\bm{Z}/2\bm{Z}$\\
$(32,25)$ & $D_4 \times C_4$ & $(6,2461,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,25)$ & $D_4 \times C_4$ & $(6,2465,16)$ & $\bm{Z}/2\bm{Z}$\\
$(32,25)$ & $D_4 \times C_4$ & $(6,2468,19)$ & $\bm{Z}/2\bm{Z}$\\
$(32,26)$ & $Q_8 \times C_4$ & $(6,6326,4)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2471,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2471,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2471,25)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2471,41)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2471,52)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2471,71)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2471,72)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2471,114)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2471,118)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2472,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2472,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2472,25)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2472,41)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2472,53)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2483,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2483,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2483,25)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2483,38)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2483,47)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2483,62)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2483,63)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2483,79)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2484,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2484,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2484,74)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2484,80)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2484,82)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2490,84)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2490,87)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2490,90)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2491,81)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2491,84)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2491,87)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2492,58)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2492,61)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2492,64)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2492,81)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2492,84)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2492,87)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2492,108)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2492,114)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2496,58)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2496,61)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2496,64)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2498,73)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2498,76)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2500,44)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2500,50)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2500,52)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2500,66)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2500,68)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2500,70)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2500,71)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2662,52)$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2662,64)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2469,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2469,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2469,25)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2469,41)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2469,53)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2470,103)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2470,106)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2470,109)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2478,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2478,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2478,25)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2480,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2480,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2480,25)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2481,100)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2481,103)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2481,106)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2482,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2482,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2482,77)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2482,80)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2482,100)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2482,103)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2482,106)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2487,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2487,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2487,74)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2487,80)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2487,82)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2488,12)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2488,25)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2489,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2489,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2489,25)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2489,45)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2489,53)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2505,45)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2505,48)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2505,51)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2506,71)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2506,75)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2506,77)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2508,16)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2508,22)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2508,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2508,68)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2508,71)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2508,74)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2508,75)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2508,76)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2508,77)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2509,16)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2509,22)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2509,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2509,48)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2509,51)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2660,4)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2664,8)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,4701,7)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,6350,11)$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,6352,7)$ & $\bm{Z}/2\bm{Z}$\\
$(32,29)$ & $(Q_8 \times C_2) \rtimes C_2$ & $(6,6343,7)$ & $\bm{Z}/2\bm{Z}$\\
$(32,29)$ & $(Q_8 \times C_2) \rtimes C_2$ & $(6,6343,9)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(32,29)$ & $(Q_8 \times C_2) \rtimes C_2$ & $(6,6346,3)$ & $\bm{Z}/2\bm{Z}$\\
$(32,29)$ & $(Q_8 \times C_2) \rtimes C_2$ & $(6,6346,5)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(32,29)$ & $(Q_8 \times C_2) \rtimes C_2$ & $(6,6346,6)$ & $\bm{Z}/2\bm{Z}$\\
$(32,30)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,6351,8)$ & $\bm{Z}/2\bm{Z}$\\
$(32,30)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,6351,13)$ & $\bm{Z}/2\bm{Z}$\\
$(32,31)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,6345,5)$ & $\bm{Z}/2\bm{Z}$\\
$(32,31)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,6345,6)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2476,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2476,24)$ & $\bm{Z}/2\bm{Z}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2476,25)$ & $\bm{Z}/2\bm{Z}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2486,23)$ & $\bm{Z}/2\bm{Z}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2486,25)$ & $\bm{Z}/2\bm{Z}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2486,74)$ & $\bm{Z}/2\bm{Z}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2486,80)$ & $\bm{Z}/2\bm{Z}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2502,15)$ & $\bm{Z}/2\bm{Z}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2504,32)$ & $\bm{Z}/2\bm{Z}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2504,37)$ & $\bm{Z}/2\bm{Z}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2512,38)$ & $\bm{Z}/2\bm{Z}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2512,40)$ & $\bm{Z}/2\bm{Z}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2512,42)$ & $\bm{Z}/2\bm{Z}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2512,43)$ & $\bm{Z}/2\bm{Z}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2651,5)$ & $\bm{Z}/2\bm{Z}$\\
$(32,35)$ & $C_4 \rtimes Q_8$ & $(6,6344,4)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5946,4)$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5947,4)$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5949,4)$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5949,5)$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5949,6)$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5956,5)$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5956,6)$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5957,5)$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5957,6)$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5958,5)$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5959,5)$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,6354,9)$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,6354,10)$ & $\bm{Z}/2\bm{Z}$\\
$(32,43)$ & $(D_4 \times C_2) \rtimes C_2$ & $(6,5919,11)$ & $\bm{Z}/2\bm{Z}$\\
$(32,43)$ & $(D_4 \times C_2) \rtimes C_2$ & $(6,5926,5)$ & $\bm{Z}/2\bm{Z}$\\
$(32,43)$ & $(D_4 \times C_2) \rtimes C_2$ & $(6,5938,11)$ & $\bm{Z}/2\bm{Z}$\\
$(32,43)$ & $(D_4 \times C_2) \rtimes C_2$ & $(6,5939,6)$ & $\bm{Z}/2\bm{Z}$\\
$(32,43)$ & $(D_4 \times C_2) \rtimes C_2$ & $(6,6341,2)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,2432,38)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,2442,47)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,2442,49)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4849,153)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4849,156)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4849,159)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4850,102)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4850,207)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4853,47)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4853,48)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4853,49)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4853,102)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4853,103)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4853,104)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4853,105)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4853,106)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4853,107)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4856,215)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4856,216)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4856,217)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4870,200)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4870,205)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4870,209)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4871,102)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4872,112)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4873,112)$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4877,151)$ & $\bm{Z}/2\bm{Z}$\\
$(32,47)$ & $Q_8 \times C_2 \times C_2$ & $(6,5941,4)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(32,47)$ & $Q_8 \times C_2 \times C_2$ & $(6,5941,5)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(32,47)$ & $Q_8 \times C_2 \times C_2$ & $(6,5941,6)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(48,29)$ & $GL_2(\bm{F}_3)$ & $(6,6901,2)$ & $\bm{Z}/2\bm{Z}$\\
$(48,29)$ & $GL_2(\bm{F}_3)$ & $(6,6901,4)$ & $\bm{Z}/2\bm{Z}$\\
$(48,32)$ & $SL_2(\bm{F}_3) \times C_2$ & $(6,6880,2)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(48,33)$ & $SL_2(\bm{F}_3) \rtimes C_2$ & $(6,6888,2)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(48,38)$ & $D_4 \times S_3$ & $(6,367,24)$ & $\bm{Z}/2\bm{Z}$\\
$(48,38)$ & $D_4 \times S_3$ & $(6,368,24)$ & $\bm{Z}/2\bm{Z}$\\
$(48,48)$ & $S_4 \times C_2$ & $(6,5531,6)$ & $\bm{Z}/2\bm{Z}$\\
$(54,6)$ & $(C_9 \rtimes C_3) \rtimes C_2$ & $(6,2899,3)$ & $\bm{Z}/3\bm{Z}$\\
$(54,6)$ & $(C_9 \rtimes C_3) \rtimes C_2$ & $(6,2899,5)$ & $\bm{Z}/3\bm{Z}$\\
$(64,23)$ & $(C_4 \times C_2 \times C_2) \rtimes C_4$ & $(6,6411,9)$ & $\bm{Z}/2\bm{Z}$\\
$(64,23)$ & $(C_4 \times C_2 \times C_2) \rtimes C_4$ & $(6,6449,7)$ & $\bm{Z}/2\bm{Z}$\\
$(64,32)$ & $((C_8 \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6067,17)$ & $\bm{Z}/2\bm{Z}$\\
$(64,32)$ & $((C_8 \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6069,11)$ & $\bm{Z}/2\bm{Z}$\\
$(64,32)$ & $((C_8 \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6069,18)$ & $\bm{Z}/2\bm{Z}$\\
$(64,32)$ & $((C_8 \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6069,25)$ & $\bm{Z}/2\bm{Z}$\\
$(64,32)$ & $((C_8 \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6474,7)$ & $\bm{Z}/2\bm{Z}$\\
$(64,32)$ & $((C_8 \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6474,10)$ & $\bm{Z}/2\bm{Z}$\\
$(64,34)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6056,11)$ & $\bm{Z}/2\bm{Z}$\\
$(64,34)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6071,17)$ & $\bm{Z}/2\bm{Z}$\\
$(64,60)$ & $(C_2 \times ((C_4 \times C_2) \rtimes C_2)) \rtimes C_2$ & $(6,2694,34)$ & $\bm{Z}/2\bm{Z}$\\
$(64,66)$ & $(C_2 \times (C_4 \rtimes C_4)) \rtimes C_2$ & $(6,2679,14)$ & $\bm{Z}/2\bm{Z}$\\
$(64,67)$ & $(C_4 \times C_2 \times C_2 \times C_2) \rtimes C_2$ & $(6,2683,23)$ & $\bm{Z}/2\bm{Z}$\\
$(64,67)$ & $(C_4 \times C_2 \times C_2 \times C_2) \rtimes C_2$ & $(6,2693,35)$ & $\bm{Z}/2\bm{Z}$\\
$(64,73)$ & $(D_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2702,23)$ & $\bm{Z}/2\bm{Z}$\\
$(64,73)$ & $(D_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2702,54)$ & $\bm{Z}/2\bm{Z}$\\
$(64,73)$ & $(D_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2703,50)$ & $\bm{Z}/2\bm{Z}$\\
$(64,75)$ & $(C_2 \times ((C_4 \times C_2) \rtimes C_2)) \rtimes C_2$ & $(6,2705,35)$ & $\bm{Z}/2\bm{Z}$\\
$(64,75)$ & $(C_2 \times ((C_4 \times C_2) \rtimes C_2)) \rtimes C_2$ & $(6,2706,14)$ & $\bm{Z}/2\bm{Z}$\\
$(64,77)$ & $(C_2 \times (C_4 \rtimes C_4)) \rtimes C_2$ & $(6,2708,3)$ & $\bm{Z}/2\bm{Z}$\\
$(64,90)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2)\times C_2$ & $(6,6018,22)$ & $\bm{Z}/2\bm{Z}$\\
$(64,90)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2)\times C_2$ & $(6,6020,20)$ & $\bm{Z}/2\bm{Z}$\\
$(64,90)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2)\times C_2$ & $(6,6031,22)$ & $\bm{Z}/2\bm{Z}$\\
$(64,90)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2)\times C_2$ & $(6,6031,25)$ & $\bm{Z}/2\bm{Z}$\\
$(64,90)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2)\times C_2$ & $(6,6035,24)$ & $\bm{Z}/2\bm{Z}$\\
$(64,90)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2)\times C_2$ & $(6,6035,25)$ & $\bm{Z}/2\bm{Z}$\\
$(64,90)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2)\times C_2$ & $(6,6035,26)$ & $\bm{Z}/2\bm{Z}$\\
$(64,90)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2)\times C_2$ & $(6,6412,6)$ & $\bm{Z}/2\bm{Z}$\\
$(64,90)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2)\times C_2$ & $(6,6451,18)$ & $\bm{Z}/2\bm{Z}$\\
$(64,90)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2)\times C_2$ & $(6,6451,21)$ & $\bm{Z}/2\bm{Z}$\\
$(64,119)$ & $QD_8 \times C_4$ & $(6,6424,4)$ & $\bm{Z}/2\bm{Z}$\\
$(64,129)$ & $(Q_8 \times C_2 \times C_2) \rtimes C_2$ & $(6,6445,6)$ & $\bm{Z}/2\bm{Z}$\\
$(64,129)$ & $(Q_8 \times C_2 \times C_2) \rtimes C_2$ & $(6,6445,8)$ & $\bm{Z}/2\bm{Z}$\\
$(64,129)$ & $(Q_8 \times C_2 \times C_2) \rtimes C_2$ & $(6,6445,9)$ & $\bm{Z}/2\bm{Z}$\\
$(64,131)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6444,7)$ & $\bm{Z}/2\bm{Z}$\\
$(64,131)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6466,7)$ & $\bm{Z}/2\bm{Z}$\\
$(64,134)$ & $((C_4 \times C_4) \rtimes C_2) \rtimes C_2$ & $(6,6060,11)$ & $\bm{Z}/2\bm{Z}$\\
$(64,134)$ & $((C_4 \times C_4) \rtimes C_2) \rtimes C_2$ & $(6,6072,5)$ & $\bm{Z}/2\bm{Z}$\\
$(64,134)$ & $((C_4 \times C_4) \rtimes C_2) \rtimes C_2$ & $(6,6080,5)$ & $\bm{Z}/2\bm{Z}$\\
$(64,138)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6063,5)$ & $\bm{Z}/2\bm{Z}$\\
$(64,138)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6063,23)$ & $\bm{Z}/2\bm{Z}$\\
$(64,138)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6065,11)$ & $\bm{Z}/2\bm{Z}$\\
$(64,138)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6065,25)$ & $\bm{Z}/2\bm{Z}$\\
$(64,138)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6065,31)$ & $\bm{Z}/2\bm{Z}$\\
$(64,138)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6078,9)$ & $\bm{Z}/2\bm{Z}$\\
$(64,138)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6078,22)$ & $\bm{Z}/2\bm{Z}$\\
$(64,138)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6078,23)$ & $\bm{Z}/2\bm{Z}$\\
$(64,138)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2) \rtimes C_2$ & $(6,6079,24)$ & $\bm{Z}/2\bm{Z}$\\
$(64,141)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6441,4)$ & $\bm{Z}/2\bm{Z}$\\
$(64,142)$ & $(Q_8 \rtimes C_4) \rtimes C_2$ & $(6,6443,4)$ & $\bm{Z}/2\bm{Z}$\\
$(64,144)$ & $(D_4 \times C_4) \rtimes C_2$ & $(6,6465,6)$ & $\bm{Z}/2\bm{Z}$\\
$(64,146)$ & $(C_8 \times C_2 \times C_2) \rtimes C_2$ & $(6,6440,8)$ & $\bm{Z}/2\bm{Z}$\\
%$(64,149)$ & $(C_2 \times (C_8 \rtimes C_2)) \rtimes C_2$ & $(6,6459,8)$ & $\bm{Z}/2\bm{Z}$\\
$(64,173)$ & $(C_8 \times C_4) \rtimes C_2$ & $(6,6442,4)$ & $\bm{Z}/2\bm{Z}$\\
%$(64,177)$ & $(D_8 \times C_2) \rtimes C_2$ & $(6,6464,6)$ & $\bm{Z}/2\bm{Z}$\\
$(64,202)$ & $((C_2)^4 \rtimes C_2)\times C_2$ & $(6,2543,45)$ & $\bm{Z}/2\bm{Z}$\\
$(64,202)$ & $((C_2)^4 \rtimes C_2)\times C_2$ & $(6,2553,58)$ & $\bm{Z}/2\bm{Z}$\\
$(64,202)$ & $((C_2)^4 \rtimes C_2)\times C_2$ & $(6,2553,61)$ & $\bm{Z}/2\bm{Z}$\\
$(64,202)$ & $((C_2)^4 \rtimes C_2)\times C_2$ & $(6,2553,64)$ & $\bm{Z}/2\bm{Z}$\\
$(64,203)$ & $((C_4 \times C_2 \times C_2) \rtimes C_2)\times C_2$ & $(6,2537,60)$ & $\bm{Z}/2\bm{Z}$\\
$(64,203)$ & $((C_4 \times C_2 \times C_2) \rtimes C_2)\times C_2$ & $(6,2560,19)$ & $\bm{Z}/2\bm{Z}$\\
$(64,203)$ & $((C_4 \times C_2 \times C_2) \rtimes C_2)\times C_2$ & $(6,2560,22)$ & $\bm{Z}/2\bm{Z}$\\
$(64,203)$ & $((C_4 \times C_2 \times C_2) \rtimes C_2)\times C_2$ & $(6,2560,25)$ & $\bm{Z}/2\bm{Z}$\\
$(64,203)$ & $((C_4 \times C_2 \times C_2) \rtimes C_2)\times C_2$ & $(6,2695,20)$ & $\bm{Z}/2\bm{Z}$\\
$(64,215)$ & $(D_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,6454,15)$ & $\bm{Z}/2\bm{Z}$\\
$(64,226)$ & $D_4 \times D_4$ & $(6,2566,52)$ & $\bm{Z}/2\bm{Z}$\\
$(64,226)$ & $D_4 \times D_4$ & $(6,2566,100)$ & $\bm{Z}/2\bm{Z}$\\
$(64,226)$ & $D_4 \times D_4$ & $(6,2568,23)$ & $\bm{Z}/2\bm{Z}$\\
$(64,226)$ & $D_4 \times D_4$ & $(6,2568,24)$ & $\bm{Z}/2\bm{Z}$\\
$(64,226)$ & $D_4 \times D_4$ & $(6,2568,25)$ & $\bm{Z}/2\bm{Z}$\\
$(64,226)$ & $D_4 \times D_4$ & $(6,2575,102)$ & $\bm{Z}/2\bm{Z}$\\
$(64,226)$ & $D_4 \times D_4$ & $(6,2578,103)$ & $\bm{Z}/2\bm{Z}$\\
$(64,226)$ & $D_4 \times D_4$ & $(6,2582,45)$ & $\bm{Z}/2\bm{Z}$\\
$(64,230)$ & $Q_8 \times D_4$ & $(6,6428,4)$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(64,251)$ & $QD_8 \times C_2 \times C_2$ & $(6,6044,4)$ & $\bm{Z}/2\bm{Z}$\\
$(64,251)$ & $QD_8 \times C_2 \times C_2$ & $(6,6044,5)$ & $\bm{Z}/2\bm{Z}$\\
$(96,3)$ & $((C_4 \times C_2) \rtimes C_4) \rtimes C_3$ & $(6,2792,3)$ & $\bm{Z}/2\bm{Z}$\\
$(96,64)$ & $((C_4 \times C_4) \rtimes C_3) \rtimes C_2$ & $(6,2802,4)$ & $\bm{Z}/2\bm{Z}$\\
$(96,72)$ & $((C_4 \times C_4) \rtimes C_3) \rtimes C_2$ & $(6,2799,5)$ & $\bm{Z}/2\bm{Z}$\\
$(96,187)$ & $(C_2 \times S_4) \rtimes C_2$ & $(6,5198,27)$ & $\bm{Z}/2\bm{Z}$\\
$(96,187)$ & $(C_2 \times S_4) \rtimes C_2$ & $(6,5200,27)$ & $\bm{Z}/2\bm{Z}$\\
$(96,189)$ & $GL_2(\bm{F}_3) \times C_2$ & $(6,7081,2)$ & $\bm{Z}/2\bm{Z}$\\
$(96,193)$ & $(SL_2(\bm{F}_3) \rtimes C_2) \rtimes C_2$ & $(6,7079,2)$ & $\bm{Z}/2\bm{Z}$\\
$(96,195)$ & $(A_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,5189,19)$ & $\bm{Z}/2\bm{Z}$\\
$(96,195)$ & $(A_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,5192,19)$ & $\bm{Z}/2\bm{Z}$\\
$(96,195)$ & $(A_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,5196,27)$ & $\bm{Z}/2\bm{Z}$\\
$(96,195)$ & $(A_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,5197,27)$ & $\bm{Z}/2\bm{Z}$\\
$(96,197)$ & $D_4 \times A_4$ & $(6,5155,19)$ & $\bm{Z}/2\bm{Z}$\\
$(96,197)$ & $D_4 \times A_4$ & $(6,5156,19)$ & $\bm{Z}/2\bm{Z}$\\
$(128,513)$ & $(C_2 \times (((C_4 \times C_2) \rtimes C_2) \rtimes C_2)) \rtimes C_2$ & $(6,6145,8)$ & $\bm{Z}/2\bm{Z}$\\
$(128,630)$ & $(C_2 \times C_2 \times ((C_4 \times C_2) \rtimes C_2)) \rtimes C_2$ & $(6,6148,15)$ & $\bm{Z}/2\bm{Z}$\\
$(128,753)$ & $(C_2 \times (((C_4 \times C_2) \rtimes C_2) \rtimes C_2)) \rtimes C_2$ & $(6,6200,7)$ & $\bm{Z}/2\bm{Z}$\\
$(128,753)$ & $(C_2 \times (((C_4 \times C_2) \rtimes C_2) \rtimes C_2)) \rtimes C_2$ & $(6,6201,20)$ & $\bm{Z}/2\bm{Z}$\\
$(128,928)$ & $(D_4 \times D_4) \rtimes C_2$ & $(6,5775,11)$ & $\bm{Z}/2\bm{Z}$\\
$(128,928)$ & $(D_4 \times D_4) \rtimes C_2$ & $(6,5775,24)$ & $\bm{Z}/2\bm{Z}$\\
$(128,928)$ & $(D_4 \times D_4) \rtimes C_2$ & $(6,5782,17)$ & $\bm{Z}/2\bm{Z}$\\
$(128,928)$ & $(D_4 \times D_4) \rtimes C_2$ & $(6,5789,11)$ & $\bm{Z}/2\bm{Z}$\\
$(128,1142)$ & $(D_4 \times C_2 \times C_2\times C_2) \rtimes C_2$ & $(6,2619,23)$ & $\bm{Z}/2\bm{Z}$\\
$(128,2013)$ & $QD_8 \times D_4$ & $(6,6167,4)$ & $\bm{Z}/2\bm{Z}$\\
$(192,197)$ & $(((C_4 \times C_2) \rtimes C_4) \rtimes C_3) \rtimes C_2$ & $(6,2729,6)$ & $\bm{Z}/2\bm{Z}$\\
$(192,1472)$ & $D_4 \times S_4$ & $(6,5060,27)$ & $\bm{Z}/2\bm{Z}$\\
$(192,1472)$ & $D_4 \times S_4$ & $(6,5069,27)$ & $\bm{Z}/2\bm{Z}$\\
\hline
%\end{tabular}
\end{longtable}

Table $3$-$1$-$2$: $M$ is indecomposable of rank $6$ ($12$ cases with $H_u^2(G,\bm{Q}/\bm{Z})\neq 0$)
\vspace*{-5mm}\\
%\begin{tabular}{lllllll}
\begin{longtable}{llllllll}
\hline
$G(n,i)$ & $G$ & CARAT ID & $H_u^2(G,\bm{Q}/\bm{Z})$ & $H_u^2(G,M)$\\\hline
$(64,149)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6459,2)$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,149)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6459,4)$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,149)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6459,6)$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,149)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6459,8)$ & $\bm{Z}/2\bm{Z}$ & $\bm{Z}/2\bm{Z}$\\
$(64,150)$ & $(D_8 \times C_2) \rtimes C_2$ & $(6,6458,2)$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,150)$ & $(D_8 \times C_2) \rtimes C_2$ & $(6,6458,4)$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,150)$ & $(D_8 \times C_2) \rtimes C_2$ & $(6,6458,6)$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,150)$ & $(D_8 \times C_2) \rtimes C_2$ & $(6,6458,8)$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,177)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6464,2)$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,177)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6464,4)$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,177)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6464,6)$ & $\bm{Z}/2\bm{Z}$ & $\bm{Z}/2\bm{Z}$\\
$(64,177)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6464,8)$ & $\bm{Z}/2\bm{Z}$ & $0$\\
\end{longtable}

Table $3$-$2$: $M=M_1\oplus M_2$ is decomposable of rank $6=5+1$
and $M_1$ is in Table $2$-$1$ ($161$ cases with $H_u^2(G,\bm{Q}/\bm{Z})=0$)\vspace*{-2mm}\\
\begin{longtable}{lllllll}
\hline
$G(n,i)$ & $G$ & CARAT ID & $M_1\oplus M_2$\quad $(G_i=G|_{M_i})$& $[|G_1|,|G_2|]$ & $H_u^2(G,M)$\\\hline
$(8,3)$ & $D_4$ & $(6,4682,3)$ & $(5,39,5)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4691,4)$ & $(5,39,5)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4692,5)$ & $(5,39,5)\oplus\bm{Z}$ & $[8,1]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4809,12)$ & $(5,100,12)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4809,19)$ & $(5,100,23)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4809,53)$ & $(5,100,12)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4809,64)$ & $(5,100,23)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4810,19)$ & $(5,99,23)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4810,22)$ & $(5,99,24)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4810,25)$ & $(5,99,25)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4812,19)$ & $(5,99,23)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4812,22)$ & $(5,99,25)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4812,25)$ & $(5,99,24)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4813,12)$ & $(5,100,12)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4813,19)$ & $(5,100,23)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4814,23)$ & $(5,99,23)\oplus\bm{Z}$ & $[8,1]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4814,24)$ & $(5,99,24)\oplus\bm{Z}$ & $[8,1]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4814,25)$ & $(5,99,25)\oplus\bm{Z}$ & $[8,1]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,23)$ & $(5,100,12)\oplus\bm{Z}$ & $[8,1]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,41)$ & $(5,99,23)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,51)$ & $(5,99,24)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,61)$ & $(5,99,25)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,83)$ & $(5,100,23)\oplus\bm{Z}$ & $[8,1]$ & $\bm{Z}/2\bm{Z}$\\
$(8,4)$ & $Q_8$ & $(6,5750,2)$ & $(5,773,4)\oplus\bm{Z}$ & $[8,1]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(8,4)$ & $Q_8$ & $(6,5751,2)$ & $(5,774,4)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,4)$ & $Q_8$ & $(6,6100,2)$ & $(5,773,4)\oplus\bm{Z}^-$ & $[8,2]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(8,4)$ & $Q_8$ & $(6,6100,3)$ & $(5,774,4)\oplus\bm{Z}$ & $[8,1]$ & $\bm{Z}/2\bm{Z}$\\
$(8,4)$ & $Q_8$ & $(6,6101,2)$ & $(5,774,4)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2322,4)$ & $(5,118,18)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2323,16)$ & $(5,116,20)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2336,16)$ & $(5,109,5)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2400,76)$ & $(5,116,20)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2400,103)$ & $(5,118,18)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2401,47)$ & $(5,116,20)\oplus\bm{Z}$ & $[16,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2403,8)$ & $(5,118,18)\oplus\bm{Z}$ & $[16,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2404,27)$ & $(5,116,20)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2415,10)$ & $(5,109,5)\oplus\bm{Z}$ & $[16,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2421,10)$ & $(5,109,5)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2424,57)$ & $(5,109,5)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,2332,12)$ & $(5,105,5)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,2418,10)$ & $(5,105,5)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,2419,10)$ & $(5,105,5)\oplus\bm{Z}$ & $[16,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,2420,37)$ & $(5,105,5)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5649,2)$ & $(5,672,2)\oplus\bm{Z}$ & $[16,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5650,2)$ & $(5,673,2)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5839,2)$ & $(5,672,2)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5839,3)$ & $(5,673,2)\oplus\bm{Z}$ & $[16,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5848,2)$ & $(5,672,2)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5849,2)$ & $(5,673,2)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5850,2)$ & $(5,673,2)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5851,2)$ & $(5,672,2)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2326,14)$ & $(5,119,4)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2405,39)$ & $(5,119,4)\oplus\bm{Z}$ & $[16,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2407,10)$ & $(5,119,4)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2412,53)$ & $(5,119,4)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4687,10)$ & $(5,39,5)\times\{\pm 1\}$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4761,19)$ & $(5,76,49)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4761,22)$ & $(5,76,50)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4761,25)$ & $(5,76,51)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4764,19)$ & $(5,76,49)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4764,22)$ & $(5,76,51)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4764,25)$ & $(5,76,50)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4765,65)$ & $(5,79,18)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4770,62)$ & $(5,73,37)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4773,19)$ & $(5,71,19)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4774,23)$ & $(5,71,19)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4774,57)$ & $(5,71,19)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4778,47)$ & $(5,79,18)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4780,23)$ & $(5,76,49)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4780,24)$ & $(5,76,51)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4780,25)$ & $(5,76,50)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4785,16)$ & $(5,73,37)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4825,16)$ & $(5,71,19)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,31)$ & $(5,99,23)\times\{\pm 1\}$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,51)$ & $(5,99,24)\times\{\pm 1\}$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,60)$ & $(5,99,25)\times\{\pm 1\}$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,97)$ & $(5,76,49)\oplus\bm{Z}$ & $[16,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,100)$ & $(5,76,51)\oplus\bm{Z}$ & $[16,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,101)$ & $(5,76,50)\oplus\bm{Z}$ & $[16,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,12)$ & $(5,100,12)\times\{\pm 1\}$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,31)$ & $(5,100,23)\times\{\pm 1\}$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,97)$ & $(5,76,49)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,100)$ & $(5,76,50)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,101)$ & $(5,76,51)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4829,31)$ & $(5,71,19)\oplus\bm{Z}$ & $[16,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4830,31)$ & $(5,71,19)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4830,78)$ & $(5,73,37)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4830,230)$ & $(5,71,19)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4831,31)$ & $(5,71,19)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4831,54)$ & $(5,79,18)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4832,178)$ & $(5,73,37)\oplus\bm{Z}$ & $[16,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4833,43)$ & $(5,76,49)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4833,44)$ & $(5,76,51)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4833,45)$ & $(5,76,50)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4833,63)$ & $(5,73,37)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4834,152)$ & $(5,79,18)\oplus\bm{Z}$ & $[16,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,34)$ & $(5,76,49)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,43)$ & $(5,76,50)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,51)$ & $(5,76,51)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,181)$ & $(5,79,18)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4839,152)$ & $(5,76,49)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4839,161)$ & $(5,76,50)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4839,166)$ & $(5,79,18)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4839,169)$ & $(5,76,51)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4841,51)$ & $(5,73,37)\oplus\bm{Z}^-$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5641,2)$ & $(5,664,2)\oplus\bm{Z}^-$ & $[16,2]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5831,2)$ & $(5,773,4)\times\{\pm 1\}$ & $[8,2]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5831,3)$ & $(5,664,2)\oplus\bm{Z}$ & $[16,1]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5832,2)$ & $(5,664,2)\oplus\bm{Z}^-$ & $[16,2]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5832,3)$ & $(5,774,4)\times\{\pm 1\}$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5852,2)$ & $(5,664,2)\oplus\bm{Z}^-$ & $[16,2]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5678,7)$ & $(5,704,3)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5679,4)$ & $(5,706,8)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5907,17)$ & $(5,704,3)\oplus\bm{Z}$ & $[32,1]$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5908,14)$ & $(5,706,8)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5909,18)$ & $(5,706,8)\oplus\bm{Z}$ & $[32,1]$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5910,17)$ & $(5,704,3)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,6)$ & $((C_4 \times C_2) \rtimes C_2) \rtimes C_2$ & $(6,5910,19)$ & $(5,706,8)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2438,66)$ & $(5,118,18)\times\{\pm 1\}$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2439,47)$ & $(5,116,20)\times\{\pm 1\}$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,22)$ & $((C_4 \times C_2) \rtimes C_2)\times C_2$ & $(6,2450,47)$ & $(5,109,5)\times\{\pm 1\}$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,23)$ & $(C_4 \rtimes C_4)\times C_2$ & $(6,2455,8)$ & $(5,105,5)\times\{\pm 1\}$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2352,23)$ & $(5,142,14)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2471,112)$ & $(5,142,14)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2472,39)$ & $(5,142,14)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2484,68)$ & $(5,142,14)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2490,73)$ & $(5,142,14)\oplus\bm{Z}$ & $[32,1]$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2492,47)$ & $(5,142,14)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2496,47)$ & $(5,142,14)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2500,38)$ & $(5,142,14)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2359,19)$ & $(5,140,23)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2469,39)$ & $(5,140,23)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2470,92)$ & $(5,140,23)\oplus\bm{Z}$ & $[32,1]$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2487,68)$ & $(5,140,23)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2488,8)$ & $(5,140,23)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2505,34)$ & $(5,140,23)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2508,10)$ & $(5,140,23)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2509,10)$ & $(5,140,23)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5694,2)$ & $(5,721,2)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5946,2)$ & $(5,721,2)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5947,2)$ & $(5,721,2)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5949,2)$ & $(5,721,2)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5956,2)$ & $(5,672,2)\times\{\pm 1\}$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5956,3)$ & $(5,721,2)\oplus\bm{Z}$ & $[32,1]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5957,2)$ & $(5,673,2)\times\{\pm 1\}$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5957,3)$ & $(5,721,2)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5958,3)$ & $(5,721,2)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5959,3)$ & $(5,721,2)\oplus\bm{Z}^-$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,2442,39)$ & $(5,119,4)\times\{\pm 1\}$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4849,62)$ & $(5,71,19)\times\{\pm 1\}$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4853,43)$ & $(5,76,49)\times\{\pm 1\}$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4853,44)$ & $(5,76,50)\times\{\pm 1\}$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4853,45)$ & $(5,76,51)\times\{\pm 1\}$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4856,152)$ & $(5,79,18)\times\{\pm 1\}$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4870,169)$ & $(5,73,37)\times\{\pm 1\}$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,47)$ & $Q_8 \times C_2 \times C_2$ & $(6,5941,2)$ & $(5,664,2)\times\{\pm 1\}$ & $[16,2]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(64,90)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2)\times C_2$ & $(6,6031,17)$ & $(5,704,3)\times\{\pm 1\}$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(64,90)$ & $(((C_4 \times C_2) \rtimes C_2) \rtimes C_2)\times C_2$ & $(6,6035,14)$ & $(5,706,8)\times\{\pm 1\}$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(64,202)$ & $((C_2)^4 \rtimes C_2)\times C_2$ & $(6,2553,47)$ & $(5,142,14)\times\{\pm 1\}$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(64,203)$ & $((C_4 \times C_2 \times C_2) \rtimes C_2)\times C_2$ & $(6,2560,8)$ & $(5,140,23)\times\{\pm 1\}$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
$(64,251)$ & $QD_8\times C_2 \times C_2$ & $(6,6044,2)$ & $(5,721,2)\times\{\pm 1\}$ & $[32,2]$ & $\bm{Z}/2\bm{Z}$\\
\hline
\end{longtable}

Table $3$-$3$-$1$: $M=M_1\oplus M_2$ is decomposable of rank $6=4+2$
and $M_1$ is not in Table $1$ ($27$ cases with $H_u^2(G,\bm{Q}/\bm{Z})=0$)\
\vspace*{-2mm}\\
%\begin{tabular}{lllllll}
\begin{longtable}{lllllll}
\hline
$G(n,i)$ & $G$ & CARAT ID & $M_1\oplus M_2$\quad $(G_i=G|_{M_i})$& $[|G_1|,|G_2|]$ & $H_u^2(G,M)$\\\hline
$(8,3)$ & $D_4$ & $(6,4892,57)$ & $(4,5,1,12)\oplus(2,3,2,1)$ & $[4,8]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,95)$ & $(4,5,1,12)\oplus(2,3,2,1)$ & $[4,8]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,107)$ & $(4,5,1,12)\oplus(2,3,2,1)$ & $[4,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2424,11)$ & $(4,12,2,6)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2424,58)$ & $(4,12,2,6)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2634,2)$ & $(4,18,1,3)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2634,15)$ & $(4,18,1,3)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,2418,11)$ & $(4,12,2,6)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,2633,2)$ & $(4,18,1,3)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4825,28)$ & $(4,5,2,8)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4825,36)$ & $(4,5,2,8)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4825,42)$ & $(4,5,2,8)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,105)$ & $(4,6,2,10)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,107)$ & $(4,6,2,10)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,109)$ & $(4,6,2,10)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4830,109)$ & $(4,6,2,10)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4830,280)$ & $(4,6,2,10)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4831,107)$ & $(4,6,2,10)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,61)$ & $(4,5,2,8)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,194)$ & $(4,5,2,8)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4841,75)$ & $(4,5,2,8)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2471,40)$ & $(4,12,5,10)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2471,113)$ & $(4,12,5,10)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2483,5)$ & $(4,12,5,10)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2483,34)$ & $(4,12,5,10)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2488,5)$ & $(4,12,5,10)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2489,5)$ & $(4,12,5,10)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
\hline
\end{longtable}
%\end{tabular}

Table $3$-$3$-$2$: $M=M_1\oplus M_2$ is decomposable of rank $6=4+2$
and $M_1$ is in Table $1$ ($191$ cases with $H_u^2(G,\bm{Q}/\bm{Z})=0$)\
\vspace*{-2mm}\\
%\begin{tabular}{lllllll}
\begin{longtable}{lllllll}
\hline
$G(n,i)$ & $G$ & CARAT ID & $M_1\oplus M_2$\quad $(G_i=G|_{M_i})$& $[|G_1|,|G_2|]$ & $H_u^2(G,M)$\\\hline
$(8,3)$ & $D_4$ & $(6,4812,31)$ & $(4,12,4,12)\oplus(2,2,1,2)$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,86)$ & $(4,12,4,12)\oplus(2,2,1,2)$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4810,31)$ & $(4,12,4,12)\oplus(2,2,1,2)$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4809,31)$ & $(4,12,4,12)\oplus(2,2,2,2)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4749,10)$ & $(4,12,4,12)\oplus(2,2,2,2)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4813,31)$ & $(4,12,4,12)\oplus(2,2,2,2)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4691,10)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4691,26)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(8,4)$ & $Q_8$ & $(6,6100,4)$ & $(4,32,1,2)\oplus(2,2,1,2)$ & $[8,2]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(8,4)$ & $Q_8$ & $(6,6101,3)$ & $(4,32,1,2)\oplus(2,2,2,2)$ & $[8,4]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2421,5)$ & $(4,12,4,12)\oplus(2,3,1,1)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2424,5)$ & $(4,12,4,12)\oplus(2,3,1,1)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2400,71)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2404,53)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2404,30)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,3)$ & $(C_4 \times C_2) \rtimes C_2$ & $(6,2400,100)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,2420,32)$ & $(4,12,4,12)\oplus(2,3,1,1)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,6224,1)$ & $(4,32,1,2)\oplus(2,3,1,1)$ & $[8,4]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,4)$ & $C_4 \rtimes C_4$ & $(6,6225,1)$ & $(4,32,1,2)\oplus(2,3,2,1)$ & $[8,8]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,8)$ & $QD_8$ & $(6,5848,4)$ & $(4,32,3,2)\oplus(2,2,1,2)$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5839,4)$ & $(4,32,3,2)\oplus(2,2,1,2)$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5851,4)$ & $(4,32,3,2)\oplus(2,2,1,2)$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5850,4)$ & $(4,32,3,2)\oplus(2,2,2,2)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5840,4)$ & $(4,32,3,2)\oplus(2,2,2,2)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5849,4)$ & $(4,32,3,2)\oplus(2,2,2,2)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,6226,1)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,6226,5)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,98)$ & $(4,12,4,12)\times(2,2,1,2)$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4761,31)$ & $(4,12,4,12)\oplus(2,2,2,2)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4839,176)$ & $(4,12,4,12)\oplus(2,2,2,2)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,98)$ & $(4,12,4,12)\oplus(2,2,2,2)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,58)$ & $(4,12,4,12)\oplus(2,2,2,2)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4764,31)$ & $(4,12,4,12)\oplus(2,2,2,2)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4833,46)$ & $(4,12,4,12)\oplus(2,2,2,2)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2407,34)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,2407,5)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5831,4)$ & $(4,32,1,2)\times(2,2,1,2)$ & $[8,2]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5832,4)$ & $(4,32,1,2)\oplus(2,2,2,2)$ & $[8,4]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5852,3)$ & $(4,32,1,2)\oplus(2,2,2,2)$ & $[8,4]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(24,3)$ & $SL_2(\bm{F}_3)$ & $(6,6737,1)$ & $(4,33,3,1)\oplus(2,4,1,1)$ & $[24,3]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(24,4)$ & $C_3 \rtimes Q_8$ & $(6,6740,1)$ & $(4,32,1,2)\oplus(2,4,2,1)$ & $[8,6]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(24,4)$ & $C_3 \rtimes Q_8$ & $(6,6740,3)$ & $(4,32,1,2)\oplus(2,4,2,2)$ & $[8,6]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(24,4)$ & $C_3 \rtimes Q_8$ & $(6,6741,1)$ & $(4,32,1,2)\oplus(2,4,4,1)$ & $[8,12]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(24,6)$ & $D_{12}$ & $(6,234,17)$ & $(4,12,4,12)\oplus(2,4,2,1)$ & $[8,6]$ & $\bm{Z}/2\bm{Z}$\\
$(24,6)$ & $D_{12}$ & $(6,234,37)$ & $(4,12,4,12)\oplus(2,4,2,2)$ & $[8,6]$ & $\bm{Z}/2\bm{Z}$\\
$(24,6)$ & $D_{12}$ & $(6,233,11)$ & $(4,12,4,12)\oplus(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(24,6)$ & $D_{12}$ & $(6,233,30)$ & $(4,12,4,12)\oplus(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(24,8)$ & $(C_6 \times C_2) \rtimes C_2$ & $(6,235,5)$ & $(4,12,4,12)\oplus(2,4,2,1)$ & $[8,6]$ & $\bm{Z}/2\bm{Z}$\\
$(24,8)$ & $(C_6 \times C_2) \rtimes C_2$ & $(6,242,18)$ & $(4,12,4,12)\oplus(2,4,2,1)$ & $[8,6]$ & $\bm{Z}/2\bm{Z}$\\
$(24,8)$ & $(C_6 \times C_2) \rtimes C_2$ & $(6,235,31)$ & $(4,12,4,12)\oplus(2,4,2,2)$ & $[8,6]$ & $\bm{Z}/2\bm{Z}$\\
$(24,8)$ & $(C_6 \times C_2) \rtimes C_2$ & $(6,242,5)$ & $(4,12,4,12)\oplus(2,4,2,2)$ & $[8,6]$ & $\bm{Z}/2\bm{Z}$\\
$(24,8)$ & $(C_6 \times C_2) \rtimes C_2$ & $(6,225,31)$ & $(4,12,4,12)\oplus(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(24,8)$ & $(C_6 \times C_2) \rtimes C_2$ & $(6,236,5)$ & $(4,12,4,12)\oplus(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(24,8)$ & $(C_6 \times C_2) \rtimes C_2$ & $(6,236,18)$ & $(4,12,4,12)\oplus(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(24,8)$ & $(C_6 \times C_2) \rtimes C_2$ & $(6,225,5)$ & $(4,12,4,12)\oplus(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(24,10)$ & $D_4 \times C_3$ & $(6,207,5)$ & $(4,12,4,12)\times(2,4,1,1)$ & $[8,3]$ & $\bm{Z}/2\bm{Z}$\\
$(24,10)$ & $D_4 \times C_3$ & $(6,199,5)$ & $(4,12,4,12)\oplus(2,4,3,1)$ & $[8,6]$ & $\bm{Z}/2\bm{Z}$\\
$(24,10)$ & $D_4 \times C_3$ & $(6,206,5)$ & $(4,12,4,12)\oplus(2,4,3,1)$ & $[8,6]$ & $\bm{Z}/2\bm{Z}$\\
$(24,10)$ & $D_4 \times C_3$ & $(6,200,5)$ & $(4,12,4,12)\oplus(2,4,3,1)$ & $[8,6]$ & $\bm{Z}/2\bm{Z}$\\
$(24,11)$ & $Q_8 \times C_3$ & $(6,6738,1)$ & $(4,32,1,2)\times(2,4,1,1)$ & $[8,3]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(24,11)$ & $Q_8 \times C_3$ & $(6,6739,1)$ & $(4,32,1,2)\oplus(2,4,3,1)$ & $[8,6]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(32,9)$ & $(C_8 \times C_2) \rtimes C_2$ & $(6,6333,4)$ & $(4,32,3,2)\oplus(2,3,1,1)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,9)$ & $(C_8 \times C_2) \rtimes C_2$ & $(6,6355,6)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,9)$ & $(C_8 \times C_2) \rtimes C_2$ & $(6,6355,8)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,10)$ & $Q_8 \rtimes C_4$ & $(6,6329,1)$ & $(4,32,3,2)\oplus(2,3,1,1)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,10)$ & $Q_8 \rtimes C_4$ & $(6,6347,1)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,10)$ & $Q_8 \rtimes C_4$ & $(6,6347,4)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,13)$ & $C_8 \rtimes C_4$ & $(6,6334,3)$ & $(4,32,3,2)\oplus(2,3,1,1)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,25)$ & $D_4 \times C_4$ & $(6,2445,5)$ & $(4,12,4,12)\times(2,3,1,1)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,26)$ & $Q_8 \times C_4$ & $(6,6326,3)$ & $(4,32,1,2)\times(2,3,1,1)$ & $[8,4]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2472,34)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2472,5)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2471,34)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,27)$ & $(C_2)^4 \rtimes C_2$ & $(6,2471,5)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2478,5)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2480,5)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2469,34)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,28)$ & $(C_4 \times C_2 \times C_2) \rtimes C_2$ & $(6,2469,5)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,29)$ & $(Q_8 \times C_2) \rtimes C_2$ & $(6,6343,6)$ & $(4,32,1,2)\oplus(2,3,2,1)$ & $[8,8]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(32,29)$ & $(Q_8 \times C_2) \rtimes C_2$ & $(6,6343,8)$ & $(4,32,1,2)\oplus(2,3,2,1)$ & $[8,8]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(32,34)$ & $(C_4 \times C_4) \rtimes C_2$ & $(6,2476,5)$ & $(4,12,4,12)\oplus(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,35)$ & $C_4 \rtimes Q_8$ & $(6,6344,3)$ & $(4,32,1,2)\oplus(2,3,2,1)$ & $[8,8]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5956,4)$ & $(4,32,3,2)\oplus(2,2,1,2)$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5959,4)$ & $(4,32,3,2)\oplus(2,2,2,2)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5946,3)$ & $(4,32,3,2)\oplus(2,2,2,2)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5957,4)$ & $(4,32,3,2)\oplus(2,2,2,2)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5949,3)$ & $(4,32,3,2)\oplus(2,2,2,2)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5958,4)$ & $(4,32,3,2)\oplus(2,2,2,2)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5947,3)$ & $(4,32,3,2)\oplus(2,2,2,2)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,6354,8)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,6354,6)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4853,46)$ & $(4,12,4,12)\times(2,2,2,2)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,47)$ & $Q_8 \times C_2 \times C_2$ & $(6,5941,3)$ & $(4,32,1,2)\times(2,2,2,2)$ & $[8,4]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(48,6)$ & $C_{24} \rtimes C_2$ & $(6,6915,3)$ & $(4,32,3,2)\oplus(2,4,2,1)$ & $[16,6]$ & $\bm{Z}/2\bm{Z}$\\
$(48,6)$ & $C_{24} \rtimes C_2$ & $(6,6915,1)$ & $(4,32,3,2)\oplus(2,4,2,2)$ & $[16,6]$ & $\bm{Z}/2\bm{Z}$\\
$(48,6)$ & $C_{24} \rtimes C_2$ & $(6,6914,1)$ & $(4,32,3,2)\oplus(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(48,6)$ & $C_{24} \rtimes C_2$ & $(6,6914,3)$ & $(4,32,3,2)\oplus(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(48,16)$ & $(C_3 \rtimes C_8) \rtimes C_2$ & $(6,6912,3)$ & $(4,32,3,2)\oplus(2,4,2,1)$ & $[16,6]$ & $\bm{Z}/2\bm{Z}$\\
$(48,16)$ & $(C_3 \rtimes C_8) \rtimes C_2$ & $(6,6912,1)$ & $(4,32,3,2)\oplus(2,4,2,2)$ & $[16,6]$ & $\bm{Z}/2\bm{Z}$\\
$(48,16)$ & $(C_3 \rtimes C_8) \rtimes C_2$ & $(6,6913,1)$ & $(4,32,3,2)\oplus(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(48,16)$ & $(C_3 \rtimes C_8) \rtimes C_2$ & $(6,6913,3)$ & $(4,32,3,2)\oplus(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(48,17)$ & $(Q_8 \times C_3) \rtimes C_2$ & $(6,6918,3)$ & $(4,32,3,2)\oplus(2,4,2,1)$ & $[16,6]$ & $\bm{Z}/2\bm{Z}$\\
$(48,17)$ & $(Q_8 \times C_3) \rtimes C_2$ & $(6,6918,1)$ & $(4,32,3,2)\oplus(2,4,2,2)$ & $[16,6]$ & $\bm{Z}/2\bm{Z}$\\
$(48,17)$ & $(Q_8 \times C_3) \rtimes C_2$ & $(6,6919,3)$ & $(4,32,3,2)\oplus(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(48,17)$ & $(Q_8 \times C_3) \rtimes C_2$ & $(6,6919,1)$ & $(4,32,3,2)\oplus(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(48,26)$ & $QD_8 \times C_3$ & $(6,6891,1)$ & $(4,32,3,2)\oplus(2,4,1,1)$ & $[16,3]$ & $\bm{Z}/2\bm{Z}$\\
$(48,26)$ & $QD_8 \times C_3$ & $(6,6894,1)$ & $(4,32,3,2)\oplus(2,4,3,1)$ & $[16,6]$ & $\bm{Z}/2\bm{Z}$\\
$(48,26)$ & $QD_8 \times C_3$ & $(6,6892,1)$ & $(4,32,3,2)\oplus(2,4,3,1)$ & $[16,6]$ & $\bm{Z}/2\bm{Z}$\\
$(48,26)$ & $QD_8 \times C_3$ & $(6,6893,1)$ & $(4,32,3,2)\oplus(2,4,3,1)$ & $[16,6]$ & $\bm{Z}/2\bm{Z}$\\
$(48,29)$ & $GL_2(\bm{F}_3)$ & $(6,6004,2)$ & $(4,33,6,1)\oplus(2,2,1,2)$ & $[48,2]$ & $\bm{Z}/2\bm{Z}$\\
$(48,29)$ & $GL_2(\bm{F}_3)$ & $(6,6901,1)$ & $(4,33,6,1)\oplus(2,4,2,1)$ & $[48,6]$ & $\bm{Z}/2\bm{Z}$\\
$(48,29)$ & $GL_2(\bm{F}_3)$ & $(6,6901,3)$ & $(4,33,6,1)\oplus(2,4,2,2)$ & $[48,6]$ & $\bm{Z}/2\bm{Z}$\\
$(48,32)$ & $SL_2(\bm{F}_3) \times C_2$ & $(6,6002,2)$ & $(4,33,3,1)\times(2,2,1,2)$ & $[24,2]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(48,32)$ & $SL_2(\bm{F}_3) \times C_2$ & $(6,6880,1)$ & $(4,33,3,1)\oplus(2,4,3,1)$ & $[24,6]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(48,34)$ & $(C_3 \rtimes Q_8) \times C_2$ & $(6,6898,1)$ & $(4,32,1,2)\oplus(2,4,4,1)$ & $[8,12]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(48,36)$ & $D_{12} \times C_2$ & $(6,420,5)$ & $(4,12,4,12)\oplus(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(48,38)$ & $D_4 \times S_3$ & $(6,424,5)$ & $(4,12,4,12)\times(2,4,2,1)$ & $[8,6]$ & $\bm{Z}/2\bm{Z}$\\
$(48,38)$ & $D_4 \times S_3$ & $(6,424,18)$ & $(4,12,4,12)\times(2,4,2,2)$ & $[8,6]$ & $\bm{Z}/2\bm{Z}$\\
$(48,38)$ & $D_4 \times S_3$ & $(6,367,18)$ & $(4,12,4,12)\oplus(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(48,38)$ & $D_4 \times S_3$ & $(6,367,5)$ & $(4,12,4,12)\oplus(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(48,38)$ & $D_4 \times S_3$ & $(6,425,18)$ & $(4,12,4,12)\oplus(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(48,38)$ & $D_4 \times S_3$ & $(6,425,5)$ & $(4,12,4,12)\oplus(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(48,38)$ & $D_4 \times S_3$ & $(6,368,18)$ & $(4,12,4,12)\oplus(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(48,38)$ & $D_4 \times S_3$ & $(6,368,5)$ & $(4,12,4,12)\oplus(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(48,40)$ & $Q_8 \times S_3$ & $(6,6897,1)$ & $(4,32,1,2)\times(2,4,2,1)$ & $[8,6]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(48,40)$ & $Q_8 \times S_3$ & $(6,6897,3)$ & $(4,32,1,2)\times(2,4,2,2)$ & $[8,6]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(48,40)$ & $Q_8 \times S_3$ & $(6,6899,3)$ & $(4,32,1,2)\oplus(2,4,4,1)$ & $[8,12]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(48,40)$ & $Q_8 \times S_3$ & $(6,6899,1)$ & $(4,32,1,2)\oplus(2,4,4,1)$ & $[8,12]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(48,43)$ & $((C_6 \times C_2) \rtimes C_2) \times C_2$ & $(6,410,5)$ & $(4,12,4,12)\oplus(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(48,43)$ & $((C_6 \times C_2) \rtimes C_2) \times C_2$ & $(6,428,5)$ & $(4,12,4,12)\oplus(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(48,45)$ & $D_4 \times C_6$ & $(6,283,5)$ & $(4,12,4,12)\times(2,4,3,1)$ & $[8,6]$ & $\bm{Z}/2\bm{Z}$\\
$(48,46)$ & $Q_8 \times C_6$ & $(6,6881,1)$ & $(4,32,1,2)\times(2,4,3,1)$ & $[8,6]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(64,119)$ & $QD_8 \times C_4$ & $(6,6424,3)$ & $(4,32,3,2)\times(2,3,1,1)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(64,129)$ & $(Q_8 \times C_2 \times C_2) \rtimes C_2$ & $(6,6445,7)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(64,129)$ & $(Q_8 \times C_2 \times C_2) \rtimes C_2$ & $(6,6445,5)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(64,131)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6444,8)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(64,131)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6444,6)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(64,141)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6441,3)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(64,142)$ & $(Q_8 \rtimes C_4) \rtimes C_2$ & $(6,6443,3)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(64,146)$ & $(C_8 \times C_2 \times C_2) \rtimes C_2$ & $(6,6440,5)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(64,146)$ & $(C_8 \times C_2 \times C_2) \rtimes C_2$ & $(6,6440,7)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(64,173)$ & $(C_8 \times C_4) \rtimes C_2$ & $(6,6442,3)$ & $(4,32,3,2)\oplus(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(64,226)$ & $D_4 \times D_4$ & $(6,2568,5)$ & $(4,12,4,12)\times(2,3,2,1)$ & $[8,8]$ & $\bm{Z}/2\bm{Z}$\\
$(64,230)$ & $Q_8 \times D_4$ & $(6,6428,3)$ & $(4,32,1,2)\times(2,3,2,1)$ & $[8,8]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(64,251)$ & $QD_8\times C_2 \times C_2$ & $(6,6044,3)$ & $(4,32,3,2)\oplus(2,2,2,2)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(72,25)$ & $SL_2(\bm{F}_3) \times C_3$ & $(6,6977,1)$ & $(4,33,3,1)\times(2,4,1,1)$ & $[24,3]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(96,66)$ & $SL_2(\bm{F}_3) \rtimes C_4$ & $(6,6521,1)$ & $(4,33,6,1)\oplus(2,3,1,1)$ & $[48,4]$ & $\bm{Z}/2\bm{Z}$\\
$(96,69)$ & $SL_2(\bm{F}_3) \times C_4$ & $(6,6519,1)$ & $(4,33,3,1)\times(2,3,1,1)$ & $[24,4]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(96,109)$ & $(C_{24} \rtimes C_2) \times C_2$ & $(6,7093,1)$ & $(4,32,3,2)\oplus(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(96,120)$ & $QD_8 \times S_3$ & $(6,7095,3)$ & $(4,32,3,2)\times(2,4,2,1)$ & $[16,6]$ & $\bm{Z}/2\bm{Z}$\\
$(96,120)$ & $QD_8 \times S_3$ & $(6,7095,1)$ & $(4,32,3,2)\times(2,4,2,2)$ & $[16,6]$ & $\bm{Z}/2\bm{Z}$\\
$(96,120)$ & $QD_8 \times S_3$ & $(6,7098,1)$ & $(4,32,3,2)\oplus(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(96,120)$ & $QD_8 \times S_3$ & $(6,7098,3)$ & $(4,32,3,2)\oplus(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(96,120)$ & $QD_8 \times S_3$ & $(6,7096,1)$ & $(4,32,3,2)\oplus(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(96,120)$ & $QD_8 \times S_3$ & $(6,7096,3)$ & $(4,32,3,2)\oplus(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(96,120)$ & $QD_8 \times S_3$ & $(6,7097,1)$ & $(4,32,3,2)\oplus(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(96,120)$ & $QD_8 \times S_3$ & $(6,7097,3)$ & $(4,32,3,2)\oplus(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(96,140)$ & $((C_3 \rtimes C_8) \rtimes C_2)\times C_2$ & $(6,7092,1)$ & $(4,32,3,2)\oplus(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(96,148)$ & $((Q_8 \times C_3) \rtimes C_2)\times C_2$ & $(6,7100,1)$ & $(4,32,3,2)\oplus(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(96,180)$ & $QD_8 \times C_6$ & $(6,7036,1)$ & $(4,32,3,2)\times(2,4,3,1)$ & $[16,6]$ & $\bm{Z}/2\bm{Z}$\\
$(96,189)$ & $GL_2(\bm{F}_3) \times C_2$ & $(6,6124,2)$ & $(4,33,6,1)\times(2,2,1,2)$ & $[48,2]$ & $\bm{Z}/2\bm{Z}$\\
$(96,189)$ & $GL_2(\bm{F}_3) \times C_2$ & $(6,6125,2)$ & $(4,33,6,1)\oplus(2,2,2,2)$ & $[48,4]$ & $\bm{Z}/2\bm{Z}$\\
$(96,189)$ & $GL_2(\bm{F}_3) \times C_2$ & $(6,6126,2)$ & $(4,33,6,1)\oplus(2,2,2,2)$ & $[48,4]$ & $\bm{Z}/2\bm{Z}$\\
$(96,189)$ & $GL_2(\bm{F}_3) \times C_2$ & $(6,7081,1)$ & $(4,33,6,1)\oplus(2,4,4,1)$ & $[48,12]$ & $\bm{Z}/2\bm{Z}$\\
$(96,198)$ & $SL_2(\bm{F}_3) \times C_2 \times C_2$ & $(6,6120,2)$ & $(4,33,3,1)\times(2,2,2,2)$ & $[24,4]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(96,209)$ & $D_4 \times S_3 \times C_2$ & $(6,570,5)$ & $(4,12,4,12)\times(2,4,4,1)$ & $[8,12]$ & $\bm{Z}/2\bm{Z}$\\
$(96,212)$ & $Q_8 \times S_3 \times C_2$ & $(6,7080,1)$ & $(4,32,1,2)\times(2,4,4,1)$ & $[8,12]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(128,2013)$ & $QD_8 \times D_4$ & $(6,6167,3)$ & $(4,32,3,2)\times(2,3,2,1)$ & $[16,8]$ & $\bm{Z}/2\bm{Z}$\\
$(144,122)$ & $GL_2(\bm{F}_3) \times C_3$ & $(6,6577,1)$ & $(4,33,6,1)\times(2,4,1,1)$ & $[48,3]$ & $\bm{Z}/2\bm{Z}$\\
$(144,122)$ & $GL_2(\bm{F}_3) \times C_3$ & $(6,6578,1)$ & $(4,33,6,1)\oplus(2,4,3,1)$ & $[48,6]$ & $\bm{Z}/2\bm{Z}$\\
$(144,125)$ & $(SL_2(\bm{F}_3) \times C_3) \rtimes C_2$ & $(6,6592,2)$ & $(4,33,6,1)\oplus(2,4,2,1)$ & $[48,6]$ & $\bm{Z}/2\bm{Z}$\\
$(144,125)$ & $(SL_2(\bm{F}_3) \times C_3) \rtimes C_2$ & $(6,6592,1)$ & $(4,33,6,1)\oplus(2,4,2,2)$ & $[48,6]$ & $\bm{Z}/2\bm{Z}$\\
$(144,128)$ & $SL_2(\bm{F}_3) \times S_3$ & $(6,6584,1)$ & $(4,33,3,1)\times(2,4,2,1)$ & $[24,6]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(144,128)$ & $SL_2(\bm{F}_3) \times S_3$ & $(6,6584,2)$ & $(4,33,3,1)\times(2,4,2,2)$ & $[24,6]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(144,156)$ & $SL_2(\bm{F}_3) \times C_6$ & $(6,6571,1)$ & $(4,33,3,1)\times(2,4,3,1)$ & $[24,6]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(192,951)$ & $GL_2(\bm{F}_3) \times C_4$ & $(6,6248,1)$ & $(4,33,6,1)\times(2,3,1,1)$ & $[48,4]$ & $\bm{Z}/2\bm{Z}$\\
$(192,952)$ & $(GL_2(\bm{F}_3)\times C_2) \rtimes C_2$ & $(6,6252,1)$ & $(4,33,6,1)\oplus(2,3,2,1)$ & $[48,8]$ & $\bm{Z}/2\bm{Z}$\\
$(192,980)$ & $(SL_2(\bm{F}_3)\times C_2 \times C_2) \rtimes C_2$ & $(6,6251,2)$ & $(4,33,6,1)\oplus(2,3,2,1)$ & $[48,8]$ & $\bm{Z}/2\bm{Z}$\\
$(192,980)$ & $(SL_2(\bm{F}_3)\times C_2 \times C_2) \rtimes C_2$ & $(6,6251,1)$ & $(4,33,6,1)\oplus(2,3,2,1)$ & $[48,8]$ & $\bm{Z}/2\bm{Z}$\\
$(192,1004)$ & $SL_2(\bm{F}_3) \times D_4$ & $(6,6246,1)$ & $(4,33,3,1)\times(2,3,2,1)$ & $[24,8]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(192,1317)$ & $QD_8 \times S_3 \times C_2$ & $(6,6714,1)$ & $(4,32,3,2)\times(2,4,4,1)$ & $[16,12]$ & $\bm{Z}/2\bm{Z}$\\
$(192,1475)$ & $GL_2(\bm{F}_3) \times C_2 \times C_2$ & $(6,5877,2)$ & $(4,33,6,1)\times(2,2,2,2)$ & $[48,4]$ & $\bm{Z}/2\bm{Z}$\\
$(288,851)$ & $GL_2(\bm{F}_3) \times S_3$ & $(6,6764,2)$ & $(4,33,6,1)\times(2,4,2,1)$ & $[48,6]$ & $\bm{Z}/2\bm{Z}$\\
$(288,851)$ & $GL_2(\bm{F}_3) \times S_3$ & $(6,6764,1)$ & $(4,33,6,1)\times(2,4,2,2)$ & $[48,6]$ & $\bm{Z}/2\bm{Z}$\\
$(288,851)$ & $GL_2(\bm{F}_3) \times S_3$ & $(6,6765,1)$ & $(4,33,6,1)\oplus(2,4,4,1)$ & $[48,12]$ & $\bm{Z}/2\bm{Z}$\\
$(288,851)$ & $GL_2(\bm{F}_3) \times S_3$ & $(6,6765,2)$ & $(4,33,6,1)\oplus(2,4,4,1)$ & $[48,12]$ & $\bm{Z}/2\bm{Z}$\\
$(288,900)$ & $GL_2(\bm{F}_3) \times C_6$ & $(6,6748,1)$ & $(4,33,6,1)\times(2,4,3,1)$ & $[48,6]$ & $\bm{Z}/2\bm{Z}$\\
$(288,911)$ & $((SL_2(\bm{F}_3) \times C_3) \rtimes C_2) \times C_2$ & $(6,6766,1)$ & $(4,33,6,1)\oplus(2,4,4,1)$ & $[48,12]$ & $\bm{Z}/2\bm{Z}$\\
$(288,922)$ & $SL_2(\bm{F}_3) \times S_3 \times C_2$ & $(6,6758,1)$ & $(4,33,3,1)\times(2,4,4,1)$ & $[24,12]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(384,17972)$ & $GL_2(\bm{F}_3) \times D_4$ & $(6,6380,1)$ & $(4,33,6,1)\times(2,3,2,1)$ & $[48,8]$ & $\bm{Z}/2\bm{Z}$\\
$(576,8325)$ & $GL_2(\bm{F}_3) \times S_3 \times C_2$ & $(6,6946,1)$ & $(4,33,6,1)\times(2,4,4,1)$ & $[48,12]$ & $\bm{Z}/2\bm{Z}$\\
\hline
%\end{tabular}
\end{longtable}

Table $3$-$3$-$3$: $M=M_1\oplus M_2$ is decomposable of rank $6=4+2$ ($12$ cases with $H_u^2(G,\bm{Q}/\bm{Z})\neq 0$)\vspace*{-2mm}\\
\begin{longtable}{lllllll}
\hline
$G(n,i)$ & $G$ & CARAT ID & $M_1\oplus M_2$\quad $(G_i=G|_{M_i})$& $[|G_1|,|G_2|]$ & $H_u^2(G,\bm{Q}/\bm{Z})$ & $H_u^2(G,M)$\\\hline
$(64,149)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6459,1)$ & $(4,32,6,1)\oplus(2,3,2,1)$ & $[32,8]$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,149)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6459,3)$ & $(4,32,6,1)\oplus(2,3,2,1)$ & $[32,8]$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,149)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6459,5)$ & $(4,32,6,2)\oplus(2,3,2,1)$ & $[32,8]$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,149)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6459,7)$ & $(4,32,6,2)\oplus(2,3,2,1)$ & $[32,8]$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,150)$ & $(D_8 \times C_2) \rtimes C_2$ & $(6,6458,1)$ & $(4,32,6,1)\oplus(2,3,2,1)$ & $[32,8]$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,150)$ & $(D_8 \times C_2) \rtimes C_2$ & $(6,6458,3)$ & $(4,32,6,1)\oplus(2,3,2,1)$ & $[32,8]$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,150)$ & $(D_8 \times C_2) \rtimes C_2$ & $(6,6458,5)$ & $(4,32,6,2)\oplus(2,3,2,1)$ & $[32,8]$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,150)$ & $(D_8 \times C_2) \rtimes C_2$ & $(6,6458,7)$ & $(4,32,6,2)\oplus(2,3,2,1)$ & $[32,8]$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,177)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6464,1)$ & $(4,32,6,1)\oplus(2,3,2,1)$ & $[32,8]$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,177)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6464,3)$ & $(4,32,6,1)\oplus(2,3,2,1)$ & $[32,8]$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,177)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6464,5)$ & $(4,32,6,2)\oplus(2,3,2,1)$ & $[32,8]$ & $\bm{Z}/2\bm{Z}$ & $0$\\
$(64,177)$ & $(QD_8 \times C_2) \rtimes C_2$ & $(6,6464,7)$ & $(4,32,6,2)\oplus(2,3,2,1)$ & $[32,8]$ & $\bm{Z}/2\bm{Z}$ & $0$\\
\end{longtable}

Table $3$-$4$: $M=M_1\oplus M_2$ is decomposable of rank $6=4+1+1$
and $M_1$ is in Table $1$ ($59$ cases with $H_u^2(G,\bm{Q}/\bm{Z})=0$)\
\vspace*{-2mm}\\
%\begin{tabular}{lllllll}
\begin{longtable}{lllllll}
\hline
$G(n,i)$ & $G$ & CARAT ID & $M_1\oplus M_2$\quad $(G_i=G|_{M_i})$& $[|G_1|,|G_2|]$ & $H_u^2(G,M)$\\\hline
$(8,3)$ & $D_4$ & $(6,4732,5)$ & $(4,12,4,12)\oplus(2,1,2,1)$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4735,5)$ & $(4,12,4,12)\oplus(2,1,2,1)$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4749,5)$ & $(4,12,4,12)\oplus(2,2,2,1)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4809,8)$ & $(4,12,4,12)\oplus(2,2,2,1)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4809,46)$ & $(4,12,4,12)\oplus(2,1,2,1)$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4810,8)$ & $(4,12,4,12)\oplus(2,2,1,1)$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4812,8)$ & $(4,12,4,12)\oplus(2,2,1,1)$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4813,8)$ & $(4,12,4,12)\oplus(2,2,2,1)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4814,5)$ & $(4,12,4,12)\oplus(2,1,1,1)$ & $[8,1]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,8)$ & $(4,12,4,12)\oplus(2,2,1,1)$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,4)$ & $Q_8$ & $(6,5750,1)$ & $(4,32,1,2)\oplus(2,1,1,1)$ & $[8,1]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(8,4)$ & $Q_8$ & $(6,5751,1)$ & $(4,32,1,2)\oplus(2,1,2,1)$ & $[8,2]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(8,4)$ & $Q_8$ & $(6,6100,1)$ & $(4,32,1,2)\oplus(2,2,1,1)$ & $[8,2]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(8,4)$ & $Q_8$ & $(6,6101,1)$ & $(4,32,1,2)\oplus(2,2,2,1)$ & $[8,4]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,8)$ & $QD_8$ & $(6,5649,1)$ & $(4,32,3,2)\oplus(2,1,1,1)$ & $[16,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5650,1)$ & $(4,32,3,2)\oplus(2,1,2,1)$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5651,1)$ & $(4,32,3,2)\oplus(2,1,2,1)$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5652,1)$ & $(4,32,3,2)\oplus(2,1,2,1)$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5839,1)$ & $(4,32,3,2)\oplus(2,2,1,1)$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5840,1)$ & $(4,32,3,2)\oplus(2,2,2,1)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5848,1)$ & $(4,32,3,2)\oplus(2,2,1,1)$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5849,1)$ & $(4,32,3,2)\oplus(2,2,2,1)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5850,1)$ & $(4,32,3,2)\oplus(2,2,2,1)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,8)$ & $QD_8$ & $(6,5851,1)$ & $(4,32,3,2)\oplus(2,2,1,1)$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4761,8)$ & $(4,12,4,12)\oplus(2,2,2,1)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4764,8)$ & $(4,12,4,12)\oplus(2,2,2,1)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4780,5)$ & $(4,12,4,12)\times(2,1,2,1)$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4827,10)$ & $(4,12,4,12)\times(2,2,1,1)$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,10)$ & $(4,12,4,12)\oplus(2,2,2,1)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4833,5)$ & $(4,12,4,12)\oplus(2,2,2,1)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4837,12)$ & $(4,12,4,12)\oplus(2,2,2,1)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4839,130)$ & $(4,12,4,12)\oplus(2,2,2,1)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5641,1)$ & $(4,32,1,2)\times(2,1,2,1)$ & $[8,2]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5831,1)$ & $(4,32,1,2)\times(2,2,1,1)$ & $[8,2]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5832,1)$ & $(4,32,1,2)\oplus(2,2,2,1)$ & $[8,4]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(16,12)$ & $Q_8 \times C_2$ & $(6,5852,1)$ & $(4,32,1,2)\oplus(2,2,2,1)$ & $[8,4]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(24,3)$ & $SL_2(\bm{F}_3)$ & $(6,5669,1)$ & $(4,33,3,1)\oplus(2,1,1,1)$ & $[24,1]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5694,1)$ & $(4,32,3,2)\times(2,1,2,1)$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5946,1)$ & $(4,32,3,2)\oplus(2,2,2,1)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5947,1)$ & $(4,32,3,2)\oplus(2,2,2,1)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5949,1)$ & $(4,32,3,2)\oplus(2,2,2,1)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5956,1)$ & $(4,32,3,2)\times(2,2,1,1)$ & $[16,2]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5957,1)$ & $(4,32,3,2)\oplus(2,2,2,1)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5958,1)$ & $(4,32,3,2)\oplus(2,2,2,1)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,40)$ & $QD_8 \times C_2$ & $(6,5959,1)$ & $(4,32,3,2)\oplus(2,2,2,1)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,46)$ & $D_4 \times C_2 \times C_2$ & $(6,4853,5)$ & $(4,12,4,12)\times(2,2,2,1)$ & $[8,4]$ & $\bm{Z}/2\bm{Z}$\\
$(32,47)$ & $Q_8 \times C_2 \times C_2$ & $(6,5941,1)$ & $(4,32,1,2)\times(2,2,2,1)$ & $[8,4]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(48,29)$ & $GL_2(\bm{F}_3)$ & $(6,5713,1)$ & $(4,33,6,1)\oplus(2,1,2,1)$ & $[48,2]$ & $\bm{Z}/2\bm{Z}$\\
$(48,29)$ & $GL_2(\bm{F}_3)$ & $(6,5714,1)$ & $(4,33,6,1)\oplus(2,1,1,1)$ & $[48,1]$ & $\bm{Z}/2\bm{Z}$\\
$(48,29)$ & $GL_2(\bm{F}_3)$ & $(6,6004,1)$ & $(4,33,6,1)\oplus(2,2,1,1)$ & $[48,2]$ & $\bm{Z}/2\bm{Z}$\\
$(48,32)$ & $SL_2(\bm{F}_3) \times C_2$ & $(6,5710,1)$ & $(4,33,3,1)\times(2,1,2,1)$ & $[24,2]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(48,32)$ & $SL_2(\bm{F}_3) \times C_2$ & $(6,6002,1)$ & $(4,33,3,1)\times(2,2,1,1)$ & $[24,2]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(64,251)$ & $QD_8 \times C_2 \times C_2$ & $(6,6044,1)$ & $(4,32,3,2)\times(2,2,2,1)$ & $[16,4]$ & $\bm{Z}/2\bm{Z}$\\
$(96,189)$ & $GL_2(\bm{F}_3) \times C_2$ & $(6,5755,1)$ & $(4,33,6,1)\times(2,1,2,1)$ & $[48,2]$ & $\bm{Z}/2\bm{Z}$\\
$(96,189)$ & $GL_2(\bm{F}_3) \times C_2$ & $(6,6124,1)$ & $(4,33,6,1)\times(2,2,1,1)$ & $[48,2]$ & $\bm{Z}/2\bm{Z}$\\
$(96,189)$ & $GL_2(\bm{F}_3) \times C_2$ & $(6,6125,1)$ & $(4,33,6,1)\oplus(2,2,2,1)$ & $[48,4]$ & $\bm{Z}/2\bm{Z}$\\
$(96,189)$ & $GL_2(\bm{F}_3) \times C_2$ & $(6,6126,1)$ & $(4,33,6,1)\oplus(2,2,2,1)$ & $[48,4]$ & $\bm{Z}/2\bm{Z}$\\
$(96,198)$ & $SL_2(\bm{F}_3) \times C_2 \times C_2$ & $(6,6120,1)$ & $(4,33,3,1)\times(2,2,2,1)$ & $[24,4]$ & $(\bm{Z}/2\bm{Z})^{\oplus 2}$\\
$(192,1475)$ & $GL_2(\bm{F}_3) \times C_2 \times C_2$ & $(6,5877,1)$ & $(4,33,6,1)\times(2,2,2,1)$ & $[48,4]$ & $\bm{Z}/2\bm{Z}$\\
\hline
%\end{tabular}
\end{longtable}

Table $3$-$5$: $M=M_1\oplus M_2$ is decomposable of rank $6=3+3$
and $M_1$ is in Table $1$ ($5$ case with $H_u^2(G,\bm{Q}/\bm{Z})=0$)\
\vspace*{-2mm}\\
%\begin{tabular}{lllllll}
\begin{longtable}{lllllll}
\hline
$G(n,i)$ & $G$ & CARAT ID & $M_1\oplus M_2$\quad $(G_i=G|_{M_i})$& $[|G_1|,|G_2|]$ & $H_u^2(G,M)$\\\hline
$(8,3)$ & $D_4$ & $(6,4809,28)$ & $(3,3,1,3)\oplus(3,4,6,3)$ & $[4,8]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4809,69)$ & $(3,3,1,3)\oplus(3,4,6,4)$ & $[4,8]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4813,28)$ & $(3,3,1,3)\oplus(3,4,4,2)$ & $[4,8]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,47)$ & $(3,3,1,3)\oplus(3,4,5,2)$ & $[4,8]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,104)$ & $(3,3,1,3)\oplus(3,4,7,2)$ & $[4,16]$ & $\bm{Z}/2\bm{Z}$\\
\hline
%\end{tabular}
\end{longtable}

Table $3$-$6$: $M=M_1\oplus M_2$ is decomposable of rank $6=3+2+1$
and $M_1$ is in Table $1$ ($5$ cases with $H_u^2(G,\bm{Q}/\bm{Z})=0$)\
\vspace*{-2mm}\\
%\begin{tabular}{lllllll}
\begin{longtable}{lllllll}
\hline
$G(n,i)$ & $G$ & CARAT ID & $M_1\oplus M_2$\quad $(G_i=G|_{M_i})$& $[|G_1|,|G_2|]$ & $H_u^2(G,M)$\\\hline
$(8,3)$ & $D_4$ & $(6,4809,11)$ & $(5,100,11)\oplus\bm{Z}^-$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4809,52)$ & $(5,100,11)\oplus\bm{Z}^-$ & $[8,2]$& $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4813,11)$ & $(5,100,11)\oplus\bm{Z}^-$ & $[8,2]$& $\bm{Z}/2\bm{Z}$\\
$(8,3)$ & $D_4$ & $(6,4892,22)$ & $(5,100,11)\oplus\bm{Z}$ & $[8,1]$ & $\bm{Z}/2\bm{Z}$\\
$(16,11)$ & $D_4 \times C_2$ & $(6,4828,11)$ & $(5,100,11)\times\{\pm 1\}$ & $[8,2]$ & $\bm{Z}/2\bm{Z}$\\
\hline
%\end{tabular}
\end{longtable}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

%\cchapter{Tables }
%\ssection{Tables}\label{tables}


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\begin{thebibliography}{BBFKKW}

\bibitem[AM]{AM}
M. Artin and D. Mumford,
\textit{Some elementary examples of unirational varieties which are not rational}, Proc. London Math. Soc. 25 (1972) 75--95.

\bibitem[Ba]{Ba1}
J. Barge,
\textit{Cohomologie des groupes et corps d'invariants multiplicatifs},
Math. Ann. 283 (1989) 519--528.

\bibitem[BBFKKW]{BBFKKW}
A. Betten, M. Braun, H. Fripertinger, A. Kerber, A. Kohnert, A. Wassermann,
\textit{Error-correcting linear codes. Classification by isometry and applications}, %With 1 CD-ROM (Windows and Linux).
Algorithms and Computation in Mathematics, 18. Springer-Verlag, Berlin, 2006.

\bibitem[BBNWZ]{BBNWZ}
H. Brown, R. B\"ullow, J. Neub\"user, H. Wondratschek and H. Zassenhaus,
\textit{Crystallographic Groups of Four-Dimensional Spaces},
John Wiley, New York, 1978.

\bibitem[Bo]{Bo}
F. A. Bogomolov,
\textit{The Brauer group of quotient spaces by linear group actions},
Math. USSR Izv. 30 (1988) 455--485.

\bibitem[BM07]{BM07}
G. Butler, J. McKay,
\textit{The transitive groups of degree up to eleven},
Comm. Algebra \textbf{11} (1983) 863--911.

\bibitem[CARAT]{CARAT}
J. Opgenorth, W. Plesken and T. Schulz,
CARAT, GAP 4 package, version 2.1b1, 2008,
available from {\tt http://wwwb.math.rwth-aachen.de/carat/}.

\bibitem[CHK]{CHK}
H. Chu, S.-J. Hu and M. Kang, \textit{Noether's problem for dihedral groups}, Comment. Math. Helv. 79 (2004) 147--159.

\bibitem[CHKK]{CHKK}
H. Chu, S.-J. Hu, M. Kang and B. E. Kunyavskii, \textit{Noether's
problem and the unramified Brauer group for groups of order 64},
Int. Math. Res. Not. IMRN 2010 2329--2366.

\bibitem[CHKP]{CHKP}
H. Chu, S.-J. Hu, M. Kang and Y. G. Prokhorov,
\textit{Noether's problem for groups of order 32},
J. Algebra 320 (2008) 3022--3035.

\bibitem[CK]{CK}
H. Chu and M. Kang, \textit{Rationality of $p$-group actions},
J. Algebra 237 (2001) 673--690.

\bibitem[CTO]{CTO}
J.-L. Colliot-Th\'el\`ene and M. Ojanguren,
{\it Vari\'et\'es unirationnelles non rationnelles: au-del\`a de l'example
d'Artin et Mumford}, Invent. Math. 97 (1989) 141--158.

\bibitem[CTS]{CTS}
J.-L. Colliot-Th\'el\`ene and J.-J. Sansuc,
\textit{La $R$-\'equivalence sur les tores},
Ann. Sci. \'Ecole Norm. Sup. (4) 10 (1977) 175--229.

\bibitem[DHW]{DHW}
K. Dekimpe, M. Hartl and S. Wauters,
\textit{A seven-term exact sequence for the cohomology of a group extension},
J. Algebra 369 (2012) 70--95.
Addendum %to "A seven-term exact sequence for the cohomology of a group extension'' [J. Algebra 369 (1) (2012) 70--95] [MR2959787].
J. Algebra 373 (2013) 439--440.

\bibitem[EM1]{EM1}
S. Endo and T. Miyata, \textit{Invariants of finite abelian
groups}, J. Math. Soc. Japan 25 (1973) 7--26.


\bibitem[EM2]{EM}
S. Endo and T. Miyata, \textit{On a classification of the function
fields of algebraic tori}, Nagoya Math. J. 56 (1975) 85--104.


\bibitem[Fi]{Fi}
E. Fischer,
{\it Die Isomorphie der Invariantenk\"orper der endlichen
Abel'schen Gruppen linearer Transformationen},
Nachr. K\"onigl. Ges. Wiss. G\"ottingen (1915) 77--80.

\bibitem[GAP]{GAP}
The GAP Group, GAP -- Groups, Algorithms, and Programming, Version
4.4.12, 2008 (http://www.gap-system.org).

\bibitem[Ha]{Ha} M. Hajja,
{\it Rationality of finite groups of monomial automorphisms of $k(x,y)$},
J. Algebra 109 (1987) 46--51.

\bibitem[HAP]{HAP}
G. Ellis, The GAP package HAP, available from
http://www.gap-system.org/Packages/hap.html.

\bibitem[HK1]{HK1}
M. Hajja and M. Kang, {\it Finite group actions on rational function fields}, J. Algebra 149 (1992) 139--154.

\bibitem[HK2]{HK2}
M. Hajja and M. Kang,
\textit{Three-dimensional purely monomial group actions},
J. Algebra 170 (1994) 805--860.

\bibitem[HS]{HS}
P. J. Hilton and U. Stammbach,
{\it A course in homological algebra},
Graduate Texts in Mathematics, Vol. 4. Springer-Verlag,
New York-Berlin, 1971. %ix+338 pp

\bibitem[HKK]{HKK}
A. Hoshi, M. Kang and H. Kitayama, \textit{Quasi-monomial actions and
some 4-dimensional rationality problem}, J. Algebra 403 (2014) 363--400.

\bibitem[HKKu]{HKKu}
A. Hoshi, M. Kang and B. E. Kunyavskii, \textit{Noether's problem and unramified Brauer groups},
Asian J. Math. 17 (2013) 689--714.

\bibitem[HKY]{HKY}
A. Hoshi, M. Kang and A. Yamasaki, \textit{Degree three unramified cohomology groups}, J. Algebra 458 (2016) 120--133.

\bibitem[HR]{HR}
A. Hoshi and Y. Rikuna, \textit{Rationality problem of three-dimensional
purely monomial group actions: the last case},
Math. Comp. 77 (2008) 1823--1829.

\bibitem[HY]{HY}
A. Hoshi and A. Yamasaki, \textit{Rationality problem for algebraic tori},
to appear in Mem. Amer. Math. Soc., arXiv: 1210.4525.

\bibitem[Hu]{Hu}
J. Huebschmann, \textit{Group extensions, crossed pairs and eight term exact sequence}, J. Reine Angew. Math. 321 (1981) 150--172.

\bibitem[Ka1]{Ka1}
M. Kang, \textit{Retract rationality and Noether's problem},
Int. Math. Res. Not. IMRN 2009 2760--2788.

\bibitem[Ka2]{Ka}
M. Kang, \textit{Retract rational fields}, J. Algebra 349 (2012) 22--37.

\bibitem[Ku]{Ku}
B. Kunyavskii, \textit{The Bogomolov multiplier of finite simple groups}, in ``Cohomological and geometric approaches to rationality problem", edied by F. Bogomolov and Y. Tschinkel, Birkhause, Boston, 2010.


\bibitem[Le]{Le}
H. W. Lenstra Jr.,
\textit{Rational functions invariant under a finite abelian group},
Invent. math. 25 (1974) 299--325.

\bibitem[Mo]{Mo}
P. Moravec,
{\it Unramified Brauer groups of finite and infinite groups},
Amer. J. Math. 134 (2012) 1679--170.

\bibitem[Pe]{Pe}
E. Peyre, \textit{Unramified cohomology of degree 3 and Noether's
problem}, Invent. Math. 171 (2008) 191--225.

\bibitem[PS]{PS}
W. Plesken and T. Schulz, \textit{Counting crystallographic groups in low dimension}, Exp. Math. 9 (2000) 407--411.

\bibitem[Sa1]{Sa5}
D. J. Saltman, \textit{Generic Galois extensions and problems in field theory}, Adv. Math. 43 (1982) 250--283.

\bibitem[Sa2]{Sa1}
D. J. Saltman, \textit{Noether's problem over an algebraically closed field}, Invent. Math. 77 (1984) 71--84.


\bibitem[Sa3]{Sa2}
D. J. Saltman, \textit{Retract rational fields and cyclic Galois extensions},
Israel J. Math. 47 (1984) 165--215.

\bibitem[Sa4]{Sa3}
D. J. Saltman, \textit{Multiplicative field invariants},
J. Algebra 106 (1987) 221--238.

\bibitem[Sa5]{Sa4}
D. J. Saltman, \textit{Multiplicaitive field invariants and the Brauer group},
J. Algebra 133 (1990) 533--544.

\bibitem[Se]{Se}
J-P. Serre, \textit{Local fields},
Springer GTM vol. 67, Springer-Verlag, Berlin, 1979.

\bibitem[Sw]{Sw}
R. G. Swan, {\it Noether's problem in Galois theory},
Emmy Noether in Bryn Mawr (Bryn Mawr, Pa., 1982), 21--40,
Springer, New York-Berlin, 1983.

\bibitem[Vo]{Vo}
V. E. Voskresenskii, \textit{Algebraic groups and their birational invariants},
Amer. Math. Soc. Transl. of Math. Monographs, vol. 179, Providence, 1998.
\end{thebibliography}
\end{document}


