From 49900f8996910a5796d1a0e78d2b0b23ca55655e Mon Sep 17 00:00:00 2001
From: Tim Daly
Date: Mon, 18 Jul 2016 00:18:47 0400
Subject: [PATCH] books/bookvol{10.1,10.5,4} fix volume title
Goal: Axiom Literate Programming
The titles did not correspond to the volume (copy/paste bug)

books/bookvol10.1.pamphlet  2 +
books/bookvol10.5.pamphlet  2 +
books/bookvol4.pamphlet  5 +
changelog  4 +
patch  819 +
src/axiomwebsite/patches.html  2 +
6 files changed, 11 insertions(+), 823 deletions()
diff git a/books/bookvol10.1.pamphlet b/books/bookvol10.1.pamphlet
index 138df7f..b44f914 100644
 a/books/bookvol10.1.pamphlet
+++ b/books/bookvol10.1.pamphlet
@@ 1,5 +1,5 @@
\documentclass[dvipdfm]{book}
\newcommand{\VolumeName}{Volume 10: Axiom Algebra: Theory}
+\newcommand{\VolumeName}{Volume 10.1: Axiom Algebra: Theory}
\input{bookheader.tex}
\mainmatter
\setcounter{chapter}{0} % Chapter 1
diff git a/books/bookvol10.5.pamphlet b/books/bookvol10.5.pamphlet
index 8a8f56a..718d3d1 100644
 a/books/bookvol10.5.pamphlet
+++ b/books/bookvol10.5.pamphlet
@@ 1,5 +1,5 @@
\documentclass[dvipdfm]{book}
\newcommand{\VolumeName}{Volume 10: Axiom Algebra: Numerics}
+\newcommand{\VolumeName}{Volume 10.5: Axiom Algebra: Numerics}
\input{bookheader.tex}
\mainmatter
\setcounter{secnumdepth}{0} % override the one in bookheader.tex
diff git a/books/bookvol4.pamphlet b/books/bookvol4.pamphlet
index 5d6baba..6a1df38 100644
 a/books/bookvol4.pamphlet
+++ b/books/bookvol4.pamphlet
@@ 1,10 +1,7 @@
\documentclass[dvipdfm]{book}
\newcommand{\VolumeName}{Volume 10: Axiom Algebra: Numerics}
+\newcommand{\VolumeName}{Volume 4: Axiom Developers Guide}
\input{bookheader.tex}
\mainmatter
\setcounter{secnumdepth}{0} % override the one in bookheader.tex
\setcounter{chapter}{0} % Chapter 1
\center{\large{Volume 4: Axiom Developers Guide}}
\setcounter{chapter}{0} % Chapter 1
\begin{quote}
Confronting every new programmer learning a new language are
diff git a/changelog b/changelog
index 22d7536..95c55ab 100644
 a/changelog
+++ b/changelog
@@ 1,3 +1,7 @@
+20160717 tpd src/axiomwebsite/patches.html 20160717.02.tpd.patch
+20160717 tpd books/bookvol10.1 fix volume title
+20160717 tpd books/bookvol10.5 fix volume title
+20160717 tpd books/bookvol4 fix volume title
20160717 tpd src/axiomwebsite/patches.html 20160717.01.tpd.patch
20160717 tpd books/bookvol10.2 add citations to algebra
20160717 tpd books/bookvol10.3 add citations to algebra
diff git a/patch b/patch
index 58e4160..0de61b9 100644
 a/patch
+++ b/patch
@@ 1,820 +1,5 @@
books/bookvolbib Axiom Citations in the Literature
+books/bookvol{10.1,10.5,4} fix volume title
Goal: Axiom Literate Programming
\index{Corless, Robert M.}
\index{Jeffrey, David J.}
\begin{chunk}{axiom.bib}
@article{Corl98,
 author = "Corless, Robert M. and Jeffrey, David J.",
 title = "Graphing Elementary Riemann Surfaces",
 journal = "SIGSAM Bulletin",
 volume = "32",
 number = "1",
 pages = "1117",
 year = "1998",
 paper = "Corl98.djvu",
 abstract =
 "This paper discusses one of the prettiest pieces of elementary
 mathematics or computer algebra, that we have ever had the pleasure
 to learn. The tricks that we discuss here are certainly ``wellknown''
 (that is, in the literature), but we didn't know them until recently,
 and none of our immediate colleagues knew them either. Therefore we
 believe that it is useful to publicize them further. We hope that
 you find these ideas as pleasant and useful as we do."
}

\end{chunk}

\index{Corless, Robert M.}
\index{Jeffrey, David J.}
\index{Knuth, Donald E.}
\begin{chunk}{axiom.bib}
@misc{Corl97,
 author = "Corless, Robert M. and Jeffrey, David J. and Knuth, Donald E.",
 title = "A Sequence of Series for The Lambert W Function",
 year = "1997",
 paper = "Corl97.pdf",
 abstract =
 "We give a uniform treatment of several series expansions for the
 Lambert $W$ function, leading to an infinite family of new series.
 We also discuss standardization, complex branches, a family of
 arbitraryorder iterative methods for computation of $W_i$, and
 give a theorem showing how to correctly solve another simple and
 frequently occurring nonlinear equation in terms of $W$ and the
 unwinding number"
}

\end{chunk}

\index{Chow, Timothy Y.}
\begin{chunk}{axiom.bib}
@article{Chow99,
 author = "Chow, Timothy Y.",
 title = "What is a closedform number?",
 journal = "The American Mathematical Monthly",
 volume = "106",
 number = "5",
 pages = "440448",
 paper = "Chowxx.pdf",
 year = "1999"
}

\end{chunk}

\index{Hur, Namhyun}
\index{Davenport, James H.}
\begin{chunk}{axiom.bib}
@inproceedings{Hurx00,
 author = "Hur, Namhyun and Davenport, James H.",
 title = "An exact real algebraic arithmetic with equality determination",
 booktitle = "Proc. ISSAC 2000",
 series = "ISSAC '00",
 pages = "169174",
 year = "2000",
 paper = "Hurx00.djvu",
 abstract =
 "We describe a new arithmetic model for real algebraic numbers with
 an exact equality determination. The model represents a real algebraic
 number as a pair of an arbitrary precision numerical value and a
 symbolic expression. For the numerical part we currently (another
 representation could be used) use the dyadic exact real number and
 for the symbolic part we use a squarefree polynomial for the real
 algebraic number. In this model we show that we can decide exactly
 the equality of real algebraic numbers."
}

\end{chunk}

\index{Langley, Simon}
\index{Richardson, Daniel}
\begin{chunk}{axiom.bib}
@article{Lang02,
 author = "Langley, Simon and Richardson, Daniel",
 title = "What can we do with a Solution?",
 journal = "Electronic Notes in Theoretical Computer Science",
 volume = "66",
 number = "1",
 year = "2002",
 url = "http://www.elsevier.nl/locate/entcs/volume66.html",
 paper = "Lang02.pdf",
 abstract =
 "If $S=0$ is a system of $n$ equations and unknowns over $\mathbb{C}$
 and $S(\alpha)=0$ to what extent can we compute with the point $\alpha$?
 In particular, can we decide whether or not a polynomial expressions
 in the components of $\alpha$ with integral coefficients is zero?
 This question is considered for both algebraic and elementary systems
 of equations."
}

\end{chunk}

\index{Wang, Paul S.}
\begin{chunk}{axiom.bib}
@article{Wang74,
 author = "Wang, Paul S.",
 title = "The Undecidability of the Existence of Zeros of Real Elementary
 Functions",
 journal = "J. ACM",
 volume = "21",
 number = "4",
 pages = "586589",
 year = "1974",
 paper = "Wang74.djvu",
 abstract =
 "From Richardson's undecidability results, it is shown that the predicate
 ``there exists a real number $r$ such that $G(r)=0$'' is recursively
 undecidable for $G(x)$ in a class of functions which involves polynomials
 and the sine function. The deduction follows that the convergence of a
 class of improper integrals is recursively undecidable."
}

\end{chunk}

\index{Daly, Timothy}
\begin{chunk}{axiom.bib}
@article{Daly02
 author = "Daly, Timothy",
 title = "Axiom as open source",
 journal = "SIGSAM Bulletin",
 volume = "36",
 number = "1",
 pages = "2828",
 month = "March",
 year = "2002",
 keywords = "axiomref"
}

\end{chunk}

\index{Jenks, Richard D.}
\begin{chunk}{axiom.bib}
@article{Jenk92,
 author = "Jenks, Richard D.",
 title = "SCRATCHPAD",
 volume = "??",
 number = "24",
 pages = "1617",
 month = "October",
 year = "1972",
 keywords = "axiomref",
 abstract =
 "The following SCRATCHPAD solution of Problem \#2 was run on a 1280K
 virtual machine under CP/CMS time sharing system on a System/360
 model 67. The conversation below is a modification of a program
 originally written by Yngve Sundblad, August 1972. The program uses
 symmetrised formulae, saves certain intermediate results, but does not
 eliminate numerical factors in denominators"
}

\end{chunk}

\index{Norman, Arthur C.}
\begin{chunk}{axiom.bib}
@article{Norm75a,
 author = "Norman, Arthur C.",
 title = "The SCRATCHPAD Power Series Package",
 journal = "SIGSAM",
 volume = "9",
 number = "1",
 pages = "1220",
 year = "1975",
 comment = "IBM T.J. Watson Research RC4998",
 keywords = "axiomref"
}

\end{chunk}

\index{Griesmer, James H.}
\index{Jenks, Richard D.}
\index{Yun, David Y.Y.}
\begin{chunk}{axiom.bib}
@article{Grie75a,
 author = "Griesmer, James H. and Jenks, Richard D. and Yun, David Y.Y."
 title = "A SCRATCHPAD solution to problem \#7",
 journal = "SIGSAM",
 volume = "9",
 number = "3",
 pages = "1317",
 year = "1975"
}

\end{chunk}

\index{Miller, Bruce R.}
\begin{chunk}{axiom.bib}
@misc{Mill95,
 author = "Miller, Bruce R.",
 title = "An expression formatter for MACSYMA",
 keywords = "axiomref",
 year = "1995",
 paper = "Mill95.pdf",
 abstract =
 "A package for formatting algebraic expressions in MACSYA is described.
 It provides facilities for userdirected hierarchical structuring of
 expressions, as well as for directing simplifications to selected
 subexpressions. It emphasizes a semantic rther than syntactic description
 of the desired form. The package also provides utilities for obtaining
 efficiently the coefficients of polynomials, trigonometric sums and
 power series. Similar capabilities would be useful in other computer
 algebra systems."
}

\end{chunk}

\index{Griesmer, James H.}
\index{Jenks, Richard D.}
\index{Yun, David Y.Y.}
\begin{chunk}{axiom.bib}
@article{Grie75b,
 author = "Griesmer, James H. and Jenks, Richard D. and Yun, David Y.Y."
 title = "A FORMAT statement in SCRATCHPAD",
 journal = "SIGSAM",
 volume = "9",
 number = "3",
 pages = "2425",
 year = "1975",
 keywords = "axiomref",
 abstract =
 "Algebraic manipulation covers branches of software, particularly list
 processing, mathematics, notably logic and number theory, and
 applications largely in physics. The lectures will deal with all of these
 to a varying extent.
}

\end{chunk}

\index{Blair, Fred W.}
\index{Griesmer, James H.}
\index{Jenks, Richard D.}
\begin{chunk}{axiom.bib}
@inproceedings{Blai70,
 author = "Blair, Fred W. and Griesmer, James H. and Jenks, Richard D.",
 title = "An interactive facility for symbolic mathematics",
 booktitle = "Proc. International Computing Symposium, Bonn, Germany",
 year = "1970",
 pages = "394419",
 keywords = "axiomref",
 abstract =
 "The SCRATCHPAD/1 system is designed to provide an interactive symbolic
 coputational facility for the mathematician user. The system features
 a user language designed to capture the style and succinctness of
 mathematical notation, together with a facility for conveniently
 introducing new notations into the language. A comprehensive system
 library incorporates symbolic capabilities provided by such systems as
 SIN, MATHLAB, and REDUCE."
}

\end{chunk}

\index{Jenks, Richard D.}
\begin{chunk}{axiom.bib}
@article{Jenk79a,
 author = "Jenks, Richard D.",
 title = "SCRATCHPAD/360: reflections on a language design",
 journal = "SIGSAM",
 volume = "13",
 number = "1",
 pages = "1626",
 year = "1979",
 keywords = "axiomref",
 comment = "IBM Research RC 7405",
 abstract =
 "The key concepts of the SCRATCHPAD language are described, assessed,
 and illustrated by an example. The language was originally intended as
 an interactive problem solving language for symbolic mathematics.
 Nevertheless, as this paper intends to show, it can be used as a
 programming language as well."
}

\end{chunk}

\index{Ng, Edward W.}
\begin{chunk}{axiom.bib}
@techreport{Ngxx80,
 author = "Ng, Edward W.",
 title = "SymbolicNumeric Interface: A Review",
 type = "technical report",
 number = "NASACR162690 HC A02/MF A01"
 institution = "NASA Jet Propulsion Lab",
 url = "http://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19800008508.pdf",
 paper = "Ngxx80.pdf",
 keywords = "axiomref",
 abstract =
 "This is a survey of recent activities that either used or encouraged the
 potential use of a combination of symbolic and numerical calculations.
 Symbolic calculations here primarily refer to the computer processing of
 procedures from classical algebra, analysis and calculus. Numerical
 calculations refer to both numerical mathematics research and scientific
 computation. This survey is inteded to point out a large number of problem
 areas where a cooperation of symbolic and numeric methods is likely to
 bear many fruits. These areas include such classical operations as
 differentiation and integration, such diverse activities as function
 approximations andqualitative analysis, and such contemporary topics as
 finite element calculations and computational complexity. It is contended
 that other less obvious topics such as the fast Fourier transform, linear
 algebra, nonlinear analysis and error analysis would also benefti from a
 synergistic approach advocated here."
}

\end{chunk}

\index{Fateman, Richard J.}
\begin{chunk}{axiom.bib}
@article{Fate01,
 author = "Fateman, Richard J.",
 title = "A Review of Macsyma",
 journal = "IEEE Trans. Knowl. Eng.",
 volume = "1",
 number = "1",
 year = "2001",
 url = "http://people.eecs.berkeley.edu/~fateman/papers/mac82b.pdf",
 paper = "Fate01.pdf",
 keywords = "axiomref",
 abstract =
 "We review the successes and failures of the Macsyma algebraic
 manipulation system from the point of view of one of the original
 contributors. We provide a retrospective examination of some of the
 controversial ideas that worked, and some that did not. We consider
 input/output, language semantics, data types, pattern matching,
 knowledgeadjunction, mathematical semantics, the user community,
 and software engineering. We also comment on the porting of this
 system to a variety of computing systems, and possible future
 directions for algebraic manipulation systembuilding."
}

\end{chunk}

\index{Griesmer, James H.}
\index{Jenks, Richard D.}
\begin{chunk}{axiom.bib}
@article{Grie74,
 author = "Griesmer, James H. and Jenks, Richard D.",
 title = "A solution to problem \#4": the lie transform",
 journal = "SIGSAM Bulletin",
 volume = "8",
 number = "4",
 pages = "1213",
 year = "1974",
 keywords = "axiomref",
 abstract =
 "The following SCRATCHPAD conversation for carrying out the Lie
 Transform computation represents a slight modification of one written
 by Dr. David Barton, when he was a summer visitor during 1972 at the
 Watson Research Center."
}

\end{chunk}

\begin{chunk}{axiom.bib}
@misc{SIGS16,
 author = "SIGSAM, ACM",
 title = "Axiom"
 url = "http://www.sigsam.org/software/axiom.html",
 year = "2016",
 contact = "Infodir\_SIGSAM\@acm.org",
 abstract =
 "Axiom is a free, open source, generalpurpose computer algebra
 system. It features a strongly typed language. The system has an
 interactive interpreter and a compiler. It includes over 1100
 supported categories, domains, and packages covering large areas of
 Mathematics."
}

\end{chunk}

\index{Li, Yue}
\index{Dos Reis, Gabriel}
\begin{chunk}{axiom.bib}
@inproceedings{Lixx11,
 author = "Li, Yue and Dos Reis, Gabriel",
 title = "An Automatic Parallelization Framework for Algebraic
 Computation Systems",
 booktitle = "Proc. ISSAC 2011",
 pages = "233240",
 isbn = "9781450306751",
 year = "2011",
 url = "http://www.axiomatics.org/~gdr/concurrency/oaconcissac11.pdf",
 paper = "Lixx11.pdf",
 keywords = "axiomref",
 abstract =
 "This paper proposes a nonintrusive automatic parallelization
 framework for typeful and propertyaware computer algebra systems.
 Automatic parallelization remains a promising computer program
 transformation for exploiting ubiquitous concurrency facilities
 available in modern computers. The framework uses semanticsbased
 static analysis to extract reductions in library components based on
 algebraic properties. An early implementation shows up to 5 times
 speedup for library functions and homotopybased polynomial system
 solver. The general framework is applicable to algebraic computation
 systems and programming languages with advanced type systems that
 support userdefined axioms or annotation systems."
}

\end{chunk}

\index{Kendall, Wilfrid S.}
\begin{chunk}{axiom.bib}
@article{Kend01,
 author = "Kendall, Wilfrid S.",
 title = "Symbolic It\^o calculus in AXIOM: an ongoing story",
 journal = "Statistics and Computing",
 volume = "11",
 pages = "2535",
 year = "2001",
 url = "http://www2.warwick.ac.uk/fac/sci/statistics/staff/academicresearch/kendall/personal/ppt/327.ps.gz",
 paper = "Kend01.pdf",
 keywords = "axiomref",
 abstract =
 "Symbolic It\^o calculus refers both to the implementation of the
 It\^o calculus algebra package and to its application. This article
 reports on progress in the implementation of It\^o calculus in the
 powerful and innovative computer algebra package AXIOM, in the context
 of a decade of previous implementations and applications. It is shown
 how the elegant algebraic structure underylying the expressive and
 effective formalism of It\^o calculus can be implemented directly in
 AXIOM using the package's programmable facilities for ``strong
 typing'' of computational objects. An application is given of the use
 of the implementation to provide calculations for a new proof, based
 on stochastic differentials, of the MardiaDryden distribution from
 statistical shape theory."
}

\end{chunk}

\index{Senechaud, Pascale}
\index{Siebert, F.}
\begin{chunk}{axiom.bib}
@techreport{Sene87a,
 author = "Senechaud, Pascale and Siebert, F.",
 title = "Etude dl l'algorithme de Kovacic et son implantation sur
 Scratchpad II",
 type = "Technical Report",
 number = "639",
 institution = "Institut IMAG, Informatique et Mathematiques Appliquees
 de Grenoble",
 address = "Grenoble, France",
 year = "1987",
 keywords = "axiomref"
}

\end{chunk}

\index{Terelius, Bjorn}
\begin{chunk}{axiom.bib}
@mastersthesis{Tere09,
 author = "Terelius, Bjorn",
 title = "Symbolic Integration",
 school = "Royal Institute of Technology",
 address = "Stockholm, Sweden",
 year = "2009",
 paper = "Tere09.pdf",
 abstract =
 "Symbolic integration is the problem of expressing an indefinite integral
 $\int{f}$ of a given function $f$ as a finite combination $g$ of elementary
 functions, or more generally, to determine whether a certain class of
 functions contains an element $g$ such that $g^\prime = f$."

 In the first part of this thesis, we compare different algorithms for
 symbolic integration. Specifically, we review the integration rules
 taught in calculus courses and how they can be used systematically to
 create a reasonable, but somewhat limited, integration method. Then we
 present the differential algebra required to prove the transcendental
 cases of Risch's algorithm. Risch's algorithm decides if the integral
 of an elementary function is elementary and if so computes it. The
 presentation is mostly selfcontained and, we hope, simpler than
 previous descriptions of the algorithm. Finally, we describe
 RischNorman's algorithm which, although it is not a decision
 procedure, works well in practice and is considerably simpler than the
 full Risch algorithm.

 In the second part of this thesis, we briefly discuss an
 implementation of a computer algebra system and some of the
 experiences it has given us. We also demonstrate an implementation of
 the rulebased approach and how it can be used, not only to compute
 integrals, but also to generate readable derivations of the results."
}

\end{chunk}

\index{Kendall, Wilfrid S.}
\begin{chunk}{axiom.bib}
@article{Kend07,
 author = "Kendall, Wilfrid S.",
 title = "Coupling all the Levy Stochastic Areas of Multidimensional
 Brownian Motion",
 journal = "The Annals of Probability",
 volume = "35",
 number = "3",
 pages = "935953",
 year = "2007",
 keywords = "axiomref",
 comment = "Author used Axiom for computation but says missed citation",
 url = "http://arxiv.org/pdf/math/0512336v2.pdf",
 paper = "Kend07.pdf",
 abstract =
 "It is shown how to construct a successful coadapted coupling of two
 copies of an $n$dimensional Brownian motion ($B_1,\ldots,B_n$) while
 simultaneously coupling all corresponding copies of the L{\'e}vy
 stochastic areas $\int B_idB_j$  \int B_j dB_i$. It is conjectured
 that successful coadapted couplings still exist when the L{\'e}vy
 stochastic areas are replaced by a finite set of multiply iterated
 path and timeintegrals, subject to algebraic compatibility of the
 initial conditions."
}

\end{chunk}

\index{Bronstein, Manuel}
\index{Lafaille, S\'ebastien}
\begin{chunk}{axiom.bib}
@inproceedings{Bron02,
 author = "Bronstein, Manuel and Lafaille, S\'ebastien",
 title = "Solutions of linear ordinary differential equations in terms
 of special functions",
 booktitle = "Proc. ISSAC '02",
 publisher = "ACM Press",
 pages = "2328",
 year = "2002",
 isbn = "1581134843",
 url =
 "http://wwwsop.inria.fr/cafe/Manuel.Bronstein/publications/issac2002.pdf",
 paper = "Bron02.pdf",
 url2 = "http://xena.hunter.cuny.edu/ksda/papers/bronstein2.pdf",
 paper2 = "Bron02x.pdf",
 abstract =
 "We describe a new algorithm for computing special function solutions
 of the form $y(x) = m(x)F(\eta(x))$ of second order linear ordinary
 differential equations, where $m(x)$ is an arbitrary Liouvillian
 function, $\eta(x)$ is an arbitrary rational function, and $F$
 satisfies a given second order linear ordinary differential
 equations. Our algorithm, which is base on finding an appropriate
 point transformation between the equation defining $F$ and the one to
 solve, is able to find all rational transformations for a large class
 of functions $F$, in particular (but not only) the $_0F_1$ and $_1F_1$
 special functions of mathematical physics, such as Airy, Bessel,
 Kummer and Whittaker functions. It is also able to identify the values
 of the parameters entering those special functions, and can be
 generalized to equations of higher order."
}

\end{chunk}

\index{Chan, L.}
\index{ChebTerrab, E.S.}
\begin{chunk}{axiom.bib}
@inproceedings{Chan04,
 author = "Chan, L. and ChebTerrab, E.S.",
 title = "NonLiouvillian solutions for second order linear ODEs",
 booktitle = "Proc. ISSAC 04",
 pages = "8086",
 isbn = "158113827X",
 url = "http://www.cecm.sfu.ca/CAG/papers/edgardoIS04.pdf",
 keywords = "axiomref",
 paper = "Chan04.pdf",
 abstract =
 "There exist sound literature and algorithms for computing Liouvillian
 solutions for the important problem of linear ODEs with rational
 coefficients. Taking as sample the 363 second order equations of that
 type found in Kamke's book, for instance, 51\% of them admit Liouvillian
 solutions and so are solvable using Kovacic's algorithm. On the other
 hand, special function solutions not admitting Liouvillian form appear
 frequently in mathematical physics, but there are not so general
 algorithms for computing them. In this paper we present an algorithm
 for computing special function solutions which can be expressed using
 the $_2F_1$, $_1F_1$ or $_0F_1$ hypergeometric functions. They algorithm
 is easy to implement in the framework of a computer algebra system and
 systematically solves 91\% of the 363 Kamke's linear ODE examples
 mentioned."
}

\end{chunk}

\index{van Hoeij, Mark}
\index{Monagan, Michael}
\begin{chunk}{axiom.bib}
@inproceedings{Hoei04,
 author = "van Hoeij, Mark and Monagan, Michael",
 title = "Algorithms for Polynomial GCD Computation over Algebraic
 Function Fields",
 booktitle = "Proc. ISSAC 04",
 isbn = "158113827X",
 url = "http://www.cecm.sfu.ca/personal/mmonagan/papers/AFGCD.pdf",
 paper = "Hoei04.pdf",
 abstract =
 "Let $L$ be an algebraic function field in $k \ge 0$ parameters
 $t_1,\ldots,t)k$. Let $f_1$, $f_2$ be nonzero polynomials in
 $L[x]$. We give two algorithms for computing their gcd. The first, a
 modular GCD algorithm, is an extension of the modular GCD algorithm
 for Brown for {\bf Z}$[x_1,\ldots,x_n]$ and Encarnacion for {\bf
 Q}$(\alpha[x])$ to function fields. The second, a fractionfree
 algorithm, is a modification of the Moreno Maza and Rioboo algorithm
 for computing gcds over triangular sets. The modification reduces
 coefficient grownth in $L$ to be linear. We give an empirical
 comparison of the two algorithms using implementations in Maple."
}

\end{chunk}

\begin{chunk}{axiom.bib}
@misc{Maxi16a,
 author = "Maxima",
 title = "Symbolic Integration: The Algorithms",
 url =
"http://maxima.sourceforge.net/docs/tutorial/en/gaertnertutorialrevision/Pages/SI001.htm"
}

\index{Gil, I.}
\begin{chunk}{axiom.bib}
@inproceedings{Gilx92,
 author = "Gil, I.",
 title = "Computation of the Jordan canonical form of a square matrix
 (using the Axiom programming language)",
 booktitle = "Proc ISSAC 1992",
 series = "ISSAC '92",
 publisher = "ACM",
 pages = "138145",
 isbn = "0897914899 (soft cover), 0897914902 (hard cover)",
 keywords = "axiomref",
 abstract =
 "Presents an algorithm for computing: the Jordan form of a square
 matrix with coefficients in a field K using the computer algebra
 system Axiom. This system presents the advantage of allowing generic
 programming. That is to say, the algorithm can first be implemented
 for matrices with rational coefficients and then generalized to
 matrices with coefficients in any field. Therefore the author
 presents the general method which is essentially based on the use of
 the Frobenius form of a matrix in order to compute its Jordan form;
 and then restricts attention to matrices with rational
 coefficients. On the one hand the author streamlines the algorithm
 froben which computes the Frobenius form of a matrix, and on the other
 she examines in some detail the transformation from the Frobenius form
 to the Jordan form, and gives the so called algorithm Jordform. The
 author studies in particular, the complexity of this algorithm and
 proves that it is polynomial when the coefficients of the matrix are
 rational. Finally the author gives some experiments and a conclusion."
}

\end{chunk}

\index{InnerNormalBasisFieldFunctions}
\index{Stinson, D.R.}
\begin{chunk}{axiom.bib}
@article{Stin90,
 author = "Stinson, D.R.",
 title = "Some observations on parallel Algorithms for fast exponentiation
 in $GF(2^n)$",
 journal = "Siam J. Comp.",
 volume = "19",
 number = "4",
 pages = "711717",
 year = "1990",
 paper = "Stin90.pdf",
 algebra = "\newline\refto{package INBFF InnerNormalBasisFieldFunctions}",
 abstract =
 "A normal basis represention in $GF(2^n)$ allows squaring to be
 accomplished by a cyclic shift. Algorithms for multiplication in
 $GF(2^n)$ using a normal basis have been studied by several
 researchers. In this paper, algorithms for performing exponentiation
 in $GF(2^n)$ using a normal basis, and how they can be speeded up by
 using parallelization, are investigated."
}

\end{chunk}

\index{FiniteFieldPolynomialPackage}
\index{Lenstra, H. W.}
\index{Schoof, R. J.}
\begin{chunk}{axiom.bib}
@article{Lens87,
 author = "Lenstra, H. W. and Schoof, R. J.",
 title = "Primitive Normal Bases for Finite Fields",
 journal = "Mathematics of Computation",
 volume = "48",
 number = "177",
 year = "1987",
 pages = "217231",
 url = "http://www.math.leidenuniv.nl/~hwl/PUBLICATIONS/",
 paper = "Lens87.pdf",
 algebra = "\newline\refto{package FFPOLY FiniteFieldPolynomialPackage}",
 abstract =
 "It is proved that any finite extension of a finite field has a normal
 basis consisting of primitive roots"
}

\end{chunk}

\index{CharacteristicNonZero}
\index{FieldOfPrimeCharacteristic}
\index{ExtensionField}
\index{FiniteFieldCategory}
\index{FiniteAlgebraicExtensionField}
\index{SimpleAlgebraicExtension}
\index{InnerPrimeField}
\index{PrimeField}
\index{FiniteFieldExtensionByPolynomial}
\index{FiniteFieldCyclicGroupExtensionByPolynomial}
\index{FiniteFieldNormalBasisExtensionByPolynomial}
\index{FiniteFieldExtension}
\index{FiniteFieldCyclicGroupExtension}
\index{FiniteFieldNormalBasisExtension}
\index{InnerFiniteField}
\index{FiniteField}
\index{FiniteFieldCyclicGroup}
\index{FiniteFieldNormalBasis}
\index{DiscreteLogarithmPackage}
\index{FiniteFieldFunctions}
\index{InnerNormalBasisFieldFunctions}
\index{FiniteFieldPolynomialPackage}
\index{FiniteFieldPolynomialPackage2}
\index{FiniteFieldHomomorphisms}
\index{FiniteFieldFactorizationWithSizeParseBySideEffect}
\index{Grabmeier, Johannes}
\index{Scheerhorn, Alfred}
\begin{chunk}{axiom.bib}
@techreport{Grab92,
 author = "Grabmeier, Johannes and Scheerhorn, Alfred",
 title = "Finite fields in Axiom",
 type = "technical report",
 number = "AXIOM Technical Report TR7/92 (ATR/5)(NP2522)",
 institution = "Numerical Algorithms Group, Inc.",
 address = "Downer's Grove, IL, USA and Oxford, UK",
 year = "1992",
 url = "http://www.nag.co.uk/doc/TechRep/axiomtr.html",
 keywords = "axiomref",
 paper = "Grab92.pdf",
 algebra =
 "\newline\refto{category CHARNZ CharacteristicNonZero}
 \newline\refto{category FPC FieldOfPrimeCharacteristic}
 \newline\refto{category XF ExtensionField}
 \newline\refto{category FFIELDC FiniteFieldCategory}
 \newline\refto{category FAXF FiniteAlgebraicExtensionField}
 \newline\refto{domain SAE SimpleAlgebraicExtension}
 \newline\refto{domain IPF InnerPrimeField}
 \newline\refto{domain PF PrimeField}
 \newline\refto{domain FFP FiniteFieldExtensionByPolynomial}
 \newline\refto{domain FFCGP FiniteFieldCyclicGroupExtensionByPolynomial}
 \newline\refto{domain FFNBP FiniteFieldNormalBasisExtensionByPolynomial}
 \newline\refto{domain FFX FiniteFieldExtension}
 \newline\refto{domain FFCGX FiniteFieldCyclicGroupExtension}
 \newline\refto{domain FFNBX FiniteFieldNormalBasisExtension}
 \newline\refto{domain IFF InnerFiniteField}
 \newline\refto{domain FF FiniteField}
 \newline\refto{domain FFCG FiniteFieldCyclicGroup}
 \newline\refto{domain FFNB FiniteFieldNormalBasis}
 \newline\refto{package DLP DiscreteLogarithmPackage}
 \newline\refto{package FFF FiniteFieldFunctions}
 \newline\refto{package INBFF InnerNormalBasisFieldFunctions}
 \newline\refto{package FFPOLY FiniteFieldPolynomialPackage}
 \newline\refto{package FFPOLY2 FiniteFieldPolynomialPackage2}
 \newline\refto{package FFHOM FiniteFieldHomomorphisms}
 \newline\refto
 {package FFFACTSE FiniteFieldFactorizationWithSizeParseBySideEffect}",
 abstract =
 "Finite fields play an important role for many applications (e.g. coding
 theory, cryptograpy). There are different ways to construct a finite
 field for a given prime power. The paper describes the different
 constructions implemented in AXIOM. These are {\sl polynomial basis
 representation}, {\sl cyclic group representation}, and {\sl normal
 basis representation}. Furthermore, the concept of the implementation,
 the used algorithms and the various datatype coercions between these
 representations are discussed."
}

\end{chunk}

\index{InnerNormalBasisFieldFunctions}
\index{Itoh, T.}
\index{Tsujii, S.}
\begin{chunk}{axiom.bib}
@article{Itoh88,
 author = "Itoh, T. and Tsujii, S.",
 title = "A fast algorithm for computing multiplicative inverses in
 $GF(2^m)$ using normal bases",
 journal = "Inf. and Comp.",
 volume = "78",
 pages = "171177",
 year = "1988",
 paper = "Itoh88.pdf",
 algebra = "\newline\refto{package INBFF InnerNormalBasisFieldFunctions}",
 abstract =
 "This paper proposes a fast algorithm for computing multiplicative
 inverses in $GF(2^m)$ using normal bases. Normal bases have the
 following useful property: In the case that an element $x$ in
 $GF(2^m)$ is represented by normal bases, $2^k$ power operation of an
 element $x$ in $GF(2^m)$ can be carried out by $k$ times cyclic shift
 of its vector representation. C.C. Wang et al. proposed an algorithm
 for computing multiplicative inverses using normal bases, which
 requires $(m2)$ multiplications in $GF(2^m)$ and $(m1)$ cyclic
 shifts. The fast algorithm proposed in this paper also uses normal
 bases, and computes multiplicative inverses iterating multiplications
 in $GF(2^m)$. It requires at most $2[log_2(m1)]$ multiplications in
 $GF(2^m)$ and $(m1)$ cyclic shifts, which are much less than those
 required in Wang's method. The same idea of the proposed fast
 algorithm is applicable to the general power operation in $GF(2^m)$
 and the computation of multiplicative inverses in $GF(q^m)$
 $(q=2^n)$."
}

\end{chunk}

+The titles did not correspond to the volume (copy/paste bug)
diff git a/src/axiomwebsite/patches.html b/src/axiomwebsite/patches.html
index 721903c..331b859 100644
 a/src/axiomwebsite/patches.html
+++ b/src/axiomwebsite/patches.html
@@ 5482,6 +5482,8 @@ books/bookvol10.* add literature references to algebra
books/bookvol2 Add Davenport chapters
20160717.01.tpd.patch
books/bookvolbib Axiom Citations in the Literature
+20160717.02.tpd.patch
+books/bookvol{10.1,10.5,4} fix volume title

1.7.5.4