Script 'mail_helper' called by obssrc
Hello community,
here is the log from the commit of package gap-twistedconjugacy for
openSUSE:Factory checked in at 2026-05-06 19:18:13
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Factory/gap-twistedconjugacy (Old)
and /work/SRC/openSUSE:Factory/.gap-twistedconjugacy.new.30200 (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "gap-twistedconjugacy"
Wed May 6 19:18:13 2026 rev:4 rq:1351189 version:3.3.1
Changes:
--------
---
/work/SRC/openSUSE:Factory/gap-twistedconjugacy/gap-twistedconjugacy.changes
2026-04-15 16:06:31.843834061 +0200
+++
/work/SRC/openSUSE:Factory/.gap-twistedconjugacy.new.30200/gap-twistedconjugacy.changes
2026-05-06 19:20:04.578471524 +0200
@@ -1,0 +2,7 @@
+Wed May 6 11:31:58 UTC 2026 - Jan Engelhardt <[email protected]>
+
+- Update to release 3.3.1
+ * Added a better implementation of `ExtendedReidemeisterSpectrum`
+ and `CoincidenceReidemeisterSpectrum` for finite simple groups.
+
+-------------------------------------------------------------------
Old:
----
TwistedConjugacy-3.3.0.tar.gz
New:
----
TwistedConjugacy-3.3.1.tar.gz
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Other differences:
------------------
++++++ gap-twistedconjugacy.spec ++++++
--- /var/tmp/diff_new_pack.xLZ7Au/_old 2026-05-06 19:20:05.238498708 +0200
+++ /var/tmp/diff_new_pack.xLZ7Au/_new 2026-05-06 19:20:05.238498708 +0200
@@ -17,7 +17,7 @@
Name: gap-twistedconjugacy
-Version: 3.3.0
+Version: 3.3.1
Release: 0
Summary: GAP: Computation with twisted conjugacy classes
License: GPL-2.0-or-later
++++++ TwistedConjugacy-3.3.0.tar.gz -> TwistedConjugacy-3.3.1.tar.gz ++++++
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/CHANGELOG.md
new/TwistedConjugacy-3.3.1/CHANGELOG.md
--- old/TwistedConjugacy-3.3.0/CHANGELOG.md 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/CHANGELOG.md 2026-05-06 02:00:00.000000000
+0200
@@ -1,5 +1,14 @@
This file describes changes in the GAP package TwistedConjugacy.
+## 3.3.1 (2026-05-06)
+
+### Added
+- Add a better implementation of `ExtendedReidemeisterSpectrum` and
+ `CoincidenceReidemeisterSpectrum` for finite simple groups.
+
+### Changed
+- Updated references in the documentation.
+
## 3.3.0 (2026-04-09)
### Added
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/CITATION.cff
new/TwistedConjugacy-3.3.1/CITATION.cff
--- old/TwistedConjugacy-3.3.0/CITATION.cff 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/CITATION.cff 2026-05-06 02:00:00.000000000
+0200
@@ -3,8 +3,8 @@
type: software
title: TwistedConjugacy
abstract: Computation with twisted conjugacy classes
-version: 3.3.0
-date-released: 2026-04-09
+version: 3.3.1
+date-released: 2026-05-06
license: GPL-2.0-or-later
doi: 10.5281/zenodo.14283553
authors:
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/PackageInfo.g
new/TwistedConjugacy-3.3.1/PackageInfo.g
--- old/TwistedConjugacy-3.3.0/PackageInfo.g 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/PackageInfo.g 2026-05-06 02:00:00.000000000
+0200
@@ -2,8 +2,8 @@
PackageName := "TwistedConjugacy",
Subtitle := "Computation with twisted conjugacy classes",
-Version := "3.3.0",
-Date := "09/04/2026",
+Version := "3.3.1",
+Date := "06/05/2026",
License := "GPL-2.0-or-later",
Persons := [
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore'
old/TwistedConjugacy-3.3.0/doc/_Chapter_affineactions.xml
new/TwistedConjugacy-3.3.1/doc/_Chapter_affineactions.xml
--- old/TwistedConjugacy-3.3.0/doc/_Chapter_affineactions.xml 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/_Chapter_affineactions.xml 2026-05-06
02:00:00.000000000 +0200
@@ -19,7 +19,7 @@
<P/>
Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving affine actions, see
-<Cite Key='tert25-a' Where='Sec. 10'/> for a description on this.
+<Cite Key='tert26-a' Where='Sec. 10'/> for a description on this.
<P/>
<P/>
<P/>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/_Chapter_cosets.xml
new/TwistedConjugacy-3.3.1/doc/_Chapter_cosets.xml
--- old/TwistedConjugacy-3.3.0/doc/_Chapter_cosets.xml 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/_Chapter_cosets.xml 2026-05-06
02:00:00.000000000 +0200
@@ -61,7 +61,7 @@
<P/>
Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving double cosets, see
-<Cite Key='tert25-a' Where='Sec. 9'/> for a description on this. When the
+<Cite Key='tert26-a' Where='Sec. 9'/> for a description on this. When the
&PACKAGENAME; package is loaded, it does this automatically, and the
functions below should then work for PcpGroups, even if they are infinite.
<ManSection Label="AutoDoc_generated_group18">
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/_Chapter_derivations.xml
new/TwistedConjugacy-3.3.1/doc/_Chapter_derivations.xml
--- old/TwistedConjugacy-3.3.0/doc/_Chapter_derivations.xml 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/_Chapter_derivations.xml 2026-05-06
02:00:00.000000000 +0200
@@ -17,7 +17,7 @@
<P/>
Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving group derivations, see
-<Cite Key='tert25-a' Where='Sec. 10'/> for a description on this.
+<Cite Key='tert26-a' Where='Sec. 10'/> for a description on this.
<P/>
<P/>
<P/>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore'
old/TwistedConjugacy-3.3.0/doc/_Chapter_reidemeisternumbers.xml
new/TwistedConjugacy-3.3.1/doc/_Chapter_reidemeisternumbers.xml
--- old/TwistedConjugacy-3.3.0/doc/_Chapter_reidemeisternumbers.xml
2026-04-09 02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/_Chapter_reidemeisternumbers.xml
2026-05-06 02:00:00.000000000 +0200
@@ -21,7 +21,7 @@
If <Math>G</Math> is abelian, this function relies on (a generalisation of)
<Cite Key='jian83-a' Where='Thm. 2.5'/>.
If <Math>G = H</Math>, <Math>G</Math> is finite non-abelian and <Math>\psi =
\operatorname{id}_G</Math>, it
- relies on <Cite Key='fh94-a' Where='Thm. 5'/>.
+ relies on <Cite Key='ree59-a' Where='Thm. 1'/>.
Otherwise, it simply calculates the twisted conjugacy classes and then
counts them.
<P/>
@@ -71,9 +71,9 @@
<Returns>the Reidemeister spectrum of <A>G</A>.
</Returns>
<Description>
- If <Math>G</Math> is abelian, this function relies on the results from
+ If <A>G</A> is abelian, this function relies on the results from
<Cite Key='send23-a'/>.
- Otherwise, it relies on <Cite Key='fh94-a' Where='Thm. 5'/>.
+ Otherwise, it relies on <Cite Key='ree59-a' Where='Thm. 1'/>.
</Description>
</ManSection>
@@ -82,9 +82,10 @@
<Returns>the extended Reidemeister spectrum of <A>G</A>.
</Returns>
<Description>
- If <Math>G</Math> is abelian, this is just the set of all divisors of the
order of
- <A>G</A>.
- Otherwise, this function relies on <Cite Key='fh94-a' Where='Thm. 5'/>.
+ If <A>G</A> is simple, this is the union of its Reidemeister spectrum with
+ the element <Math>1</Math>.
+ If <A>G</A> is abelian, this is just the set of all divisors its order.
+ Otherwise, this function relies on <Cite Key='ree59-a' Where='Thm. 1'/>.
</Description>
</ManSection>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore'
old/TwistedConjugacy-3.3.0/doc/_Chapter_twistedconjugacyclasses.xml
new/TwistedConjugacy-3.3.1/doc/_Chapter_twistedconjugacyclasses.xml
--- old/TwistedConjugacy-3.3.0/doc/_Chapter_twistedconjugacyclasses.xml
2026-04-09 02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/_Chapter_twistedconjugacyclasses.xml
2026-05-06 02:00:00.000000000 +0200
@@ -176,7 +176,7 @@
If <Math>G</Math> and <Math>H</Math> are finite, this function relies on an
orbit-stabiliser
algorithm.
Otherwise, it relies on the algorithms in <Cite Key='dt21-a'/> and
- <Cite Key='tert25-a' />.
+ <Cite Key='tert26-a' />.
<P/>
</Description>
</ManSection>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/_entities.xml
new/TwistedConjugacy-3.3.1/doc/_entities.xml
--- old/TwistedConjugacy-3.3.0/doc/_entities.xml 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/_entities.xml 2026-05-06
02:00:00.000000000 +0200
@@ -1,5 +1,5 @@
<!ENTITY ABBREV 'TC'>
-<!ENTITY ARCHIVEURL
'https://github.com/stertooy/TwistedConjugacy/releases/download/v3.3.0/TwistedConjugacy-3.3.0'>
+<!ENTITY ARCHIVEURL
'https://github.com/stertooy/TwistedConjugacy/releases/download/v3.3.1/TwistedConjugacy-3.3.1'>
<!ENTITY AUTHOR 'Sam Tertooy'>
<!ENTITY AUTHORREVERSED 'Tertooy, Sam'>
<!ENTITY AutoDoc '<Package>AutoDoc</Package>'>
@@ -10,9 +10,9 @@
<!ENTITY PackageManager '<Package>PackageManager</Package>'>
<!ENTITY PackageName 'TwistedConjugacy'>
<!ENTITY Polycyclic '<Package>Polycyclic</Package>'>
-<!ENTITY RELEASEDATE '9 April 2026'>
+<!ENTITY RELEASEDATE '6 May 2026'>
<!ENTITY RELEASEYEAR '2026'>
<!ENTITY SUBTITLE 'Computation with twisted conjugacy classes'>
<!ENTITY SUPPORTEMAIL '[email protected]'>
<!ENTITY TwistedConjugacy '<Package>TwistedConjugacy</Package>'>
-<!ENTITY VERSION '3.3.0'>
+<!ENTITY VERSION '3.3.1'>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/_main.tex
new/TwistedConjugacy-3.3.1/doc/_main.tex
--- old/TwistedConjugacy-3.3.0/doc/_main.tex 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/_main.tex 2026-05-06 02:00:00.000000000
+0200
@@ -98,8 +98,8 @@
{\Huge \textbf{ Computation with twisted conjugacy classes \mbox{}}}\\
\vfill
-{\Huge 3.3.0 \mbox{}}\\[1cm]
-{ 9 April 2026 \mbox{}}\\[1cm]
+{\Huge 3.3.1 \mbox{}}\\[1cm]
+{ 6 May 2026 \mbox{}}\\[1cm]
\mbox{}\\[2cm]
{\Large \textbf{ Sam Tertooy \mbox{}}}\\
\hypersetup{pdfauthor= Sam Tertooy }
@@ -156,7 +156,7 @@
{
- This is the manual for the \textsf{GAP} 4 package \textsf{TwistedConjugacy}
version 3.3.0, developed by Sam Tertooy.
+ This is the manual for the \textsf{GAP} 4 package \textsf{TwistedConjugacy}
version 3.3.1, developed by Sam Tertooy.
\section{\textcolor{Chapter
}{Installation}}\label{Chapter_package_Section_installation}
@@ -173,7 +173,7 @@
\end{Verbatim}
- Alternatively, you can download \textsf{TwistedConjugacy} as a .tar.gz
archive
\href{https://github.com/stertooy/TwistedConjugacy/releases/download/v3.3.0/TwistedConjugacy-3.3.0.tar.gz}
{here}. After extracting, you should place it in a suitable \texttt{pkg}
folder. For example, on a Debian\texttt{\symbol{45}}based Linux distribution
+ Alternatively, you can download \textsf{TwistedConjugacy} as a .tar.gz
archive
\href{https://github.com/stertooy/TwistedConjugacy/releases/download/v3.3.1/TwistedConjugacy-3.3.1.tar.gz}
{here}. After extracting, you should place it in a suitable \texttt{pkg}
folder. For example, on a Debian\texttt{\symbol{45}}based Linux distribution
(e.g. Ubuntu, Mint), you can place it in \texttt{\$HOME/.gap/pkg}
(recommended) which makes it available for just yourself, or in the
\textsf{GAP} installation directory (\texttt{gap\texttt{\symbol{45}}X.Y.Z/pkg})
which makes it available for all users.
You can use the following command to efficiently install the package for
@@ -215,11 +215,11 @@
In Bib{\TeX}:
\begin{Verbatim}[commandchars=!|B,fontsize=\small,frame=single,label=BibTeX]
- @misc{TC3.3.0,
+ @misc{TC3.3.1,
author = {Tertooy, Sam},
title = {{TwistedConjugacy,
Computation with twisted conjugacy classes,
- Version 3.3.0}},
+ Version 3.3.1}},
note = {GAP package},
year = {2026},
howpublished = {\url{https://stertooy.github.io/TwistedConjugacy}}
@@ -229,11 +229,11 @@
In Bib{\LaTeX}:
\begin{Verbatim}[commandchars=!|B,fontsize=\small,frame=single,label=BibLaTeX]
- @software{TC3.3.0,
+ @software{TC3.3.1,
author = {Tertooy, Sam},
title = {TwistedConjugacy},
subtitle = {Computation with twisted conjugacy classes},
- version = {3.3.0},
+ version = {3.3.1},
note = {GAP package},
year = {2026},
url = {https://stertooy.github.io/TwistedConjugacy}
@@ -712,7 +712,7 @@
classes belong to \mbox{\texttt{\mdseries\slshape N}} if this argument is
provided.
If $G$ and $H$ are finite, this function relies on an
orbit\texttt{\symbol{45}}stabiliser
-algorithm. Otherwise, it relies on the algorithms in \cite{dt21-a} and
\cite{tert25-a}.
+algorithm. Otherwise, it relies on the algorithms in \cite{dt21-a} and
\cite{tert26-a}.
}
@@ -784,7 +784,7 @@
- If $G$ is abelian, this function relies on (a generalisation of) \cite[Thm.
2.5]{jian83-a}. If $G = H$, $G$ is finite non\texttt{\symbol{45}}abelian and
$\psi = \operatorname{id}_G$, it relies on \cite[Thm. 5]{fh94-a}. Otherwise, it
simply calculates the twisted conjugacy classes and then
+ If $G$ is abelian, this function relies on (a generalisation of) \cite[Thm.
2.5]{jian83-a}. If $G = H$, $G$ is finite non\texttt{\symbol{45}}abelian and
$\psi = \operatorname{id}_G$, it relies on \cite[Thm. 1]{ree59-a}. Otherwise,
it simply calculates the twisted conjugacy classes and then
counts them.
}
@@ -841,7 +841,7 @@
- If $G$ is abelian, this function relies on the results from \cite{send23-a}.
Otherwise, it relies on \cite[Thm. 5]{fh94-a}. }
+ If \mbox{\texttt{\mdseries\slshape G}} is abelian, this function relies on
the results from \cite{send23-a}. Otherwise, it relies on \cite[Thm.
1]{ree59-a}. }
@@ -856,7 +856,8 @@
- If $G$ is abelian, this is just the set of all divisors of the order of
\mbox{\texttt{\mdseries\slshape G}}. Otherwise, this function relies on
\cite[Thm. 5]{fh94-a}. }
+ If \mbox{\texttt{\mdseries\slshape G}} is simple, this is the union of its
Reidemeister spectrum with the element $1$. If \mbox{\texttt{\mdseries\slshape
G}} is abelian, this is just the set of all divisors its order. Otherwise, this
+function relies on \cite[Thm. 1]{ree59-a}. }
@@ -1183,7 +1184,7 @@
Algorithms designed for computing with twisted conjugacy classes can be
-leveraged to do computations involving double cosets, see \cite[Sec.
9]{tert25-a} for a description on this. When the \textsf{TwistedConjugacy}
package is loaded, it does this automatically, and the functions below should
+leveraged to do computations involving double cosets, see \cite[Sec.
9]{tert26-a} for a description on this. When the \textsf{TwistedConjugacy}
package is loaded, it does this automatically, and the functions below should
then work for PcpGroups, even if they are infinite.
\subsection{\textcolor{Chapter
}{\texttt{\symbol{92}}in}}\label{AutoDoc_generated_group18}
\logpage{[ 7, 2, 1 ]}
@@ -1551,7 +1552,7 @@
Algorithms designed for computing with twisted conjugacy classes can be
-leveraged to do computations involving group derivations, see \cite[Sec.
10]{tert25-a} for a description on this.
+leveraged to do computations involving group derivations, see \cite[Sec.
10]{tert26-a} for a description on this.
@@ -1918,7 +1919,7 @@
Algorithms designed for computing with twisted conjugacy classes can be
-leveraged to do computations involving affine actions, see \cite[Sec.
10]{tert25-a} for a description on this.
+leveraged to do computations involving affine actions, see \cite[Sec.
10]{tert26-a} for a description on this.
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/affineactions.autodoc
new/TwistedConjugacy-3.3.1/doc/affineactions.autodoc
--- old/TwistedConjugacy-3.3.0/doc/affineactions.autodoc 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/affineactions.autodoc 2026-05-06
02:00:00.000000000 +0200
@@ -15,7 +15,7 @@
Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving affine actions, see
-<Cite Key='tert25-a' Where='Sec. 10'/> for a description on this.
+<Cite Key='tert26-a' Where='Sec. 10'/> for a description on this.
<P/>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/bibliography.bib
new/TwistedConjugacy-3.3.1/doc/bibliography.bib
--- old/TwistedConjugacy-3.3.0/doc/bibliography.bib 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/bibliography.bib 2026-05-06
02:00:00.000000000 +0200
@@ -18,18 +18,6 @@
mrnumber = {4229472}
}
-@Article{fh94-a,
- author = {Fel'shtyn, A. and Hill, R.},
- title = {The {R}eidemeister zeta function with applications to
{N}ielsen theory and a connection with {R}eidemeister torsion},
- year = {1994},
- journal = {K-Theory},
- number = {4},
- volume = {8},
- pages = {367-393},
- url = {https://doi.org/10/bjqxpq},
- mrnumber = {1300546}
-}
-
@Book{jian83-a,
author = {Jiang, B.},
title = {Lectures on {N}ielsen fixed point theory},
@@ -41,6 +29,18 @@
mrnumber = {0685755}
}
+@Article{ree59-a,
+ author = {Ree, R.},
+ title = {On generalized conjugate classes in a finite group},
+ year = {1959},
+ journal = {Ill. J. Math.},
+ number = {3},
+ volume = {3},
+ pages = {440-444},
+ url = {https://doi.org/10/hb2rkv},
+ mrnumber = {0106948}
+}
+
@Article{roma16-a,
author = {Roman'kov, V.},
title = {On solvability of equations with endomorphisms in nilpotent
groups},
@@ -67,18 +67,19 @@
author = {Senden, P.},
title = {The {R}eidemeister {S}pectrum of {F}inite {A}belian
{G}roups},
year = {2023},
+ journal = {Proc. Edinburgh Math. Soc.},
number = {4},
volume = {66},
- journal = {Proc. Edinburgh Math. Soc.},
pages = {940-959},
url = {https://doi.org/10/gszbsf},
mrnumber = {4679208}
}
-@Misc{tert25-a,
- author = {Tertooy, S.},
+@Article{tert26-a,
+ author = {Tertooy, Sam},
title = {Algorithms for twisted conjugacy classes of
polycyclic-by-finite groups {II}},
- year = {2025},
- howpublished = {arXiv:2504.03596 [math.GR]},
- url = {https://arxiv.org/abs/2504.03596},
+ year = {2026},
+ journal = {J. Algebra},
+ note = {Advance Online Publication},
+ url = {https://doi.org/10/q5jb},
}
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap0.html
new/TwistedConjugacy-3.3.1/doc/chap0.html
--- old/TwistedConjugacy-3.3.0/doc/chap0.html 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chap0.html 2026-05-06 02:00:00.000000000
+0200
@@ -29,10 +29,10 @@
<h2>Computation with twisted conjugacy classes</h2>
<p>
- 3.3.0</p>
+ 3.3.1</p>
<p>
- 9 April 2026
+ 6 May 2026
</p>
</div>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap0.txt
new/TwistedConjugacy-3.3.1/doc/chap0.txt
--- old/TwistedConjugacy-3.3.0/doc/chap0.txt 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chap0.txt 2026-05-06 02:00:00.000000000
+0200
@@ -6,10 +6,10 @@
[1X Computation with twisted conjugacy classes [101X
- 3.3.0
+ 3.3.1
- 9 April 2026
+ 6 May 2026
Sam Tertooy
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap0_mj.html
new/TwistedConjugacy-3.3.1/doc/chap0_mj.html
--- old/TwistedConjugacy-3.3.0/doc/chap0_mj.html 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/chap0_mj.html 2026-05-06
02:00:00.000000000 +0200
@@ -32,10 +32,10 @@
<h2>Computation with twisted conjugacy classes</h2>
<p>
- 3.3.0</p>
+ 3.3.1</p>
<p>
- 9 April 2026
+ 6 May 2026
</p>
</div>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap1.html
new/TwistedConjugacy-3.3.1/doc/chap1.html
--- old/TwistedConjugacy-3.3.0/doc/chap1.html 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chap1.html 2026-05-06 02:00:00.000000000
+0200
@@ -38,7 +38,7 @@
<h3>1 <span class="Heading">The TwistedConjugacy package</span></h3>
-<p>This is the manual for the <strong class="pkg">GAP</strong> 4 package
<strong class="pkg">TwistedConjugacy</strong> version 3.3.0, developed by Sam
Tertooy.</p>
+<p>This is the manual for the <strong class="pkg">GAP</strong> 4 package
<strong class="pkg">TwistedConjugacy</strong> version 3.3.1, developed by Sam
Tertooy.</p>
<p><a id="X8360C04082558A12" name="X8360C04082558A12"></a></p>
@@ -55,7 +55,7 @@
true
</pre></div>
-<p>Alternatively, you can download <strong
class="pkg">TwistedConjugacy</strong> as a .tar.gz archive <span class="URL"><a
href="https://github.com/stertooy/TwistedConjugacy/releases/download/v3.3.0/TwistedConjugacy-3.3.0.tar.gz">here</a></span>.
After extracting, you should place it in a suitable <code
class="file">pkg</code> folder. For example, on a Debian-based Linux
distribution (e.g. Ubuntu, Mint), you can place it in <code
class="file">$HOME/.gap/pkg</code> (recommended) which makes it available for
just yourself, or in the <strong class="pkg">GAP</strong> installation
directory (<code class="file">gap-X.Y.Z/pkg</code>) which makes it available
for all users.</p>
+<p>Alternatively, you can download <strong
class="pkg">TwistedConjugacy</strong> as a .tar.gz archive <span class="URL"><a
href="https://github.com/stertooy/TwistedConjugacy/releases/download/v3.3.1/TwistedConjugacy-3.3.1.tar.gz">here</a></span>.
After extracting, you should place it in a suitable <code
class="file">pkg</code> folder. For example, on a Debian-based Linux
distribution (e.g. Ubuntu, Mint), you can place it in <code
class="file">$HOME/.gap/pkg</code> (recommended) which makes it available for
just yourself, or in the <strong class="pkg">GAP</strong> installation
directory (<code class="file">gap-X.Y.Z/pkg</code>) which makes it available
for all users.</p>
<p>You can use the following command to efficiently install the package for
yourself:</p>
@@ -85,11 +85,11 @@
<div class="example"><pre>
-@misc{TC3.3.0,
+@misc{TC3.3.1,
author = {Tertooy, Sam},
title = {{TwistedConjugacy,
Computation with twisted conjugacy classes,
- Version 3.3.0}},
+ Version 3.3.1}},
note = {GAP package},
year = {2026},
howpublished = {\url{https://stertooy.github.io/TwistedConjugacy}}
@@ -99,11 +99,11 @@
<div class="example"><pre>
-@software{TC3.3.0,
+@software{TC3.3.1,
author = {Tertooy, Sam},
title = {TwistedConjugacy},
subtitle = {Computation with twisted conjugacy classes},
- version = {3.3.0},
+ version = {3.3.1},
note = {GAP package},
year = {2026},
url = {https://stertooy.github.io/TwistedConjugacy}
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap1.txt
new/TwistedConjugacy-3.3.1/doc/chap1.txt
--- old/TwistedConjugacy-3.3.0/doc/chap1.txt 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chap1.txt 2026-05-06 02:00:00.000000000
+0200
@@ -1,7 +1,7 @@
[1X1 [33X[0;0YThe TwistedConjugacy package[133X[101X
- [33X[0;0YThis is the manual for the [5XGAP[105X 4 package
[5XTwistedConjugacy[105X version 3.3.0,
+ [33X[0;0YThis is the manual for the [5XGAP[105X 4 package
[5XTwistedConjugacy[105X version 3.3.1,
developed by Sam Tertooy.[133X
@@ -21,7 +21,7 @@
[4X[32X[104X
[33X[0;0YAlternatively, you can download [5XTwistedConjugacy[105X as a
.tar.gz archive here
-
([7Xhttps://github.com/stertooy/TwistedConjugacy/releases/download/v3.3.0/TwistedConjugacy-3.3.0.tar.gz[107X).
+
([7Xhttps://github.com/stertooy/TwistedConjugacy/releases/download/v3.3.1/TwistedConjugacy-3.3.1.tar.gz[107X).
After extracting, you should place it in a suitable [11Xpkg[111X folder.
For example,
on a Debian-based Linux distribution (e.g. Ubuntu, Mint), you can place it
in [11X$HOME/.gap/pkg[111X (recommended) which makes it available for
just yourself,
@@ -59,11 +59,11 @@
[33X[0;0YIn BibTeX:[133X
[4X[32X BibTeX [32X[104X
- [4X@misc{TC3.3.0,[104X
+ [4X@misc{TC3.3.1,[104X
[4X author = {Tertooy, Sam},[104X
[4X title = {{TwistedConjugacy,[104X
[4X Computation with twisted conjugacy classes,[104X
- [4X Version 3.3.0}},[104X
+ [4X Version 3.3.1}},[104X
[4X note = {GAP package},[104X
[4X year = {2026},[104X
[4X howpublished =
{\url{https://stertooy.github.io/TwistedConjugacy}}[104X
@@ -73,11 +73,11 @@
[33X[0;0YIn BibLaTeX:[133X
[4X[32X BibLaTeX [32X[104X
- [4X@software{TC3.3.0,[104X
+ [4X@software{TC3.3.1,[104X
[4X author = {Tertooy, Sam},[104X
[4X title = {TwistedConjugacy},[104X
[4X subtitle = {Computation with twisted conjugacy classes},[104X
- [4X version = {3.3.0},[104X
+ [4X version = {3.3.1},[104X
[4X note = {GAP package},[104X
[4X year = {2026},[104X
[4X url = {https://stertooy.github.io/TwistedConjugacy}[104X
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap10.html
new/TwistedConjugacy-3.3.1/doc/chap10.html
--- old/TwistedConjugacy-3.3.0/doc/chap10.html 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chap10.html 2026-05-06 02:00:00.000000000
+0200
@@ -79,7 +79,7 @@
<p>If <span class="Math">K</span> is a subgroup of <span
class="Math">H</span>, then the restriction of the affine action of <span
class="Math">H</span> on <span class="Math">G</span> to <span
class="Math">K</span> coincides with the affine action of <span
class="Math">K</span> on <span class="Math">G</span> associated to the
restriction of <span class="Math">\delta</span> to <span
class="Math">K</span>.</p>
-<p>Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving affine actions, see <a
href="chapBib.html#biBtert25-a">[Ter25, Sec. 10]</a> for a description on
this.</p>
+<p>Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving affine actions, see <a
href="chapBib.html#biBtert26-a">[Ter26, Sec. 10]</a> for a description on
this.</p>
<p>Please note that the functions in this chapter require <span
class="Math">G</span> and <span class="Math">H</span> to either both be finite,
or both be PcpGroups.</p>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap10.txt
new/TwistedConjugacy-3.3.1/doc/chap10.txt
--- old/TwistedConjugacy-3.3.0/doc/chap10.txt 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chap10.txt 2026-05-06 02:00:00.000000000
+0200
@@ -22,7 +22,7 @@
restriction of [23X\delta[123X to [23XK[123X.[133X
[33X[0;0YAlgorithms designed for computing with twisted conjugacy
classes can be
- leveraged to do computations involving affine actions, see [Ter25, Sec. 10]
+ leveraged to do computations involving affine actions, see [Ter26, Sec. 10]
for a description on this.[133X
[33X[0;0YPlease note that the functions in this chapter require
[23XG[123X and [23XH[123X to either
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap10_mj.html
new/TwistedConjugacy-3.3.1/doc/chap10_mj.html
--- old/TwistedConjugacy-3.3.0/doc/chap10_mj.html 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/chap10_mj.html 2026-05-06
02:00:00.000000000 +0200
@@ -82,7 +82,7 @@
<p>If <span class="SimpleMath">\(K\)</span> is a subgroup of <span
class="SimpleMath">\(H\)</span>, then the restriction of the affine action of
<span class="SimpleMath">\(H\)</span> on <span class="SimpleMath">\(G\)</span>
to <span class="SimpleMath">\(K\)</span> coincides with the affine action of
<span class="SimpleMath">\(K\)</span> on <span class="SimpleMath">\(G\)</span>
associated to the restriction of <span class="SimpleMath">\(\delta\)</span> to
<span class="SimpleMath">\(K\)</span>.</p>
-<p>Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving affine actions, see <a
href="chapBib_mj.html#biBtert25-a">[Ter25, Sec. 10]</a> for a description on
this.</p>
+<p>Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving affine actions, see <a
href="chapBib_mj.html#biBtert26-a">[Ter26, Sec. 10]</a> for a description on
this.</p>
<p>Please note that the functions in this chapter require <span
class="SimpleMath">\(G\)</span> and <span class="SimpleMath">\(H\)</span> to
either both be finite, or both be PcpGroups.</p>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap1_mj.html
new/TwistedConjugacy-3.3.1/doc/chap1_mj.html
--- old/TwistedConjugacy-3.3.0/doc/chap1_mj.html 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/chap1_mj.html 2026-05-06
02:00:00.000000000 +0200
@@ -41,7 +41,7 @@
<h3>1 <span class="Heading">The TwistedConjugacy package</span></h3>
-<p>This is the manual for the <strong class="pkg">GAP</strong> 4 package
<strong class="pkg">TwistedConjugacy</strong> version 3.3.0, developed by Sam
Tertooy.</p>
+<p>This is the manual for the <strong class="pkg">GAP</strong> 4 package
<strong class="pkg">TwistedConjugacy</strong> version 3.3.1, developed by Sam
Tertooy.</p>
<p><a id="X8360C04082558A12" name="X8360C04082558A12"></a></p>
@@ -58,7 +58,7 @@
true
</pre></div>
-<p>Alternatively, you can download <strong
class="pkg">TwistedConjugacy</strong> as a .tar.gz archive <span class="URL"><a
href="https://github.com/stertooy/TwistedConjugacy/releases/download/v3.3.0/TwistedConjugacy-3.3.0.tar.gz">here</a></span>.
After extracting, you should place it in a suitable <code
class="file">pkg</code> folder. For example, on a Debian-based Linux
distribution (e.g. Ubuntu, Mint), you can place it in <code
class="file">$HOME/.gap/pkg</code> (recommended) which makes it available for
just yourself, or in the <strong class="pkg">GAP</strong> installation
directory (<code class="file">gap-X.Y.Z/pkg</code>) which makes it available
for all users.</p>
+<p>Alternatively, you can download <strong
class="pkg">TwistedConjugacy</strong> as a .tar.gz archive <span class="URL"><a
href="https://github.com/stertooy/TwistedConjugacy/releases/download/v3.3.1/TwistedConjugacy-3.3.1.tar.gz">here</a></span>.
After extracting, you should place it in a suitable <code
class="file">pkg</code> folder. For example, on a Debian-based Linux
distribution (e.g. Ubuntu, Mint), you can place it in <code
class="file">$HOME/.gap/pkg</code> (recommended) which makes it available for
just yourself, or in the <strong class="pkg">GAP</strong> installation
directory (<code class="file">gap-X.Y.Z/pkg</code>) which makes it available
for all users.</p>
<p>You can use the following command to efficiently install the package for
yourself:</p>
@@ -88,11 +88,11 @@
<div class="example"><pre>
-@misc{TC3.3.0,
+@misc{TC3.3.1,
author = {Tertooy, Sam},
title = {{TwistedConjugacy,
Computation with twisted conjugacy classes,
- Version 3.3.0}},
+ Version 3.3.1}},
note = {GAP package},
year = {2026},
howpublished = {\url{https://stertooy.github.io/TwistedConjugacy}}
@@ -102,11 +102,11 @@
<div class="example"><pre>
-@software{TC3.3.0,
+@software{TC3.3.1,
author = {Tertooy, Sam},
title = {TwistedConjugacy},
subtitle = {Computation with twisted conjugacy classes},
- version = {3.3.0},
+ version = {3.3.1},
note = {GAP package},
year = {2026},
url = {https://stertooy.github.io/TwistedConjugacy}
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap4.html
new/TwistedConjugacy-3.3.1/doc/chap4.html
--- old/TwistedConjugacy-3.3.0/doc/chap4.html 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chap4.html 2026-05-06 02:00:00.000000000
+0200
@@ -191,7 +191,7 @@
<p>If the argument <var class="Arg">N</var> is provided, it must be a normal
subgroup of <code class="code">Range(<var class="Arg">hom1</var>)</code>; the
function will then only return the Reidemeister classes that intersect <var
class="Arg">N</var> non-trivially. It is guaranteed that the Reidemeister class
of the identity is in the first position, and that the representatives of the
classes belong to <var class="Arg">N</var> if this argument is provided.</p>
-<p>If <span class="Math">G</span> and <span class="Math">H</span> are finite,
this function relies on an orbit-stabiliser algorithm. Otherwise, it relies on
the algorithms in <a href="chapBib.html#biBdt21-a">[DT21]</a> and <a
href="chapBib.html#biBtert25-a">[Ter25]</a>.</p>
+<p>If <span class="Math">G</span> and <span class="Math">H</span> are finite,
this function relies on an orbit-stabiliser algorithm. Otherwise, it relies on
the algorithms in <a href="chapBib.html#biBdt21-a">[DT21]</a> and <a
href="chapBib.html#biBtert26-a">[Ter26]</a>.</p>
<p><a id="X862C49C0834E01D7" name="X862C49C0834E01D7"></a></p>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap4.txt
new/TwistedConjugacy-3.3.1/doc/chap4.txt
--- old/TwistedConjugacy-3.3.0/doc/chap4.txt 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chap4.txt 2026-05-06 02:00:00.000000000
+0200
@@ -123,7 +123,7 @@
to [3XN[103X if this argument is provided.[133X
[33X[0;0YIf [23XG[123X and [23XH[123X are finite, this function
relies on an orbit-stabiliser
- algorithm. Otherwise, it relies on the algorithms in [DT21] and
[Ter25].[133X
+ algorithm. Otherwise, it relies on the algorithms in [DT21] and
[Ter26].[133X
[1X4.3-2 RepresentativesTwistedConjugacyClasses[101X
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap4_mj.html
new/TwistedConjugacy-3.3.1/doc/chap4_mj.html
--- old/TwistedConjugacy-3.3.0/doc/chap4_mj.html 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/chap4_mj.html 2026-05-06
02:00:00.000000000 +0200
@@ -194,7 +194,7 @@
<p>If the argument <var class="Arg">N</var> is provided, it must be a normal
subgroup of <code class="code">Range(<var class="Arg">hom1</var>)</code>; the
function will then only return the Reidemeister classes that intersect <var
class="Arg">N</var> non-trivially. It is guaranteed that the Reidemeister class
of the identity is in the first position, and that the representatives of the
classes belong to <var class="Arg">N</var> if this argument is provided.</p>
-<p>If <span class="SimpleMath">\(G\)</span> and <span
class="SimpleMath">\(H\)</span> are finite, this function relies on an
orbit-stabiliser algorithm. Otherwise, it relies on the algorithms in <a
href="chapBib_mj.html#biBdt21-a">[DT21]</a> and <a
href="chapBib_mj.html#biBtert25-a">[Ter25]</a>.</p>
+<p>If <span class="SimpleMath">\(G\)</span> and <span
class="SimpleMath">\(H\)</span> are finite, this function relies on an
orbit-stabiliser algorithm. Otherwise, it relies on the algorithms in <a
href="chapBib_mj.html#biBdt21-a">[DT21]</a> and <a
href="chapBib_mj.html#biBtert26-a">[Ter26]</a>.</p>
<p><a id="X862C49C0834E01D7" name="X862C49C0834E01D7"></a></p>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap5.html
new/TwistedConjugacy-3.3.1/doc/chap5.html
--- old/TwistedConjugacy-3.3.0/doc/chap5.html 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chap5.html 2026-05-06 02:00:00.000000000
+0200
@@ -53,7 +53,7 @@
<div class="func"><table class="func" width="100%"><tr><td
class="tdleft"><code class="func">‣ NrTwistedConjugacyClasses</code>(
<var class="Arg">hom1</var>[, <var class="Arg">hom2</var>] )</td><td
class="tdright">( function )</td></tr></table></div>
<p>Returns: the Reidemeister number of ( <var class="Arg">hom1</var>, <var
class="Arg">hom2</var> ).</p>
-<p>If <span class="Math">G</span> is abelian, this function relies on (a
generalisation of) <a href="chapBib.html#biBjian83-a">[Jia83, Thm. 2.5]</a>. If
<span class="Math">G = H</span>, <span class="Math">G</span> is finite
non-abelian and <span class="Math">\psi = \operatorname{id}_G</span>, it relies
on <a href="chapBib.html#biBfh94-a">[FH94, Thm. 5]</a>. Otherwise, it simply
calculates the twisted conjugacy classes and then counts them.</p>
+<p>If <span class="Math">G</span> is abelian, this function relies on (a
generalisation of) <a href="chapBib.html#biBjian83-a">[Jia83, Thm. 2.5]</a>. If
<span class="Math">G = H</span>, <span class="Math">G</span> is finite
non-abelian and <span class="Math">\psi = \operatorname{id}_G</span>, it relies
on <a href="chapBib.html#biBree59-a">[Ree59, Thm. 1]</a>. Otherwise, it simply
calculates the twisted conjugacy classes and then counts them.</p>
<div class="example"><pre>
@@ -97,7 +97,7 @@
<div class="func"><table class="func" width="100%"><tr><td
class="tdleft"><code class="func">‣ ReidemeisterSpectrum</code>( <var
class="Arg">G</var> )</td><td
class="tdright">( function )</td></tr></table></div>
<p>Returns: the Reidemeister spectrum of <var class="Arg">G</var>.</p>
-<p>If <span class="Math">G</span> is abelian, this function relies on the
results from <a href="chapBib.html#biBsend23-a">[Sen23]</a>. Otherwise, it
relies on <a href="chapBib.html#biBfh94-a">[FH94, Thm. 5]</a>.</p>
+<p>If <var class="Arg">G</var> is abelian, this function relies on the results
from <a href="chapBib.html#biBsend23-a">[Sen23]</a>. Otherwise, it relies on <a
href="chapBib.html#biBree59-a">[Ree59, Thm. 1]</a>.</p>
<p><a id="X8122B246860C1617" name="X8122B246860C1617"></a></p>
@@ -106,7 +106,7 @@
<div class="func"><table class="func" width="100%"><tr><td
class="tdleft"><code class="func">‣ ExtendedReidemeisterSpectrum</code>(
<var class="Arg">G</var> )</td><td
class="tdright">( function )</td></tr></table></div>
<p>Returns: the extended Reidemeister spectrum of <var class="Arg">G</var>.</p>
-<p>If <span class="Math">G</span> is abelian, this is just the set of all
divisors of the order of <var class="Arg">G</var>. Otherwise, this function
relies on <a href="chapBib.html#biBfh94-a">[FH94, Thm. 5]</a>.</p>
+<p>If <var class="Arg">G</var> is simple, this is the union of its
Reidemeister spectrum with the element <span class="Math">1</span>. If <var
class="Arg">G</var> is abelian, this is just the set of all divisors its order.
Otherwise, this function relies on <a href="chapBib.html#biBree59-a">[Ree59,
Thm. 1]</a>.</p>
<p><a id="X78839C0886EBDB71" name="X78839C0886EBDB71"></a></p>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap5.txt
new/TwistedConjugacy-3.3.1/doc/chap5.txt
--- old/TwistedConjugacy-3.3.0/doc/chap5.txt 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chap5.txt 2026-05-06 02:00:00.000000000
+0200
@@ -15,7 +15,7 @@
[33X[0;0YIf [23XG[123X is abelian, this function relies on (a
generalisation of) [Jia83, Thm.
2.5]. If [23XG = H[123X, [23XG[123X is finite non-abelian and
[23X\psi = \operatorname{id}_G[123X, it
- relies on [FH94, Thm. 5]. Otherwise, it simply calculates the twisted
+ relies on [Ree59, Thm. 1]. Otherwise, it simply calculates the twisted
conjugacy classes and then counts them.[133X
[4X[32X Example [32X[104X
@@ -78,16 +78,17 @@
[33X[1;0Y[29X[2XReidemeisterSpectrum[102X( [3XG[103X ) [32X
function[133X
[6XReturns:[106X [33X[0;10Ythe Reidemeister spectrum of
[3XG[103X.[133X
- [33X[0;0YIf [23XG[123X is abelian, this function relies on the
results from [Sen23].
- Otherwise, it relies on [FH94, Thm. 5].[133X
+ [33X[0;0YIf [3XG[103X is abelian, this function relies on the
results from [Sen23].
+ Otherwise, it relies on [Ree59, Thm. 1].[133X
[1X5.2-2 ExtendedReidemeisterSpectrum[101X
[33X[1;0Y[29X[2XExtendedReidemeisterSpectrum[102X( [3XG[103X ) [32X
function[133X
[6XReturns:[106X [33X[0;10Ythe extended Reidemeister spectrum of
[3XG[103X.[133X
- [33X[0;0YIf [23XG[123X is abelian, this is just the set of all
divisors of the order of [3XG[103X.
- Otherwise, this function relies on [FH94, Thm. 5].[133X
+ [33X[0;0YIf [3XG[103X is simple, this is the union of its
Reidemeister spectrum with the
+ element [23X1[123X. If [3XG[103X is abelian, this is just the set of
all divisors its order.
+ Otherwise, this function relies on [Ree59, Thm. 1].[133X
[1X5.2-3 CoincidenceReidemeisterSpectrum[101X
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap5_mj.html
new/TwistedConjugacy-3.3.1/doc/chap5_mj.html
--- old/TwistedConjugacy-3.3.0/doc/chap5_mj.html 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/chap5_mj.html 2026-05-06
02:00:00.000000000 +0200
@@ -56,7 +56,7 @@
<div class="func"><table class="func" width="100%"><tr><td
class="tdleft"><code class="func">‣ NrTwistedConjugacyClasses</code>(
<var class="Arg">hom1</var>[, <var class="Arg">hom2</var>] )</td><td
class="tdright">( function )</td></tr></table></div>
<p>Returns: the Reidemeister number of ( <var class="Arg">hom1</var>, <var
class="Arg">hom2</var> ).</p>
-<p>If <span class="SimpleMath">\(G\)</span> is abelian, this function relies
on (a generalisation of) <a href="chapBib_mj.html#biBjian83-a">[Jia83, Thm.
2.5]</a>. If <span class="SimpleMath">\(G = H\)</span>, <span
class="SimpleMath">\(G\)</span> is finite non-abelian and <span
class="SimpleMath">\(\psi = \operatorname{id}_G\)</span>, it relies on <a
href="chapBib_mj.html#biBfh94-a">[FH94, Thm. 5]</a>. Otherwise, it simply
calculates the twisted conjugacy classes and then counts them.</p>
+<p>If <span class="SimpleMath">\(G\)</span> is abelian, this function relies
on (a generalisation of) <a href="chapBib_mj.html#biBjian83-a">[Jia83, Thm.
2.5]</a>. If <span class="SimpleMath">\(G = H\)</span>, <span
class="SimpleMath">\(G\)</span> is finite non-abelian and <span
class="SimpleMath">\(\psi = \operatorname{id}_G\)</span>, it relies on <a
href="chapBib_mj.html#biBree59-a">[Ree59, Thm. 1]</a>. Otherwise, it simply
calculates the twisted conjugacy classes and then counts them.</p>
<div class="example"><pre>
@@ -100,7 +100,7 @@
<div class="func"><table class="func" width="100%"><tr><td
class="tdleft"><code class="func">‣ ReidemeisterSpectrum</code>( <var
class="Arg">G</var> )</td><td
class="tdright">( function )</td></tr></table></div>
<p>Returns: the Reidemeister spectrum of <var class="Arg">G</var>.</p>
-<p>If <span class="SimpleMath">\(G\)</span> is abelian, this function relies
on the results from <a href="chapBib_mj.html#biBsend23-a">[Sen23]</a>.
Otherwise, it relies on <a href="chapBib_mj.html#biBfh94-a">[FH94, Thm.
5]</a>.</p>
+<p>If <var class="Arg">G</var> is abelian, this function relies on the results
from <a href="chapBib_mj.html#biBsend23-a">[Sen23]</a>. Otherwise, it relies on
<a href="chapBib_mj.html#biBree59-a">[Ree59, Thm. 1]</a>.</p>
<p><a id="X8122B246860C1617" name="X8122B246860C1617"></a></p>
@@ -109,7 +109,7 @@
<div class="func"><table class="func" width="100%"><tr><td
class="tdleft"><code class="func">‣ ExtendedReidemeisterSpectrum</code>(
<var class="Arg">G</var> )</td><td
class="tdright">( function )</td></tr></table></div>
<p>Returns: the extended Reidemeister spectrum of <var class="Arg">G</var>.</p>
-<p>If <span class="SimpleMath">\(G\)</span> is abelian, this is just the set
of all divisors of the order of <var class="Arg">G</var>. Otherwise, this
function relies on <a href="chapBib_mj.html#biBfh94-a">[FH94, Thm. 5]</a>.</p>
+<p>If <var class="Arg">G</var> is simple, this is the union of its
Reidemeister spectrum with the element <span class="SimpleMath">\(1\)</span>.
If <var class="Arg">G</var> is abelian, this is just the set of all divisors
its order. Otherwise, this function relies on <a
href="chapBib_mj.html#biBree59-a">[Ree59, Thm. 1]</a>.</p>
<p><a id="X78839C0886EBDB71" name="X78839C0886EBDB71"></a></p>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap7.html
new/TwistedConjugacy-3.3.1/doc/chap7.html
--- old/TwistedConjugacy-3.3.0/doc/chap7.html 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chap7.html 2026-05-06 02:00:00.000000000
+0200
@@ -95,7 +95,7 @@
<h4>7.2 <span class="Heading">Double cosets</span></h4>
-<p>Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving double cosets, see <a
href="chapBib.html#biBtert25-a">[Ter25, Sec. 9]</a> for a description on this.
When the <strong class="pkg">TwistedConjugacy</strong> package is loaded, it
does this automatically, and the functions below should then work for
PcpGroups, even if they are infinite.</p>
+<p>Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving double cosets, see <a
href="chapBib.html#biBtert26-a">[Ter26, Sec. 9]</a> for a description on this.
When the <strong class="pkg">TwistedConjugacy</strong> package is loaded, it
does this automatically, and the functions below should then work for
PcpGroups, even if they are infinite.</p>
<p><a id="X87BDB89B7AAFE8AD" name="X87BDB89B7AAFE8AD"></a></p>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap7.txt
new/TwistedConjugacy-3.3.1/doc/chap7.txt
--- old/TwistedConjugacy-3.3.0/doc/chap7.txt 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chap7.txt 2026-05-06 02:00:00.000000000
+0200
@@ -48,7 +48,7 @@
[1X7.2 [33X[0;0YDouble cosets[133X[101X
[33X[0;0YAlgorithms designed for computing with twisted conjugacy
classes can be
- leveraged to do computations involving double cosets, see [Ter25, Sec. 9]
+ leveraged to do computations involving double cosets, see [Ter26, Sec. 9]
for a description on this. When the [5XTwistedConjugacy[105X package is
loaded, it
does this automatically, and the functions below should then work for
PcpGroups, even if they are infinite.[133X
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap7_mj.html
new/TwistedConjugacy-3.3.1/doc/chap7_mj.html
--- old/TwistedConjugacy-3.3.0/doc/chap7_mj.html 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/chap7_mj.html 2026-05-06
02:00:00.000000000 +0200
@@ -98,7 +98,7 @@
<h4>7.2 <span class="Heading">Double cosets</span></h4>
-<p>Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving double cosets, see <a
href="chapBib_mj.html#biBtert25-a">[Ter25, Sec. 9]</a> for a description on
this. When the <strong class="pkg">TwistedConjugacy</strong> package is loaded,
it does this automatically, and the functions below should then work for
PcpGroups, even if they are infinite.</p>
+<p>Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving double cosets, see <a
href="chapBib_mj.html#biBtert26-a">[Ter26, Sec. 9]</a> for a description on
this. When the <strong class="pkg">TwistedConjugacy</strong> package is loaded,
it does this automatically, and the functions below should then work for
PcpGroups, even if they are infinite.</p>
<p><a id="X87BDB89B7AAFE8AD" name="X87BDB89B7AAFE8AD"></a></p>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap9.html
new/TwistedConjugacy-3.3.1/doc/chap9.html
--- old/TwistedConjugacy-3.3.0/doc/chap9.html 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chap9.html 2026-05-06 02:00:00.000000000
+0200
@@ -73,7 +73,7 @@
<p>Note that we do not require <span class="Math">G</span> to be abelian.</p>
-<p>Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving group derivations, see <a
href="chapBib.html#biBtert25-a">[Ter25, Sec. 10]</a> for a description on
this.</p>
+<p>Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving group derivations, see <a
href="chapBib.html#biBtert26-a">[Ter26, Sec. 10]</a> for a description on
this.</p>
<p>Please note that the functions in this chapter require <span
class="Math">G</span> and <span class="Math">H</span> to either both be finite,
or both be PcpGroups.</p>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap9.txt
new/TwistedConjugacy-3.3.1/doc/chap9.txt
--- old/TwistedConjugacy-3.3.0/doc/chap9.txt 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chap9.txt 2026-05-06 02:00:00.000000000
+0200
@@ -20,7 +20,7 @@
[33X[0;0YNote that we do not require [23XG[123X to be abelian.[133X
[33X[0;0YAlgorithms designed for computing with twisted conjugacy
classes can be
- leveraged to do computations involving group derivations, see [Ter25, Sec.
+ leveraged to do computations involving group derivations, see [Ter26, Sec.
10] for a description on this.[133X
[33X[0;0YPlease note that the functions in this chapter require
[23XG[123X and [23XH[123X to either
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chap9_mj.html
new/TwistedConjugacy-3.3.1/doc/chap9_mj.html
--- old/TwistedConjugacy-3.3.0/doc/chap9_mj.html 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/chap9_mj.html 2026-05-06
02:00:00.000000000 +0200
@@ -76,7 +76,7 @@
<p>Note that we do not require <span class="SimpleMath">\(G\)</span> to be
abelian.</p>
-<p>Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving group derivations, see <a
href="chapBib_mj.html#biBtert25-a">[Ter25, Sec. 10]</a> for a description on
this.</p>
+<p>Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving group derivations, see <a
href="chapBib_mj.html#biBtert26-a">[Ter26, Sec. 10]</a> for a description on
this.</p>
<p>Please note that the functions in this chapter require <span
class="SimpleMath">\(G\)</span> and <span class="SimpleMath">\(H\)</span> to
either both be finite, or both be PcpGroups.</p>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chapBib.html
new/TwistedConjugacy-3.3.1/doc/chapBib.html
--- old/TwistedConjugacy-3.3.0/doc/chapBib.html 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chapBib.html 2026-05-06 02:00:00.000000000
+0200
@@ -47,19 +47,6 @@
</p>
-<p><a id="biBfh94-a" name="biBfh94-a"></a></p>
-<p class='BibEntry'>
-[<span class='BibKeyLink'><a
href="https://www.ams.org/mathscinet-getitem?mr=1300546">FH94</a></span>] <b
class='BibAuthor'>Fel'shtyn, A. and Hill, R.</b>,
-<a href="https://doi.org/10/bjqxpq"><i class='BibTitle'>The Reidemeister zeta
function with applications to
- Nielsen theory and a connection with Reidemeister
- torsion</i></a>,
- <span class='BibJournal'>K-Theory</span>,
- <em class='BibVolume'>8</em> (<span class='BibNumber'>4</span>)
- (<span class='BibYear'>1994</span>),
- <span class='BibPages'>367-393</span>.
-</p>
-
-
<p><a id="biBjian83-a" name="biBjian83-a"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a
href="https://www.ams.org/mathscinet-getitem?mr=0685755">Jia83</a></span>] <b
class='BibAuthor'>Jiang, B.</b>,
@@ -71,6 +58,17 @@
</p>
+<p><a id="biBree59-a" name="biBree59-a"></a></p>
+<p class='BibEntry'>
+[<span class='BibKeyLink'><a
href="https://www.ams.org/mathscinet-getitem?mr=0106948">Ree59</a></span>] <b
class='BibAuthor'>Ree, R.</b>,
+<a href="https://doi.org/10/hb2rkv"><i class='BibTitle'>On generalized
conjugate classes in a finite group</i></a>,
+ <span class='BibJournal'>Ill. J. Math.</span>,
+ <em class='BibVolume'>3</em> (<span class='BibNumber'>3</span>)
+ (<span class='BibYear'>1959</span>),
+ <span class='BibPages'>440-444</span>.
+</p>
+
+
<p><a id="biBroma16-a" name="biBroma16-a"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a
href="https://www.ams.org/mathscinet-getitem?mr=3553164">Rom16</a></span>] <b
class='BibAuthor'>Roman'kov, V.</b>,
@@ -106,13 +104,14 @@
</p>
-<p><a id="biBtert25-a" name="biBtert25-a"></a></p>
+<p><a id="biBtert26-a" name="biBtert26-a"></a></p>
<p class='BibEntry'>
-[<span class='BibKey'>Ter25</span>] <b class='BibAuthor'>Tertooy, S.</b>,
-<a href="https://arxiv.org/abs/2504.03596"><i class='BibTitle'>Algorithms for
twisted conjugacy classes of polycyclic-by-finite
- groups II</i></a>
- (<span class='BibYear'>2025</span>),
-<span class='BibHowpublished'>arXiv:2504.03596 [math.GR]</span>.
+[<span class='BibKey'>Ter26</span>] <b class='BibAuthor'>Tertooy, S.</b>,
+<a href="https://doi.org/10/q5jb"><i class='BibTitle'>Algorithms for twisted
conjugacy classes of polycyclic-by-finite
+ groups II</i></a>,
+ <span class='BibJournal'>J. Algebra</span>
+ (<span class='BibYear'>2026</span>)<br />
+(<span class='BibNote'>Advance Online Publication</span>).
</p>
<p> </p>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chapBib.txt
new/TwistedConjugacy-3.3.1/doc/chapBib.txt
--- old/TwistedConjugacy-3.3.0/doc/chapBib.txt 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/chapBib.txt 2026-05-06 02:00:00.000000000
+0200
@@ -9,13 +9,12 @@
[[20XDT21[120X] [16XDekimpe, K. and Tertooy, S.[116X, [17XAlgorithms
for twisted conjugacy classes
of polycyclic-by-finite groups[117X, [18XTopology Appl.[118X,
[19X293[119X (2021), 107565.
- [[20XFH94[120X] [16XFel'shtyn, A. and Hill, R.[116X, [17XThe
Reidemeister zeta function with
- applications to Nielsen theory and a connection with Reidemeister
torsion[117X,
- [18XK-Theory[118X, [19X8[119X, 4 (1994), 367-393.
-
[[20XJia83[120X] [16XJiang, B.[116X, [17XLectures on Nielsen fixed
point theory[117X, Amer. Math. Soc.,
Contemp. Math., [19X14[119X (1983).
+ [[20XRee59[120X] [16XRee, R.[116X, [17XOn generalized conjugate classes
in a finite group[117X, [18XIll. J.
+ Math.[118X, [19X3[119X, 3 (1959), 440-444.
+
[[20XRom16[120X] [16XRoman'kov, V.[116X, [17XOn solvability of
equations with endomorphisms in
nilpotent groups[117X, [18XSib. Elektron. Mat. Izv.[118X, [19X13[119X
(2016), 716-725.
@@ -25,8 +24,9 @@
[[20XSen23[120X] [16XSenden, P.[116X, [17XThe Reidemeister
Spectrum of Finite Abelian Groups[117X,
[18XProc. Edinburgh Math. Soc.[118X, [19X66[119X, 4 (2023), 940-959.
- [[20XTer25[120X] [16XTertooy, S.[116X, [17XAlgorithms for
twisted conjugacy classes of
- polycyclic-by-finite groups II[117X (2025), arXiv:2504.03596 [math.GR].
+ [[20XTer26[120X] [16XTertooy, S.[116X, [17XAlgorithms for
twisted conjugacy classes of
+ polycyclic-by-finite groups II[117X, [18XJ. Algebra[118X (2026),
(Advance Online
+ Publication).
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/chapBib_mj.html
new/TwistedConjugacy-3.3.1/doc/chapBib_mj.html
--- old/TwistedConjugacy-3.3.0/doc/chapBib_mj.html 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/chapBib_mj.html 2026-05-06
02:00:00.000000000 +0200
@@ -50,19 +50,6 @@
</p>
-<p><a id="biBfh94-a" name="biBfh94-a"></a></p>
-<p class='BibEntry'>
-[<span class='BibKeyLink'><a
href="https://www.ams.org/mathscinet-getitem?mr=1300546">FH94</a></span>] <b
class='BibAuthor'>Fel'shtyn, A. and Hill, R.</b>,
-<a href="https://doi.org/10/bjqxpq"><i class='BibTitle'>The Reidemeister zeta
function with applications to
- Nielsen theory and a connection with Reidemeister
- torsion</i></a>,
- <span class='BibJournal'>K-Theory</span>,
- <em class='BibVolume'>8</em> (<span class='BibNumber'>4</span>)
- (<span class='BibYear'>1994</span>),
- <span class='BibPages'>367-393</span>.
-</p>
-
-
<p><a id="biBjian83-a" name="biBjian83-a"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a
href="https://www.ams.org/mathscinet-getitem?mr=0685755">Jia83</a></span>] <b
class='BibAuthor'>Jiang, B.</b>,
@@ -74,6 +61,17 @@
</p>
+<p><a id="biBree59-a" name="biBree59-a"></a></p>
+<p class='BibEntry'>
+[<span class='BibKeyLink'><a
href="https://www.ams.org/mathscinet-getitem?mr=0106948">Ree59</a></span>] <b
class='BibAuthor'>Ree, R.</b>,
+<a href="https://doi.org/10/hb2rkv"><i class='BibTitle'>On generalized
conjugate classes in a finite group</i></a>,
+ <span class='BibJournal'>Ill. J. Math.</span>,
+ <em class='BibVolume'>3</em> (<span class='BibNumber'>3</span>)
+ (<span class='BibYear'>1959</span>),
+ <span class='BibPages'>440-444</span>.
+</p>
+
+
<p><a id="biBroma16-a" name="biBroma16-a"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a
href="https://www.ams.org/mathscinet-getitem?mr=3553164">Rom16</a></span>] <b
class='BibAuthor'>Roman'kov, V.</b>,
@@ -109,13 +107,14 @@
</p>
-<p><a id="biBtert25-a" name="biBtert25-a"></a></p>
+<p><a id="biBtert26-a" name="biBtert26-a"></a></p>
<p class='BibEntry'>
-[<span class='BibKey'>Ter25</span>] <b class='BibAuthor'>Tertooy, S.</b>,
-<a href="https://arxiv.org/abs/2504.03596"><i class='BibTitle'>Algorithms for
twisted conjugacy classes of polycyclic-by-finite
- groups II</i></a>
- (<span class='BibYear'>2025</span>),
-<span class='BibHowpublished'>arXiv:2504.03596 [math.GR]</span>.
+[<span class='BibKey'>Ter26</span>] <b class='BibAuthor'>Tertooy, S.</b>,
+<a href="https://doi.org/10/q5jb"><i class='BibTitle'>Algorithms for twisted
conjugacy classes of polycyclic-by-finite
+ groups II</i></a>,
+ <span class='BibJournal'>J. Algebra</span>
+ (<span class='BibYear'>2026</span>)<br />
+(<span class='BibNote'>Advance Online Publication</span>).
</p>
<p> </p>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/cosets.autodoc
new/TwistedConjugacy-3.3.1/doc/cosets.autodoc
--- old/TwistedConjugacy-3.3.0/doc/cosets.autodoc 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/cosets.autodoc 2026-05-06
02:00:00.000000000 +0200
@@ -22,6 +22,6 @@
Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving double cosets, see
-<Cite Key='tert25-a' Where='Sec. 9'/> for a description on this. When the
+<Cite Key='tert26-a' Where='Sec. 9'/> for a description on this. When the
&PACKAGENAME; package is loaded, it does this automatically, and the
functions below should then work for PcpGroups, even if they are infinite.
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/derivations.autodoc
new/TwistedConjugacy-3.3.1/doc/derivations.autodoc
--- old/TwistedConjugacy-3.3.0/doc/derivations.autodoc 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/doc/derivations.autodoc 2026-05-06
02:00:00.000000000 +0200
@@ -13,7 +13,7 @@
Algorithms designed for computing with twisted conjugacy classes can be
leveraged to do computations involving group derivations, see
-<Cite Key='tert25-a' Where='Sec. 10'/> for a description on this.
+<Cite Key='tert26-a' Where='Sec. 10'/> for a description on this.
<P/>
Binary files old/TwistedConjugacy-3.3.0/doc/manual.pdf and
new/TwistedConjugacy-3.3.1/doc/manual.pdf differ
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/manual.six
new/TwistedConjugacy-3.3.1/doc/manual.six
--- old/TwistedConjugacy-3.3.0/doc/manual.six 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/manual.six 2026-05-06 02:00:00.000000000
+0200
@@ -293,8 +293,8 @@
[ "\033[2XExtendedReidemeisterSpectrum\033[102X", "5.2-2", [ 5, 2, 2 ], 84,
14, "extendedreidemeisterspectrum", "X8122B246860C1617" ],
[ "\033[2XCoincidenceReidemeisterSpectrum\033[102X", "5.2-3", [ 5, 2, 3 ],
- 92, 14, "coincidencereidemeisterspectrum", "X78839C0886EBDB71" ],
- [ "\033[2XTotalReidemeisterSpectrum\033[102X", "5.2-4", [ 5, 2, 4 ], 97,
+ 93, 14, "coincidencereidemeisterspectrum", "X78839C0886EBDB71" ],
+ [ "\033[2XTotalReidemeisterSpectrum\033[102X", "5.2-4", [ 5, 2, 4 ], 98,
14, "totalreidemeisterspectrum", "X7DB417F182B155C5" ],
[ "\033[2XIteratedReidemeisterNumberDecomposition\033[102X", "6.1-1",
[ 6, 1, 1 ], 21, 15, "iteratedreidemeisternumberdecomposition",
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/doc/title.xml
new/TwistedConjugacy-3.3.1/doc/title.xml
--- old/TwistedConjugacy-3.3.0/doc/title.xml 2026-04-09 02:00:00.000000000
+0200
+++ new/TwistedConjugacy-3.3.1/doc/title.xml 2026-05-06 02:00:00.000000000
+0200
@@ -9,7 +9,7 @@
Computation with twisted conjugacy classes
</Subtitle>
<Version>
- 3.3.0
+ 3.3.1
</Version>
<Author>
Sam Tertooy
@@ -25,7 +25,7 @@
<Homepage>https://stertooy.github.io/</Homepage>
</Author>
<Date>
- 9 April 2026
+ 6 May 2026
</Date>
<Abstract>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/lib/reidemeisternumber.gd
new/TwistedConjugacy-3.3.1/lib/reidemeisternumber.gd
--- old/TwistedConjugacy-3.3.0/lib/reidemeisternumber.gd 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/lib/reidemeisternumber.gd 2026-05-06
02:00:00.000000000 +0200
@@ -5,7 +5,7 @@
#! If $G$ is abelian, this function relies on (a generalisation of)
#! <Cite Key='jian83-a' Where='Thm. 2.5'/>.
#! If $G = H$, $G$ is finite non-abelian and $\psi = \operatorname{id}_G$, it
-#! relies on <Cite Key='fh94-a' Where='Thm. 5'/>.
+#! relies on <Cite Key='ree59-a' Where='Thm. 1'/>.
#! Otherwise, it simply calculates the twisted conjugacy classes and then
#! counts them.
#! @Arguments hom1[, hom2]
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/lib/reidemeisterspectrum.gd
new/TwistedConjugacy-3.3.1/lib/reidemeisterspectrum.gd
--- old/TwistedConjugacy-3.3.0/lib/reidemeisterspectrum.gd 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/lib/reidemeisterspectrum.gd 2026-05-06
02:00:00.000000000 +0200
@@ -1,9 +1,9 @@
#! @Returns the Reidemeister spectrum of <A>G</A>.
#! @ChapterInfo reidemeisternumbers, reidemeisterspectra
#! @Description
-#! If $G$ is abelian, this function relies on the results from
+#! If <A>G</A> is abelian, this function relies on the results from
#! <Cite Key='send23-a'/>.
-#! Otherwise, it relies on <Cite Key='fh94-a' Where='Thm. 5'/>.
+#! Otherwise, it relies on <Cite Key='ree59-a' Where='Thm. 1'/>.
#! @Arguments G
DeclareGlobalFunction( "ReidemeisterSpectrum" );
@@ -12,9 +12,10 @@
#! @Returns the extended Reidemeister spectrum of <A>G</A>.
#! @ChapterInfo reidemeisternumbers, reidemeisterspectra
#! @Description
-#! If $G$ is abelian, this is just the set of all divisors of the order of
-#! <A>G</A>.
-#! Otherwise, this function relies on <Cite Key='fh94-a' Where='Thm. 5'/>.
+#! If <A>G</A> is simple, this is the union of its Reidemeister spectrum with
+#! the element $1$.
+#! If <A>G</A> is abelian, this is just the set of all divisors its order.
+#! Otherwise, this function relies on <Cite Key='ree59-a' Where='Thm. 1'/>.
#! @Arguments G
DeclareGlobalFunction( "ExtendedReidemeisterSpectrum" );
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/TwistedConjugacy-3.3.0/lib/reidemeisterspectrum.gi
new/TwistedConjugacy-3.3.1/lib/reidemeisterspectrum.gi
--- old/TwistedConjugacy-3.3.0/lib/reidemeisterspectrum.gi 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/lib/reidemeisterspectrum.gi 2026-05-06
02:00:00.000000000 +0200
@@ -232,6 +232,13 @@
##
InstallMethod(
ExtendedReidemeisterSpectrumOp,
+ "for finite simple groups",
+ [ IsSimpleGroup and IsFinite ],
+ G -> UnionSet( ReidemeisterSpectrumOp( G ), [ 1 ] )
+);
+
+InstallMethod(
+ ExtendedReidemeisterSpectrumOp,
"for finite abelian groups",
[ IsGroup and IsFinite and IsAbelian ],
G -> DivisorsInt( Size( G ) )
@@ -297,6 +304,13 @@
);
InstallOtherMethod(
+ CoincidenceReidemeisterSpectrumOp,
+ "for a finite simple group to itself",
+ [ IsSimpleGroup and IsFinite ],
+ G -> UnionSet( ExtendedReidemeisterSpectrumOp( G ), [ Size( G ) ] )
+);
+
+InstallOtherMethod(
CoincidenceReidemeisterSpectrumOp,
"for finite abelian group to itself",
[ IsGroup and IsFinite and IsAbelian ],
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore'
old/TwistedConjugacy-3.3.0/lib/twistedconjugacyclasses.gd
new/TwistedConjugacy-3.3.1/lib/twistedconjugacyclasses.gd
--- old/TwistedConjugacy-3.3.0/lib/twistedconjugacyclasses.gd 2026-04-09
02:00:00.000000000 +0200
+++ new/TwistedConjugacy-3.3.1/lib/twistedconjugacyclasses.gd 2026-05-06
02:00:00.000000000 +0200
@@ -140,7 +140,7 @@
#! If $G$ and $H$ are finite, this function relies on an orbit-stabiliser
#! algorithm.
#! Otherwise, it relies on the algorithms in <Cite Key='dt21-a'/> and
-#! <Cite Key='tert25-a' />.
+#! <Cite Key='tert26-a' />.
#! @Arguments hom1[, hom2][, N]
DeclareGlobalFunction( "TwistedConjugacyClasses" );
#! @Arguments hom1[, hom2][, N]
++++++ _scmsync.obsinfo ++++++
--- /var/tmp/diff_new_pack.xLZ7Au/_old 2026-05-06 19:20:05.570512382 +0200
+++ /var/tmp/diff_new_pack.xLZ7Au/_new 2026-05-06 19:20:05.574512547 +0200
@@ -1,5 +1,5 @@
-mtime: 1776173639
-commit: fc8ceaa69fed941953eb0ff25a6b545248bebf3dc4f471c64c04612a9df74551
+mtime: 1778067148
+commit: 00a13924b054e4fd5515443f441a4ce4713927ff16827e40c4781b6130a13436
url: https://src.opensuse.org/jengelh/gap-twistedconjugacy
revision: master
++++++ build.specials.obscpio ++++++
++++++ build.specials.obscpio ++++++
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/.gitignore new/.gitignore
--- old/.gitignore 1970-01-01 01:00:00.000000000 +0100
+++ new/.gitignore 2026-05-06 13:32:28.000000000 +0200
@@ -0,0 +1 @@
+.osc