v1.71

Author: grahamknockillaree

HowToUpdateHap.txt

@@ -0,0 +1,39 @@
+Change Test:=testquick.g, date and version in PackageInfo.g
+
+Change ~/Hap/date
+
+Change ~/Hap/version
+
+Run ./updateAll.sh
+
+Fix Undocumented.xml
+
+Run clean in ~/Hap/doc and in ~/Hap/doc/tutorial
+
+git clone https://github.com/gap-packages/hap.git
+
+cp -r pkg/Hap1.30/* hap
+
+rm hap/HowToUpdateHap.txt    THIS SEEMS TO BE IMPORTANT
+
+diff -r pkg/Hap1.30/ hap/
+
+cd hap and then
+
+ git add .
+ git commit -m "message"
+ git push origin master  [with username grahamknockillaree and passwd MumWon]
+
+ git clone --branch gh-pages  https://github.com/gap-packages/hap.git
+ 
+Rename the gh-pages directory from whatever it is called to gh-pages
+
+Populate gh-pages/doc  gh-pages/tutorial  gh-pages/www with most recent files (xml, html files, etc.)
+
+Make sure you have the latest Release Tools and then from within hap type
+
+../ReleaseTools/release-gap-package --token ghp_whateverthetokenis
+
+For some reason it may be necessary to perform the last command as root.
+
+That's it.

PackageInfo.g

@@ -8,8 +8,8 @@ SetPackageInfo( rec(
 
   PackageName := "HAP",
   Subtitle  := "Homological Algebra Programming",
-  Version := "1.70",
-  Date    := "19/07/2025",
+  Version := "1.71",
+  Date    := "21/12/2025",
   License := "GPL-2.0-or-later",
 
   SourceRepository := rec(

README.md

@@ -32,12 +32,12 @@ Please send your bug reports to graham.ellis(at)nuigalway.ie .
 On a Linux machine with GAP (and optionally Polymake) installed, the HAP
 library can be loaded as follows:
 
-* First download the file hap1.70.tar.gz to the subdirectory "pkg/" of GAP. (If
+* First download the file hap1.71.tar.gz to the subdirectory "pkg/" of GAP. (If
 you don't have access to this, then create a directory "pkg" in your home
 directory and download the file there.)
 
-* Change to directory "pkg/" and type "gunzip hap1.70.tar.gz" followed by
-"tar -xvf hap1.70.tar" .
+* Change to directory "pkg/" and type "gunzip hap1.71.tar.gz" followed by
+"tar -xvf hap1.71.tar" .
 
 * Start GAP. (If you have created "pkg" in your home directory then start GAP
 with the command "gap -l 'path/homedir;' "   where path/homedir is the path to
@@ -46,12 +46,12 @@ your home directory.)
 * In GAP type " LoadPackage("HAP"); " .
 
 * Help on HAP can be found on the HAP home page (a version of which is
-included in directory "pkg/Hap1.70/www" of this distribution).
+included in directory "pkg/Hap1.71/www" of this distribution).
 
 * Performance can be significantly improved by using a compiled version of the
 HAP library. A compiled version can be created by the following steps.
 
-1. Change to the directory "pkg/Hap1.70/" .
+1. Change to the directory "pkg/Hap1.71/" .
 2. Edit the file "compile" so that: PKGDIR is equal to the path to the
 directory "pkg" where your GAP packages are stored; GACDIR is equal to the
 path to the directory where the GAP compiler "gac" is stored.
@@ -60,4 +60,4 @@ path to the directory where the GAP compiler "gac" is stored.
 The next time HAP is loaded a compiled version will be loaded.
 
 * Should you want to return to an uncompiled version, change to the directory
-"pkg/Hap1.70/" and type "./uncompile".
+"pkg/Hap1.71/" and type "./uncompile".

date

@@ -1 +1 @@
-19 July 2025 
+21 December 2025 

doc/Undocumented.xml

@@ -51,7 +51,7 @@
 </Description> </ManSection> 
 <ManSection> <Func Name="ContractPureCubicalComplex" Arg="T"/> <Description> <P/> Inputs a pure cubical complex <M>T</M> of dimension <M>d</M> and removes <M>d</M>-dimensional cells from <M>T</M> without changing the homotopy type of <M>T</M>. When the function has been applied, no further <M>d</M>-cells can be removed from <M>T</M> without changing its homotopy type. This function modifies <M>T</M>. <P/><B>Examples:</B> <URL><Link>../www/SideLinks/About/aboutKnots.html</Link><LinkText>1</LinkText></URL>&nbsp;
 </Description> </ManSection> 
-<ManSection> <Func Name="ContractedComplex" Arg="T"/> <Description> <P/> Inputs a pure cubical complex <M>T</M> and returns a structural copy of the complex obtained from <M>T</M> by applying the function ContractPureCubicalComplex(T). <P/><B>Examples:</B> <URL><Link>../tutorial/chap1.html</Link><LinkText>1</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap2.html</Link><LinkText>2</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap3.html</Link><LinkText>3</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap5.html</Link><LinkText>4</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap7.html</Link><LinkText>5</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap10.html</Link><LinkText>6</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap11.html</Link><LinkText>7</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutCoveringSpaces.html</Link><LinkText>8</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutCoverinSpaces.html</Link><LinkText>9</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutCubical.html</Link><LinkText>10</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutKnots.html</Link><LinkText>11</LinkText></URL>&nbsp;
+<ManSection> <Func Name="ContractedComplex" Arg="T"/> <Description> <P/> Inputs a pure cubical complex <M>T</M> and returns a structural copy of the complex obtained from <M>T</M> by applying the function ContractPureCubicalComplex(T). <P/><B>Examples:</B> <URL><Link>../tutorial/chap1.html</Link><LinkText>1</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap2.html</Link><LinkText>2</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap3.html</Link><LinkText>3</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap5.html</Link><LinkText>4</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap7.html</Link><LinkText>5</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap10.html</Link><LinkText>6</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap11.html</Link><LinkText>7</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap13.html</Link><LinkText>8</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutCoveringSpaces.html</Link><LinkText>9</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutCoverinSpaces.html</Link><LinkText>10</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutCubical.html</Link><LinkText>11</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutKnots.html</Link><LinkText>12</LinkText></URL>&nbsp;
 </Description> </ManSection> 
 <ManSection> <Func Name="ZigZagContractedPureCubicalComplex" Arg="T"/> <Description> <P/> Inputs a pure cubical complex <M>T</M> and returns a homotopy equivalent pure cubical complex <M>S</M>. The aim is for <M>S</M> to involve fewer cells than <M>T</M> and certainly to involve no more cells than <M>T</M>. <P/><B>Examples:</B> <URL><Link>../www/SideLinks/About/aboutLinks.html</Link><LinkText>1</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutCubical.html</Link><LinkText>2</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutKnots.html</Link><LinkText>3</LinkText></URL>&nbsp;
 </Description> </ManSection> 

doc/newCubical.xml

@@ -5,7 +5,7 @@
 </Description> </ManSection> 
 <ManSection> <Func Name="HomToIntegersModP" Arg="R"/> <Description> <P/> Inputs a <M>ZG</M>-resolution <M>R</M> and returns the cochain complex obtained by applying <M>HomZG( _ , Z_p)</M> where <M>Z_p</M> is the trivial module of integers mod <M>p</M>. (At present this functor does not handle equivariant chain maps.) <P/><B>Examples:</B> <URL><Link>../tutorial/chap8.html</Link><LinkText>1</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutSpaceGroup.html</Link><LinkText>2</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutIntro.html</Link><LinkText>3</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutTorAndExt.html</Link><LinkText>4</LinkText></URL>&nbsp;
 </Description> </ManSection> 
-<ManSection> <Func Name="HomToIntegralModule" Arg="R,f"/> <Description> <P/> Inputs a <M>ZG</M>-resolution <M>R</M> and a group homomorphism <M>f:G \longrightarrow GL_n(Z)</M> to the group of <M>n×n</M> invertible integer matrices. Here <M>Z</M> must have characteristic 0. It returns the cochain complex obtained by applying <M>HomZG( _ , A)</M> where <M>A</M> is the <M>ZG</M>-module <M>Z^n</M> with <M>G</M> action via <M>f</M>. (At present this function does not handle equivariant chain maps.) <P/><B>Examples:</B> <URL><Link>../tutorial/chap7.html</Link><LinkText>1</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap13.html</Link><LinkText>2</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutTwistedCoefficients.html</Link><LinkText>3</LinkText></URL>&nbsp;
+<ManSection> <Func Name="HomToIntegralModule" Arg="R,f"/> <Description> <P/> Inputs a <M>ZG</M>-resolution <M>R</M> and a group homomorphism <M>f:G \longrightarrow GL_n(Z)</M> to the group of <M>n×n</M> invertible integer matrices. Here <M>Z</M> must have characteristic 0. It returns the cochain complex obtained by applying <M>HomZG( _ , A)</M> where <M>A</M> is the <M>ZG</M>-module <M>Z^n</M> with <M>G</M> action via <M>f</M>. (At present this function does not handle equivariant chain maps.) <P/><B>Examples:</B> <URL><Link>../tutorial/chap7.html</Link><LinkText>1</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap13.html</Link><LinkText>2</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap14.html</Link><LinkText>3</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutTwistedCoefficients.html</Link><LinkText>4</LinkText></URL>&nbsp;
 </Description> </ManSection> 
 <ManSection> <Func Name="TensorWithIntegralModule" Arg="R,f"/> <Description> <P/> Inputs a <M>ZG</M>-resolution <M>R</M> and a group homomorphism <M>f:G \longrightarrow GL_n(Z)</M> to the group of <M>n×n</M> invertible integer matrices. Here <M>Z</M> must have characteristic 0. It returns the chain complex obtained by tensoring over <M>ZG</M> with the <M>ZG</M>-module <M>A=Z^n</M> with <M>G</M> action via <M>f</M>. (At present this function does not handle equivariant chain maps.) <P/><B>Examples:</B> <URL><Link>../tutorial/chap7.html</Link><LinkText>1</LinkText></URL>&nbsp;
 </Description> </ManSection> 

doc/newFunctors.xml

@@ -83,7 +83,7 @@
 </Description> </ManSection> 
 <ManSection> <Func Name="ThickeningFiltration" Arg="K,n"/> <Func Name="ThickeningFiltration" Arg="K,n,s"/> <Description><P/> <P/> Inputs a pure cubical complex <M>K</M> and integer <M>n \ge 1</M>, and returns a filtered pure cubical complex of filtration length <M>n</M>. The <M>t</M>-th term of the filtration is the <M>t</M>-fold thickening of <M>K</M>. If an integer <M>s \ge 1</M> is entered as the optional third argument then the <M>t</M>-th term of the filtration is the <M>ts</M>-fold thickening of <M>K</M>. <P/><B>Examples:</B> <URL><Link>../tutorial/chap5.html</Link><LinkText>1</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutPersistent.html</Link><LinkText>2</LinkText></URL>&nbsp;
 </Description> </ManSection> </Section> <Section><Heading> Cellular Complexes <M>\longrightarrow</M> Cellular Complexes (Preserving Data Types)</Heading> 
-<ManSection> <Func Name="ContractedComplex" Arg="K"/> <Func Name="ContractedComplex" Arg="K"/> <Func Name="ContractedComplex" Arg="K"/> <Func Name="ContractedComplex" Arg="K"/> <Func Name="ContractedComplex" Arg="K,S"/> <Func Name="ContractedComplex" Arg="K"/> <Func Name="ContractedComplex" Arg="K"/> <Func Name="ContractedComplex" Arg="K,S"/> <Func Name="ContractedComplex" Arg="K"/> <Func Name="ContractedComplex" Arg="G"/> <Description> <P/> Inputs a complex (regular CW, Filtered regular CW, pure cubical etc.) and returns a homotopy equivalent subcomplex. <P/> Inputs a pure cubical complex or pure permutahedral complex <M>K</M> and a subcomplex <M>S</M>. It returns a homotopy equivalent subcomplex of <M>K</M> that contains <M>S</M>. <P/> Inputs a graph <M>G</M> and returns a subgraph <M>S</M> such that the clique complexes of <M>G</M> and <M>S</M> are homotopy equivalent. <P/><B>Examples:</B> <URL><Link>../tutorial/chap1.html</Link><LinkText>1</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap2.html</Link><LinkText>2</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap3.html</Link><LinkText>3</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap5.html</Link><LinkText>4</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap7.html</Link><LinkText>5</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap10.html</Link><LinkText>6</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap11.html</Link><LinkText>7</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutCoveringSpaces.html</Link><LinkText>8</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutCoverinSpaces.html</Link><LinkText>9</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutCubical.html</Link><LinkText>10</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutKnots.html</Link><LinkText>11</LinkText></URL>&nbsp;
+<ManSection> <Func Name="ContractedComplex" Arg="K"/> <Func Name="ContractedComplex" Arg="K"/> <Func Name="ContractedComplex" Arg="K"/> <Func Name="ContractedComplex" Arg="K"/> <Func Name="ContractedComplex" Arg="K,S"/> <Func Name="ContractedComplex" Arg="K"/> <Func Name="ContractedComplex" Arg="K"/> <Func Name="ContractedComplex" Arg="K,S"/> <Func Name="ContractedComplex" Arg="K"/> <Func Name="ContractedComplex" Arg="G"/> <Description> <P/> Inputs a complex (regular CW, Filtered regular CW, pure cubical etc.) and returns a homotopy equivalent subcomplex. <P/> Inputs a pure cubical complex or pure permutahedral complex <M>K</M> and a subcomplex <M>S</M>. It returns a homotopy equivalent subcomplex of <M>K</M> that contains <M>S</M>. <P/> Inputs a graph <M>G</M> and returns a subgraph <M>S</M> such that the clique complexes of <M>G</M> and <M>S</M> are homotopy equivalent. <P/><B>Examples:</B> <URL><Link>../tutorial/chap1.html</Link><LinkText>1</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap2.html</Link><LinkText>2</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap3.html</Link><LinkText>3</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap5.html</Link><LinkText>4</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap7.html</Link><LinkText>5</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap10.html</Link><LinkText>6</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap11.html</Link><LinkText>7</LinkText></URL>&nbsp;, <URL><Link>../tutorial/chap13.html</Link><LinkText>8</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutCoveringSpaces.html</Link><LinkText>9</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutCoverinSpaces.html</Link><LinkText>10</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutCubical.html</Link><LinkText>11</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutKnots.html</Link><LinkText>12</LinkText></URL>&nbsp;
 </Description> </ManSection> 
 <ManSection> <Func Name="ContractibleSubcomplex" Arg="K"/> <Func Name="ContractibleSubcomplex" Arg="K"/> <Func Name="ContractibleSubcomplex" Arg="K"/> <Description><P/> <P/> Inputs a non-empty pure cubical, pure permutahedral or simplicial complex <M>K</M> and returns a contractible subcomplex. <P/><B>Examples:</B> <URL><Link>../tutorial/chap10.html</Link><LinkText>1</LinkText></URL>&nbsp;, <URL><Link>../www/SideLinks/About/aboutCubical.html</Link><LinkText>2</LinkText></URL>&nbsp;
 </Description> </ManSection>