March 2024 - openSUSE Commits - openSUSE Mailing Lists

commit gap-standardff for openSUSE:Factory
by Source-Sync 25 Mar '24

25 Mar '24

Script 'mail_helper' called by obssrc Hello community, here is the log from the commit of package gap-standardff for openSUSE:Factory checked in at 2024-03-25 21:09:41 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/gap-standardff (Old) and /work/SRC/openSUSE:Factory/.gap-standardff.new.1905 (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Package is "gap-standardff" Mon Mar 25 21:09:41 2024 rev:2 rq:1161022 version:1.0 Changes: -------- --- /work/SRC/openSUSE:Factory/gap-standardff/gap-standardff.changes 2023-12-28 23:01:16.706036841 +0100 +++ /work/SRC/openSUSE:Factory/.gap-standardff.new.1905/gap-standardff.changes 2024-03-25 21:15:33.349391917 +0100 @@ -1,0 +2,8 @@ +Sat Mar 23 22:06:43 UTC 2024 - Jan Engelhardt <jengelh(a)inai.de> + +- Update to release 1.0 + * Support the move of the code for ``Dlog`/``DLogShanks`` to the + GAP library. + * Changed ``AsVector`` to an attribute. + +------------------------------------------------------------------- Old: ---- StandardFF-0.9.4.tar.gz New: ---- StandardFF-1.0.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ gap-standardff.spec ++++++ --- /var/tmp/diff_new_pack.Setkmt/_old 2024-03-25 21:15:33.813408954 +0100 +++ /var/tmp/diff_new_pack.Setkmt/_new 2024-03-25 21:15:33.813408954 +0100 @@ -1,7 +1,7 @@ # # spec file for package gap-standardff # -# Copyright (c) 2023 SUSE LLC +# Copyright (c) 2024 SUSE LLC # # All modifications and additions to the file contributed by third parties # remain the property of their copyright owners, unless otherwise agreed @@ -17,7 +17,7 @@ Name: gap-standardff -Version: 0.9.4 +Version: 1.0 Release: 0 Summary: GAP: Standard finite fields and cyclic generators License: GPL-3.0-or-later ++++++ StandardFF-0.9.4.tar.gz -> StandardFF-1.0.tar.gz ++++++ ++++ 9450 lines of diff (skipped)

1 0

commit gap-repndecomp for openSUSE:Factory
by Source-Sync 25 Mar '24

25 Mar '24

Script 'mail_helper' called by obssrc Hello community, here is the log from the commit of package gap-repndecomp for openSUSE:Factory checked in at 2024-03-25 21:09:38 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/gap-repndecomp (Old) and /work/SRC/openSUSE:Factory/.gap-repndecomp.new.1905 (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Package is "gap-repndecomp" Mon Mar 25 21:09:38 2024 rev:2 rq:1161019 version:1.3.0 Changes: -------- --- /work/SRC/openSUSE:Factory/gap-repndecomp/gap-repndecomp.changes 2023-12-28 23:00:39.108662749 +0100 +++ /work/SRC/openSUSE:Factory/.gap-repndecomp.new.1905/gap-repndecomp.changes 2024-03-25 21:15:29.749259731 +0100 @@ -1,0 +2,6 @@ +Sat Mar 23 22:02:59 UTC 2024 - Jan Engelhardt <jengelh(a)inai.de> + +- Update to release 1.3.0 + * Do not pass extra arguments to ``DeclareGlobalFunction`` + +------------------------------------------------------------------- Old: ---- RepnDecomp-1.2.1.tar.gz New: ---- RepnDecomp-1.3.0.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ gap-repndecomp.spec ++++++ --- /var/tmp/diff_new_pack.GEkC5Z/_old 2024-03-25 21:15:30.369282496 +0100 +++ /var/tmp/diff_new_pack.GEkC5Z/_new 2024-03-25 21:15:30.373282643 +0100 @@ -1,7 +1,7 @@ # # spec file for package gap-repndecomp # -# Copyright (c) 2023 SUSE LLC +# Copyright (c) 2024 SUSE LLC # # All modifications and additions to the file contributed by third parties # remain the property of their copyright owners, unless otherwise agreed @@ -17,7 +17,7 @@ Name: gap-repndecomp -Version: 1.2.1 +Version: 1.3.0 Release: 0 Summary: GAP: Decomposition of finite groups reprensentations into irreducibles License: GPL-3.0-only ++++++ RepnDecomp-1.2.1.tar.gz -> RepnDecomp-1.3.0.tar.gz ++++++ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/PackageInfo.g new/RepnDecomp-1.3.0/PackageInfo.g --- old/RepnDecomp-1.2.1/PackageInfo.g 2022-03-03 00:51:26.000000000 +0100 +++ new/RepnDecomp-1.3.0/PackageInfo.g 2023-01-03 02:15:20.000000000 +0100 @@ -10,8 +10,8 @@ PackageName := "RepnDecomp", Subtitle := "Decompose representations of finite groups into irreducibles", -Version := "1.2.1", -Date := "02/03/2022", # dd/mm/yyyy format +Version := "1.3.0", +Date := "02/01/2023", # dd/mm/yyyy format License := "GPL-3.0", Persons := [ @@ -65,7 +65,7 @@ PackageDoc := rec( BookName := "RepnDecomp", ArchiveURLSubset := ["doc"], - HTMLStart := "doc/chap0.html", + HTMLStart := "doc/chap0_mj.html", PDFFile := "doc/manual.pdf", SixFile := "doc/manual.six", LongTitle := "Decompose representations of finite groups into irreducibles", diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/RepnDecomp.toc new/RepnDecomp-1.3.0/doc/RepnDecomp.toc --- old/RepnDecomp-1.2.1/doc/RepnDecomp.toc 2022-03-03 00:51:44.000000000 +0100 +++ new/RepnDecomp-1.3.0/doc/RepnDecomp.toc 1970-01-01 01:00:00.000000000 +0100 @@ -1,59 +0,0 @@ -\contentsline {chapter}{\numberline {1}\textcolor {Chapter }{Introduction}}{3}{chapter.1}% -\contentsline {section}{\numberline {1.1}\textcolor {Chapter }{Getting started with RepnDecomp}}{3}{section.1.1}% -\contentsline {subsection}{\numberline {1.1.1}\textcolor {Chapter }{Installation}}{3}{subsection.1.1.1}% -\contentsline {subsection}{\numberline {1.1.2}\textcolor {Chapter }{Note on what is meant by a representation}}{3}{subsection.1.1.2}% -\contentsline {subsection}{\numberline {1.1.3}\textcolor {Chapter }{API Overview}}{3}{subsection.1.1.3}% -\contentsline {chapter}{\numberline {2}\textcolor {Chapter }{Isomorphisms between representations}}{5}{chapter.2}% -\contentsline {section}{\numberline {2.1}\textcolor {Chapter }{Finding explicit isomorphisms}}{5}{section.2.1}% -\contentsline {subsection}{\numberline {2.1.1}\textcolor {Chapter }{LinearRepresentationIsomorphism}}{5}{subsection.2.1.1}% -\contentsline {subsection}{\numberline {2.1.2}\textcolor {Chapter }{LinearRepresentationIsomorphismSlow}}{6}{subsection.2.1.2}% -\contentsline {section}{\numberline {2.2}\textcolor {Chapter }{Testing isomorphisms}}{6}{section.2.2}% -\contentsline {subsection}{\numberline {2.2.1}\textcolor {Chapter }{AreRepsIsomorphic}}{6}{subsection.2.2.1}% -\contentsline {subsection}{\numberline {2.2.2}\textcolor {Chapter }{IsLinearRepresentationIsomorphism}}{7}{subsection.2.2.2}% -\contentsline {chapter}{\numberline {3}\textcolor {Chapter }{Algorithms for unitary representations}}{8}{chapter.3}% -\contentsline {section}{\numberline {3.1}\textcolor {Chapter }{Unitarising representations}}{8}{section.3.1}% -\contentsline {subsection}{\numberline {3.1.1}\textcolor {Chapter }{UnitaryRepresentation}}{8}{subsection.3.1.1}% -\contentsline {subsection}{\numberline {3.1.2}\textcolor {Chapter }{IsUnitaryRepresentation}}{9}{subsection.3.1.2}% -\contentsline {subsection}{\numberline {3.1.3}\textcolor {Chapter }{LDLDecomposition}}{9}{subsection.3.1.3}% -\contentsline {section}{\numberline {3.2}\textcolor {Chapter }{Decomposing unitary representations}}{9}{section.3.2}% -\contentsline {subsection}{\numberline {3.2.1}\textcolor {Chapter }{IrreducibleDecompositionDixon}}{9}{subsection.3.2.1}% -\contentsline {chapter}{\numberline {4}\textcolor {Chapter }{Miscellaneous useful functions}}{10}{chapter.4}% -\contentsline {section}{\numberline {4.1}\textcolor {Chapter }{Predicates for representations}}{10}{section.4.1}% -\contentsline {subsection}{\numberline {4.1.1}\textcolor {Chapter }{IsFiniteGroupLinearRepresentation (for IsGroupHomomorphism)}}{10}{subsection.4.1.1}% -\contentsline {subsection}{\numberline {4.1.2}\textcolor {Chapter }{IsFiniteGroupPermutationRepresentation (for IsGroupHomomorphism)}}{10}{subsection.4.1.2}% -\contentsline {section}{\numberline {4.2}\textcolor {Chapter }{Efficient summing over groups}}{10}{section.4.2}% -\contentsline {subsection}{\numberline {4.2.1}\textcolor {Chapter }{GroupSumBSGS}}{10}{subsection.4.2.1}% -\contentsline {section}{\numberline {4.3}\textcolor {Chapter }{Space-efficient representation of tensors of matrices}}{11}{section.4.3}% -\contentsline {subsection}{\numberline {4.3.1}\textcolor {Chapter }{IsTensorProductOfMatricesObj (for IsMultiplicativeElementWithInverse)}}{11}{subsection.4.3.1}% -\contentsline {subsection}{\numberline {4.3.2}\textcolor {Chapter }{IsTensorProductPairRep (for IsPositionalObjectRep)}}{11}{subsection.4.3.2}% -\contentsline {subsection}{\numberline {4.3.3}\textcolor {Chapter }{IsTensorProductKroneckerRep (for IsPositionalObjectRep)}}{11}{subsection.4.3.3}% -\contentsline {subsection}{\numberline {4.3.4}\textcolor {Chapter }{TensorProductOfMatrices}}{11}{subsection.4.3.4}% -\contentsline {subsection}{\numberline {4.3.5}\textcolor {Chapter }{CharacterOfTensorProductOfRepresentations}}{11}{subsection.4.3.5}% -\contentsline {section}{\numberline {4.4}\textcolor {Chapter }{Matrices and homomorphisms}}{11}{section.4.4}% -\contentsline {subsection}{\numberline {4.4.1}\textcolor {Chapter }{ComposeHomFunction}}{11}{subsection.4.4.1}% -\contentsline {section}{\numberline {4.5}\textcolor {Chapter }{Representation theoretic functions}}{12}{section.4.5}% -\contentsline {subsection}{\numberline {4.5.1}\textcolor {Chapter }{TensorProductRepLists}}{12}{subsection.4.5.1}% -\contentsline {subsection}{\numberline {4.5.2}\textcolor {Chapter }{DirectSumOfRepresentations}}{12}{subsection.4.5.2}% -\contentsline {subsection}{\numberline {4.5.3}\textcolor {Chapter }{DegreeOfRepresentation}}{12}{subsection.4.5.3}% -\contentsline {subsection}{\numberline {4.5.4}\textcolor {Chapter }{PermToLinearRep}}{12}{subsection.4.5.4}% -\contentsline {subsection}{\numberline {4.5.5}\textcolor {Chapter }{IsOrthonormalSet}}{12}{subsection.4.5.5}% -\contentsline {chapter}{\numberline {5}\textcolor {Chapter }{Computing decompositions of representations}}{13}{chapter.5}% -\contentsline {section}{\numberline {5.1}\textcolor {Chapter }{Block diagonalizing}}{13}{section.5.1}% -\contentsline {subsection}{\numberline {5.1.1}\textcolor {Chapter }{BlockDiagonalBasisOfRepresentation}}{13}{subsection.5.1.1}% -\contentsline {subsection}{\numberline {5.1.2}\textcolor {Chapter }{BlockDiagonalRepresentation}}{13}{subsection.5.1.2}% -\contentsline {section}{\numberline {5.2}\textcolor {Chapter }{Algorithms due to the authors}}{13}{section.5.2}% -\contentsline {subsection}{\numberline {5.2.1}\textcolor {Chapter }{REPN{\textunderscore }ComputeUsingMyMethod (for IsGroupHomomorphism)}}{13}{subsection.5.2.1}% -\contentsline {subsection}{\numberline {5.2.2}\textcolor {Chapter }{REPN{\textunderscore }ComputeUsingMyMethodCanonical (for IsGroupHomomorphism)}}{14}{subsection.5.2.2}% -\contentsline {section}{\numberline {5.3}\textcolor {Chapter }{Algorithms due to Serre}}{15}{section.5.3}% -\contentsline {subsection}{\numberline {5.3.1}\textcolor {Chapter }{CanonicalDecomposition}}{15}{subsection.5.3.1}% -\contentsline {subsection}{\numberline {5.3.2}\textcolor {Chapter }{IrreducibleDecomposition}}{15}{subsection.5.3.2}% -\contentsline {subsection}{\numberline {5.3.3}\textcolor {Chapter }{IrreducibleDecompositionCollected}}{16}{subsection.5.3.3}% -\contentsline {subsection}{\numberline {5.3.4}\textcolor {Chapter }{REPN{\textunderscore }ComputeUsingSerre (for IsGroupHomomorphism)}}{16}{subsection.5.3.4}% -\contentsline {chapter}{\numberline {6}\textcolor {Chapter }{Centralizer (commutant) rings}}{18}{chapter.6}% -\contentsline {section}{\numberline {6.1}\textcolor {Chapter }{Finding a basis for the centralizer}}{18}{section.6.1}% -\contentsline {subsection}{\numberline {6.1.1}\textcolor {Chapter }{CentralizerBlocksOfRepresentation}}{18}{subsection.6.1.1}% -\contentsline {subsection}{\numberline {6.1.2}\textcolor {Chapter }{CentralizerOfRepresentation}}{18}{subsection.6.1.2}% -\contentsline {section}{\numberline {6.2}\textcolor {Chapter }{Using the centralizer for computations}}{19}{section.6.2}% -\contentsline {subsection}{\numberline {6.2.1}\textcolor {Chapter }{ClassSumCentralizer}}{19}{subsection.6.2.1}% -\contentsline {subsection}{\numberline {6.2.2}\textcolor {Chapter }{ClassSumCentralizerNC}}{19}{subsection.6.2.2}% -\contentsline {chapter}{Index}{20}{section*.2}% diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/RepnDecomp.xml new/RepnDecomp-1.3.0/doc/RepnDecomp.xml --- old/RepnDecomp-1.2.1/doc/RepnDecomp.xml 2022-03-03 00:51:43.000000000 +0100 +++ new/RepnDecomp-1.3.0/doc/RepnDecomp.xml 2023-01-03 03:06:35.000000000 +0100 @@ -3,8 +3,7 @@  <!DOCTYPE Book SYSTEM "gapdoc.dtd" [ -<!ENTITY see '<Alt Only="LaTeX">$\to$</Alt><Alt Not="LaTeX">--></Alt>'> -<!ENTITY RepnDecomp '<Package>RepnDecomp</Package>'> + [<#Include SYSTEM "_entities.xml"> ] > <Book Name="RepnDecomp"> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/_Chapter_Miscellaneous_useful_functions.xml new/RepnDecomp-1.3.0/doc/_Chapter_Miscellaneous_useful_functions.xml --- old/RepnDecomp-1.2.1/doc/_Chapter_Miscellaneous_useful_functions.xml 2022-03-03 00:51:43.000000000 +0100 +++ new/RepnDecomp-1.3.0/doc/_Chapter_Miscellaneous_useful_functions.xml 2023-01-03 03:06:35.000000000 +0100 @@ -82,7 +82,7 @@ structure. <ManSection> <Filt Arg="arg" Name="IsTensorProductOfMatricesObj" Label="for IsMultiplicativeElementWithInverse"/> - <Returns><C>true</C> or <C>false</C> + <Returns><K>true</K> or <K>false</K> </Returns> <Description> <P/> @@ -94,7 +94,7 @@ tensor product <Math>A_1 \otimes A_2</Math>. <ManSection> <Filt Arg="arg" Name="IsTensorProductPairRep" Label="for IsPositionalObjectRep"/> - <Returns><C>true</C> or <C>false</C> + <Returns><K>true</K> or <K>false</K> </Returns> <Description> <P/> @@ -106,7 +106,7 @@ is very space inefficient and supposed to be used as a last resort. <ManSection> <Filt Arg="arg" Name="IsTensorProductKroneckerRep" Label="for IsPositionalObjectRep"/> - <Returns><C>true</C> or <C>false</C> + <Returns><K>true</K> or <K>false</K> </Returns> <Description> <P/> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/_entities.xml new/RepnDecomp-1.3.0/doc/_entities.xml --- old/RepnDecomp-1.2.1/doc/_entities.xml 1970-01-01 01:00:00.000000000 +0100 +++ new/RepnDecomp-1.3.0/doc/_entities.xml 2023-01-03 03:06:35.000000000 +0100 @@ -0,0 +1 @@ +<!ENTITY RepnDecomp '<Package>RepnDecomp</Package>'> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/chap0.html new/RepnDecomp-1.3.0/doc/chap0.html --- old/RepnDecomp-1.2.1/doc/chap0.html 2022-03-03 00:51:44.000000000 +0100 +++ new/RepnDecomp-1.3.0/doc/chap0.html 2023-01-03 03:06:37.000000000 +0100 @@ -29,10 +29,10 @@ <h2>Decompose representations of finite groups into irreducibles</h2> <p> - 1.2.1</p> + 1.3.0</p> <p> - 2 March 2022 + 2 January 2023 </p> </div> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/chap0.txt new/RepnDecomp-1.3.0/doc/chap0.txt --- old/RepnDecomp-1.2.1/doc/chap0.txt 2022-03-03 00:51:43.000000000 +0100 +++ new/RepnDecomp-1.3.0/doc/chap0.txt 2023-01-03 03:06:35.000000000 +0100 @@ -6,10 +6,10 @@ [1X Decompose representations of finite groups into irreducibles [101X - 1.2.1 + 1.3.0 - 2 March 2022 + 2 January 2023 Kaashif Hymabaccus diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/chap0_mj.html new/RepnDecomp-1.3.0/doc/chap0_mj.html --- old/RepnDecomp-1.2.1/doc/chap0_mj.html 2022-03-03 00:51:44.000000000 +0100 +++ new/RepnDecomp-1.3.0/doc/chap0_mj.html 2023-01-03 03:06:37.000000000 +0100 @@ -32,10 +32,10 @@ <h2>Decompose representations of finite groups into irreducibles</h2> <p> - 1.2.1</p> + 1.3.0</p> <p> - 2 March 2022 + 2 January 2023 </p> </div> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/chap4.html new/RepnDecomp-1.3.0/doc/chap4.html --- old/RepnDecomp-1.2.1/doc/chap4.html 2022-03-03 00:51:44.000000000 +0100 +++ new/RepnDecomp-1.3.0/doc/chap4.html 2023-01-03 03:06:37.000000000 +0100 @@ -114,7 +114,7 @@ <h5>4.3-1 IsTensorProductOfMatricesObj</h5> <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsTensorProductOfMatricesObj</code>( <var class="Arg">arg</var> )</td><td class="tdright">( filter )</td></tr></table></div> -<p>Returns: <code class="code">true</code> or <code class="code">false</code></p> +<p>Returns: <code class="keyw">true</code> or <code class="keyw">false</code></p> <p>Position <span class="Math">i</span> in this representation stores the matrix <span class="Math">A_i</span> in the tensor product <span class="Math">A_1 \otimes A_2</span>.</p> @@ -123,7 +123,7 @@ <h5>4.3-2 IsTensorProductPairRep</h5> <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsTensorProductPairRep</code>( <var class="Arg">arg</var> )</td><td class="tdright">( filter )</td></tr></table></div> -<p>Returns: <code class="code">true</code> or <code class="code">false</code></p> +<p>Returns: <code class="keyw">true</code> or <code class="keyw">false</code></p> <p>Position 1 stores the full Kronecker product of the matrices, this is very space inefficient and supposed to be used as a last resort.</p> @@ -132,7 +132,7 @@ <h5>4.3-3 IsTensorProductKroneckerRep</h5> <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsTensorProductKroneckerRep</code>( <var class="Arg">arg</var> )</td><td class="tdright">( filter )</td></tr></table></div> -<p>Returns: <code class="code">true</code> or <code class="code">false</code></p> +<p>Returns: <code class="keyw">true</code> or <code class="keyw">false</code></p> <p>More convenient constructor for a tensor product (automatically handles family)</p> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/chap4.txt new/RepnDecomp-1.3.0/doc/chap4.txt --- old/RepnDecomp-1.2.1/doc/chap4.txt 2022-03-03 00:51:43.000000000 +0100 +++ new/RepnDecomp-1.3.0/doc/chap4.txt 2023-01-03 03:06:35.000000000 +0100 @@ -70,7 +70,7 @@ [1X4.3-1 IsTensorProductOfMatricesObj[101X [33X[1;0Y[29X[2XIsTensorProductOfMatricesObj[102X( [3Xarg[103X ) [32X filter[133X - [6XReturns:[106X [33X[0;10Y[10Xtrue[110X or [10Xfalse[110X[133X + [6XReturns:[106X [33X[0;10Y[9Xtrue[109X or [9Xfalse[109X[133X [33X[0;0YPosition [23Xi[123X in this representation stores the matrix [23XA_i[123X in the tensor product [23XA_1 \otimes A_2[123X.[133X @@ -78,7 +78,7 @@ [1X4.3-2 IsTensorProductPairRep[101X [33X[1;0Y[29X[2XIsTensorProductPairRep[102X( [3Xarg[103X ) [32X filter[133X - [6XReturns:[106X [33X[0;10Y[10Xtrue[110X or [10Xfalse[110X[133X + [6XReturns:[106X [33X[0;10Y[9Xtrue[109X or [9Xfalse[109X[133X [33X[0;0YPosition 1 stores the full Kronecker product of the matrices, this is very space inefficient and supposed to be used as a last resort.[133X @@ -86,7 +86,7 @@ [1X4.3-3 IsTensorProductKroneckerRep[101X [33X[1;0Y[29X[2XIsTensorProductKroneckerRep[102X( [3Xarg[103X ) [32X filter[133X - [6XReturns:[106X [33X[0;10Y[10Xtrue[110X or [10Xfalse[110X[133X + [6XReturns:[106X [33X[0;10Y[9Xtrue[109X or [9Xfalse[109X[133X [33X[0;0YMore convenient constructor for a tensor product (automatically handles family)[133X diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/chap4_mj.html new/RepnDecomp-1.3.0/doc/chap4_mj.html --- old/RepnDecomp-1.2.1/doc/chap4_mj.html 2022-03-03 00:51:44.000000000 +0100 +++ new/RepnDecomp-1.3.0/doc/chap4_mj.html 2023-01-03 03:06:37.000000000 +0100 @@ -117,7 +117,7 @@ <h5>4.3-1 IsTensorProductOfMatricesObj</h5> <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsTensorProductOfMatricesObj</code>( <var class="Arg">arg</var> )</td><td class="tdright">( filter )</td></tr></table></div> -<p>Returns: <code class="code">true</code> or <code class="code">false</code></p> +<p>Returns: <code class="keyw">true</code> or <code class="keyw">false</code></p> <p>Position <span class="SimpleMath">$i$</span> in this representation stores the matrix <span class="SimpleMath">$A_i$</span> in the tensor product <span class="SimpleMath">$A_1 \otimes A_2$</span>.</p> @@ -126,7 +126,7 @@ <h5>4.3-2 IsTensorProductPairRep</h5> <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsTensorProductPairRep</code>( <var class="Arg">arg</var> )</td><td class="tdright">( filter )</td></tr></table></div> -<p>Returns: <code class="code">true</code> or <code class="code">false</code></p> +<p>Returns: <code class="keyw">true</code> or <code class="keyw">false</code></p> <p>Position 1 stores the full Kronecker product of the matrices, this is very space inefficient and supposed to be used as a last resort.</p> @@ -135,7 +135,7 @@ <h5>4.3-3 IsTensorProductKroneckerRep</h5> <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsTensorProductKroneckerRep</code>( <var class="Arg">arg</var> )</td><td class="tdright">( filter )</td></tr></table></div> -<p>Returns: <code class="code">true</code> or <code class="code">false</code></p> +<p>Returns: <code class="keyw">true</code> or <code class="keyw">false</code></p> <p>More convenient constructor for a tensor product (automatically handles family)</p> Binary files old/RepnDecomp-1.2.1/doc/manual.pdf and new/RepnDecomp-1.3.0/doc/manual.pdf differ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/title.xml new/RepnDecomp-1.3.0/doc/title.xml --- old/RepnDecomp-1.2.1/doc/title.xml 2022-03-03 00:51:43.000000000 +0100 +++ new/RepnDecomp-1.3.0/doc/title.xml 2023-01-03 03:06:35.000000000 +0100 @@ -9,7 +9,7 @@ Decompose representations of finite groups into irreducibles </Subtitle> <Version> - 1.2.1 + 1.3.0 </Version> <Author> Kaashif Hymabaccus<Alt Only="LaTeX"><Br/></Alt> @@ -18,6 +18,6 @@ </Author> <Date> - 2 March 2022 + 2 January 2023 </Date> </TitlePage> \ No newline at end of file diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/lib/block_diagonalize.gd new/RepnDecomp-1.3.0/lib/block_diagonalize.gd --- old/RepnDecomp-1.2.1/lib/block_diagonalize.gd 2022-03-03 00:51:26.000000000 +0100 +++ new/RepnDecomp-1.3.0/lib/block_diagonalize.gd 2023-01-03 02:15:20.000000000 +0100 @@ -15,7 +15,7 @@ #! with dimension $d_i$ and multiplicity $m_i$. The basis returned by #! this operation gives each $\rho(g)$ as a block diagonal matrix #! which has $m_i$ blocks of size $d_i \times d_i$ for each $i$. -DeclareGlobalFunction( "BlockDiagonalBasisOfRepresentation", IsGroupHomomorphism ); +DeclareGlobalFunction( "BlockDiagonalBasisOfRepresentation" ); #! @Arguments rho @@ -26,6 +26,6 @@ #! Attr="BlockDiagonalBasisOfRepresentation" /> to calculate the basis #! change matrix and applies it to put $\rho$ into the block #! diagonalised form. -DeclareGlobalFunction( "BlockDiagonalRepresentation", IsGroupHomomorphism ); +DeclareGlobalFunction( "BlockDiagonalRepresentation" ); DeclareGlobalFunction( "BasisChangeMatrixSimilar" ); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/makedoc.sh new/RepnDecomp-1.3.0/makedoc.sh --- old/RepnDecomp-1.2.1/makedoc.sh 2022-03-03 00:51:26.000000000 +0100 +++ new/RepnDecomp-1.3.0/makedoc.sh 1970-01-01 01:00:00.000000000 +0100 @@ -1,38 +0,0 @@ -#!/usr/bin/env bash -# -# Copyright (C) 2017-2019 Max Horn -# Copyright (C) 2017-2019 The GAP Team -# -# This code is free software; you can redistribute it and/or modify -# it under the terms of the GNU General Public License as published by -# the Free Software Foundation; either version 2 of the License, or -# (at your option) any later version. -# -# SPDX-License-Identifier: GPL-2.0-or-later -# -set -ex - -GAPROOT=${GAPROOT-$HOME/gap} - -# set up a custom GAP root containing only this package, so that -# we can force GAP to load the correct version of this package -# (we already did that in build_pkg.sh, but we do it again here, -# to allow the occasional instance where a package wants to also -# run the tests of others packages, by invoking this script multiple -# times in different directories) -mkdir -p gaproot/pkg/ -ln -f -s $PWD gaproot/pkg/ - -# start GAP with custom GAP root, to ensure correct package version is loaded -GAP="$GAPROOT/bin/gap.sh -l $PWD/gaproot; --quitonbreak" - -# Unless explicitly turned off by setting the NO_COVERAGE environment variable, -# we collect coverage data -if [[ -z $NO_COVERAGE ]]; then - mkdir -p ${COVDIR-coverage} - GAP="$GAP --cover ${COVDIR-coverage}/$(mktemp XXXXXX).coverage" -fi - -# TODO: honor TestFile from PackageInfo record, but make sure that it -# is for the package in the current directory -$GAP -q < makedoc.g diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/tst/repndecomp01.tst new/RepnDecomp-1.3.0/tst/repndecomp01.tst --- old/RepnDecomp-1.2.1/tst/repndecomp01.tst 2022-03-03 00:51:44.000000000 +0100 +++ new/RepnDecomp-1.3.0/tst/repndecomp01.tst 2023-01-03 03:06:37.000000000 +0100 @@ -8,7 +8,7 @@ # taken. Note that the XML file in turn may have been generated by AutoDoc # from some other input. # -gap> START_TEST( "repndecomp01.tst"); +gap> START_TEST("repndecomp01.tst"); # doc/_Chapter_Introduction.xml:43-52 gap> G := SymmetricGroup(3); @@ -21,4 +21,4 @@ [ [ 0, 1, 0 ], [ 1, 0, 0 ], [ 0, 0, 1 ] ] ] # -gap> STOP_TEST("repndecomp01.tst", 1 ); +gap> STOP_TEST("repndecomp01.tst", 1); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/tst/repndecomp02.tst new/RepnDecomp-1.3.0/tst/repndecomp02.tst --- old/RepnDecomp-1.2.1/tst/repndecomp02.tst 2022-03-03 00:51:44.000000000 +0100 +++ new/RepnDecomp-1.3.0/tst/repndecomp02.tst 2023-01-03 03:06:37.000000000 +0100 @@ -8,7 +8,7 @@ # taken. Note that the XML file in turn may have been generated by AutoDoc # from some other input. # -gap> START_TEST( "repndecomp02.tst"); +gap> START_TEST("repndecomp02.tst"); # /doc/_Chunks.xml:66-93 gap> G := SymmetricGroup(4);; @@ -65,4 +65,4 @@ false # -gap> STOP_TEST("repndecomp02.tst", 1 ); +gap> STOP_TEST("repndecomp02.tst", 1); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/tst/repndecomp03.tst new/RepnDecomp-1.3.0/tst/repndecomp03.tst --- old/RepnDecomp-1.2.1/tst/repndecomp03.tst 2022-03-03 00:51:44.000000000 +0100 +++ new/RepnDecomp-1.3.0/tst/repndecomp03.tst 2023-01-03 03:06:37.000000000 +0100 @@ -8,7 +8,7 @@ # taken. Note that the XML file in turn may have been generated by AutoDoc # from some other input. # -gap> START_TEST( "repndecomp03.tst"); +gap> START_TEST("repndecomp03.tst"); # /doc/_Chunks.xml:261-287 gap> G := SymmetricGroup(3);; @@ -57,4 +57,4 @@ true # -gap> STOP_TEST("repndecomp03.tst", 1 ); +gap> STOP_TEST("repndecomp03.tst", 1); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/tst/repndecomp04.tst new/RepnDecomp-1.3.0/tst/repndecomp04.tst --- old/RepnDecomp-1.2.1/tst/repndecomp04.tst 2022-03-03 00:51:44.000000000 +0100 +++ new/RepnDecomp-1.3.0/tst/repndecomp04.tst 2023-01-03 03:06:37.000000000 +0100 @@ -8,7 +8,7 @@ # taken. Note that the XML file in turn may have been generated by AutoDoc # from some other input. # -gap> START_TEST( "repndecomp04.tst"); +gap> START_TEST("repndecomp04.tst"); # /doc/_Chunks.xml:140-164 gap> G := SymmetricGroup(4);; @@ -107,4 +107,4 @@ gap> REPN_ComputeUsingSerre(tau : irreps := irreps_H);; # -gap> STOP_TEST("repndecomp04.tst", 1 ); +gap> STOP_TEST("repndecomp04.tst", 1); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/RepnDecomp-1.2.1/tst/repndecomp05.tst new/RepnDecomp-1.3.0/tst/repndecomp05.tst --- old/RepnDecomp-1.2.1/tst/repndecomp05.tst 2022-03-03 00:51:44.000000000 +0100 +++ new/RepnDecomp-1.3.0/tst/repndecomp05.tst 2023-01-03 03:06:37.000000000 +0100 @@ -8,7 +8,7 @@ # taken. Note that the XML file in turn may have been generated by AutoDoc # from some other input. # -gap> START_TEST( "repndecomp05.tst"); +gap> START_TEST("repndecomp05.tst"); # /doc/_Chunks.xml:2-14 gap> G := DihedralGroup(8);; @@ -55,4 +55,4 @@ true # -gap> STOP_TEST("repndecomp05.tst", 1 ); +gap> STOP_TEST("repndecomp05.tst", 1);

1 0

commit gap-monoidalcategories for openSUSE:Factory
by Source-Sync 25 Mar '24

25 Mar '24

Script 'mail_helper' called by obssrc Hello community, here is the log from the commit of package gap-monoidalcategories for openSUSE:Factory checked in at 2024-03-25 21:09:37 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/gap-monoidalcategories (Old) and /work/SRC/openSUSE:Factory/.gap-monoidalcategories.new.1905 (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Package is "gap-monoidalcategories" Mon Mar 25 21:09:37 2024 rev:2 rq:1161017 version:2024.02.04 Changes: -------- --- /work/SRC/openSUSE:Factory/gap-monoidalcategories/gap-monoidalcategories.changes 2023-12-28 22:59:44.930682675 +0100 +++ /work/SRC/openSUSE:Factory/.gap-monoidalcategories.new.1905/gap-monoidalcategories.changes 2024-03-25 21:15:28.761223454 +0100 @@ -1,0 +2,6 @@ +Sat Mar 23 22:00:10 UTC 2024 - Jan Engelhardt <jengelh(a)inai.de> + +- Update to release 2024.02.04 + * No changelog was provided + +------------------------------------------------------------------- Old: ---- MonoidalCategories-2022.12-01.tar.gz New: ---- MonoidalCategories-2024.02-04.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ gap-monoidalcategories.spec ++++++ --- /var/tmp/diff_new_pack.w5XuYB/_old 2024-03-25 21:15:29.233240785 +0100 +++ /var/tmp/diff_new_pack.w5XuYB/_new 2024-03-25 21:15:29.233240785 +0100 @@ -1,7 +1,7 @@ # # spec file for package gap-monoidalcategories # -# Copyright (c) 2023 SUSE LLC +# Copyright (c) 2024 SUSE LLC # # All modifications and additions to the file contributed by third parties # remain the property of their copyright owners, unless otherwise agreed @@ -17,8 +17,8 @@ Name: gap-monoidalcategories -Version: 2022.12.01 -%define sillyver 2022.12-01 +Version: 2024.02.04 +%define sillyver 2024.02-04 Release: 0 Summary: GAP: Monoidal and monoidal (co-)closed categories License: GPL-2.0-or-later @@ -27,7 +27,7 @@ Source: https://github.com/homalg-project/CAP_project/releases/download/MonoidalCat… BuildRequires: fdupes BuildRequires: gap-rpm-devel -Requires: gap-cap >= 2022.09.17 +Requires: gap-cap >= 2023.08.16 Requires: gap-core >= 4.12.1 Requires: gap-toolsforhomalg >= 2018.05.22 ++++++ MonoidalCategories-2022.12-01.tar.gz -> MonoidalCategories-2024.02-04.tar.gz ++++++ ++++ 50193 lines of diff (skipped)

1 0

commit gap-modules for openSUSE:Factory
by Source-Sync 25 Mar '24

25 Mar '24

Script 'mail_helper' called by obssrc Hello community, here is the log from the commit of package gap-modules for openSUSE:Factory checked in at 2024-03-25 21:09:36 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/gap-modules (Old) and /work/SRC/openSUSE:Factory/.gap-modules.new.1905 (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Package is "gap-modules" Mon Mar 25 21:09:36 2024 rev:2 rq:1161016 version:2024.01.01 Changes: -------- --- /work/SRC/openSUSE:Factory/gap-modules/gap-modules.changes 2023-12-28 22:59:42.838606215 +0100 +++ /work/SRC/openSUSE:Factory/.gap-modules.new.1905/gap-modules.changes 2024-03-25 21:15:26.133126958 +0100 @@ -1,0 +2,6 @@ +Sat Mar 23 21:59:04 UTC 2024 - Jan Engelhardt <jengelh(a)inai.de> + +- Update to release 2024.01.01 + * No changelog was provided + +------------------------------------------------------------------- Old: ---- Modules-2022.11-01.tar.gz New: ---- Modules-2024.01-01.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ gap-modules.spec ++++++ --- /var/tmp/diff_new_pack.IfEoaU/_old 2024-03-25 21:15:27.793187910 +0100 +++ /var/tmp/diff_new_pack.IfEoaU/_new 2024-03-25 21:15:27.801188204 +0100 @@ -1,7 +1,7 @@ # # spec file for package gap-modules # -# Copyright (c) 2023 SUSE LLC +# Copyright (c) 2024 SUSE LLC # # All modifications and additions to the file contributed by third parties # remain the property of their copyright owners, unless otherwise agreed @@ -17,8 +17,8 @@ Name: gap-modules -Version: 2022.11.01 -%define sillyver 2022.11-01 +Version: 2024.01.01 +%define sillyver 2024.01-01 Release: 0 Summary: GAP: Abelian Finitely Presented Modules over Computable Rings License: GPL-2.0-only @@ -30,11 +30,11 @@ Source: https://github.com/homalg-project/homalg_project/releases/download/Modules-… BuildArch: noarch BuildRequires: gap-rpm-devel -Requires: gap-core >= 4.11.1 +Requires: gap-core >= 4.12.1 Requires: gap-gapdoc >= 1.0 -Requires: gap-gaussforhomalg >= 2019.09.01 +Requires: gap-gaussforhomalg >= 2023.08.01 Requires: gap-homalg >= 2022.02.01 -Requires: gap-matricesforhomalg >= 2022.02.01 +Requires: gap-matricesforhomalg >= 2023.10.01 Requires: gap-toolsforhomalg >= 2013.04.12 %description ++++++ Modules-2022.11-01.tar.gz -> Modules-2024.01-01.tar.gz ++++++ ++++ 5935 lines of diff (skipped)

1 0

commit gap-matricesforhomalg for openSUSE:Factory
by Source-Sync 25 Mar '24

25 Mar '24

Script 'mail_helper' called by obssrc Hello community, here is the log from the commit of package gap-matricesforhomalg for openSUSE:Factory checked in at 2024-03-25 21:09:35 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/gap-matricesforhomalg (Old) and /work/SRC/openSUSE:Factory/.gap-matricesforhomalg.new.1905 (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Package is "gap-matricesforhomalg" Mon Mar 25 21:09:35 2024 rev:2 rq:1161014 version:2024.02.01 Changes: -------- --- /work/SRC/openSUSE:Factory/gap-matricesforhomalg/gap-matricesforhomalg.changes 2023-12-28 22:59:38.970464844 +0100 +++ /work/SRC/openSUSE:Factory/.gap-matricesforhomalg.new.1905/gap-matricesforhomalg.changes 2024-03-25 21:15:21.072941165 +0100 @@ -1,0 +2,6 @@ +Sat Mar 23 21:56:49 UTC 2024 - Jan Engelhardt <jengelh(a)inai.de> + +- Update to release 2024.02.01 + * No changelog was provided + +------------------------------------------------------------------- Old: ---- MatricesForHomalg-2022.12-01.tar.gz New: ---- MatricesForHomalg-2024.02-01.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ gap-matricesforhomalg.spec ++++++ --- /var/tmp/diff_new_pack.77fMVj/_old 2024-03-25 21:15:22.668999766 +0100 +++ /var/tmp/diff_new_pack.77fMVj/_new 2024-03-25 21:15:22.668999766 +0100 @@ -1,7 +1,7 @@ # # spec file for package gap-matricesforhomalg # -# Copyright (c) 2023 SUSE LLC +# Copyright (c) 2024 SUSE LLC # # All modifications and additions to the file contributed by third parties # remain the property of their copyright owners, unless otherwise agreed @@ -17,8 +17,8 @@ Name: gap-matricesforhomalg -Version: 2022.12.01 -%define sillyver 2022.12-01 +Version: 2024.02.01 +%define sillyver 2024.02-01 Release: 0 Summary: GAP: Matrices for the homalg project License: GPL-2.0-only @@ -28,10 +28,9 @@ Source: https://github.com/homalg-project/homalg_project/releases/download/Matrices… BuildArch: noarch BuildRequires: gap-rpm-devel -Requires: gap-core >= 4.11.1 +Requires: gap-core >= 4.12.1 Requires: gap-gapdoc >= 1.0 -Requires: gap-toolsforhomalg >= 2018.12.15 -Suggests: gap-utils >= 0.54 +Requires: gap-toolsforhomalg >= 2023.11.01 %description The MatricesForHomalg package provides lazy evaluated matrices with ++++++ MatricesForHomalg-2022.12-01.tar.gz -> MatricesForHomalg-2024.02-01.tar.gz ++++++ ++++ 13068 lines of diff (skipped)

1 0

commit gap-linearalgebraforcap for openSUSE:Factory
by Source-Sync 25 Mar '24

25 Mar '24

Script 'mail_helper' called by obssrc Hello community, here is the log from the commit of package gap-linearalgebraforcap for openSUSE:Factory checked in at 2024-03-25 21:09:33 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/gap-linearalgebraforcap (Old) and /work/SRC/openSUSE:Factory/.gap-linearalgebraforcap.new.1905 (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Package is "gap-linearalgebraforcap" Mon Mar 25 21:09:33 2024 rev:2 rq:1161012 version:2024.02.02 Changes: -------- --- /work/SRC/openSUSE:Factory/gap-linearalgebraforcap/gap-linearalgebraforcap.changes 2023-12-28 22:59:23.061883423 +0100 +++ /work/SRC/openSUSE:Factory/.gap-linearalgebraforcap.new.1905/gap-linearalgebraforcap.changes 2024-03-25 21:15:19.132869931 +0100 @@ -1,0 +2,6 @@ +Sat Mar 23 21:54:58 UTC 2024 - Jan Engelhardt <jengelh(a)inai.de> + +- Update to release 2024.02.04 + * No changelog was provided + +------------------------------------------------------------------- Old: ---- LinearAlgebraForCAP-2022.12-04.tar.gz New: ---- LinearAlgebraForCAP-2024.02-02.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ gap-linearalgebraforcap.spec ++++++ --- /var/tmp/diff_new_pack.RQIOTo/_old 2024-03-25 21:15:19.872897103 +0100 +++ /var/tmp/diff_new_pack.RQIOTo/_new 2024-03-25 21:15:19.872897103 +0100 @@ -1,7 +1,7 @@ # # spec file for package gap-linearalgebraforcap # -# Copyright (c) 2023 SUSE LLC +# Copyright (c) 2024 SUSE LLC # # All modifications and additions to the file contributed by third parties # remain the property of their copyright owners, unless otherwise agreed @@ -12,13 +12,13 @@ # license that conforms to the Open Source Definition (Version 1.9) # published by the Open Source Initiative. -# Please submit bugfixes or comments via http://bugs.opensuse.org/ +# Please submit bugfixes or comments via https://bugs.opensuse.org/ # Name: gap-linearalgebraforcap -Version: 2022.12.04 -%define sillyver 2022.12-04 +Version: 2024.02.02 +%define sillyver 2024.02-02 Release: 0 Summary: GAP: Category of Matrices over a Field for CAP License: GPL-2.0-or-later @@ -26,16 +26,16 @@ URL: https://homalg-project.github.io/pkg/LinearAlgebraForCAP #Git-Clone: https://github.com/homalg-project/CAP_project Source: https://github.com/homalg-project/CAP_project/releases/download/LinearAlgeb… -BuildRequires: gap-devel >= 4.11 +BuildRequires: gap-devel >= 4.12.1 BuildRequires: gap-rpm-devel -Requires: gap-cap >= 2022.12.07 +Requires: gap-cap >= 2023.10.07 Requires: gap-core >= 4.12.1 Requires: gap-gapdoc >= 1.5 Requires: gap-gaussforhomalg >= 2021.04.02 -Requires: gap-matricesforhomalg >= 2021.12.01 -Requires: gap-monoidalcategories >= 2022.06.01 +Requires: gap-matricesforhomalg >= 2023.01.01 +Requires: gap-monoidalcategories >= 2024.02.02 Requires: gap-toolsforhomalg >= 2015.09.18 -Suggests: gap-freydcategoriesforcap >= 2022.12.02 +Suggests: gap-freydcategoriesforcap >= 2024.01.04 %description This package adds support for categories of matrices over a field ++++++ LinearAlgebraForCAP-2022.12-04.tar.gz -> LinearAlgebraForCAP-2024.02-02.tar.gz ++++++ ++++ 12766 lines of diff (skipped)

1 0

commit gap-kan for openSUSE:Factory
by Source-Sync 25 Mar '24

25 Mar '24

Script 'mail_helper' called by obssrc Hello community, here is the log from the commit of package gap-kan for openSUSE:Factory checked in at 2024-03-25 21:09:33 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/gap-kan (Old) and /work/SRC/openSUSE:Factory/.gap-kan.new.1905 (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Package is "gap-kan" Mon Mar 25 21:09:33 2024 rev:2 rq:1161011 version:1.37 Changes: -------- --- /work/SRC/openSUSE:Factory/gap-kan/gap-kan.changes 2023-12-28 22:59:05.885255659 +0100 +++ /work/SRC/openSUSE:Factory/.gap-kan.new.1905/gap-kan.changes 2024-03-25 21:15:18.376842172 +0100 @@ -1,0 +2,7 @@ +Sat Mar 23 21:52:18 UTC 2024 - Jan Engelhardt <jengelh(a)inai.de> + +- Update to release 1.37 + * Fixed varying output from ``DisplayRwsRules`` + * kan is now using ``PreImagesRepresentativeNC`` + +------------------------------------------------------------------- Old: ---- kan-1.34.tar.gz New: ---- kan-1.37.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ gap-kan.spec ++++++ --- /var/tmp/diff_new_pack.IwndZG/_old 2024-03-25 21:15:18.856859797 +0100 +++ /var/tmp/diff_new_pack.IwndZG/_new 2024-03-25 21:15:18.856859797 +0100 @@ -1,7 +1,7 @@ # # spec file for package gap-kan # -# Copyright (c) 2022 SUSE LLC +# Copyright (c) 2024 SUSE LLC # # All modifications and additions to the file contributed by third parties # remain the property of their copyright owners, unless otherwise agreed @@ -17,7 +17,7 @@ Name: gap-kan -Version: 1.34 +Version: 1.37 Release: 0 Summary: GAP: double coset rewriting systems License: GPL-2.0-or-later ++++++ kan-1.34.tar.gz -> kan-1.37.tar.gz ++++++ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/CHANGES.md new/kan-1.37/CHANGES.md --- old/kan-1.34/CHANGES.md 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/CHANGES.md 2024-01-23 19:16:30.000000000 +0100 @@ -1,33 +1,34 @@ -# CHANGES to the Kan package +# CHANGES to the Kan package ## ToDo: * long-standing: see the ToDo list in section 3.2 in the manual -## Version 1.34 for GAP 4.11.1 (13/03/22) +## Version 1.37 for GAP 4.12.2 (23/01/24) + * (15/08/23) fixed varying output from DisplayRwsRules + * (16/02/23) now used PreImagesRepresentativeNC + +## Version 1.35 for GAP 4.12.2 (09/02/23) + * (23/12/22) changed email address; deleted location and institution +## Version 1.34 for GAP 4.11.1 (13/03/22) * (13/03/22) adjusted dcrws3.tst because of differences between 4r11 & dev ## Version 1.33 for GAP 4.11.1 (15/11/21) - * (15/11/21) move package homepage to https://github.com/cdwensley * (08/04/21) Switch CI to use GitHub Actions ## Version 1.32 for GAP 4.11.0 (16/07/20) - * (16/07/20) fixed a problem in manual(2.2.1) reported by Daniel Longenecker ## Version 1.31 for GAP 4.10.2 (14/10/19) - * (14/10/19) made kbmag a RequiredPackage rather than a Suggested one * (14/10/19) restructured the tests ## Version 1.29 for GAP 4.10.1 (29/05/19) - * (16/02/19) added License field in PackageInfo.g ## 1.27 -> 1.28 (04/02/2018) - * (11/01/18) now using AutoDoc to build the manual * (15/12/17) removed examples/; added expt/ and xtst/ * (08/08/17) testall.g copied to testing.g; testall now calls TestDirectory @@ -41,12 +42,10 @@ added use of ReducedForm to the examples in the manual ## 1.25 -> 1.27 (20/10/2016) - * (18/10/16) now using bibliography file `bib.xml` of type `bibxmlext.dtd` * (11/10/16) changed package releases to <https://gap-packages.github.io/kan> ## 1.22 -> 1.25 (18/02/2016) - * (18/02/16) removed date/version information from file headers * (16/02/16) attempted to correct new output error when printing accT * (12/01/16) modified ENTITY names in `PackageInfo.g` @@ -54,7 +53,6 @@ * (01/09/15) major edits to `README`, including GitHub issues link ## 1.21 -> 1.22 (24/08/2015) - * (24/08/15) packed up version 1.22 prior to move from Bitbucket to Github * (26/06/15) changed output of WordAcceptorOfReducedRws from nfa to mfa fixing problem with the language langT given on p.5 of the manual @@ -62,55 +60,44 @@ adjusted `test/example` files and added to page 8 of the manual ## 1.11 -> 1.21 (01/06/2015) - * (01/06/15) `PackageInfo.g` : Kan is now an accepted package * (01/06/15) converted the bibliography to BibXMLext format - and added an URL to Anne's thesis (`heyworth.ps.gz`) ## 1.07 -> 1.11 (10/12/2014) - * (10/12/14) moved package home page to <pages.bangor.ac.uk/~mas023/chda/kan/> * (10/12/14) started bitbucket repository for kan ## 1.06 -> 1.07 (16/10/2013) - * (16/10/13) fix test files to reflect new printing of monoids * (05/02/13) rewrite of `testall.g` following Alex K's wedderga example ## 1.05 -> 1.06 (07/01/2013) - * (07/01/13) edited test file output to agree with GAP 4.6 ## 1.04 -> 1.05 (23/04/2012) - * (23/04/12) replaced ReadTest by Test in testall.g * (25/11/11) removed Anne's email address now using package directory in the format `../kan-1.05/` and archive files in the format `kan-1.05.tar` ## 1.03 -> 1.04 (21/11/2011) - * (21/11/11) forgotten why the edited version `kbsemi2.gi` of `kbsemi.gi` was needed: deleted it, since it no longer seems necesssary. ## 1.01 -> 1.03 (21/09/2011) - * (20/09/11) new version of `makedocrel.g` for building the manual * (17/09/11) Shortened the banner. * (16/09/11) Renamed subdirectory `kan/gap` as `kan/lib` ## 0.99 -> 1.01 (25/08/2011) - * (16/08/11) changed directory for archive to `.../chda/gap4r5/kan/` * (10/06/11) started version 1.01; moved Anne's files etc to folder extras. ## 0.98 -> 0.99 (07/06/2011) - * (07/06/11) LoadPackage -> DirectoriesPackagePrograms in `read.g` * (06/06/11) Tidied up file headings and made version 0.99. ## 0.97 -> 0.98 (06/05/2011) - * (06/05/11) the automaton in section 2.4.2 (Example 3) now has 44 states, rather than the previous 40 (don't know why!) * (05/05/11) test files now `fulltest.tst` and `parttest.tst`. @@ -118,13 +105,9 @@ * (18/04/10) moved Kan development to IMac at home. ## 0.96 -> 0.97 (18/11/2008) - * (14/11/08) Automata.1.12 now available, so temporary fixes removed. ## 0.95 -> 0.96 (13/11/2008) - - * (13/11/08) new Bangor website * move the Kan pages to - <http://www.maths.bangor.ac.uk/chda/kan/> * (12/11/08) temporary fix: added edited version of functions from the Automata package in files `automata.gd` and `automata.gi` * added GNU General Public License declaration @@ -132,7 +115,6 @@ following changes in the Automata package. ## 0.94 -> 0.95 (09/10/2007) - * started this `CHANGES` file * new address for Anne * fixed file permissions @@ -141,7 +123,6 @@ to "for i in [1..n] do ... od;" ## 0.91 -> 0.94 (02/06/2006) - * manual now prepared using the GAPDoc package, * test file `kan/tst/kan_manual.tst` sets the AssertionLevel to 0 to avoid recursion in the Automata package, diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/PackageInfo.g new/kan-1.37/PackageInfo.g --- old/kan-1.34/PackageInfo.g 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/PackageInfo.g 2024-01-23 19:16:30.000000000 +0100 @@ -7,8 +7,8 @@ PackageName := "kan", Subtitle := "including double coset rewriting systems", -Version := "1.34", -Date := "13/03/2022", +Version := "1.37", +Date := "23/01/2024", License := "GPL-2.0-or-later", Persons := [ @@ -17,26 +17,15 @@ FirstNames := "Anne", IsAuthor := true, IsMaintainer := false, - Place := "Open University" - ## Email := "anne.heyworth(a)gmail.com" ), rec( LastName := "Wensley", FirstNames := "Chris", IsAuthor := true, IsMaintainer := true, - Email := "c.d.wensley(a)bangor.ac.uk", + Email := "cdwensley.maths(a)btinternet.com", WWWHome := "https://github.com/cdwensley", - PostalAddress := Concatenation( [ - "Dr. C.D. Wensley\n", - "School of Computer Science\n", - "Bangor University\n", - "Dean Street\n", - "Bangor\n", - "Gwynedd LL57 1UT\n", - "UK"] ), - Place := "Bangor", - Institution := "Bangor University" + Place := "Llanfairfechan", ) ], @@ -63,7 +52,7 @@ PackageDoc := rec( BookName := "Kan", ArchiveURLSubset := ["doc"], - HTMLStart := "doc/chap0.html", + HTMLStart := "doc/chap0_mj.html", PDFFile := "doc/manual.pdf", SixFile := "doc/manual.six", LongTitle := "Computing with Kan extensions" @@ -72,7 +61,6 @@ Dependencies := rec( GAP := ">=4.11.0", NeededOtherPackages := [ [ "automata", ">= 1.14" ], - [ "GAPDoc", ">= 1.6.2" ], [ "kbmag", ">= 1.5.9" ] ], SuggestedOtherPackages := [ ], ExternalConditions := [ ] @@ -97,7 +85,7 @@ AutoDoc := rec( TitlePage := rec( Copyright := Concatenation( - "&copyright; 1996-2022 Anne Heyworth and Chris Wensley<P/>\n", + "&copyright; 1996-2024 Anne Heyworth and Chris Wensley<P/>\n", "The &Kan; package is free software; you can redistribute it ", "and/or modify it under the terms of the GNU General ", "Public License as published by the Free Software Foundation; ", @@ -118,7 +106,7 @@ "<P/>\n", "Bug reports, suggestions and comments are, of course, welcome.\n", "Please contact the last author at ", - "<Email>c.d.wensley(a)bangor.ac.uk</Email> ", + "<Email>cdwensley.maths(a)btinternet.com</Email> ", "or submit an issue at the GitHub repository ", "<URL>https://github.com/gap-packages/kan/issues/</URL>.\n" ), diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/README.md new/kan-1.37/README.md --- old/kan-1.34/README.md 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/README.md 2024-01-23 19:16:30.000000000 +0100 @@ -27,7 +27,7 @@ ## Copyright The 'Kan' package is Copyright {\copyright} Chris Wensley and Anne Heyworth, -1996--2017. +1996--2024. 'Kan' is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -53,5 +53,5 @@ ------- If you have a question relating to 'Kan', encounter any problems, or have a suggestion for extending the package in any way, please - - email: c.d.wensley(a)bangor.ac.uk - - or report an issue at: https://github.com/gap-packages/kan/issues/new \ No newline at end of file + - email: <cdwensley.maths(a)btinternet.com> + - or report an issue at: https://github.com/gap-packages/kan/issues/new diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/_entities.xml new/kan-1.37/doc/_entities.xml --- old/kan-1.34/doc/_entities.xml 1970-01-01 01:00:00.000000000 +0100 +++ new/kan-1.37/doc/_entities.xml 2024-01-23 19:19:18.000000000 +0100 @@ -0,0 +1,4 @@ +<!ENTITY AutoDoc '<Package>AutoDoc</Package>'> +<!ENTITY kan '<Package>Kan</Package>'> +<!ENTITY Automata '<Package>Automata</Package>'> +<!ENTITY Kan '<Package>Kan</Package>'> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/bib.xml new/kan-1.37/doc/bib.xml --- old/kan-1.34/doc/bib.xml 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/doc/bib.xml 2024-01-23 19:16:30.000000000 +0100 @@ -24,7 +24,9 @@ <year>2017</year> <other type="note"> GAP package, - <URL>http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/index.html</URL> + <URL> + https://www.math.rwth-aachen.de/~Frank.Luebeck/gap/GAPDoc/index.html + </URL> </other> </manual></entry> @@ -76,7 +78,7 @@ <school>University of Wales, Bangor</school> <year>1999</year> <note> - <URL>http://www.maths.bangor.ac.uk/research/ftp/theses/heyworth.ps.gz</URL> + <URL>https://www.researchgate.net/profile/Anne-Heyworth/research</URL> </note> </phdthesis></entry> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/bib.xml.bib new/kan-1.37/doc/bib.xml.bib --- old/kan-1.34/doc/bib.xml.bib 2022-03-13 10:10:26.000000000 +0100 +++ new/kan-1.37/doc/bib.xml.bib 2024-01-23 19:19:18.000000000 +0100 @@ -20,9 +20,10 @@ organization = {RWTH Aachen}, year = {2017}, note = {GAP package, \href - {http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/index.html} - {\texttt{http://www.math.rwth-aachen.de/}\discretionary + {https://www.math.rwth-aachen.de/~Frank.Luebeck/gap/GAPDoc/index.html} + {\texttt{https://www.math.rwth-aachen.de/}\discretionary {}{}{}\texttt{\texttt{\symbol{126}}Frank.Luebeck/}\discretionary + {}{}{}\texttt{gap/}\discretionary {}{}{}\texttt{GAPDoc/}\discretionary {}{}{}\texttt{index.html}}}, printedkey = {LN17} @@ -66,12 +67,11 @@ school = {University of Wales, Bangor}, year = {1999}, note = {\href - {http://www.maths.bangor.ac.uk/research/ftp/theses/heyworth.ps.gz} - {\texttt{http://www.maths.bangor.ac.uk/}\discretionary - {}{}{}\texttt{research/}\discretionary - {}{}{}\texttt{ftp/}\discretionary - {}{}{}\texttt{theses/}\discretionary - {}{}{}\texttt{heyworth.ps.gz}}}, + {https://www.researchgate.net/profile/Anne-Heyworth/research} + {\texttt{https://www.researchgate.net/}\discretionary + {}{}{}\texttt{profile/}\discretionary + {}{}{}\texttt{Anne-Heyworth/}\discretionary + {}{}{}\texttt{research}}}, printedkey = {Hey99} } @article{ SteveL, diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/chap0.html new/kan-1.37/doc/chap0.html --- old/kan-1.34/doc/chap0.html 2022-03-13 10:10:30.000000000 +0100 +++ new/kan-1.37/doc/chap0.html 2024-01-23 19:19:20.000000000 +0100 @@ -29,10 +29,10 @@ <h2>including double coset rewriting systems</h2> <p> - 1.34</p> + 1.37</p> <p> - 13 March 2022 + 23 January 2024 </p> </div> @@ -45,11 +45,9 @@ - </b> -<br />Email: <span class="URL"><a href="mailto:c.d.wensley@bangor.ac.uk">c.d.wensley(a)bangor.ac.uk</a></span> +<br />Email: <span class="URL"><a href="mailto:cdwensley.maths@btinternet.com">cdwensley.maths(a)btinternet.com</a></span> <br />Homepage: <span class="URL"><a href="https://github.com/cdwensley">https://github.com/cdwensley</a></span> -<br />Address: <br />Dr. C.D. Wensley<br /> School of Computer Science<br /> Bangor University<br /> Dean Street<br /> Bangor<br /> Gwynedd LL57 1UT<br /> UK<br /> </p> <p><a id="X7AA6C5737B711C89" name="X7AA6C5737B711C89"></a></p> @@ -60,11 +58,11 @@ <p><strong class="pkg">Kan</strong> became an accepted <strong class="pkg">GAP</strong> package in May 2015.</p> -<p>Bug reports, suggestions and comments are, of course, welcome. Please contact the last author at <span class="URL"><a href="mailto:c.d.wensley@bangor.ac.uk">c.d.wensley(a)bangor.ac.uk</a></span> or submit an issue at the GitHub repository <span class="URL"><a href="https://github.com/gap-packages/kan/issues/">https://github.com/gap-packages/kan/issues/</a></span>.</p> +<p>Bug reports, suggestions and comments are, of course, welcome. Please contact the last author at <span class="URL"><a href="mailto:cdwensley.maths@btinternet.com">cdwensley.maths(a)btinternet.com</a></span> or submit an issue at the GitHub repository <span class="URL"><a href="https://github.com/gap-packages/kan/issues/">https://github.com/gap-packages/kan/issues/</a></span>.</p> <p><a id="X81488B807F2A1CF1" name="X81488B807F2A1CF1"></a></p> <h3>Copyright</h3> -<p>© 1996-2022 Anne Heyworth and Chris Wensley</p> +<p>© 1996-2024 Anne Heyworth and Chris Wensley</p> <p>The <strong class="pkg">Kan</strong> package is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.</p> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/chap0.txt new/kan-1.37/doc/chap0.txt --- old/kan-1.34/doc/chap0.txt 2022-03-13 10:10:25.000000000 +0100 +++ new/kan-1.37/doc/chap0.txt 2024-01-23 19:19:18.000000000 +0100 @@ -6,10 +6,10 @@ [1X including double coset rewriting systems [101X - 1.34 + 1.37 - 13 March 2022 + 23 January 2024 Anne Heyworth @@ -19,17 +19,8 @@ Chris Wensley - Email: [7Xmailto:c.d.wensley@bangor.ac.uk[107X + Email: [7Xmailto:cdwensley.maths@btinternet.com[107X Homepage: [7Xhttps://github.com/cdwensley[107X - Address: [33X[0;14YDr. C.D. Wensley[133X - [33X[0;14YSchool of Computer Science[133X - [33X[0;14YBangor University[133X - [33X[0;14YDean Street[133X - [33X[0;14YBangor[133X - [33X[0;14YGwynedd LL57 1UT[133X - [33X[0;14YUK[133X - - ------------------------------------------------------- [1XAbstract[101X @@ -43,13 +34,14 @@ [33X[0;0Y[5XKan[105X became an accepted [5XGAP[105X package in May 2015.[133X [33X[0;0YBug reports, suggestions and comments are, of course, welcome. Please - contact the last author at [7Xmailto:c.d.wensley@bangor.ac.uk[107X or submit an - issue at the GitHub repository [7Xhttps://github.com/gap-packages/kan/issues/[107X.[133X + contact the last author at [7Xmailto:cdwensley.maths@btinternet.com[107X or submit + an issue at the GitHub repository + [7Xhttps://github.com/gap-packages/kan/issues/[107X.[133X ------------------------------------------------------- [1XCopyright[101X - [33X[0;0Y© 1996-2022 Anne Heyworth and Chris Wensley[133X + [33X[0;0Y© 1996-2024 Anne Heyworth and Chris Wensley[133X [33X[0;0YThe [5XKan[105X package is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/chap0_mj.html new/kan-1.37/doc/chap0_mj.html --- old/kan-1.34/doc/chap0_mj.html 2022-03-13 10:10:30.000000000 +0100 +++ new/kan-1.37/doc/chap0_mj.html 2024-01-23 19:19:20.000000000 +0100 @@ -32,10 +32,10 @@ <h2>including double coset rewriting systems</h2> <p> - 1.34</p> + 1.37</p> <p> - 13 March 2022 + 23 January 2024 </p> </div> @@ -48,11 +48,9 @@ - </b> -<br />Email: <span class="URL"><a href="mailto:c.d.wensley@bangor.ac.uk">c.d.wensley(a)bangor.ac.uk</a></span> +<br />Email: <span class="URL"><a href="mailto:cdwensley.maths@btinternet.com">cdwensley.maths(a)btinternet.com</a></span> <br />Homepage: <span class="URL"><a href="https://github.com/cdwensley">https://github.com/cdwensley</a></span> -<br />Address: <br />Dr. C.D. Wensley<br /> School of Computer Science<br /> Bangor University<br /> Dean Street<br /> Bangor<br /> Gwynedd LL57 1UT<br /> UK<br /> </p> <p><a id="X7AA6C5737B711C89" name="X7AA6C5737B711C89"></a></p> @@ -63,11 +61,11 @@ <p><strong class="pkg">Kan</strong> became an accepted <strong class="pkg">GAP</strong> package in May 2015.</p> -<p>Bug reports, suggestions and comments are, of course, welcome. Please contact the last author at <span class="URL"><a href="mailto:c.d.wensley@bangor.ac.uk">c.d.wensley(a)bangor.ac.uk</a></span> or submit an issue at the GitHub repository <span class="URL"><a href="https://github.com/gap-packages/kan/issues/">https://github.com/gap-packages/kan/issues/</a></span>.</p> +<p>Bug reports, suggestions and comments are, of course, welcome. Please contact the last author at <span class="URL"><a href="mailto:cdwensley.maths@btinternet.com">cdwensley.maths(a)btinternet.com</a></span> or submit an issue at the GitHub repository <span class="URL"><a href="https://github.com/gap-packages/kan/issues/">https://github.com/gap-packages/kan/issues/</a></span>.</p> <p><a id="X81488B807F2A1CF1" name="X81488B807F2A1CF1"></a></p> <h3>Copyright</h3> -<p>© 1996-2022 Anne Heyworth and Chris Wensley</p> +<p>© 1996-2024 Anne Heyworth and Chris Wensley</p> <p>The <strong class="pkg">Kan</strong> package is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.</p> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/chap2.html new/kan-1.37/doc/chap2.html --- old/kan-1.34/doc/chap2.html 2022-03-13 10:10:30.000000000 +0100 +++ new/kan-1.37/doc/chap2.html 2024-01-23 19:19:20.000000000 +0100 @@ -68,7 +68,7 @@ <p>We take as an example the fundamental group of the oriented surface of genus 2. The generators are by default ordered <code class="code">[A,a,B,b,C,c,D,d]</code>, so the list <code class="code">L = [2,1,4,3,6,5,8,7]</code> is used to specify the order <code class="code">[a,A,b,B,c,C,d,D]</code> to be used with the wreath ordering. Specifying a limit <code class="code">0</code> means that no limit is prescribed.</p> -<p>The operation <code class="code">DisplayRwsRules</code> prints out the rules using the letters in the given alphabet <code class="code">alph4</code> rather than using the generators of the monoid.</p> +<p>The operation <code class="code">DisplayRwsRules</code> prints out the rules using the letters in the given alphabet <code class="code">alph4</code> rather than using the generators of the monoid. (As from September 2023 the rules are first converted to a set, so that the output is the same in the latest released version and in the development version.)</p> <p>An additional method for <code class="code">ReducedForm(G,g)</code> is provided for a finitely presented group <code class="code">G</code> with a rewriting system and an element <code class="code">g</code> of <code class="code">G</code>.</p> @@ -83,9 +83,9 @@ <span class="GAPprompt">gap></span> <span class="GAPinput">alph4 := "aAbBcCdD";;</span> <span class="GAPprompt">gap></span> <span class="GAPinput">rws4 := ReducedConfluentRewritingSystem( H4, L, order, 0, alph4 );;</span> <span class="GAPprompt">gap></span> <span class="GAPinput">DisplayRwsRules( rws4 );</span> -[ [ aA, id ], [ Aa, id ], [ bB, id ], [ Bb, id ], [ cC, id ], [ Cc, id ], [ dD\ -, id ], [ Dd, id ], [ cd, dcBAba ], [ cBAbaD, Dc ], [ CD, BAbaDC ], [ Cd, dABa\ -bC ] ] +[ [ aA, id ], [ Aa, id ], [ bB, id ], [ Bb, id ], [ cC, id ], [ cd, dcBAba ], \ +[ Cc, id ], [ Cd, dABabC ], [ CD, BAbaDC ], [ dD, id ], [ Dd, id ], [ cBAbaD, \ +Dc ] ] true <span class="GAPprompt">gap></span> <span class="GAPinput">a := H4.1;; b := H4.2;; c := H4.3;; d := H4.4;; </span> <span class="GAPprompt">gap></span> <span class="GAPinput">ReducedForm( H4, c*d);</span> @@ -173,14 +173,14 @@ G-rules: [ [ Aa, id ], [ aA, id ], [ Bb, id ], [ bB, id ] ] H-rules: -[ [ Haaaa, HAA ], - [ HAAA, Haaa ] ] +[ [ HAAA, Haaa ], + [ Haaaa, HAA ] ] K-rules: -[ [ aaaK, AK ], - [ AAK, aaK ] ] +[ [ AAK, aaK ], + [ aaaK, AK ] ] H-K-rules: -[ [ HaaK, HK ], - [ HAK, HaK ] ] +[ [ HAK, HaK ], + [ HaaK, HK ] ] </pre></div> @@ -291,7 +291,8 @@ <span class="GAPprompt">gap></span> <span class="GAPinput">orderT := "wreath";;</span> <span class="GAPprompt">gap></span> <span class="GAPinput">rwsT := ReducedConfluentRewritingSystem( T, ordT, orderT, 0, alphT );;</span> <span class="GAPprompt">gap></span> <span class="GAPinput">DisplayRwsRules( rwsT );;</span> -[ [ dD, id ], [ Dd, id ], [ C, ccDD ], [ ccc, dd ], [ ddc, cdd ], [ Dc, dcDD ]\ +[ [ C, ccDD ], [ dD, id ], [ Dc, dcDD ], [ Dd, id ], [ ccc, dd ], [ \ +ddc, cdd ]\ ] <span class="GAPprompt">gap></span> <span class="GAPinput">accT := WordAcceptorOfReducedRws( rwsT );</span> < deterministic automaton on 4 letters with 7 states > diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/chap2.txt new/kan-1.37/doc/chap2.txt --- old/kan-1.34/doc/chap2.txt 2022-03-13 10:10:25.000000000 +0100 +++ new/kan-1.37/doc/chap2.txt 2024-01-23 19:19:18.000000000 +0100 @@ -31,7 +31,10 @@ prescribed.[133X [33X[0;0YThe operation [10XDisplayRwsRules[110X prints out the rules using the letters in the - given alphabet [10Xalph4[110X rather than using the generators of the monoid.[133X + given alphabet [10Xalph4[110X rather than using the generators of the monoid. (As + from September 2023 the rules are first converted to a set, so that the + output is the same in the latest released version and in the development + version.)[133X [33X[0;0YAn additional method for [10XReducedForm(G,g)[110X is provided for a finitely presented group [10XG[110X with a rewriting system and an element [10Xg[110X of [10XG[110X.[133X @@ -46,9 +49,9 @@ [4X[25Xgap>[125X [27Xalph4 := "aAbBcCdD";;[127X[104X [4X[25Xgap>[125X [27Xrws4 := ReducedConfluentRewritingSystem( H4, L, order, 0, alph4 );;[127X[104X [4X[25Xgap>[125X [27XDisplayRwsRules( rws4 );[127X[104X - [4X[28X[ [ aA, id ], [ Aa, id ], [ bB, id ], [ Bb, id ], [ cC, id ], [ Cc, id ], [ dD\[128X[104X - [4X[28X, id ], [ Dd, id ], [ cd, dcBAba ], [ cBAbaD, Dc ], [ CD, BAbaDC ], [ Cd, dABa\[128X[104X - [4X[28XbC ] ][128X[104X + [4X[28X[ [ aA, id ], [ Aa, id ], [ bB, id ], [ Bb, id ], [ cC, id ], [ cd, dcBAba ], \[128X[104X + [4X[28X[ Cc, id ], [ Cd, dABabC ], [ CD, BAbaDC ], [ dD, id ], [ Dd, id ], [ cBAbaD, \[128X[104X + [4X[28XDc ] ][128X[104X [4X[28Xtrue[128X[104X [4X[25Xgap>[125X [27Xa := H4.1;; b := H4.2;; c := H4.3;; d := H4.4;; [127X[104X [4X[25Xgap>[125X [27XReducedForm( H4, c*d);[127X[104X @@ -143,14 +146,14 @@ [4X[28XG-rules:[128X[104X [4X[28X[ [ Aa, id ], [ aA, id ], [ Bb, id ], [ bB, id ] ][128X[104X [4X[28XH-rules:[128X[104X - [4X[28X[ [ Haaaa, HAA ],[128X[104X - [4X[28X [ HAAA, Haaa ] ][128X[104X + [4X[28X[ [ HAAA, Haaa ],[128X[104X + [4X[28X [ Haaaa, HAA ] ][128X[104X [4X[28XK-rules:[128X[104X - [4X[28X[ [ aaaK, AK ],[128X[104X - [4X[28X [ AAK, aaK ] ][128X[104X + [4X[28X[ [ AAK, aaK ],[128X[104X + [4X[28X [ aaaK, AK ] ][128X[104X [4X[28XH-K-rules:[128X[104X - [4X[28X[ [ HaaK, HK ],[128X[104X - [4X[28X [ HAK, HaK ] ][128X[104X + [4X[28X[ [ HAK, HaK ],[128X[104X + [4X[28X [ HaaK, HK ] ][128X[104X [4X[28X[128X[104X [4X[32X[104X @@ -256,7 +259,8 @@ [4X[25Xgap>[125X [27XorderT := "wreath";;[127X[104X [4X[25Xgap>[125X [27XrwsT := ReducedConfluentRewritingSystem( T, ordT, orderT, 0, alphT );;[127X[104X [4X[25Xgap>[125X [27XDisplayRwsRules( rwsT );;[127X[104X - [4X[28X[ [ dD, id ], [ Dd, id ], [ C, ccDD ], [ ccc, dd ], [ ddc, cdd ], [ Dc, dcDD ]\[128X[104X + [4X[28X[ [ C, ccDD ], [ dD, id ], [ Dc, dcDD ], [ Dd, id ], [ ccc, dd ], [ \[128X[104X + [4X[28Xddc, cdd ]\[128X[104X [4X[28X ][128X[104X [4X[25Xgap>[125X [27XaccT := WordAcceptorOfReducedRws( rwsT );[127X[104X [4X[28X< deterministic automaton on 4 letters with 7 states >[128X[104X diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/chap2_mj.html new/kan-1.37/doc/chap2_mj.html --- old/kan-1.34/doc/chap2_mj.html 2022-03-13 10:10:30.000000000 +0100 +++ new/kan-1.37/doc/chap2_mj.html 2024-01-23 19:19:20.000000000 +0100 @@ -71,7 +71,7 @@ <p>We take as an example the fundamental group of the oriented surface of genus 2. The generators are by default ordered <code class="code">[A,a,B,b,C,c,D,d]</code>, so the list <code class="code">L = [2,1,4,3,6,5,8,7]</code> is used to specify the order <code class="code">[a,A,b,B,c,C,d,D]</code> to be used with the wreath ordering. Specifying a limit <code class="code">0</code> means that no limit is prescribed.</p> -<p>The operation <code class="code">DisplayRwsRules</code> prints out the rules using the letters in the given alphabet <code class="code">alph4</code> rather than using the generators of the monoid.</p> +<p>The operation <code class="code">DisplayRwsRules</code> prints out the rules using the letters in the given alphabet <code class="code">alph4</code> rather than using the generators of the monoid. (As from September 2023 the rules are first converted to a set, so that the output is the same in the latest released version and in the development version.)</p> <p>An additional method for <code class="code">ReducedForm(G,g)</code> is provided for a finitely presented group <code class="code">G</code> with a rewriting system and an element <code class="code">g</code> of <code class="code">G</code>.</p> @@ -86,9 +86,9 @@ <span class="GAPprompt">gap></span> <span class="GAPinput">alph4 := "aAbBcCdD";;</span> <span class="GAPprompt">gap></span> <span class="GAPinput">rws4 := ReducedConfluentRewritingSystem( H4, L, order, 0, alph4 );;</span> <span class="GAPprompt">gap></span> <span class="GAPinput">DisplayRwsRules( rws4 );</span> -[ [ aA, id ], [ Aa, id ], [ bB, id ], [ Bb, id ], [ cC, id ], [ Cc, id ], [ dD\ -, id ], [ Dd, id ], [ cd, dcBAba ], [ cBAbaD, Dc ], [ CD, BAbaDC ], [ Cd, dABa\ -bC ] ] +[ [ aA, id ], [ Aa, id ], [ bB, id ], [ Bb, id ], [ cC, id ], [ cd, dcBAba ], \ +[ Cc, id ], [ Cd, dABabC ], [ CD, BAbaDC ], [ dD, id ], [ Dd, id ], [ cBAbaD, \ +Dc ] ] true <span class="GAPprompt">gap></span> <span class="GAPinput">a := H4.1;; b := H4.2;; c := H4.3;; d := H4.4;; </span> <span class="GAPprompt">gap></span> <span class="GAPinput">ReducedForm( H4, c*d);</span> @@ -176,14 +176,14 @@ G-rules: [ [ Aa, id ], [ aA, id ], [ Bb, id ], [ bB, id ] ] H-rules: -[ [ Haaaa, HAA ], - [ HAAA, Haaa ] ] +[ [ HAAA, Haaa ], + [ Haaaa, HAA ] ] K-rules: -[ [ aaaK, AK ], - [ AAK, aaK ] ] +[ [ AAK, aaK ], + [ aaaK, AK ] ] H-K-rules: -[ [ HaaK, HK ], - [ HAK, HaK ] ] +[ [ HAK, HaK ], + [ HaaK, HK ] ] </pre></div> @@ -294,7 +294,8 @@ <span class="GAPprompt">gap></span> <span class="GAPinput">orderT := "wreath";;</span> <span class="GAPprompt">gap></span> <span class="GAPinput">rwsT := ReducedConfluentRewritingSystem( T, ordT, orderT, 0, alphT );;</span> <span class="GAPprompt">gap></span> <span class="GAPinput">DisplayRwsRules( rwsT );;</span> -[ [ dD, id ], [ Dd, id ], [ C, ccDD ], [ ccc, dd ], [ ddc, cdd ], [ Dc, dcDD ]\ +[ [ C, ccDD ], [ dD, id ], [ Dc, dcDD ], [ Dd, id ], [ ccc, dd ], [ \ +ddc, cdd ]\ ] <span class="GAPprompt">gap></span> <span class="GAPinput">accT := WordAcceptorOfReducedRws( rwsT );</span> < deterministic automaton on 4 letters with 7 states > diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/chap3.html new/kan-1.37/doc/chap3.html --- old/kan-1.34/doc/chap3.html 2022-03-13 10:10:30.000000000 +0100 +++ new/kan-1.37/doc/chap3.html 2024-01-23 19:19:20.000000000 +0100 @@ -59,7 +59,7 @@ <p>Version 1.28, of May 2017, saw a great many changes to the examples, with the various rewriting systems used to perform reduction of words to reduced form.</p> -<p>Only minor changes have been made in recent years. The latest version is 1.34 of March 2022.</p> +<p>Only minor changes have been made in recent years.</p> <p><a id="X83D1530487593182" name="X83D1530487593182"></a></p> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/chap3.txt new/kan-1.37/doc/chap3.txt --- old/kan-1.34/doc/chap3.txt 2022-03-13 10:10:25.000000000 +0100 +++ new/kan-1.37/doc/chap3.txt 2024-01-23 19:19:18.000000000 +0100 @@ -25,8 +25,7 @@ the various rewriting systems used to perform reduction of words to reduced form.[133X - [33X[0;0YOnly minor changes have been made in recent years. The latest version is - 1.34 of March 2022.[133X + [33X[0;0YOnly minor changes have been made in recent years.[133X [1X3.2 [33X[0;0YWhat needs doing next?[133X[101X diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/chap3_mj.html new/kan-1.37/doc/chap3_mj.html --- old/kan-1.34/doc/chap3_mj.html 2022-03-13 10:10:30.000000000 +0100 +++ new/kan-1.37/doc/chap3_mj.html 2024-01-23 19:19:20.000000000 +0100 @@ -62,7 +62,7 @@ <p>Version 1.28, of May 2017, saw a great many changes to the examples, with the various rewriting systems used to perform reduction of words to reduced form.</p> -<p>Only minor changes have been made in recent years. The latest version is 1.34 of March 2022.</p> +<p>Only minor changes have been made in recent years.</p> <p><a id="X83D1530487593182" name="X83D1530487593182"></a></p> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/chapBib.html new/kan-1.37/doc/chapBib.html --- old/kan-1.34/doc/chapBib.html 2022-03-13 10:10:30.000000000 +0100 +++ new/kan-1.37/doc/chapBib.html 2024-01-23 19:19:20.000000000 +0100 @@ -69,7 +69,7 @@ <span class='BibSchool'>University of Wales, Bangor</span> (<span class='BibYear'>1999</span>)<br /> (<span class='BibNote'> - <a href="http://www.maths.bangor.ac.uk/research/ftp/theses/heyworth.ps.gz">http://www.maths.bangor.ac.uk/research/ftp/theses/heyworth.ps.gz</a> + <a href="https://www.researchgate.net/profile/Anne-Heyworth/research">https://www.researchgate.net/profile/Anne-Heyworth/research</a> </span>). </p> @@ -104,7 +104,7 @@ (<span class='BibYear'>2017</span>)<br /> (<span class='BibNote'> GAP package, - <a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/index.html">http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/index.html</a> + <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/gap/GAPDoc/index.html">https://www.math.rwth-aachen.de/~Frank.Luebeck/gap/GAPDoc/index.html</a> </span>). </p> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/chapBib.txt new/kan-1.37/doc/chapBib.txt --- old/kan-1.34/doc/chapBib.txt 2022-03-13 10:10:25.000000000 +0100 +++ new/kan-1.37/doc/chapBib.txt 2024-01-23 19:19:18.000000000 +0100 @@ -11,24 +11,24 @@ (2000), 5–31. [[20XGH17[120X] [16XGutsche, S. and Horn, M.[116X, [17XAutoDoc - Generate documentation from GAP - source code (Version 2017.09.15)[117X (2017), (( GAP package, - https://github.com/gap-packages/AutoDoc )). + source code (Version 2017.09.15)[117X (2017), ( GAP package, + https://github.com/gap-packages/AutoDoc ). [[20XHey99[120X] [16XHeyworth, A.[116X, [17XApplications of Rewriting Systems and Groebner Bases to Computing Kan Extensions and Identities Among Relations[117X, Ph.D. thesis, - University of Wales, Bangor (1999), (( - http://www.maths.bangor.ac.uk/research/ftp/theses/heyworth.ps.gz )). + University of Wales, Bangor (1999), ( + https://www.researchgate.net/profile/Anne-Heyworth/research ). [[20XHor17[120X] [16XHorn, M.[116X, [17XGitHubPagesForGAP - Template for easily using GitHub Pages - within GAP packages (Version 0.2)[117X (2017), (( GAP package, - https://gap-system.github.io/GitHubPagesForGAP/ )). + within GAP packages (Version 0.2)[117X (2017), ( GAP package, + https://gap-system.github.io/GitHubPagesForGAP/ ). [[20XLin91[120X] [16XLinton, S.[116X, [17XDouble coset enumeration[117X, [18XJ. Symbolic Comput.[118X, [19X12[119X (1991), 415–426. [[20XLN17[120X] [16XLübeck, F. and Neunhöffer, M.[116X, [17XGAPDoc (version 1.6)[117X, RWTH Aachen - (2017), (( GAP package, - http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/index.html )). + (2017), ( GAP package, + https://www.math.rwth-aachen.de/~Frank.Luebeck/gap/GAPDoc/index.html ). diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/chapBib_mj.html new/kan-1.37/doc/chapBib_mj.html --- old/kan-1.34/doc/chapBib_mj.html 2022-03-13 10:10:30.000000000 +0100 +++ new/kan-1.37/doc/chapBib_mj.html 2024-01-23 19:19:20.000000000 +0100 @@ -72,7 +72,7 @@ <span class='BibSchool'>University of Wales, Bangor</span> (<span class='BibYear'>1999</span>)<br /> (<span class='BibNote'> - <a href="http://www.maths.bangor.ac.uk/research/ftp/theses/heyworth.ps.gz">http://www.maths.bangor.ac.uk/research/ftp/theses/heyworth.ps.gz</a> + <a href="https://www.researchgate.net/profile/Anne-Heyworth/research">https://www.researchgate.net/profile/Anne-Heyworth/research</a> </span>). </p> @@ -107,7 +107,7 @@ (<span class='BibYear'>2017</span>)<br /> (<span class='BibNote'> GAP package, - <a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/index.html">http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/index.html</a> + <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/gap/GAPDoc/index.html">https://www.math.rwth-aachen.de/~Frank.Luebeck/gap/GAPDoc/index.html</a> </span>). </p> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/dcrws.xml new/kan-1.37/doc/dcrws.xml --- old/kan-1.34/doc/dcrws.xml 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/doc/dcrws.xml 2024-01-23 19:16:30.000000000 +0100 @@ -47,7 +47,10 @@ <P/> The operation <C>DisplayRwsRules</C> prints out the rules using the letters in the given alphabet <C>alph4</C> rather than using the generators of the -monoid. +monoid. +(As from September 2023 the rules are first converted to a set, +so that the output is the same in the latest released version +and in the development version.) <P/> <Index>ReducedForm</Index> An additional method for <C>ReducedForm(G,g)</C> is provided @@ -65,9 +68,9 @@ gap> alph4 := "aAbBcCdD";; gap> rws4 := ReducedConfluentRewritingSystem( H4, L, order, 0, alph4 );; gap> DisplayRwsRules( rws4 ); -[ [ aA, id ], [ Aa, id ], [ bB, id ], [ Bb, id ], [ cC, id ], [ Cc, id ], [ dD\ -, id ], [ Dd, id ], [ cd, dcBAba ], [ cBAbaD, Dc ], [ CD, BAbaDC ], [ Cd, dABa\ -bC ] ] +[ [ aA, id ], [ Aa, id ], [ bB, id ], [ Bb, id ], [ cC, id ], [ cd, dcBAba ], \ +[ Cc, id ], [ Cd, dABabC ], [ CD, BAbaDC ], [ dD, id ], [ Dd, id ], [ cBAbaD, \ +Dc ] ] true gap> a := H4.1;; b := H4.2;; c := H4.3;; d := H4.4;; gap> ReducedForm( H4, c*d); @@ -180,14 +183,14 @@ G-rules: [ [ Aa, id ], [ aA, id ], [ Bb, id ], [ bB, id ] ] H-rules: -[ [ Haaaa, HAA ], - [ HAAA, Haaa ] ] +[ [ HAAA, Haaa ], + [ Haaaa, HAA ] ] K-rules: -[ [ aaaK, AK ], - [ AAK, aaK ] ] +[ [ AAK, aaK ], + [ aaaK, AK ] ] H-K-rules: -[ [ HaaK, HK ], - [ HAK, HaK ] ] +[ [ HAK, HaK ], + [ HaaK, HK ] ] ]]> </Example> @@ -310,7 +313,8 @@ gap> orderT := "wreath";; gap> rwsT := ReducedConfluentRewritingSystem( T, ordT, orderT, 0, alphT );; gap> DisplayRwsRules( rwsT );; -[ [ dD, id ], [ Dd, id ], [ C, ccDD ], [ ccc, dd ], [ ddc, cdd ], [ Dc, dcDD ]\ +[ [ C, ccDD ], [ dD, id ], [ Dc, dcDD ], [ Dd, id ], [ ccc, dd ], [ \ +ddc, cdd ]\ ] gap> accT := WordAcceptorOfReducedRws( rwsT ); < deterministic automaton on 4 letters with 7 states > diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/history.xml new/kan-1.37/doc/history.xml --- old/kan-1.34/doc/history.xml 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/doc/history.xml 2024-01-23 19:16:30.000000000 +0100 @@ -37,7 +37,6 @@ to reduced form. <P/> Only minor changes have been made in recent years. -The latest version is 1.34 of March 2022. <P/> </Section> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/kan.toc new/kan-1.37/doc/kan.toc --- old/kan-1.34/doc/kan.toc 2022-03-13 10:10:30.000000000 +0100 +++ new/kan-1.37/doc/kan.toc 1970-01-01 01:00:00.000000000 +0100 @@ -1,21 +0,0 @@ -\contentsline {chapter}{\numberline {1}\textcolor {Chapter }{Introduction}}{4}{chapter.1}% -\contentsline {chapter}{\numberline {2}\textcolor {Chapter }{Double Coset Rewriting Systems}}{6}{chapter.2}% -\contentsline {section}{\numberline {2.1}\textcolor {Chapter }{Rewriting Systems}}{6}{section.2.1}% -\contentsline {subsection}{\numberline {2.1.1}\textcolor {Chapter }{KnuthBendixRewritingSystem}}{6}{subsection.2.1.1}% -\contentsline {subsection}{\numberline {2.1.2}\textcolor {Chapter }{NextWord}}{7}{subsection.2.1.2}% -\contentsline {section}{\numberline {2.2}\textcolor {Chapter }{Example 2 -- free product of two cyclic groups}}{7}{section.2.2}% -\contentsline {subsection}{\numberline {2.2.1}\textcolor {Chapter }{DoubleCosetRewritingSystem}}{7}{subsection.2.2.1}% -\contentsline {subsection}{\numberline {2.2.2}\textcolor {Chapter }{DisplayAsString}}{8}{subsection.2.2.2}% -\contentsline {subsection}{\numberline {2.2.3}\textcolor {Chapter }{WordAcceptorOfReducedRws}}{9}{subsection.2.2.3}% -\contentsline {section}{\numberline {2.3}\textcolor {Chapter }{Example 3 -- the trefoil group}}{10}{section.2.3}% -\contentsline {subsection}{\numberline {2.3.1}\textcolor {Chapter }{PartialDoubleCosetRewritingSystem}}{10}{subsection.2.3.1}% -\contentsline {section}{\numberline {2.4}\textcolor {Chapter }{Example 4 -- an infinite rewriting system}}{13}{section.2.4}% -\contentsline {subsection}{\numberline {2.4.1}\textcolor {Chapter }{KBMagRewritingSystem}}{13}{subsection.2.4.1}% -\contentsline {subsection}{\numberline {2.4.2}\textcolor {Chapter }{DCrules}}{14}{subsection.2.4.2}% -\contentsline {subsection}{\numberline {2.4.3}\textcolor {Chapter }{WordToString}}{15}{subsection.2.4.3}% -\contentsline {chapter}{\numberline {3}\textcolor {Chapter }{Development History}}{17}{chapter.3}% -\contentsline {section}{\numberline {3.1}\textcolor {Chapter }{Versions of the package}}{17}{section.3.1}% -\contentsline {section}{\numberline {3.2}\textcolor {Chapter }{What needs doing next?}}{17}{section.3.2}% -\contentsline {subsection}{\numberline {3.2.1}\textcolor {Chapter }{DoubleCosetsAutomaton}}{18}{subsection.3.2.1}% -\contentsline {chapter}{References}{19}{chapter*.5}% -\contentsline {chapter}{Index}{20}{section*.6}% diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/kan.xml new/kan-1.37/doc/kan.xml --- old/kan-1.34/doc/kan.xml 2022-03-13 10:10:25.000000000 +0100 +++ new/kan-1.37/doc/kan.xml 2024-01-23 19:19:18.000000000 +0100 @@ -3,11 +3,7 @@  <!DOCTYPE Book SYSTEM "gapdoc.dtd" [ -<!ENTITY AutoDoc '<Package>AutoDoc</Package>'> -<!ENTITY kan '<Package>Kan</Package>'> -<!ENTITY see '<Alt Only="LaTeX">$\to$</Alt><Alt Not="LaTeX">--></Alt>'> -<!ENTITY Automata '<Package>Automata</Package>'> -<!ENTITY Kan '<Package>Kan</Package>'> + [<#Include SYSTEM "_entities.xml"> ] > <Book Name="Kan"> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/manual.js new/kan-1.37/doc/manual.js --- old/kan-1.34/doc/manual.js 2022-03-13 10:10:30.000000000 +0100 +++ new/kan-1.37/doc/manual.js 2024-01-23 19:19:20.000000000 +0100 @@ -86,7 +86,8 @@ var el = document.createElement("a"); var oncl = document.createAttribute("href"); var back = window.location.protocol+"//" - if (window.location.protocol == "http:") { + if (window.location.protocol == "http:" || + window.location.protocol == "https:") { back = back+window.location.host; if (window.location.port != "") { back = back+":"+window.location.port; Binary files old/kan-1.34/doc/manual.pdf and new/kan-1.37/doc/manual.pdf differ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/manual.six new/kan-1.37/doc/manual.six --- old/kan-1.34/doc/manual.six 2022-03-13 10:10:30.000000000 +0100 +++ new/kan-1.37/doc/manual.six 2024-01-23 19:19:20.000000000 +0100 @@ -4,11 +4,11 @@ bookname := "Kan", entries := [ [ "Title page", ".", [ 0, 0, 0 ], 1, 1, "title page", "X7D2C85EC87DD46E5" ], - [ "Abstract", ".-1", [ 0, 0, 1 ], 35, 2, "abstract", "X7AA6C5737B711C89" ], - [ "Copyright", ".-2", [ 0, 0, 2 ], 51, 2, "copyright", "X81488B807F2A1CF1" ] - , [ "Acknowledgements", ".-3", [ 0, 0, 3 ], 61, 2, "acknowledgements", + [ "Abstract", ".-1", [ 0, 0, 1 ], 26, 2, "abstract", "X7AA6C5737B711C89" ], + [ "Copyright", ".-2", [ 0, 0, 2 ], 43, 2, "copyright", "X81488B807F2A1CF1" ] + , [ "Acknowledgements", ".-3", [ 0, 0, 3 ], 53, 2, "acknowledgements", "X82A988D47DFAFCFA" ], - [ "Table of Contents", ".-4", [ 0, 0, 4 ], 70, 3, "table of contents", + [ "Table of Contents", ".-4", [ 0, 0, 4 ], 62, 3, "table of contents", "X8537FEB07AF2BEC8" ], [ "\033[1X\033[33X\033[0;-2YIntroduction\033[133X\033[101X", "1", [ 1, 0, 0 ], 1, 4, "introduction", "X7DFB63A97E67C0A1" ], @@ -20,14 +20,14 @@ [ 2, 1, 0 ], 9, 6, "rewriting systems", "X7CA8FCFD81AA1890" ], [ "\033[1X\033[33X\033[0;-2YExample 2 -- free product of two cyclic groups\\ -033[133X\033[101X", "2.2", [ 2, 2, 0 ], 87, 7, +033[133X\033[101X", "2.2", [ 2, 2, 0 ], 90, 7, "example 2 -- free product of two cyclic groups", "X80B18B248603B3D6" ], [ "\033[1X\033[33X\033[0;-2YExample 3 -- the trefoil group\033[133X\033[101X\ -", "2.3", [ 2, 3, 0 ], 232, 10, "example 3 -- the trefoil group", +", "2.3", [ 2, 3, 0 ], 235, 10, "example 3 -- the trefoil group", "X82FE46C27FE55A84" ], [ "\033[1X\033[33X\033[0;-2YExample 4 -- an infinite rewriting system\033[133\ -X\033[101X", "2.4", [ 2, 4, 0 ], 402, 13, +X\033[101X", "2.4", [ 2, 4, 0 ], 406, 13, "example 4 -- an infinite rewriting system", "X7ED711187E2ECAC7" ], [ "\033[1X\033[33X\033[0;-2YDevelopment History\033[133X\033[101X", "3", [ 3, 0, 0 ], 1, 17, "development history", "X810C43BC7F63C4B4" ], @@ -35,7 +35,7 @@ "3.1", [ 3, 1, 0 ], 4, 17, "versions of the package", "X8192EA4C7B7CC5CD" ], [ "\033[1X\033[33X\033[0;-2YWhat needs doing next?\033[133X\033[101X", - "3.2", [ 3, 2, 0 ], 31, 17, "what needs doing next?", + "3.2", [ 3, 2, 0 ], 30, 17, "what needs doing next?", "X83D1530487593182" ], [ "Bibliography", "bib", [ "Bib", 0, 0 ], 1, 19, "bibliography", "X7A6F98FD85F02BFE" ], @@ -50,61 +50,61 @@ "displayrwsrules", "X87A3823483E4FF86" ], [ "ReducedForm", "2.1-1", [ 2, 1, 1 ], 12, 6, "reducedform", "X87A3823483E4FF86" ], - [ "\033[2XNextWord\033[102X", "2.1-2", [ 2, 1, 2 ], 59, 7, "nextword", + [ "\033[2XNextWord\033[102X", "2.1-2", [ 2, 1, 2 ], 62, 7, "nextword", "X7AF0265982B42E47" ], - [ "\033[2XNextWords\033[102X", "2.1-2", [ 2, 1, 2 ], 59, 7, "nextwords", + [ "\033[2XNextWords\033[102X", "2.1-2", [ 2, 1, 2 ], 62, 7, "nextwords", "X7AF0265982B42E47" ], - [ "example -- free product", "2.2", [ 2, 2, 0 ], 87, 7, + [ "example -- free product", "2.2", [ 2, 2, 0 ], 90, 7, "example -- free product", "X80B18B248603B3D6" ], - [ "\033[2XDoubleCosetRewritingSystem\033[102X", "2.2-1", [ 2, 2, 1 ], 90, + [ "\033[2XDoubleCosetRewritingSystem\033[102X", "2.2-1", [ 2, 2, 1 ], 93, 7, "doublecosetrewritingsystem", "X825D1F4D85DE122D" ], - [ "\033[2XIsDoubleCosetRewritingSystem\033[102X", "2.2-1", [ 2, 2, 1 ], 90, + [ "\033[2XIsDoubleCosetRewritingSystem\033[102X", "2.2-1", [ 2, 2, 1 ], 93, 7, "isdoublecosetrewritingsystem", "X825D1F4D85DE122D" ], - [ "\033[2XDisplayAsString\033[102X", "2.2-2", [ 2, 2, 2 ], 160, 8, + [ "\033[2XDisplayAsString\033[102X", "2.2-2", [ 2, 2, 2 ], 163, 9, "displayasstring", "X82E14C4284D89ADF" ], - [ "\033[2XWordAcceptorOfReducedRws\033[102X", "2.2-3", [ 2, 2, 3 ], 190, 9, + [ "\033[2XWordAcceptorOfReducedRws\033[102X", "2.2-3", [ 2, 2, 3 ], 193, 9, "wordacceptorofreducedrws", "X83FF05087E7B133A" ], [ "\033[2XWordAcceptorOfDoubleCosetRws\033[102X", "2.2-3", [ 2, 2, 3 ], - 190, 9, "wordacceptorofdoublecosetrws", "X83FF05087E7B133A" ], + 193, 9, "wordacceptorofdoublecosetrws", "X83FF05087E7B133A" ], [ "\033[2XIsWordAcceptorOfDoubleCosetRws\033[102X", "2.2-3", [ 2, 2, 3 ], - 190, 9, "iswordacceptorofdoublecosetrws", "X83FF05087E7B133A" ], - [ "example -- trefoil group", "2.3", [ 2, 3, 0 ], 232, 10, + 193, 9, "iswordacceptorofdoublecosetrws", "X83FF05087E7B133A" ], + [ "example -- trefoil group", "2.3", [ 2, 3, 0 ], 235, 10, "example -- trefoil group", "X82FE46C27FE55A84" ], - [ "trefoil group", "2.3", [ 2, 3, 0 ], 232, 10, "trefoil group", + [ "trefoil group", "2.3", [ 2, 3, 0 ], 235, 10, "trefoil group", "X82FE46C27FE55A84" ], [ "\033[2XPartialDoubleCosetRewritingSystem\033[102X", "2.3-1", - [ 2, 3, 1 ], 235, 10, "partialdoublecosetrewritingsystem", + [ 2, 3, 1 ], 238, 10, "partialdoublecosetrewritingsystem", "X83DE506B828F4B0D" ], [ "\033[2XWordAcceptorOfPartialDoubleCosetRws\033[102X", "2.3-1", - [ 2, 3, 1 ], 235, 10, "wordacceptorofpartialdoublecosetrws", + [ 2, 3, 1 ], 238, 10, "wordacceptorofpartialdoublecosetrws", "X83DE506B828F4B0D" ], - [ "example -- infinite rws", "2.4", [ 2, 4, 0 ], 402, 13, + [ "example -- infinite rws", "2.4", [ 2, 4, 0 ], 406, 13, "example -- infinite rws", "X7ED711187E2ECAC7" ], - [ "\033[2XKBMagRewritingSystem\033[102X", "2.4-1", [ 2, 4, 1 ], 405, 13, + [ "\033[2XKBMagRewritingSystem\033[102X", "2.4-1", [ 2, 4, 1 ], 409, 13, "kbmagrewritingsystem", "X8722C57284F51940" ], - [ "\033[2XKBMagWordAcceptor\033[102X", "2.4-1", [ 2, 4, 1 ], 405, 13, + [ "\033[2XKBMagWordAcceptor\033[102X", "2.4-1", [ 2, 4, 1 ], 409, 13, "kbmagwordacceptor", "X8722C57284F51940" ], - [ "\033[2XKBMagFSAtoAutomataDFA\033[102X", "2.4-1", [ 2, 4, 1 ], 405, 13, + [ "\033[2XKBMagFSAtoAutomataDFA\033[102X", "2.4-1", [ 2, 4, 1 ], 409, 13, "kbmagfsatoautomatadfa", "X8722C57284F51940" ], - [ "\033[2XWordAcceptorByKBMag\033[102X", "2.4-1", [ 2, 4, 1 ], 405, 13, + [ "\033[2XWordAcceptorByKBMag\033[102X", "2.4-1", [ 2, 4, 1 ], 409, 13, "wordacceptorbykbmag", "X8722C57284F51940" ], [ "\033[2XWordAcceptorByKBMagOfDoubleCosetRws\033[102X", "2.4-1", - [ 2, 4, 1 ], 405, 13, "wordacceptorbykbmagofdoublecosetrws", + [ 2, 4, 1 ], 409, 13, "wordacceptorbykbmagofdoublecosetrws", "X8722C57284F51940" ], - [ "\033[2XDCrules\033[102X", "2.4-2", [ 2, 4, 2 ], 452, 14, "dcrules", + [ "\033[2XDCrules\033[102X", "2.4-2", [ 2, 4, 2 ], 456, 14, "dcrules", "X815C08FD87D014B5" ], - [ "\033[2XHrules\033[102X", "2.4-2", [ 2, 4, 2 ], 452, 14, "hrules", + [ "\033[2XHrules\033[102X", "2.4-2", [ 2, 4, 2 ], 456, 14, "hrules", "X815C08FD87D014B5" ], - [ "\033[2XKrules\033[102X", "2.4-2", [ 2, 4, 2 ], 452, 14, "krules", + [ "\033[2XKrules\033[102X", "2.4-2", [ 2, 4, 2 ], 456, 14, "krules", "X815C08FD87D014B5" ], - [ "\033[2XHKrules\033[102X", "2.4-2", [ 2, 4, 2 ], 452, 14, "hkrules", + [ "\033[2XHKrules\033[102X", "2.4-2", [ 2, 4, 2 ], 456, 14, "hkrules", "X815C08FD87D014B5" ], - [ "\033[2XWordToString\033[102X", "2.4-3", [ 2, 4, 3 ], 539, 15, + [ "\033[2XWordToString\033[102X", "2.4-3", [ 2, 4, 3 ], 543, 15, "wordtostring", "X84B36973833F3B54" ], - [ "\033[2XIdentityDoubleCoset\033[102X", "2.4-3", [ 2, 4, 3 ], 539, 15, + [ "\033[2XIdentityDoubleCoset\033[102X", "2.4-3", [ 2, 4, 3 ], 543, 15, "identitydoublecoset", "X84B36973833F3B54" ], - [ "\033[2XDoubleCosetsAutomaton\033[102X", "3.2-1", [ 3, 2, 1 ], 47, 18, + [ "\033[2XDoubleCosetsAutomaton\033[102X", "3.2-1", [ 3, 2, 1 ], 46, 18, "doublecosetsautomaton", "X852CC057809CE3EE" ], - [ "\033[2XRightCosetsAutomaton\033[102X", "3.2-1", [ 3, 2, 1 ], 47, 18, + [ "\033[2XRightCosetsAutomaton\033[102X", "3.2-1", [ 3, 2, 1 ], 46, 18, "rightcosetsautomaton", "X852CC057809CE3EE" ] ] ); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/doc/title.xml new/kan-1.37/doc/title.xml --- old/kan-1.34/doc/title.xml 2022-03-13 10:10:25.000000000 +0100 +++ new/kan-1.37/doc/title.xml 2024-01-23 19:19:18.000000000 +0100 @@ -9,7 +9,7 @@ including double coset rewriting systems </Subtitle> <Version> - 1.34 + 1.37 </Version> <Author> Anne Heyworth<Alt Only="LaTeX"><Br/></Alt> @@ -17,21 +17,12 @@ </Author> <Author> Chris Wensley<Alt Only="LaTeX"><Br/></Alt> -<Address> -Dr. C.D. Wensley<Br/> -School of Computer Science<Br/> -Bangor University<Br/> -Dean Street<Br/> -Bangor<Br/> -Gwynedd LL57 1UT<Br/> -UK<Br/> -</Address> -<Email>c.d.wensley(a)bangor.ac.uk</Email> +<Email>cdwensley.maths(a)btinternet.com</Email> <Homepage>https://github.com/cdwensley</Homepage> </Author> <Date> - 13 March 2022 + 23 January 2024 </Date> <Abstract> &Kan; is a &GAP; package originally implemented in 1996 using the &GAP; 3 language, to compute induced actions of categories, when the first author was studying for a Ph.D. in Bangor. @@ -41,13 +32,11 @@ &Kan; became an accepted &GAP; package in May 2015. <P/> Bug reports, suggestions and comments are, of course, welcome. -Please contact the last author at <Email>c.d.wensley(a)bangor.ac.uk</Email> or submit an issue at the GitHub repository <URL>https://github.com/gap-packages/kan/issues/</URL>. - +Please contact the last author at <Email>cdwensley.maths(a)btinternet.com</Email> or submit an issue at the GitHub repository <URL>https://github.com/gap-packages/kan/issues/</URL>. </Abstract> <Copyright> - &copyright; 1996-2022 Anne Heyworth and Chris Wensley<P/> + &copyright; 1996-2024 Anne Heyworth and Chris Wensley<P/> The &Kan; package is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. - </Copyright> <Acknowledgements> This documentation was prepared using the &GAPDoc; <Cite Key='GAPDoc'/> and &AutoDoc; <Cite Key='AutoDoc'/> packages.<P/> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/init.g new/kan-1.37/init.g --- old/kan-1.34/init.g 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/init.g 2024-01-23 19:16:30.000000000 +0100 @@ -3,6 +3,10 @@ #W init.g GAP package `kan' Chris Wensley #W & Anne Heyworth +if not IsBound( PreImagesRepresentativeNC ) then + BindGlobal( "PreImagesRepresentativeNC", PreImagesRepresentative ); +fi; + ## read the function declarations ReadPackage( "kan", "lib/dcrws.gd" ); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/lib/dcrws.gi new/kan-1.37/lib/dcrws.gi --- old/kan-1.34/lib/dcrws.gi 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/lib/dcrws.gi 2024-01-23 19:16:30.000000000 +0100 @@ -2,7 +2,7 @@ ## #W dcrws.gi Kan Package Chris Wensley #W & Anne Heyworth -#Y Copyright (C) 1996-2017, Chris Wensley and Anne Heyworth +#Y Copyright (C) 1996-2023, Chris Wensley and Anne Heyworth ## ## This file contains generic methods for double coset rewriting systems ## @@ -170,6 +170,8 @@ fi; fi; cG:=0; cH:=0; cK:=0; cHK:=0; + ## (15/8/23) make output same for GAP 4.12 and gapdev + rules := Set(rules); numr := Length( rules ); type := ListWithIdenticalEntries( numr, 0 ); if extended then diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/lib/kbrws.gi new/kan-1.37/lib/kbrws.gi --- old/kan-1.34/lib/kbrws.gi 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/lib/kbrws.gi 2024-01-23 19:16:30.000000000 +0100 @@ -1,8 +1,8 @@ ############################################################################## ## -#W kbrws.gi Kan Package Chris Wensley -#W & Anne Heyworth -#Y Copyright (C) 1996-2017, Chris Wensley and Anne Heyworth +#W kbrws.gi Kan Package Chris Wensley +#W & Anne Heyworth +#Y Copyright (C) 1996-2023, Chris Wensley and Anne Heyworth ## ## This file contains functions taken from the library files ## rws.gi and kbsemi.gi, and modified to allow partial rewrite systems @@ -261,7 +261,7 @@ mg := Image( hom, g ); r := ReducedForm( rws, UnderlyingElement(mg) ); rmg := ElementOfFpMonoid( fam, r ); - rg := PreImagesRepresentative( hom, rmg ); + rg := PreImagesRepresentativeNC( hom, rmg ); return rg; end ); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/makedoc.g new/kan-1.37/makedoc.g --- old/kan-1.34/makedoc.g 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/makedoc.g 2024-01-23 19:16:30.000000000 +0100 @@ -4,6 +4,7 @@ ## call this with GAP from within the package root directory LoadPackage( "Kan" ); +LoadPackage( "GAPDoc" ); LoadPackage( "AutoDoc" ); AutoDoc(rec( diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/tst/dcrws1.g new/kan-1.37/tst/dcrws1.g --- old/kan-1.34/tst/dcrws1.g 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/tst/dcrws1.g 1970-01-01 01:00:00.000000000 +0100 @@ -1,4 +0,0 @@ -## kan/tst/dcrws1.g -LoadPackage("kan"); -Print( "running dcrws1.tst\n" ); -Test( "tst/manual/dcrws1.tst", rec(compareFunction := "uptowhitespace") ); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/tst/dcrws2.g new/kan-1.37/tst/dcrws2.g --- old/kan-1.34/tst/dcrws2.g 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/tst/dcrws2.g 1970-01-01 01:00:00.000000000 +0100 @@ -1,4 +0,0 @@ -## kan/tst/dcrws2.g -LoadPackage("kan"); -Print( "running dcrws2.tst\n" ); -Test( "tst/manual/dcrws2.tst", rec(compareFunction := "uptowhitespace") ); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/tst/dcrws3.g new/kan-1.37/tst/dcrws3.g --- old/kan-1.34/tst/dcrws3.g 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/tst/dcrws3.g 1970-01-01 01:00:00.000000000 +0100 @@ -1,4 +0,0 @@ -## kan/tst/dcrws3.g -LoadPackage("kan"); -Print( "running dcrws3.tst\n" ); -Test( "tst/manual/dcrws3.tst", rec(compareFunction := "uptowhitespace") ); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/tst/dcrws4.g new/kan-1.37/tst/dcrws4.g --- old/kan-1.34/tst/dcrws4.g 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/tst/dcrws4.g 1970-01-01 01:00:00.000000000 +0100 @@ -1,4 +0,0 @@ -## kan/tst/dcrws4.g -LoadPackage("kan"); -Print( "running dcrws4.tst\n" ); -Test( "tst/manual/dcrws4.tst", rec(compareFunction := "uptowhitespace") ); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/tst/history.g new/kan-1.37/tst/history.g --- old/kan-1.34/tst/history.g 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/tst/history.g 1970-01-01 01:00:00.000000000 +0100 @@ -1,4 +0,0 @@ -## kan/tst/history.g -LoadPackage("kan"); -Print( "running history.tst\n" ); -Test( "tst/manual/history.tst", rec(compareFunction := "uptowhitespace") ); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/tst/kbtest.g new/kan-1.37/tst/kbtest.g --- old/kan-1.34/tst/kbtest.g 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/tst/kbtest.g 1970-01-01 01:00:00.000000000 +0100 @@ -1,4 +0,0 @@ -## kan/tst/kbtest.g -LoadPackage("kan"); -Print( "running kbtest.tst\n" ); -Test( "tst/extra/kbtest.tst", rec(compareFunction := "uptowhitespace") ); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/tst/manual/dcrws1.tst new/kan-1.37/tst/manual/dcrws1.tst --- old/kan-1.34/tst/manual/dcrws1.tst 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/tst/manual/dcrws1.tst 2024-01-23 19:16:30.000000000 +0100 @@ -2,7 +2,7 @@ ## #W dcrws1.tst Kan Package Chris Wensley #W & Anne Heyworth -#Y Copyright (C) 1996-2019, Chris Wensley and Anne Heyworth +#Y Copyright (C) 1996-2023, Chris Wensley and Anne Heyworth #Y School of Computer Science, Bangor University, U.K. ## gap> START_TEST( "Kan package: dcrws1.tst" ); @@ -23,9 +23,9 @@ gap> alph4 := "aAbBcCdD";; gap> rws4 := ReducedConfluentRewritingSystem( H4, L, order, 0, alph4 );; gap> DisplayRwsRules( rws4 ); -[ [ aA, id ], [ Aa, id ], [ bB, id ], [ Bb, id ], [ cC, id ], [ Cc, id ], [ dD\ -, id ], [ Dd, id ], [ cd, dcBAba ], [ cBAbaD, Dc ], [ CD, BAbaDC ], [ Cd, dABa\ -bC ] ] +[ [ aA, id ], [ Aa, id ], [ bB, id ], [ Bb, id ], [ cC, id ], [ cd, dcBAba ], \ +[ Cc, id ], [ Cd, dABabC ], [ CD, BAbaDC ], [ dD, id ], [ Dd, id ], [ cBAbaD, \ +Dc ] ] true gap> a := H4.1;; b := H4.2;; c := H4.3;; d := H4.4;; gap> c*d; diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/tst/manual/dcrws2.tst new/kan-1.37/tst/manual/dcrws2.tst --- old/kan-1.34/tst/manual/dcrws2.tst 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/tst/manual/dcrws2.tst 2024-01-23 19:16:30.000000000 +0100 @@ -35,14 +35,14 @@ G-rules: [ [ Aa, id ], [ aA, id ], [ Bb, id ], [ bB, id ] ] H-rules: -[ [ Haaaa, HAA ], - [ HAAA, Haaa ] ] +[ [ HAAA, Haaa ], + [ Haaaa, HAA ] ] K-rules: -[ [ aaaK, AK ], - [ AAK, aaK ] ] +[ [ AAK, aaK ], + [ aaaK, AK ] ] H-K-rules: -[ [ HaaK, HK ], - [ HAK, HaK ] ] +[ [ HAK, HaK ], + [ HaaK, HK ] ] gap> free := FreeMonoidOfRewritingSystem( dcrws1 );; gap> mon := MonoidOfRewritingSystem( dcrws1 );; diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/kan-1.34/tst/manual/dcrws3.tst new/kan-1.37/tst/manual/dcrws3.tst --- old/kan-1.34/tst/manual/dcrws3.tst 2022-03-13 10:09:30.000000000 +0100 +++ new/kan-1.37/tst/manual/dcrws3.tst 2024-01-23 19:16:30.000000000 +0100 @@ -26,7 +26,8 @@ gap> orderT := "wreath";; gap> rwsT := ReducedConfluentRewritingSystem( T, ordT, orderT, 0, alphT );; gap> DisplayRwsRules( rwsT );; -[ [ dD, id ], [ Dd, id ], [ C, ccDD ], [ ccc, dd ], [ ddc, cdd ], [ Dc, dcDD ]\ +[ [ C, ccDD ], [ dD, id ], [ Dc, dcDD ], [ Dd, id ], [ ccc, dd ], [ \ +ddc, cdd ]\ ] gap> accT := WordAcceptorOfReducedRws( rwsT ); < deterministic automaton on 4 letters with 7 states >

1 0

commit gap-images for openSUSE:Factory
by Source-Sync 25 Mar '24

25 Mar '24

Script 'mail_helper' called by obssrc Hello community, here is the log from the commit of package gap-images for openSUSE:Factory checked in at 2024-03-25 21:09:31 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/gap-images (Old) and /work/SRC/openSUSE:Factory/.gap-images.new.1905 (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Package is "gap-images" Mon Mar 25 21:09:31 2024 rev:2 rq:1161009 version:1.3.2 Changes: -------- --- /work/SRC/openSUSE:Factory/gap-images/gap-images.changes 2023-12-28 22:58:48.880634175 +0100 +++ /work/SRC/openSUSE:Factory/.gap-images.new.1905/gap-images.changes 2024-03-25 21:15:17.016792236 +0100 @@ -1,0 +2,6 @@ +Sat Mar 23 21:50:16 UTC 2024 - Jan Engelhardt <jengelh(a)inai.de> + +- Update to release 1.3.2 + * Resolve some spellos in documentation + +------------------------------------------------------------------- Old: ---- images-1.3.1.tar.gz New: ---- images-1.3.2.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ gap-images.spec ++++++ --- /var/tmp/diff_new_pack.eFrjBR/_old 2024-03-25 21:15:17.512810448 +0100 +++ /var/tmp/diff_new_pack.eFrjBR/_new 2024-03-25 21:15:17.516810595 +0100 @@ -1,7 +1,7 @@ # # spec file for package gap-images # -# Copyright (c) 2022 SUSE LLC +# Copyright (c) 2024 SUSE LLC # # All modifications and additions to the file contributed by third parties # remain the property of their copyright owners, unless otherwise agreed @@ -12,12 +12,12 @@ # license that conforms to the Open Source Definition (Version 1.9) # published by the Open Source Initiative. -# Please submit bugfixes or comments via http://bugs.opensuse.org/ +# Please submit bugfixes or comments via https://bugs.opensuse.org/ # Name: gap-images -Version: 1.3.1 +Version: 1.3.2 Release: 0 Summary: GAP: Minimal and Canonical images License: MPL-2.0 ++++++ images-1.3.1.tar.gz -> images-1.3.2.tar.gz ++++++ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/images-1.3.1/LICENSE new/images-1.3.2/LICENSE --- old/images-1.3.1/LICENSE 2021-11-15 15:09:45.000000000 +0100 +++ new/images-1.3.2/LICENSE 2024-01-22 10:09:19.000000000 +0100 @@ -357,7 +357,7 @@ This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not distributed with this - file, You can obtain one at http://mozilla.org/MPL/2.0/. + file, You can obtain one at https://mozilla.org/MPL/2.0/. If it is not possible or desirable to put the notice in a particular file, then You may include the notice in a location (such as a LICENSE diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/images-1.3.1/PackageInfo.g new/images-1.3.2/PackageInfo.g --- old/images-1.3.1/PackageInfo.g 2021-11-15 15:09:45.000000000 +0100 +++ new/images-1.3.2/PackageInfo.g 2024-01-22 10:09:19.000000000 +0100 @@ -10,8 +10,8 @@ PackageName := "images", Subtitle := "Minimal and Canonical images", -Version := "1.3.1", -Date := "16/11/2021", # dd/mm/yyyy format +Version := "1.3.2", +Date := "22/01/2024", # dd/mm/yyyy format License := "MPL-2.0", Persons := [ rec( @@ -79,8 +79,8 @@ ## Status := "deposited", -SourceRepository := rec( - Type := "git", +SourceRepository := rec( + Type := "git", URL := "https://github.com/gap-packages/images" ), IssueTrackerURL := Concatenation( ~.SourceRepository.URL, "/issues" ), @@ -90,7 +90,7 @@ PackageDoc := rec( BookName := "images", ArchiveURLSubset := ["doc"], - HTMLStart := "doc/chap0.html", + HTMLStart := "doc/chap0_mj.html", PDFFile := "doc/manual.pdf", SixFile := "doc/manual.six", LongTitle := "Minimal and Canonical images", diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/images-1.3.1/README.md new/images-1.3.2/README.md --- old/images-1.3.1/README.md 2021-11-15 15:09:45.000000000 +0100 +++ new/images-1.3.2/README.md 2024-01-22 10:09:19.000000000 +0100 @@ -12,7 +12,7 @@ as PDF `doc/manual.pdf` or as HTML `doc/chap0_mj.html`, or on the package homepage at - <http://gap-packages.github.io/images/> + <https://gap-packages.github.io/images/> ## Bug reports and feature requests @@ -28,6 +28,12 @@ # History +1.3.2 +----- + +* Internal improvements (improving CI and compatibility with future GAP versions) + + 1.3.1 ----- diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/images-1.3.1/doc/_entities.xml new/images-1.3.2/doc/_entities.xml --- old/images-1.3.1/doc/_entities.xml 1970-01-01 01:00:00.000000000 +0100 +++ new/images-1.3.2/doc/_entities.xml 2024-01-22 10:09:44.000000000 +0100 @@ -0,0 +1 @@ +<!ENTITY images '<Package>images</Package>'> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/images-1.3.1/doc/chap0.html new/images-1.3.2/doc/chap0.html --- old/images-1.3.1/doc/chap0.html 2021-11-15 15:18:58.000000000 +0100 +++ new/images-1.3.2/doc/chap0.html 2024-01-22 10:09:47.000000000 +0100 @@ -29,10 +29,10 @@ <h2>Minimal and Canonical images</h2> <p> - 1.3.1</p> + 1.3.2</p> <p> - 16 November 2021 + 22 January 2024 </p> </div> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/images-1.3.1/doc/chap0.txt new/images-1.3.2/doc/chap0.txt --- old/images-1.3.1/doc/chap0.txt 2021-11-15 15:18:57.000000000 +0100 +++ new/images-1.3.2/doc/chap0.txt 2024-01-22 10:09:44.000000000 +0100 @@ -6,10 +6,10 @@ [1X Minimal and Canonical images [101X - 1.3.1 + 1.3.2 - 16 November 2021 + 22 January 2024 Christopher Jefferson diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/images-1.3.1/doc/chap0_mj.html new/images-1.3.2/doc/chap0_mj.html --- old/images-1.3.1/doc/chap0_mj.html 2021-11-15 15:18:58.000000000 +0100 +++ new/images-1.3.2/doc/chap0_mj.html 2024-01-22 10:09:47.000000000 +0100 @@ -32,10 +32,10 @@ <h2>Minimal and Canonical images</h2> <p> - 1.3.1</p> + 1.3.2</p> <p> - 16 November 2021 + 22 January 2024 </p> </div> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/images-1.3.1/doc/images.toc new/images-1.3.2/doc/images.toc --- old/images-1.3.1/doc/images.toc 2021-11-15 15:18:58.000000000 +0100 +++ new/images-1.3.2/doc/images.toc 1970-01-01 01:00:00.000000000 +0100 @@ -1,10 +0,0 @@ -\contentsline {chapter}{\numberline {1}\textcolor {Chapter }{The Images Package}}{4}{chapter.1}% -\contentsline {chapter}{\numberline {2}\textcolor {Chapter }{Minimal and Canonical Images}}{5}{chapter.2}% -\contentsline {section}{\numberline {2.1}\textcolor {Chapter }{Function documentation}}{6}{section.2.1}% -\contentsline {subsection}{\numberline {2.1.1}\textcolor {Chapter }{MinimalImage}}{6}{subsection.2.1.1}% -\contentsline {subsection}{\numberline {2.1.2}\textcolor {Chapter }{IsMinimalImageLessThan}}{6}{subsection.2.1.2}% -\contentsline {subsection}{\numberline {2.1.3}\textcolor {Chapter }{CanonicalImage}}{6}{subsection.2.1.3}% -\contentsline {subsection}{\numberline {2.1.4}\textcolor {Chapter }{ImagesAdvancedConfig}}{7}{subsection.2.1.4}% -\contentsline {chapter}{\numberline {3}\textcolor {Chapter }{Installing and Loading the Images Package}}{8}{chapter.3}% -\contentsline {section}{\numberline {3.1}\textcolor {Chapter }{Loading the Images Package}}{8}{section.3.1}% -\contentsline {chapter}{Index}{9}{section*.3}% diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/images-1.3.1/doc/manual.js new/images-1.3.2/doc/manual.js --- old/images-1.3.1/doc/manual.js 2021-11-15 15:18:58.000000000 +0100 +++ new/images-1.3.2/doc/manual.js 2024-01-22 10:09:47.000000000 +0100 @@ -86,7 +86,8 @@ var el = document.createElement("a"); var oncl = document.createAttribute("href"); var back = window.location.protocol+"//" - if (window.location.protocol == "http:") { + if (window.location.protocol == "http:" || + window.location.protocol == "https:") { back = back+window.location.host; if (window.location.port != "") { back = back+":"+window.location.port; Binary files old/images-1.3.1/doc/manual.pdf and new/images-1.3.2/doc/manual.pdf differ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/images-1.3.1/doc/title.xml new/images-1.3.2/doc/title.xml --- old/images-1.3.1/doc/title.xml 2021-11-15 15:18:57.000000000 +0100 +++ new/images-1.3.2/doc/title.xml 2024-01-22 10:09:44.000000000 +0100 @@ -9,7 +9,7 @@ Minimal and Canonical images </Subtitle> <Version> - 1.3.1 + 1.3.2 </Version> <Author> Christopher Jefferson<Alt Only="LaTeX"><Br/></Alt> @@ -35,11 +35,9 @@ </Author> <Date> - 16 November 2021 + 22 January 2024 </Date> <Copyright> - -&copyright; 2013-2019 - + &copyright; 2013-2019 </Copyright> </TitlePage> \ No newline at end of file diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/images-1.3.1/gap/set_smallest_image/nsi.g new/images-1.3.2/gap/set_smallest_image/nsi.g --- old/images-1.3.1/gap/set_smallest_image/nsi.g 2021-11-15 15:09:45.000000000 +0100 +++ new/images-1.3.2/gap/set_smallest_image/nsi.g 2024-01-22 10:09:19.000000000 +0100 @@ -153,7 +153,7 @@ # GAP dictionaries don't (currently) provide a way of getting the values -# stored in them, so here we cache them seperately +# stored in them, so here we cache them separately _countingDict := function(dictexample) local data; data := rec( @@ -354,7 +354,7 @@ if IsBound(config_option.orbfilt) then if config_option.orbfilt = "Min" then - # This space intensionally blank + # This space intentionally blank elif config_option.orbfilt = "Rare" then config.findBestOrbMset := function(x,y) return x < y; end; elif config_option.orbfilt = "Common" then @@ -475,7 +475,7 @@ # clean_subtree to remove any new subtrees. handle_new_stabilizer_element := function(node1,node2) local perm1, i; - # so node1 and node2 represnet group elements that map set to the same + # so node1 and node2 represent group elements that map set to the same # place in two different ways perm1 := PermListList(node1.image, node2.image); Info(InfoNSI, 2, "Can map ",node1.image, " to ", node2.image, " : ", perm1); @@ -514,7 +514,7 @@ return reps; end; - # Make orbit of x, updating orbnums, orbmins and orbsizes as approriate. + # Make orbit of x, updating orbnums, orbmins and orbsizes as appropriate. make_orbit := function(x) local q, rep, num, pt, gen, img; if orbnums[x] <> -1 then diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/images-1.3.1/gap/set_smallest_image/nsi_horriblesetsethack.g new/images-1.3.2/gap/set_smallest_image/nsi_horriblesetsethack.g --- old/images-1.3.1/gap/set_smallest_image/nsi_horriblesetsethack.g 2021-11-15 15:09:45.000000000 +0100 +++ new/images-1.3.2/gap/set_smallest_image/nsi_horriblesetsethack.g 2024-01-22 10:09:19.000000000 +0100 @@ -154,7 +154,7 @@ handle_new_stabilizer_element := function(node1,node2) local perm1, i; - # so node1 and node2 represnet group elements that map set to the same + # so node1 and node2 represent group elements that map set to the same # place in two different ways perm1 := PermListList(node1.image, node2.image); Assert(1, not perm1 in l); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/images-1.3.1/gap/smallestImage.gd new/images-1.3.2/gap/smallestImage.gd --- old/images-1.3.1/gap/smallestImage.gd 2021-11-15 15:09:45.000000000 +0100 +++ new/images-1.3.2/gap/smallestImage.gd 2024-01-22 10:09:19.000000000 +0100 @@ -171,89 +171,89 @@ BindGlobal("MinImage", rec(Smaller := -1, Equal := 0, Larger := 1)); -BIND_GLOBAL("CanonicalConfig_Minimum", MakeImmutable(rec( +BindGlobal("CanonicalConfig_Minimum", MakeImmutable(rec( branch := "minimum" ))); -BIND_GLOBAL("CanonicalConfig_FixedMinOrbit", MakeImmutable(rec( +BindGlobal("CanonicalConfig_FixedMinOrbit", MakeImmutable(rec( branch := "static", order := "MinOrbit" ))); -BIND_GLOBAL("CanonicalConfig_FixedMaxOrbit", MakeImmutable(rec( +BindGlobal("CanonicalConfig_FixedMaxOrbit", MakeImmutable(rec( branch := "static", order := "MaxOrbit" ))); -BIND_GLOBAL("CanonicalConfig_MinOrbit", MakeImmutable(rec( +BindGlobal("CanonicalConfig_MinOrbit", MakeImmutable(rec( branch := "dynamic", order := "MinOrbit" ))); -BIND_GLOBAL("CanonicalConfig_MaxOrbit", MakeImmutable(rec( +BindGlobal("CanonicalConfig_MaxOrbit", MakeImmutable(rec( branch := "dynamic", order := "MaxOrbit" ))); -BIND_GLOBAL("CanonicalConfig_SingleMaxOrbit", MakeImmutable(rec( +BindGlobal("CanonicalConfig_SingleMaxOrbit", MakeImmutable(rec( branch := "dynamic", order := "SingleMaxOrbit" ))); -BIND_GLOBAL("CanonicalConfig_RareOrbit", MakeImmutable(rec( +BindGlobal("CanonicalConfig_RareOrbit", MakeImmutable(rec( branch := "dynamic", order := "RareOrbit" ))); -BIND_GLOBAL("CanonicalConfig_CommonOrbit", MakeImmutable(rec( +BindGlobal("CanonicalConfig_CommonOrbit", MakeImmutable(rec( branch := "dynamic", order := "CommonOrbit" ))); -BIND_GLOBAL("CanonicalConfig_RareRatioOrbit", MakeImmutable(rec( +BindGlobal("CanonicalConfig_RareRatioOrbit", MakeImmutable(rec( branch := "dynamic", order := "RareRatioOrbit" ))); -BIND_GLOBAL("CanonicalConfig_CommonRatioOrbit", MakeImmutable(rec( +BindGlobal("CanonicalConfig_CommonRatioOrbit", MakeImmutable(rec( branch := "dynamic", order := "CommonRatioOrbit" ))); -BIND_GLOBAL("CanonicalConfig_RareRatioOrbitFix", MakeImmutable(rec( +BindGlobal("CanonicalConfig_RareRatioOrbitFix", MakeImmutable(rec( branch := "dynamic", order := "RareRatioOrbitFix" ))); -BIND_GLOBAL("CanonicalConfig_CommonRatioOrbitFix", MakeImmutable(rec( +BindGlobal("CanonicalConfig_CommonRatioOrbitFix", MakeImmutable(rec( branch := "dynamic", order := "CommonRatioOrbitFix" ))); -BIND_GLOBAL("CanonicalConfig_RareRatioOrbitFixPlusMin", MakeImmutable(rec( +BindGlobal("CanonicalConfig_RareRatioOrbitFixPlusMin", MakeImmutable(rec( branch := "dynamic", order := "RareRatioOrbitFix", orbfilt := "Min" ))); -BIND_GLOBAL("CanonicalConfig_RareRatioOrbitFixPlusRare", MakeImmutable(rec( +BindGlobal("CanonicalConfig_RareRatioOrbitFixPlusRare", MakeImmutable(rec( branch := "dynamic", order := "RareRatioOrbitFix", orbfilt := "Rare" ))); -BIND_GLOBAL("CanonicalConfig_RareRatioOrbitFixPlusCommon", MakeImmutable(rec( +BindGlobal("CanonicalConfig_RareRatioOrbitFixPlusCommon", MakeImmutable(rec( branch := "dynamic", order := "RareRatioOrbitFix", orbfilt := "Common" ))); -BIND_GLOBAL("CanonicalConfig_RareOrbitPlusMin", MakeImmutable(rec( +BindGlobal("CanonicalConfig_RareOrbitPlusMin", MakeImmutable(rec( branch := "dynamic", order := "RareOrbit", orbfilt := "Min" ))); -BIND_GLOBAL("CanonicalConfig_RareOrbitPlusRare", MakeImmutable(rec( +BindGlobal("CanonicalConfig_RareOrbitPlusRare", MakeImmutable(rec( branch := "dynamic", order := "RareOrbit", orbfilt := "Rare" ))); -BIND_GLOBAL("CanonicalConfig_RareOrbitPlusCommon", MakeImmutable(rec( +BindGlobal("CanonicalConfig_RareOrbitPlusCommon", MakeImmutable(rec( branch := "dynamic", order := "RareOrbit", orbfilt := "Common" ))); -BIND_GLOBAL("CanonicalConfig_Fast", CanonicalConfig_RareRatioOrbitFixPlusMin); +BindGlobal("CanonicalConfig_Fast", CanonicalConfig_RareRatioOrbitFixPlusMin); #E files.gd . . . . . . . . . . . . . . . . . . . . . . . . . . . ends here diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/images-1.3.1/maketest.g new/images-1.3.2/maketest.g --- old/images-1.3.1/maketest.g 2021-11-15 15:18:58.000000000 +0100 +++ new/images-1.3.2/maketest.g 2024-01-22 10:09:47.000000000 +0100 @@ -6,7 +6,7 @@ LoadPackage( "GAPDoc" ); -example_tree := ExtractExamples( Directory("./doc/"), "images.xml", AUTODOC_file_scan_list, 500 ); +example_tree := ExtractExamples( Directory("/home/caj/files/reps/gap/gap/git/images/tmp/images-1.3.2/doc/"), "images.xml", AUTODOC_file_scan_list, 500 ); RunExamples( example_tree, rec( compareFunction := "uptowhitespace" ) );

1 0

commit gap-homalg for openSUSE:Factory
by Source-Sync 25 Mar '24

25 Mar '24

Script 'mail_helper' called by obssrc Hello community, here is the log from the commit of package gap-homalg for openSUSE:Factory checked in at 2024-03-25 21:09:29 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/gap-homalg (Old) and /work/SRC/openSUSE:Factory/.gap-homalg.new.1905 (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Package is "gap-homalg" Mon Mar 25 21:09:29 2024 rev:2 rq:1161006 version:2024.01.01 Changes: -------- --- /work/SRC/openSUSE:Factory/gap-homalg/gap-homalg.changes 2023-12-28 22:58:42.828412568 +0100 +++ /work/SRC/openSUSE:Factory/.gap-homalg.new.1905/gap-homalg.changes 2024-03-25 21:15:14.148686928 +0100 @@ -1,0 +2,6 @@ +Sat Mar 23 21:47:16 UTC 2024 - Jan Engelhardt <jengelh(a)inai.de> + +- Update to release 2024.01.01 + * No changelog was provided + +------------------------------------------------------------------- Old: ---- homalg-2022.11-01.tar.gz New: ---- homalg-2024.01-01.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ gap-homalg.spec ++++++ --- /var/tmp/diff_new_pack.PPOGal/_old 2024-03-25 21:15:14.972717184 +0100 +++ /var/tmp/diff_new_pack.PPOGal/_new 2024-03-25 21:15:14.976717330 +0100 @@ -1,7 +1,7 @@ # # spec file for package gap-homalg # -# Copyright (c) 2023 SUSE LLC +# Copyright (c) 2024 SUSE LLC # # All modifications and additions to the file contributed by third parties # remain the property of their copyright owners, unless otherwise agreed @@ -12,23 +12,23 @@ # license that conforms to the Open Source Definition (Version 1.9) # published by the Open Source Initiative. -# Please submit bugfixes or comments via http://bugs.opensuse.org/ +# Please submit bugfixes or comments via https://bugs.opensuse.org/ # Name: gap-homalg -Version: 2022.11.01 -%define sillyver 2022.11-01 +Version: 2024.01.01 +%define sillyver 2024.01-01 Release: 0 Summary: GAP: A homological algebra meta-package for computable Abelian categories -License: GPL-2.0 +License: GPL-2.0-only Group: Productivity/Scientific/Math URL: https://homalg-project.github.io/pkg/homalg #Git-Clone: https://github.com/homalg-project/homalg_project Source: https://github.com/homalg-project/homalg_project/releases/download/homalg-%… BuildArch: noarch BuildRequires: gap-rpm-devel -Requires: gap-core >= 4.11.1 +Requires: gap-core >= 4.12.1 Requires: gap-gapdoc >= 1.0 Requires: gap-toolsforhomalg >= 2012.10.27 ++++++ homalg-2022.11-01.tar.gz -> homalg-2024.01-01.tar.gz ++++++ ++++ 3322 lines of diff (skipped)

1 0

commit gap-fplsa for openSUSE:Factory
by Source-Sync 25 Mar '24

25 Mar '24

Script 'mail_helper' called by obssrc Hello community, here is the log from the commit of package gap-fplsa for openSUSE:Factory checked in at 2024-03-25 21:09:24 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/gap-fplsa (Old) and /work/SRC/openSUSE:Factory/.gap-fplsa.new.1905 (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Package is "gap-fplsa" Mon Mar 25 21:09:24 2024 rev:2 rq:1160999 version:1.2.6 Changes: -------- --- /work/SRC/openSUSE:Factory/gap-fplsa/gap-fplsa.changes 2023-12-28 22:57:56.406712795 +0100 +++ /work/SRC/openSUSE:Factory/.gap-fplsa.new.1905/gap-fplsa.changes 2024-03-25 21:15:07.672449142 +0100 @@ -1,0 +2,6 @@ +Sat Mar 23 21:38:48 UTC 2024 - Jan Engelhardt <jengelh(a)inai.de> + +- Update to release 1.2.6 + * Janitorial changes only + +------------------------------------------------------------------- Old: ---- FPLSA-1.2.5.tar.gz New: ---- FPLSA-1.2.6.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ gap-fplsa.spec ++++++ --- /var/tmp/diff_new_pack.LNZmFm/_old 2024-03-25 21:15:08.176467648 +0100 +++ /var/tmp/diff_new_pack.LNZmFm/_new 2024-03-25 21:15:08.180467794 +0100 @@ -1,7 +1,7 @@ # # spec file for package gap-fplsa # -# Copyright (c) 2022 SUSE LLC +# Copyright (c) 2024 SUSE LLC # # All modifications and additions to the file contributed by third parties # remain the property of their copyright owners, unless otherwise agreed @@ -17,7 +17,7 @@ Name: gap-fplsa -Version: 1.2.5 +Version: 1.2.6 Release: 0 Summary: GAP: Finitely Presented Lie Algebras License: GPL-2.0-or-later ++++++ FPLSA-1.2.5.tar.gz -> FPLSA-1.2.6.tar.gz ++++++ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/CHANGES new/FPLSA-1.2.6/CHANGES --- old/FPLSA-1.2.5/CHANGES 2022-03-10 23:07:34.000000000 +0100 +++ new/FPLSA-1.2.6/CHANGES 2023-01-03 17:36:27.000000000 +0100 @@ -1,5 +1,9 @@ This file describes changes in the FPLSA package. +1.2.6 (2023-01-03) + - Enhance the `configure` script to accept `--with-gaproot=PATH` + - Minor janitorial changes + 1.2.5 (2022-03-10) - Improve buildsystem - PackageInfo.g: update Max Horn's address (again) diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/PackageInfo.g new/FPLSA-1.2.6/PackageInfo.g --- old/FPLSA-1.2.5/PackageInfo.g 2022-03-10 23:07:34.000000000 +0100 +++ new/FPLSA-1.2.6/PackageInfo.g 2023-01-03 17:36:27.000000000 +0100 @@ -5,8 +5,8 @@ SetPackageInfo( rec( PackageName := "FPLSA", Subtitle := "Finitely Presented Lie Algebras", -Version := "1.2.5", -Date := "10/03/2022", # dd/mm/yyyy format +Version := "1.2.6", +Date := "03/01/2023", # dd/mm/yyyy format License := "GPL-2.0-or-later", Persons := [ @@ -65,7 +65,7 @@ PackageDoc := rec( BookName := "fplsa", ArchiveURLSubset := [ "doc" ], - HTMLStart := "doc/chap0.html", + HTMLStart := "doc/chap0_mj.html", PDFFile := "doc/manual.pdf", SixFile := "doc/manual.six", LongTitle := "Interface to fast external Lie Todd-Coxeter Program", diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/README.md new/FPLSA-1.2.6/README.md --- old/FPLSA-1.2.5/README.md 2022-03-10 23:07:34.000000000 +0100 +++ new/FPLSA-1.2.6/README.md 2023-01-03 17:36:27.000000000 +0100 @@ -54,7 +54,7 @@ #### Configuring and Compiling the C part You have to change your current working directory to the subdirectory -FPLSA lives in. Starting from the `pkg` dirctory of your GAP +FPLSA lives in. Starting from the `pkg` directory of your GAP installation, you can do this via this command (replace `X.Y` with the actual version): diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/configure new/FPLSA-1.2.6/configure --- old/FPLSA-1.2.5/configure 2022-03-10 23:07:34.000000000 +0100 +++ new/FPLSA-1.2.6/configure 2023-01-03 17:36:27.000000000 +0100 @@ -1,17 +1,36 @@ #!/bin/sh # usage: configure gappath -# this script creates a `Makefile' from `Makefile.in' -if test -z "$1"; then - GAPPATH=../..; echo "Using ../.. as default GAP path"; -else - GAPPATH="$1"; -fi -if test ! -r "$GAPPATH/sysinfo.gap"; then - echo "Please give correct GAP path as argument (and make sure that GAP" - echo "is already properly installed)." - exit +# this script creates a `Makefile' from `Makefile.in' + +set -e + +GAPPATH=../.. +while test "$#" -ge 1 ; do + option="$1" ; shift + case "$option" in + --with-gaproot=*) GAPPATH=${option#--with-gaproot=}; ;; + -*) echo "ERROR: unsupported argument $option" ; exit 1;; + *) GAPPATH="$option" ;; + esac +done + +if test ! -r "$GAPPATH/sysinfo.gap" ; then + echo + echo "No file $GAPPATH/sysinfo.gap found." + echo + echo "Usage: ./configure [GAPPATH]" + echo " where GAPPATH is a path to your GAP installation" + echo " (The default for GAPPATH is \"../..\")" + echo + echo "Either your GAPPATH is incorrect or the GAP it is pointing to" + echo "is not properly compiled (do \"./configure && make\" there first)." + echo + echo "Aborting... No Makefile is generated." + echo + exit 1 fi +echo "Using settings from $GAPPATH/sysinfo.gap" rm -f Makefile . "$GAPPATH/sysinfo.gap" sed \ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/doc/FPLSA.toc new/FPLSA-1.2.6/doc/FPLSA.toc --- old/FPLSA-1.2.5/doc/FPLSA.toc 2022-03-10 23:07:48.000000000 +0100 +++ new/FPLSA-1.2.6/doc/FPLSA.toc 1970-01-01 01:00:00.000000000 +0100 @@ -1,8 +0,0 @@ -\contentsline {chapter}{\numberline {1}\textcolor {Chapter }{The FPLSA Package}}{3}{chapter.1}% -\contentsline {section}{\numberline {1.1}\textcolor {Chapter }{Main Functions}}{3}{section.1.1}% -\contentsline {subsection}{\numberline {1.1.1}\textcolor {Chapter }{SCAlgebraInfoOfFpLieAlgebra}}{3}{subsection.1.1.1}% -\contentsline {subsection}{\numberline {1.1.2}\textcolor {Chapter }{ IsomorphicSCAlgebra}}{4}{subsection.1.1.2}% -\contentsline {section}{\numberline {1.2}\textcolor {Chapter }{Auxiliary Variables of FPLSA}}{4}{section.1.2}% -\contentsline {subsection}{\numberline {1.2.1}\textcolor {Chapter }{FPLSA}}{4}{subsection.1.2.1}% -\contentsline {section}{\numberline {1.3}\textcolor {Chapter }{Installing the FPLSA Package}}{5}{section.1.3}% -\contentsline {chapter}{Index}{7}{section*.2}% diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/doc/FPLSA.xml new/FPLSA-1.2.6/doc/FPLSA.xml --- old/FPLSA-1.2.5/doc/FPLSA.xml 2022-03-10 23:07:43.000000000 +0100 +++ new/FPLSA-1.2.6/doc/FPLSA.xml 2023-01-03 17:36:40.000000000 +0100 @@ -3,9 +3,7 @@  <!DOCTYPE Book SYSTEM "gapdoc.dtd" [ -<!ENTITY fplsa '<Package>fplsa</Package>'> -<!ENTITY see '<Alt Only="LaTeX">$\to$</Alt><Alt Not="LaTeX">--></Alt>'> -<!ENTITY FPLSA '<Package>FPLSA</Package>'> + [<#Include SYSTEM "_entities.xml"> ] > <Book Name="fplsa"> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/doc/_entities.xml new/FPLSA-1.2.6/doc/_entities.xml --- old/FPLSA-1.2.5/doc/_entities.xml 1970-01-01 01:00:00.000000000 +0100 +++ new/FPLSA-1.2.6/doc/_entities.xml 2023-01-03 17:36:40.000000000 +0100 @@ -0,0 +1,2 @@ +<!ENTITY fplsa '<Package>fplsa</Package>'> +<!ENTITY FPLSA '<Package>FPLSA</Package>'> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/doc/chap0.html new/FPLSA-1.2.6/doc/chap0.html --- old/FPLSA-1.2.5/doc/chap0.html 2022-03-10 23:07:48.000000000 +0100 +++ new/FPLSA-1.2.6/doc/chap0.html 2023-01-03 17:36:44.000000000 +0100 @@ -29,10 +29,10 @@ <h2>Finitely Presented Lie Algebras</h2> <p> - 1.2.5</p> + 1.2.6</p> <p> - 10 March 2022 + 3 January 2023 </p> </div> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/doc/chap0.txt new/FPLSA-1.2.6/doc/chap0.txt --- old/FPLSA-1.2.5/doc/chap0.txt 2022-03-10 23:07:43.000000000 +0100 +++ new/FPLSA-1.2.6/doc/chap0.txt 2023-01-03 17:36:40.000000000 +0100 @@ -6,10 +6,10 @@ [1X Finitely Presented Lie Algebras [101X - 1.2.5 + 1.2.6 - 10 March 2022 + 3 January 2023 Vladimir Gerdt diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/doc/chap0_mj.html new/FPLSA-1.2.6/doc/chap0_mj.html --- old/FPLSA-1.2.5/doc/chap0_mj.html 2022-03-10 23:07:48.000000000 +0100 +++ new/FPLSA-1.2.6/doc/chap0_mj.html 2023-01-03 17:36:44.000000000 +0100 @@ -32,10 +32,10 @@ <h2>Finitely Presented Lie Algebras</h2> <p> - 1.2.5</p> + 1.2.6</p> <p> - 10 March 2022 + 3 January 2023 </p> </div> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/doc/chap1.html new/FPLSA-1.2.6/doc/chap1.html --- old/FPLSA-1.2.5/doc/chap1.html 2022-03-10 23:07:48.000000000 +0100 +++ new/FPLSA-1.2.6/doc/chap1.html 2023-01-03 17:36:44.000000000 +0100 @@ -50,7 +50,7 @@ <h4>1.1 <span class="Heading">Main Functions</span></h4> -<p>A finitely presented Lie algebra is a quotient of a free Lie algebra by an ideal generated by a finite number of elements. In <strong class="pkg">GAP</strong> a free Lie algebra can be created by the command <code class="code">FreeLieAlgebra</code>; we refer to the <strong class="pkg">GAP</strong> Reference Manual for more details. A finitely presented Lie algebra <var class="Arg">K</var> can be constructed by <code class="code"><var class="Arg">K</var> := <var class="Arg">L</var>/<var class="Arg">rels</var></code>, where <var class="Arg">L</var> is a free Lie algebra and <var class="Arg">rels</var> a list of elements of <var class="Arg">L</var> that constitute the relations that hold in <var class="Arg">K</var>. Given a finitle presented Lie algebra we want to calculate a basis and a multiplication table of it. The interface to the <strong class="pkg">FPLSA</strong> package comes with two related functions for doing that.</p> +<p>A finitely presented Lie algebra is a quotient of a free Lie algebra by an ideal generated by a finite number of elements. In <strong class="pkg">GAP</strong> a free Lie algebra can be created by the command <code class="code">FreeLieAlgebra</code>; we refer to the <strong class="pkg">GAP</strong> Reference Manual for more details. A finitely presented Lie algebra <var class="Arg">K</var> can be constructed by <code class="code"><var class="Arg">K</var> := <var class="Arg">L</var>/<var class="Arg">rels</var></code>, where <var class="Arg">L</var> is a free Lie algebra and <var class="Arg">rels</var> a list of elements of <var class="Arg">L</var> that constitute the relations that hold in <var class="Arg">K</var>. Given a finitely presented Lie algebra we want to calculate a basis and a multiplication table of it. The interface to the <strong class="pkg">FPLSA</strong> package comes with two related functions for doing that.</p> <p><a id="X8019B72B8298566A" name="X8019B72B8298566A"></a></p> @@ -88,7 +88,7 @@ <h5>1.1-2 IsomorphicSCAlgebra</h5> <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsomorphicSCAlgebra</code>( <var class="Arg">K</var>[, <var class="Arg">bound</var>] )</td><td class="tdright">( function )</td></tr></table></div> -<p>computes a Lie algebra given by a multiplication table isomorphic to the finitely presented Lie algebra <var class="Arg">K</var>. If the optional parameter <var class="Arg">bound</var> is specified the computation will be carried out using monomials of degree at most <var class="Arg">bound</var>. If <var class="Arg">bound</var> is not specified, then it will initially be set to 10000. If this does not suffice to calculate a multiplication tabel of the algebra, then the bound will be increased until a multiplication table is found. If the computation was successful then a structure constants algebra will be returned isomorphic to <var class="Arg">K</var>. Otherwise <code class="keyw">fail</code> will be returned.</p> +<p>computes a Lie algebra given by a multiplication table isomorphic to the finitely presented Lie algebra <var class="Arg">K</var>. If the optional parameter <var class="Arg">bound</var> is specified the computation will be carried out using monomials of degree at most <var class="Arg">bound</var>. If <var class="Arg">bound</var> is not specified, then it will initially be set to 10000. If this does not suffice to calculate a multiplication table of the algebra, then the bound will be increased until a multiplication table is found. If the computation was successful then a structure constants algebra will be returned isomorphic to <var class="Arg">K</var>. Otherwise <code class="keyw">fail</code> will be returned.</p> <div class="example"><pre> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/doc/chap1.txt new/FPLSA-1.2.6/doc/chap1.txt --- old/FPLSA-1.2.5/doc/chap1.txt 2022-03-10 23:07:43.000000000 +0100 +++ new/FPLSA-1.2.6/doc/chap1.txt 2023-01-03 17:36:40.000000000 +0100 @@ -20,7 +20,7 @@ can be created by the command [10XFreeLieAlgebra[110X; we refer to the [5XGAP[105X Reference Manual for more details. A finitely presented Lie algebra [3XK[103X can be constructed by [10X[3XK[103X[10X := [3XL[103X[10X/[3Xrels[103X[10X[110X, where [3XL[103X is a free Lie algebra and [3Xrels[103X a list of - elements of [3XL[103X that constitute the relations that hold in [3XK[103X. Given a finitle + elements of [3XL[103X that constitute the relations that hold in [3XK[103X. Given a finitely presented Lie algebra we want to calculate a basis and a multiplication table of it. The interface to the [5XFPLSA[105X package comes with two related functions for doing that.[133X @@ -70,7 +70,7 @@ finitely presented Lie algebra [3XK[103X. If the optional parameter [3Xbound[103X is specified the computation will be carried out using monomials of degree at most [3Xbound[103X. If [3Xbound[103X is not specified, then it will initially be set to - 10000. If this does not suffice to calculate a multiplication tabel of the + 10000. If this does not suffice to calculate a multiplication table of the algebra, then the bound will be increased until a multiplication table is found. If the computation was successful then a structure constants algebra will be returned isomorphic to [3XK[103X. Otherwise [9Xfail[109X will be returned.[133X diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/doc/chap1_mj.html new/FPLSA-1.2.6/doc/chap1_mj.html --- old/FPLSA-1.2.5/doc/chap1_mj.html 2022-03-10 23:07:48.000000000 +0100 +++ new/FPLSA-1.2.6/doc/chap1_mj.html 2023-01-03 17:36:44.000000000 +0100 @@ -53,7 +53,7 @@ <h4>1.1 <span class="Heading">Main Functions</span></h4> -<p>A finitely presented Lie algebra is a quotient of a free Lie algebra by an ideal generated by a finite number of elements. In <strong class="pkg">GAP</strong> a free Lie algebra can be created by the command <code class="code">FreeLieAlgebra</code>; we refer to the <strong class="pkg">GAP</strong> Reference Manual for more details. A finitely presented Lie algebra <var class="Arg">K</var> can be constructed by <code class="code"><var class="Arg">K</var> := <var class="Arg">L</var>/<var class="Arg">rels</var></code>, where <var class="Arg">L</var> is a free Lie algebra and <var class="Arg">rels</var> a list of elements of <var class="Arg">L</var> that constitute the relations that hold in <var class="Arg">K</var>. Given a finitle presented Lie algebra we want to calculate a basis and a multiplication table of it. The interface to the <strong class="pkg">FPLSA</strong> package comes with two related functions for doing that.</p> +<p>A finitely presented Lie algebra is a quotient of a free Lie algebra by an ideal generated by a finite number of elements. In <strong class="pkg">GAP</strong> a free Lie algebra can be created by the command <code class="code">FreeLieAlgebra</code>; we refer to the <strong class="pkg">GAP</strong> Reference Manual for more details. A finitely presented Lie algebra <var class="Arg">K</var> can be constructed by <code class="code"><var class="Arg">K</var> := <var class="Arg">L</var>/<var class="Arg">rels</var></code>, where <var class="Arg">L</var> is a free Lie algebra and <var class="Arg">rels</var> a list of elements of <var class="Arg">L</var> that constitute the relations that hold in <var class="Arg">K</var>. Given a finitely presented Lie algebra we want to calculate a basis and a multiplication table of it. The interface to the <strong class="pkg">FPLSA</strong> package comes with two related functions for doing that.</p> <p><a id="X8019B72B8298566A" name="X8019B72B8298566A"></a></p> @@ -91,7 +91,7 @@ <h5>1.1-2 IsomorphicSCAlgebra</h5> <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsomorphicSCAlgebra</code>( <var class="Arg">K</var>[, <var class="Arg">bound</var>] )</td><td class="tdright">( function )</td></tr></table></div> -<p>computes a Lie algebra given by a multiplication table isomorphic to the finitely presented Lie algebra <var class="Arg">K</var>. If the optional parameter <var class="Arg">bound</var> is specified the computation will be carried out using monomials of degree at most <var class="Arg">bound</var>. If <var class="Arg">bound</var> is not specified, then it will initially be set to 10000. If this does not suffice to calculate a multiplication tabel of the algebra, then the bound will be increased until a multiplication table is found. If the computation was successful then a structure constants algebra will be returned isomorphic to <var class="Arg">K</var>. Otherwise <code class="keyw">fail</code> will be returned.</p> +<p>computes a Lie algebra given by a multiplication table isomorphic to the finitely presented Lie algebra <var class="Arg">K</var>. If the optional parameter <var class="Arg">bound</var> is specified the computation will be carried out using monomials of degree at most <var class="Arg">bound</var>. If <var class="Arg">bound</var> is not specified, then it will initially be set to 10000. If this does not suffice to calculate a multiplication table of the algebra, then the bound will be increased until a multiplication table is found. If the computation was successful then a structure constants algebra will be returned isomorphic to <var class="Arg">K</var>. Otherwise <code class="keyw">fail</code> will be returned.</p> <div class="example"><pre> Binary files old/FPLSA-1.2.5/doc/manual.pdf and new/FPLSA-1.2.6/doc/manual.pdf differ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/doc/manual.xml new/FPLSA-1.2.6/doc/manual.xml --- old/FPLSA-1.2.5/doc/manual.xml 2022-03-10 23:07:34.000000000 +0100 +++ new/FPLSA-1.2.6/doc/manual.xml 2023-01-03 17:36:27.000000000 +0100 @@ -24,7 +24,7 @@ A finitely presented Lie algebra <A>K</A> can be constructed by <C><A>K</A> := <A>L</A>/<A>rels</A></C>, where <A>L</A> is a free Lie algebra and <A>rels</A> a list of elements of <A>L</A> that constitute the relations -that hold in <A>K</A>. Given a finitle presented Lie algebra we want to calculate +that hold in <A>K</A>. Given a finitely presented Lie algebra we want to calculate a basis and a multiplication table of it. The interface to the &FPLSA; package comes with two related functions for doing that. <P/> @@ -78,7 +78,7 @@ If the optional parameter <A>bound</A> is specified the computation will be carried out using monomials of degree at most <A>bound</A>. If <A>bound</A> is not specified, then it will initially be set to -10000. If this does not suffice to calculate a multiplication tabel +10000. If this does not suffice to calculate a multiplication table of the algebra, then the bound will be increased until a multiplication table is found. diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/doc/title.xml new/FPLSA-1.2.6/doc/title.xml --- old/FPLSA-1.2.5/doc/title.xml 2022-03-10 23:07:43.000000000 +0100 +++ new/FPLSA-1.2.6/doc/title.xml 2023-01-03 17:36:40.000000000 +0100 @@ -9,7 +9,7 @@ Finitely Presented Lie Algebras </Subtitle> <Version> - 1.2.5 + 1.2.6 </Version> <Author> Vladimir Gerdt<Alt Only="LaTeX"><Br/></Alt> @@ -24,6 +24,6 @@ </Author> <Date> - 10 March 2022 + 3 January 2023 </Date> </TitlePage> \ No newline at end of file diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/gap/fplsa.g new/FPLSA-1.2.6/gap/fplsa.g --- old/FPLSA-1.2.5/gap/fplsa.g 2022-03-10 23:07:34.000000000 +0100 +++ new/FPLSA-1.2.6/gap/fplsa.g 2023-01-03 17:36:27.000000000 +0100 @@ -308,11 +308,11 @@ ## If the optional parameter <bound> is specified the computation will ## be carried out using monomials of degree at most <bound>. ## If <bound> is not specified, then it will initially be set to -## 10000. If this does not suffice to calculate a multiplication tabel +## 10000. If this does not suffice to calculate a multiplication table ## of the algebra, then the bound will be increased until a multiplication ## table is found. ## -## If the computation was succesful a structure constants algebra +## If the computation was successful a structure constants algebra ## will be returned isomorphic to <K>. Otherwise `fail' ## will be returned. ## diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/src/README new/FPLSA-1.2.6/src/README --- old/FPLSA-1.2.5/src/README 2022-03-10 23:07:34.000000000 +0100 +++ new/FPLSA-1.2.6/src/README 2023-01-03 17:36:27.000000000 +0100 @@ -12,9 +12,9 @@ fplsa4.gap - output in the form readable by GAP The directory for input files can be set in fplsa4.ini. -By default, the input files have extention *.in, i.e., -if your file has such extention you can omit the extention -at the program run. If your file has no extention, you +By default, the input files have extension *.in, i.e., +if your file has such extension you can omit the extension +at the program run. If your file has no extension, you must add the dot to its name. Normally input looks like this: @@ -34,7 +34,7 @@ any place (this comment you can use in fplsa4.ini also). You can omit any above item except of Generators, because without generators the task looses any sense. -If you omit Weghts, the program sets all them = 1. +If you omit Weights, the program sets all them = 1. If you omit Limiting weight, the program asks for it. If you omit relations, the program computes free algebra (infinite-dimensional in most cases). @@ -47,8 +47,8 @@ (parametric) polynomials the sign "^" is used before degree. You can use in input relations fractions as coefficients (The program removes denominators itself) -If you type the name of inexisting file, the program can -constract it in the process of dialogue.BTW, to compute +If you type the name of a nonexistent file, the program can +construct it in the process of dialogue. BTW, to compute algebras with parameters remains still too dangerous, !!! because work with them uses some rather complicated functions (such as multivariate polynomial GCD), which were not yet @@ -77,7 +77,7 @@ GNU - 32bit compiler if set on, otherwise 16bit. You have to keep it on all the time SPACE_STATISTICS - computes and prints the maximum space used. - This computation does not take too much time, so it can be on everytime. + This computation does not take too much time, so it can be on every time. INTEGER_ALLOCATION_CHECK - controls allocation of heap memory for big integers. You have to set it on in the case of unclear program crash. POLY_ARRAY_ALLOCATION_CHECK - controls allocation in stack of working arrays @@ -91,7 +91,7 @@ program requests for name of file and limiting weight, so you have to set file name in command line and limiting weight in input file (or guess when to type them). -DEBUG, MEMORY, D_* - set on debugging and checking possible memory losts, +DEBUG, MEMORY, D_* - set on debugging and checking possible memory lost, too difficult to explain how to use these abilities. They are useful rather for me. LEFT_COMMENT, RIGHT_COMMENT, SUBSCRIPT_INPUT_SIGN, ODD_GENERATOR_INPUT_SIGN @@ -104,7 +104,7 @@ i.e., maximum name length should be 63. GAP_WIDTH - width of page in the *.gap file. Currently it is 79 to keep right margin visible. -There are also other constants and macrodefinitions, but they are useful for +There are also other constants and macro definitions, but they are useful for me only. Of course, you can organize the control of compilation via UNIX "make" file, but I don't know how to "make" such files. As to me, they only muddle @@ -120,7 +120,7 @@ Value can be either Boolean constant (Yes, No), or decimal number or text string. Determining text has essential initial part sufficient to separate -alternatives. Within this part you have to remain everithing including +alternatives. Within this part you have to remain everything including blanks as it is. Crude time: - The GNU C uses one 32bit word to count clock ticks. diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/FPLSA-1.2.5/src/fplsa4.c new/FPLSA-1.2.6/src/fplsa4.c --- old/FPLSA-1.2.5/src/fplsa4.c 2022-03-10 23:07:34.000000000 +0100 +++ new/FPLSA-1.2.6/src/fplsa4.c 2023-01-03 17:36:27.000000000 +0100 @@ -35,7 +35,7 @@ #define SPACE_STATISTICS /* Space statistics ?? */ //#define INTEGER_MAX_SIZE /* Multiprecision number maximum size ?? */ //#define INTEGER_ALLOCATION_CHECK /* Control of integer allocations ?? */ -//#define POLY_ARRAY_ALLOCATION_CHECK /* Control of allocations of ?? plynomial arrays in stack */ +//#define POLY_ARRAY_ALLOCATION_CHECK /* Control of allocations of ?? polynomial arrays in stack */ /* GAP output ?? */ /* Avoid message file, session file, */ @@ -2195,14 +2195,14 @@ } /*=ReduceRelations===================================================== Reduce the system of relations starting from Ith one. For further - differentiations returns lowest new positon (or starting one int). + differentiations returns lowest new position (or starting one int). */ int ReduceRelations(int i) { int i_min, j, lordj, lordl, min_gen, lmoni, k, l, m; uint ai, aj; i_min = i; - do /* While relations with new leading monomialsls arise */ + do /* While relations with new leading monomials arise */ if(RELATION_TO_BE_SUBSTITUTED(i)) { IN_REDUCE_RELATIONS /*----------------------------------------------*/

1 0