From 65b57d4df50b5785aa5a15ba7e554eb1bdfed1db Mon Sep 17 00:00:00 2001
From: Tim Daly
Date: Tue, 31 Oct 2017 12:02:09 -0400
Subject: [PATCH] books/bookvolbib add references
Goal: Axiom Literate Programming
\index{Jenks, Richard D.}
\begin{chunk}{axiom.bib}
@article{Jenk87a,
author = "Jenks, Richard D.",
title = {{1962-1992: The First 30 Years of Symbolic Mathematical
Programming Systems}},
journal = "Lecture Notes in Computer Science",
volume = "296",
year = "1987",
pages = "1-1",
abstract =
"This talk examines the history and future of symbolic mathematical
computer systems. This talk will trace the development of three
generations of computer algebra systems as typified by an early system
of 60's: FORMAC, the standalone systems of the 70's: REDUCE and
MACSYMA, and those developed in the 80's: muMATH, MAPLE, SMP, with
particular emphasis on Scratchpad II, a system of revolutionary design
currently under development by IBM Research.
This talk will trace the progress of algebraic algorithm research in
the past 25 years, advances in hardware and software technology over
the same period, and the impact of such progress on the design issues
of such systems. The talk will conclude with a description of the
workstation of the future and its anticipated impact on the research
and educational communities.",
paper = "Jenk87a.pdf",
keywords = "axiomref"
}
\end{chunk}
\index{Calmet, Jacques}
\begin{chunk}{axiom.bib}
@article{Calm87,
author = "Calmet, Jacques",
title = {{Intelligent Computer Algebra System: Myth, Fancy or
Reality?}},
journal = "Lecture Notes in Computer Science",
volume = "296",
year = "1987",
pages = "2-11",
paper = "Calm87.pdf",
keywords = "axiomref"
}
\end{chunk}
\index{Lescanne, Pierre}
\begin{chunk}{axiom.bib}
@article{Lesc87,
author = "Lescanne, Pierre",
title = {{Current trends in rewriting techniques and related problems}},
journal = "Lecture Notes in Computer Science",
volume = "296",
year = "1987",
pages = "38-51",
paper = "Lesc97.pdf"
}
\end{chunk}
\index{Abbott, J.A.}
\index{Bradford, R.J.}
\index{Davenport, J.H.}
\begin{chunk}{axiom.bib}
@article{Abbo87,
author = "Abbott, J.A. and Bradford, R.J. and Davenport, J.H.",
title = {{factorisation of Polynomials: Old Ideas and Recent
Results}},
journal = "Lecture Notes in Computer Science",
volume = "296",
year = "1987",
pages = "81-91",
abstract =
"The problem of factorising polynomials: that is to say, given a
polynomial with integer coefficients, to find the irreducible
polynomials that divide it, is one with a long history. While the last
word has not been said on the subject, we can say that the past 15
years have seen major break-throughs, and many computer algebra
systems now include {\sl efficient} algorithms for this problem. When
it comes to polynomials with algebraic number coefficients, the
problem is far harder, and several major questions remain to be
answered. Nevertheless, the last few years have seen substantial
improvements, and such factorisations are now possible",
paper = "Abbo87.pdf"
}
\end{chunk}
\index{Buchberger, Bruno}
\begin{chunk}{axiom.bib}
@article{Buch87,
author = "Buchberger, Bruno",
title = {{AApplications of Gr\"obner Bases in Non-Linear
Computational Geometry}},
journal = "Lecture Notes in Computer Science",
volume = "296",
year = "1987",
paper = "52-80",
abstract =
"Groebner bases are certain finite sets of multivariate
polynomials. Many problems in polynomial ideal theory (algebra
geometry, non-linear computational geometry) can be solved by easy
algorithms after transforming the polynomial sets involved in the
specification of the problems into Groebner basis form. In this paper
we give gome examples of applying the Groebner bases method to
problems in non-linear computational geometry (inverse kinematics in
robot programming, collision detection for superellipsoids,
implicitization of parametric representations of curves and surfaces,
inversion problem for parametric representations, automated
geometrical theorem proving, primary decompsotion of implicitly
defined geometrical objects). The paper starts with a brief summary of
the Groebner bases method.",
paper = "Buch87.pdf"
}
\end{chunk}
\index{Andrews, George}
\begin{chunk}{axiom.bib}
@article{Andr87,
author = "Andrews, George",
title = {{Applications of Scratchpad to Problems in Special
Functions and Combinatorics}},
journal = "Lecture Notes in Computer Science",
volume = "296",
year = "1987",
pages = "158-166",
abstract =
"Within the last few years, there have been numerous applications of
computer algebra to special functions. G. Gasper (Norwestern
University) has studied classical hypergeometric functions, and
W. Gosper (Symbolics Inc.) has developed a large variety of
spectacular transformation and summation techniques for MACSYMA. The
purpose of this note is to explore some of the interface between
computer algebra and special functions. In Section 2 we examine an
application of MACSYMA which inadequately relied, in my opinion, on
what was readily available in the literature on hypergeometric
series. In Section 3 we consider classical observations on sums of
powers of binomial coefficients. In Section 4 we consider a problem of
D.M. Jackson wherein SCRATCHPAD and classical hypergeometric series
interact nicely. We close with a problem inspired by work in
statistical mechanics which leads us to questions about algorithms
that would be useful in computer algebra applications.",
paper = "Andr87.pdf",
keywrods = "axiomref"
}
\end{chunk}
---
books/axiom.bib | 129 +++++++++++++++++++++++++++++++++-
books/bookvolbib.pamphlet | 155 ++++++++++++++++++++++++++++++++++++++++-
changelog | 2 +
patch | 154 +++++++++++++++++++++++++++++++++++++++-
src/axiom-website/patches.html | 2 +
5 files changed, 436 insertions(+), 6 deletions(-)
diff --git a/books/axiom.bib b/books/axiom.bib
index 7595c71..4b710de 100644
--- a/books/axiom.bib
+++ b/books/axiom.bib
@@ -13126,6 +13126,28 @@ paper = "Brea89.pdf"
paper = "Kalt88b.pdf"
}
+@article{Abbo87,
+ author = "Abbott, J.A. and Bradford, R.J. and Davenport, J.H.",
+ title = {{factorisation of Polynomials: Old Ideas and Recent
+ Results}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ pages = "81-91",
+ abstract =
+ "The problem of factorising polynomials: that is to say, given a
+ polynomial with integer coefficients, to find the irreducible
+ polynomials that divide it, is one with a long history. While the last
+ word has not been said on the subject, we can say that the past 15
+ years have seen major break-throughs, and many computer algebra
+ systems now include {\sl efficient} algorithms for this problem. When
+ it comes to polynomials with algebraic number coefficients, the
+ problem is far harder, and several major questions remain to be
+ answered. Nevertheless, the last few years have seen substantial
+ improvements, and such factorisations are now possible",
+ paper = "Abbo87.pdf"
+}
+
@InProceedings{Bern97a,
author = "Bernardin, Laurent and Monagan, Michael B.",
title = {{Efficient multivariate factorization over finite fields}},
@@ -19589,6 +19611,34 @@ paper = "Brea89.pdf"
keywords = "axiomref"
}
+@article{Andr87,
+ author = "Andrews, George",
+ title = {{Applications of Scratchpad to Problems in Special
+ Functions and Combinatorics}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ pages = "158-166",
+ abstract =
+ "Within the last few years, there have been numerous applications of
+ computer algebra to special functions. G. Gasper (Norwestern
+ University) has studied classical hypergeometric functions, and
+ W. Gosper (Symbolics Inc.) has developed a large variety of
+ spectacular transformation and summation techniques for MACSYMA. The
+ purpose of this note is to explore some of the interface between
+ computer algebra and special functions. In Section 2 we examine an
+ application of MACSYMA which inadequately relied, in my opinion, on
+ what was readily available in the literature on hypergeometric
+ series. In Section 3 we consider classical observations on sums of
+ powers of binomial coefficients. In Section 4 we consider a problem of
+ D.M. Jackson wherein SCRATCHPAD and classical hypergeometric series
+ interact nicely. We close with a problem inspired by work in
+ statistical mechanics which leads us to questions about algorithms
+ that would be useful in computer algebra applications.",
+ paper = "Andr87.pdf",
+ keywrods = "axiomref"
+}
+
@inproceedings{Andr90,
author = "Andrews, George and Baxter, R.J.",
title = {{SCRATCHPAD explorations for elliptic theta functions}},
@@ -20709,6 +20759,18 @@ paper = "Brea89.pdf"
beebe = "Burge:1989:ISS"
}
+@article{Calm87,
+ author = "Calmet, Jacques",
+ title = {{Intelligent Computer Algebra System: Myth, Fancy or
+ Reality?}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ pages = "2-11",
+ paper = "Calm87.pdf",
+ keywords = "axiomref"
+}
+
@article{Calm97,
author = "Calmet, J. and Campbell, J.A.",
title = {{A perspective on symbolic mathematical computing and
@@ -25210,6 +25272,33 @@ paper = "Brea89.pdf"
keywords = "axiomref"
}
+@article{Jenk87a,
+ author = "Jenks, Richard D.",
+ title = {{1962-1992: The First 30 Years of Symbolic Mathematical
+ Programming Systems}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ pages = "1-1",
+ abstract =
+ "This talk examines the history and future of symbolic mathematical
+ computer systems. This talk will trace the development of three
+ generations of computer algebra systems as typified by an early system
+ of 60's: FORMAC, the standalone systems of the 70's: REDUCE and
+ MACSYMA, and those developed in the 80's: muMATH, MAPLE, SMP, with
+ particular emphasis on Scratchpad II, a system of revolutionary design
+ currently under development by IBM Research.
+
+ This talk will trace the progress of algebraic algorithm research in
+ the past 25 years, advances in hardware and software technology over
+ the same period, and the impact of such progress on the design issues
+ of such systems. The talk will conclude with a description of the
+ workstation of the future and its anticipated impact on the research
+ and educational communities.",
+ paper = "Jenk87a.pdf",
+ keywords = "axiomref"
+}
+
@misc{Acad16,
author = "Academic Search",
title = {{A Primer: 11 Keys to New Scratchpad}},
@@ -28286,13 +28375,13 @@ paper = "Brea89.pdf"
keywords = "axiomref"
}
-@inproceedings{Schw88,
+@inproceedings{Schw87,
author = "Schwarz, Fritz",
title = {{Programming with abstract data types: the symmetry package
SPDE in Scratchpad'}},
booktitle = "Trends in Computer Algebra",
series = "Lecture Notes in Computer Science 296",
- year = "1988",
+ year = "1987",
pages = "167-176",
isbn = "3-540-18928-9",
abstract =
@@ -28305,6 +28394,7 @@ paper = "Brea89.pdf"
engineering they are elaborated by means of the symmetry analysis of
differential equations and the Scratchpad package SPDE which
abbreviates Symmetries of Partial Differential Equations.",
+ paper = "Schw87.pdf",
keywords = "axiomref",
beebe = "Schwarz:1988:PAD"
}
@@ -30975,6 +31065,31 @@ paper = "Brea89.pdf"
paper = "Brui94.pdf"
}
+@article{Buch87,
+ author = "Buchberger, Bruno",
+ title = {{Applications of Gr\"obner Bases in Non-Linear
+ Computational Geometry}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ paper = "52-80",
+ abstract =
+ "Groebner bases are certain finite sets of multivariate
+ polynomials. Many problems in polynomial ideal theory (algebra
+ geometry, non-linear computational geometry) can be solved by easy
+ algorithms after transforming the polynomial sets involved in the
+ specification of the problems into Groebner basis form. In this paper
+ we give gome examples of applying the Groebner bases method to
+ problems in non-linear computational geometry (inverse kinematics in
+ robot programming, collision detection for superellipsoids,
+ implicitization of parametric representations of curves and surfaces,
+ inversion problem for parametric representations, automated
+ geometrical theorem proving, primary decompsotion of implicitly
+ defined geometrical objects). The paper starts with a brief summary of
+ the Groebner bases method.",
+ paper = "Buch87.pdf"
+}
+
@inproceedings{Buch97a,
author = "Buchberger, B. and Jebelean, Tudor and Kriftner, Franz and
Vasaru, Daniela",
@@ -32244,6 +32359,16 @@ paper = "Brea89.pdf"
year = "2011"
}
+@article{Lesc87,
+ author = "Lescanne, Pierre",
+ title = {{Current Trends in Rewriting Techniques and Related Problems}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ pages = "38-51",
+ paper = "Lesc97.pdf"
+}
+
@misc{Leop03,
author = "Leopardi, Paul",
title = {{A quick introduction to Clifford Algebras}},
diff --git a/books/bookvolbib.pamphlet b/books/bookvolbib.pamphlet
index 271aa4f..85eb8cc 100644
--- a/books/bookvolbib.pamphlet
+++ b/books/bookvolbib.pamphlet
@@ -19013,6 +19013,34 @@ Proc ISSAC 97 pp172-175 (1997)
\section{Polynomial Factorization} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+\index{Abbott, J.A.}
+\index{Bradford, R.J.}
+\index{Davenport, J.H.}
+\begin{chunk}{axiom.bib}
+@article{Abbo87,
+ author = "Abbott, J.A. and Bradford, R.J. and Davenport, J.H.",
+ title = {{factorisation of Polynomials: Old Ideas and Recent
+ Results}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ pages = "81-91",
+ abstract =
+ "The problem of factorising polynomials: that is to say, given a
+ polynomial with integer coefficients, to find the irreducible
+ polynomials that divide it, is one with a long history. While the last
+ word has not been said on the subject, we can say that the past 15
+ years have seen major break-throughs, and many computer algebra
+ systems now include {\sl efficient} algorithms for this problem. When
+ it comes to polynomials with algebraic number coefficients, the
+ problem is far harder, and several major questions remain to be
+ answered. Nevertheless, the last few years have seen substantial
+ improvements, and such factorisations are now possible",
+ paper = "Abbo87.pdf"
+}
+
+\end{chunk}
+
\index{Bernardin, Laurent}
\index{Monagan, Michael B.}
\begin{chunk}{axiom.bib}
@@ -27198,6 +27226,38 @@ Proc ISSAC 97 pp172-175 (1997)
\end{chunk}
\index{Andrews, George}
+\begin{chunk}{axiom.bib}
+@article{Andr87,
+ author = "Andrews, George",
+ title = {{Applications of Scratchpad to Problems in Special
+ Functions and Combinatorics}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ pages = "158-166",
+ abstract =
+ "Within the last few years, there have been numerous applications of
+ computer algebra to special functions. G. Gasper (Norwestern
+ University) has studied classical hypergeometric functions, and
+ W. Gosper (Symbolics Inc.) has developed a large variety of
+ spectacular transformation and summation techniques for MACSYMA. The
+ purpose of this note is to explore some of the interface between
+ computer algebra and special functions. In Section 2 we examine an
+ application of MACSYMA which inadequately relied, in my opinion, on
+ what was readily available in the literature on hypergeometric
+ series. In Section 3 we consider classical observations on sums of
+ powers of binomial coefficients. In Section 4 we consider a problem of
+ D.M. Jackson wherein SCRATCHPAD and classical hypergeometric series
+ interact nicely. We close with a problem inspired by work in
+ statistical mechanics which leads us to questions about algorithms
+ that would be useful in computer algebra applications.",
+ paper = "Andr87.pdf",
+ keywrods = "axiomref"
+}
+
+\end{chunk}
+
+\index{Andrews, George}
\index{Baxter, R.J.}
\begin{chunk}{axiom.bib}
@inproceedings{Andr90,
@@ -29252,6 +29312,22 @@ Universit{\"a}t Karsruhe, Karlsruhe, Germany 1994
\end{chunk}
\index{Calmet, Jacques}
+\begin{chunk}{axiom.bib}
+@article{Calm87,
+ author = "Calmet, Jacques",
+ title = {{Intelligent Computer Algebra System: Myth, Fancy or
+ Reality?}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ pages = "2-11",
+ paper = "Calm87.pdf",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
+\index{Calmet, Jacques}
\index{Campbell, John A.}
\begin{chunk}{axiom.bib}
@article{Calm97,
@@ -36394,6 +36470,37 @@ SIGPLAN Notices, New York: Association for Computing Machiner, Nov 1981
\end{chunk}
+\index{Jenks, Richard D.}
+\begin{chunk}{axiom.bib}
+@article{Jenk87a,
+ author = "Jenks, Richard D.",
+ title = {{1962-1992: The First 30 Years of Symbolic Mathematical
+ Programming Systems}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ pages = "1-1",
+ abstract =
+ "This talk examines the history and future of symbolic mathematical
+ computer systems. This talk will trace the development of three
+ generations of computer algebra systems as typified by an early system
+ of 60's: FORMAC, the standalone systems of the 70's: REDUCE and
+ MACSYMA, and those developed in the 80's: muMATH, MAPLE, SMP, with
+ particular emphasis on Scratchpad II, a system of revolutionary design
+ currently under development by IBM Research.
+
+ This talk will trace the progress of algebraic algorithm research in
+ the past 25 years, advances in hardware and software technology over
+ the same period, and the impact of such progress on the design issues
+ of such systems. The talk will conclude with a description of the
+ workstation of the future and its anticipated impact on the research
+ and educational communities.",
+ paper = "Jenk87a.pdf",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
\begin{chunk}{axiom.bib}
@misc{Acad16,
author = "Academic Search",
@@ -41584,13 +41691,13 @@ Kognitive Systeme, Universit\"t Karlsruhe 1992
\index{Schwarz, Fritz}
\begin{chunk}{axiom.bib}
-@inproceedings{Schw88,
+@inproceedings{Schw87,
author = "Schwarz, Fritz",
title = {{Programming with abstract data types: the symmetry package
SPDE in Scratchpad'}},
booktitle = "Trends in Computer Algebra",
series = "Lecture Notes in Computer Science 296",
- year = "1988",
+ year = "1987",
pages = "167-176",
isbn = "3-540-18928-9",
abstract =
@@ -41603,6 +41710,7 @@ Kognitive Systeme, Universit\"t Karlsruhe 1992
engineering they are elaborated by means of the symmetry analysis of
differential equations and the Scratchpad package SPDE which
abbreviates Symmetries of Partial Differential Equations.",
+ paper = "Schw87.pdf",
keywords = "axiomref",
beebe = "Schwarz:1988:PAD"
}
@@ -46216,6 +46324,35 @@ ISBN 3-7643-5901-3 (1998)
\end{chunk}
+\index{Buchberger, Bruno}
+\begin{chunk}{axiom.bib}
+@article{Buch87,
+ author = "Buchberger, Bruno",
+ title = {{Applications of Gr\"obner Bases in Non-Linear
+ Computational Geometry}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ paper = "52-80",
+ abstract =
+ "Groebner bases are certain finite sets of multivariate
+ polynomials. Many problems in polynomial ideal theory (algebra
+ geometry, non-linear computational geometry) can be solved by easy
+ algorithms after transforming the polynomial sets involved in the
+ specification of the problems into Groebner basis form. In this paper
+ we give gome examples of applying the Groebner bases method to
+ problems in non-linear computational geometry (inverse kinematics in
+ robot programming, collision detection for superellipsoids,
+ implicitization of parametric representations of curves and surfaces,
+ inversion problem for parametric representations, automated
+ geometrical theorem proving, primary decompsotion of implicitly
+ defined geometrical objects). The paper starts with a brief summary of
+ the Groebner bases method.",
+ paper = "Buch87.pdf"
+}
+
+\end{chunk}
+
\index{Buchberger, B.}
\index{Jebelean, Tudor}
\index{Kriftner, Franz}
@@ -49066,6 +49203,20 @@ Prentice-Hall. (1974)
\end{chunk}
+\index{Lescanne, Pierre}
+\begin{chunk}{axiom.bib}
+@article{Lesc87,
+ author = "Lescanne, Pierre",
+ title = {{Current Trends in Rewriting Techniques and Related Problems}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ pages = "38-51",
+ paper = "Lesc97.pdf"
+}
+
+\end{chunk}
+
\index{Leopardi, Paul}
\begin{chunk}{axiom.bib}
@misc{Leop03,
diff --git a/changelog b/changelog
index 112facf..1d9bfe7 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20171031 tpd src/axiom-website/patches.html 20171031.03.tpd.patch
+20171031 tpd books/bookvolbib add references
20171031 tpd src/axiom-website/patches.html 20171031.02.tpd.patch
20171031 tpd books/bookvolbib respect case in paper titles
20171031 tpd src/axiom-website/patches.html 20171031.01.tpd.patch
diff --git a/patch b/patch
index 08de405..be340d0 100644
--- a/patch
+++ b/patch
@@ -1,3 +1,153 @@
-books/bookvolbib respect case in paper titles
+books/bookvolbib add references
-Goal: Axiom Maintenance
+Goal: Axiom Literate Programming
+
+\index{Jenks, Richard D.}
+\begin{chunk}{axiom.bib}
+@article{Jenk87a,
+ author = "Jenks, Richard D.",
+ title = {{1962-1992: The First 30 Years of Symbolic Mathematical
+ Programming Systems}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ pages = "1-1",
+ abstract =
+ "This talk examines the history and future of symbolic mathematical
+ computer systems. This talk will trace the development of three
+ generations of computer algebra systems as typified by an early system
+ of 60's: FORMAC, the standalone systems of the 70's: REDUCE and
+ MACSYMA, and those developed in the 80's: muMATH, MAPLE, SMP, with
+ particular emphasis on Scratchpad II, a system of revolutionary design
+ currently under development by IBM Research.
+
+ This talk will trace the progress of algebraic algorithm research in
+ the past 25 years, advances in hardware and software technology over
+ the same period, and the impact of such progress on the design issues
+ of such systems. The talk will conclude with a description of the
+ workstation of the future and its anticipated impact on the research
+ and educational communities.",
+ paper = "Jenk87a.pdf",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
+\index{Calmet, Jacques}
+\begin{chunk}{axiom.bib}
+@article{Calm87,
+ author = "Calmet, Jacques",
+ title = {{Intelligent Computer Algebra System: Myth, Fancy or
+ Reality?}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ pages = "2-11",
+ paper = "Calm87.pdf",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
+\index{Lescanne, Pierre}
+\begin{chunk}{axiom.bib}
+@article{Lesc87,
+ author = "Lescanne, Pierre",
+ title = {{Current trends in rewriting techniques and related problems}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ pages = "38-51",
+ paper = "Lesc97.pdf"
+}
+
+\end{chunk}
+
+\index{Abbott, J.A.}
+\index{Bradford, R.J.}
+\index{Davenport, J.H.}
+\begin{chunk}{axiom.bib}
+@article{Abbo87,
+ author = "Abbott, J.A. and Bradford, R.J. and Davenport, J.H.",
+ title = {{factorisation of Polynomials: Old Ideas and Recent
+ Results}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ pages = "81-91",
+ abstract =
+ "The problem of factorising polynomials: that is to say, given a
+ polynomial with integer coefficients, to find the irreducible
+ polynomials that divide it, is one with a long history. While the last
+ word has not been said on the subject, we can say that the past 15
+ years have seen major break-throughs, and many computer algebra
+ systems now include {\sl efficient} algorithms for this problem. When
+ it comes to polynomials with algebraic number coefficients, the
+ problem is far harder, and several major questions remain to be
+ answered. Nevertheless, the last few years have seen substantial
+ improvements, and such factorisations are now possible",
+ paper = "Abbo87.pdf"
+}
+
+\end{chunk}
+
+\index{Buchberger, Bruno}
+\begin{chunk}{axiom.bib}
+@article{Buch87,
+ author = "Buchberger, Bruno",
+ title = {{AApplications of Gr\"obner Bases in Non-Linear
+ Computational Geometry}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ paper = "52-80",
+ abstract =
+ "Groebner bases are certain finite sets of multivariate
+ polynomials. Many problems in polynomial ideal theory (algebra
+ geometry, non-linear computational geometry) can be solved by easy
+ algorithms after transforming the polynomial sets involved in the
+ specification of the problems into Groebner basis form. In this paper
+ we give gome examples of applying the Groebner bases method to
+ problems in non-linear computational geometry (inverse kinematics in
+ robot programming, collision detection for superellipsoids,
+ implicitization of parametric representations of curves and surfaces,
+ inversion problem for parametric representations, automated
+ geometrical theorem proving, primary decompsotion of implicitly
+ defined geometrical objects). The paper starts with a brief summary of
+ the Groebner bases method.",
+ paper = "Buch87.pdf"
+}
+
+\end{chunk}
+
+\index{Andrews, George}
+\begin{chunk}{axiom.bib}
+@article{Andr87,
+ author = "Andrews, George",
+ title = {{Applications of Scratchpad to Problems in Special
+ Functions and Combinatorics}},
+ journal = "Lecture Notes in Computer Science",
+ volume = "296",
+ year = "1987",
+ pages = "158-166",
+ abstract =
+ "Within the last few years, there have been numerous applications of
+ computer algebra to special functions. G. Gasper (Norwestern
+ University) has studied classical hypergeometric functions, and
+ W. Gosper (Symbolics Inc.) has developed a large variety of
+ spectacular transformation and summation techniques for MACSYMA. The
+ purpose of this note is to explore some of the interface between
+ computer algebra and special functions. In Section 2 we examine an
+ application of MACSYMA which inadequately relied, in my opinion, on
+ what was readily available in the literature on hypergeometric
+ series. In Section 3 we consider classical observations on sums of
+ powers of binomial coefficients. In Section 4 we consider a problem of
+ D.M. Jackson wherein SCRATCHPAD and classical hypergeometric series
+ interact nicely. We close with a problem inspired by work in
+ statistical mechanics which leads us to questions about algorithms
+ that would be useful in computer algebra applications.",
+ paper = "Andr87.pdf",
+ keywrods = "axiomref"
+}
+
+\end{chunk}
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index 38a0c2c..0e5d62b 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -5850,6 +5850,8 @@ books/bookheader.tex add tab characters in credits

books/bookvol10.3 fix typo

20171031.02.tpd.patch
books/bookvolbib respect case in paper titles

+20171031.03.tpd.patch
+books/bookvolbib add references

p
--
1.9.1