Real-time collaboration for Jupyter Notebooks, Linux Terminals, LaTeX, VS Code, R IDE, and more,
all in one place.
Real-time collaboration for Jupyter Notebooks, Linux Terminals, LaTeX, VS Code, R IDE, and more,
all in one place.
| Download
GAP 4.8.9 installation with standard packages -- copy to your CoCalc project to get it
Project: cocalc-sagemath-dev-slelievre
Views: 418346%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%1%%2%W aclib.tex Karel Dekimpe3%W Bettina Eick4%%56%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%7\Chapter{The Almost Crystallographic Groups Package}89A group is called *almost crystallographic* if it is a finitely generated10nilpotent-by-finite group without non-trivial finite normal subgroups. An11important special case of almost crystallographic groups are the *almost12Bieberbach groups*: these are almost crystallographic and torsion free.1314By its definition, an almost crystallographic group $G$ has a finitely15generated nilpotent normal subgroup $N$ of finite index. Clearly, $N$ is16polycyclic and thus has a polycyclic series. The number of infinite cyclic17factors in such a series for $N$ is an invariant of $G$: the *Hirsch length*18of $G$.1920For each almost crystallographic group of Hirsch length 3 and 4 there exists21a representation as a rational matrix group in dimension 4 or 5, respectively.22These representations can be considered as affine representations of dimension233 or 4. Via these representations, the almost crystallographic groups act24(properly discontinuously) on $\R^3$ or $\R^4$. That is one reason to define25the *dimension* of an almost crystallographic group as its Hirsch length.2627The 3-dimensional and a part of the 4-dimensional almost crystallographic28groups have been classified by K. Dekimpe in \cite{KD}. This classification29includes all almost Bieberbach groups in dimension 3 and 4. It is the first30central aim of this package to give access to the resulting library of groups.31The groups in this electronic catalog are available in two different32representations: as rational matrix groups and as polycyclically presented33groups. While the first representation is the more natural one, the latter34description facilitates effective computations with the considered groups35using the methods of the {\sf Polycyclic} package.3637The second aim of this package is to introduce a variety of algorithms for38computations with polycyclically presented almost crystallographic groups.39These algorithms supplement the methods available in the {\sf Polycyclic}40package and give access to some methods which are interesting specifically41for almost crystallographic groups. In particular, we present methods to42compute Betti numbers and to construct or check the existence of certain43extensions of almost crystallographic groups. We note that these methods44have been applied in \cite{DE1} and \cite{DE2} for computations with45almost crystallographic groups.4647Finally, we remark that almost crystallographic groups can be seen as natural48generalizations of crystallographic groups. A library of crystallographic49groups and algorithms to compute with crystallographic groups are available50in the \GAP\ packages `cryst', `carat' and `crystcat'.5152%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%53\Section{More about almost crystallographic groups}5455Almost crystallographic groups were first discussed in the theory of56actions on Lie groups. We recall the original definition here briefly57and we refer to \cite{AUS}, \cite{KD} and \cite{LEE} for more details.5859Let $L$ be a connected and simply connected nilpotent Lie group. For60example, the 3-dimensional Heisenberg group, consisting of all upper61unitriangular $3\times3$--matrices with real entries is of this type.62Then $L\rtimes {\rm Aut}(L)$ acts affinely (on the left) on $L$ via63$$ \forall l,l'\in L,\forall \alpha \in {\rm Aut}(L):\;64^{(l,\alpha)}l'=l \, \alpha(l'). $$6566Let $C$ be a maximal compact subgroup of ${\rm Aut}(L)$. Then a subgroup $G$67of $L \rtimes C$ is said to be an almost crystallographic group if and only68if the action of $G$ on $L$, induced by the action of $L\rtimes {\rm Aut}(L)$,69is properly discontinuous and the quotient space $G \backslash L$ is compact.70One recovers the situation of the ordinary crystallographic groups by taking71$L={\Bbb R}^n$, for some $n$, and $C=O(n)$, the orthogonal group.7273More generally, we say that an abstract group is an almost crystallographic74group if it can be realized as a genuine almost crystallographic subgroup75of some $L \rtimes C$. In the following theorem we outline some algebraic76characterizations of almost crystallographic groups; see Theorem 3.1.3 of77\cite{KD}. Recall that the *Fitting subgroup Fitt$(G)$* of a78polycyclic-by-finite group $G$ is its unique maximal normal nilpotent79subgroup.8081\proclaim Theorem.82The following are equivalent for a polycyclic-by-finite group $G$:83\parindent 30pt84\item{(1)} $G$ is an almost crystallographic group.85\item{(2)} Fitt$(G)$ is torsion free and of finite index in $G$.86\item{(3)} $G$ contains a torsion free nilpotent normal subgroup $N$87of finite index in $G$ with $C_G(N)$ torsion free.88\item{(4)} $G$ has a nilpotent subgroup of finite index and there89are no non-trivial finite normal subgroups in $G$.90\medskip91\parindent 0pt9293In particular, if $G$ is almost crystallographic, then $G / Fitt(G)$94is finite. This factor is called the *holonomy group* of $G$.9596The dimension of an almost crystallographic group equals the dimension97of the Lie group $L$ above which coincides also with the Hirsch length98of the polycyclic-by-finite group. This library therefore contains99families of virtually nilpotent groups of Hirsch length 3 and 4.100101102103