From 112a651c7ad790fb813db686003bdc53c226d805 Mon Sep 17 00:00:00 2001
From: Tim Daly
Date: Sun, 26 Jun 2016 18:04:44 -0400
Subject: [PATCH] books/bookvolbib Axiom Citations in the Literature
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Goal: Axiom Literate Programming
\index{Tournier, Evelyne}
\begin{chunk}{axiom.bib}
@misc{Tour95,
author = "Tournier, Evelyne",
title = "Summary of organisation, history and possible future",
paper = "Tour95.pdf",
year = "1995",
url =
"ftp://ftp.inf.ethz.ch/org/cathode/workshops/jan95/abstracts/tournier.ps",
keywords = "axiomref"
}
\end{chunk}
\index{Watt, Stephen M.}
\begin{chunk}{axiom.bib}
@misc{Watt95a,
author = "Watt, Stephen M.",
title = "The A\# Programming Language and Compiler",
paper = "Watt95a.pdf",
year = "1995",
url = "ftp://ftp.inf.ethz.ch/org/cathode/workshops/march93/Watt.tex",
keywords = "axiomref"
}
\end{chunk}
\index{Lecerf, Gr{\'e}goire}
\begin{chunk}{axiom.bib}
@article{Lece02,
author = "Lecerf, Gregoire",
title = "Quadratic Newton iteration for systems with multiplicity",
journal = "Found. Comput. Math.",
volume = "2",
number = "3",
pages = "247-293",
year = "2002",
keywords = "axiomref",
paper = "Lece02.pdf",
abstract =
"The author proposes an efficient iterator with quadratic convergence
that generalizes Newton iterator for multiple roots. It is based on an
$m$-adic topology where the ideal $m$ can be chosen generic
enough. Compared to the Newton iterator the proposed iterator
introduces a small overhead that grows with the square of the
multiplicity of the root."
}
\end{chunk}
\index{Lecerf, Gr{\'e}goire}
\begin{chunk}{axiom.bib}
@article{Lece96,
author = "Lecerf, Gregoire",
title = "Dynamic Evaluation and Real Closure Implementation in Axiom",
year = "1996",
url = "http://lecerf.perso.math.cnrs.fr/software/drc/drc.ps",
paper = "Lece96.pdf",
keywords = "axiomref"
}
\end{chunk}
\index{Lomonaco, Samual J.}
\index{Kauffman, Louis H.}
\begin{chunk}{axiom.bib}
@InProceedings{Lomo02,
author = "Lomonaco, Samual J. and Kauffman, Louis H.",
title = "Quantum hidden subgroup algorithms: a mathematical perspective",
booktitle = "Quantum computation and information",
series = "AMS special session",
year = "2002",
isbn = "0-8218-2140-7",
location = "Washington",
pages = "139-202",
keywords = "axiomref",
paper = "Lomo02.pdf",
url = "https://arxiv.org/pdf/quant-ph/0201095v3.pdf",
abstract =
"The ultimate objective of this paper is to create a stepping stone to
the development of new quantum algorithms. The strategy chosen is to
begin by focusing on the class of abelian quantum hidden subgroup
algorithms, i.e., the class of abelian algorithms of the Shor/Simon
genre. Our strategy is to make this class of algorithms as
mathematically transparent as possible. By the phrase ``mathematically
transparent'' we mean to expose, to bring to the surface, and to make
explicit the concealed mathematical structures that are inherently and
fundamentally a part of such algorithms. In so doing, we create
symbolic abelian quantum hidden subgroup algorithms that are analogous
to the those symbolic algorithms found within such software packages
as Axiom, Cayley, Maple, Mathematica, and Magma.
As a spin-off of this effort, we create three different
generalizations of Shor’s quantum factoring algorithm to free abelian
groups of finite rank. We refer to these algorithms as wandering (or
vintage $\mathbb{Z}_Q$) Shor algorithms. They are essentially quantum
algorithms on free abelian groups of finite rank $n$ which, with each
iteration, first select a random cyclic direct summand $\mathbb{Z}$ of
the group and then apply one iteration of the standard Shor algorithm
to produce a random character of the “approximating” finite group
$\widetilde{A} = \mathbb{Z}_Q$, called the group probe. These
characters are then in turn used to find either the order $P$ of a
maximal cyclic subgroup $\mathbb{Z}_P$ of the hidden quotient group
$H_{\varphi}$, or the entire hidden quotient group $H_{\varphi}$. An
integral part of these wandering quantum algorithms is the selection
of a very special random transversal $t_{\mu}:\widetilde{A}\rightarrow A$,
which we refer to as a Shor transversal. The algorithmic time
complexity of the first of these wandering Shor algorithms is found to
be $O(n^2({rm lg\ } Q)^3 ({\rm lg\ }{\rm lg\ } Q)^{n+1})$."
}
\end{chunk}
---
books/bookvolbib.pamphlet | 112 ++++++++++++++++++++++++++++++++++--
changelog | 2 +
patch | 124 +++++++++++++++++++++++++++++++++------
src/axiom-website/patches.html | 2 +
4 files changed, 216 insertions(+), 24 deletions(-)
diff --git a/books/bookvolbib.pamphlet b/books/bookvolbib.pamphlet
index 88fc160..77d5e71 100644
--- a/books/bookvolbib.pamphlet
+++ b/books/bookvolbib.pamphlet
@@ -14312,6 +14312,29 @@ In Anonymous [Ano91], pp287-299 (vol. 1) 2 vols.
\index{Lecerf, Gr{\'e}goire}
\begin{chunk}{axiom.bib}
+@article{Lece02,
+ author = "Lecerf, Gregoire",
+ title = "Quadratic Newton iteration for systems with multiplicity",
+ journal = "Found. Comput. Math.",
+ volume = "2",
+ number = "3",
+ pages = "247-293",
+ year = "2002",
+ keywords = "axiomref",
+ paper = "Lece02.pdf",
+ abstract =
+ "The author proposes an efficient iterator with quadratic convergence
+ that generalizes Newton iterator for multiple roots. It is based on an
+ $m$-adic topology where the ideal $m$ can be chosen generic
+ enough. Compared to the Newton iterator the proposed iterator
+ introduces a small overhead that grows with the square of the
+ multiplicity of the root."
+}
+
+\end{chunk}
+
+\index{Lecerf, Gr{\'e}goire}
+\begin{chunk}{axiom.bib}
@InProceedings{{Lece10,
author = "Lecerf, Gregoire",
title = "Mathemagix: toward large scale programming for symbolic and
@@ -14341,13 +14364,15 @@ In Anonymous [Ano91], pp287-299 (vol. 1) 2 vols.
\end{chunk}
\index{Lecerf, Gr{\'e}goire}
-\begin{chunk}{ignore}
-\bibitem[Lecerf 96]{Le96} Lecerf, Gr\'egoire
+\begin{chunk}{axiom.bib}
+@article{Lece96,
+ author = "Lecerf, Gregoire",
title = "Dynamic Evaluation and Real Closure Implementation in Axiom",
-June 29, 1996
+ year = "1996",
url = "http://lecerf.perso.math.cnrs.fr/software/drc/drc.ps",
- paper = "Le96.ps",
- keywords = "axiomref",
+ paper = "Lece96.pdf",
+ keywords = "axiomref"
+}
\end{chunk}
@@ -14642,6 +14667,56 @@ June 2, 1997
\end{chunk}
+\index{Lomonaco, Samual J.}
+\index{Kauffman, Louis H.}
+\begin{chunk}{axiom.bib}
+@InProceedings{Lomo02,
+ author = "Lomonaco, Samual J. and Kauffman, Louis H.",
+ title = "Quantum hidden subgroup algorithms: a mathematical perspective",
+ booktitle = "Quantum computation and information",
+ series = "AMS special session",
+ year = "2002",
+ isbn = "0-8218-2140-7",
+ location = "Washington",
+ pages = "139-202",
+ keywords = "axiomref",
+ paper = "Lomo02.pdf",
+ url = "https://arxiv.org/pdf/quant-ph/0201095v3.pdf",
+ abstract =
+ "The ultimate objective of this paper is to create a stepping stone to
+ the development of new quantum algorithms. The strategy chosen is to
+ begin by focusing on the class of abelian quantum hidden subgroup
+ algorithms, i.e., the class of abelian algorithms of the Shor/Simon
+ genre. Our strategy is to make this class of algorithms as
+ mathematically transparent as possible. By the phrase ``mathematically
+ transparent'' we mean to expose, to bring to the surface, and to make
+ explicit the concealed mathematical structures that are inherently and
+ fundamentally a part of such algorithms. In so doing, we create
+ symbolic abelian quantum hidden subgroup algorithms that are analogous
+ to the those symbolic algorithms found within such software packages
+ as Axiom, Cayley, Maple, Mathematica, and Magma.
+
+ As a spin-off of this effort, we create three different
+ generalizations of Shor’s quantum factoring algorithm to free abelian
+ groups of finite rank. We refer to these algorithms as wandering (or
+ vintage $\mathbb{Z}_Q$) Shor algorithms. They are essentially quantum
+ algorithms on free abelian groups of finite rank $n$ which, with each
+ iteration, first select a random cyclic direct summand $\mathbb{Z}$ of
+ the group and then apply one iteration of the standard Shor algorithm
+ to produce a random character of the “approximating” finite group
+ $\widetilde{A} = \mathbb{Z}_Q$, called the group probe. These
+ characters are then in turn used to find either the order $P$ of a
+ maximal cyclic subgroup $\mathbb{Z}_P$ of the hidden quotient group
+ $H_{\varphi}$, or the entire hidden quotient group $H_{\varphi}$. An
+ integral part of these wandering quantum algorithms is the selection
+ of a very special random transversal $t_{\mu}:\widetilde{A}\rightarrow A$,
+ which we refer to as a Shor transversal. The algorithmic time
+ complexity of the first of these wandering Shor algorithms is found to
+ be $O(n^2({rm lg\ } Q)^3 ({\rm lg\ }{\rm lg\ } Q)^{n+1})$."
+}
+
+\end{chunk}
+
\index{Lucks, Michael}
\begin{chunk}{ignore}
\bibitem[Lucks 86]{Luc86} Lucks, Michael
@@ -16012,6 +16087,20 @@ Universit\'e de Limoges 1998
\end{chunk}
+\index{Tournier, Evelyne}
+\begin{chunk}{axiom.bib}
+@misc{Tour95,
+ author = "Tournier, Evelyne",
+ title = "Summary of organisation, history and possible future",
+ paper = "Tour95.pdf",
+ year = "1995",
+ url =
+ "ftp://ftp.inf.ethz.ch/org/cathode/workshops/jan95/abstracts/tournier.ps",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
\subsection{V} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\index{van der Hoeven, Joris}
@@ -16286,6 +16375,19 @@ The Numerical Algorithms Group (NAG) Ltd, 1994
\end{chunk}
\index{Watt, Stephen M.}
+\begin{chunk}{axiom.bib}
+@misc{Watt95a,
+ author = "Watt, Stephen M.",
+ title = "The A\# Programming Language and Compiler",
+ paper = "Watt95a.pdf",
+ year = "1995",
+ url = "ftp://ftp.inf.ethz.ch/org/cathode/workshops/march93/Watt.tex",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
+\index{Watt, Stephen M.}
\index{Broadbery, Peter A.}
\index{Iglio, Pietro}
\index{Morrison, Scott C.}
diff --git a/changelog b/changelog
index 2b450de..7fc64d4 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20160626 tpd src/axiom-website/patches.html 20160626.09.tpd.patch
+20160626 tpd books/bookvolbib Axiom Citations in the Literature
20160626 tpd src/axiom-website/patches.html 20160626.08.tpd.patch
20160626 tpd books/bookvolbib add Mulders citation
20160626 tpd books/bookvol10.2 add Mulders to ORE and LODO refs
diff --git a/patch b/patch
index 8e0cc55..194ca90 100644
--- a/patch
+++ b/patch
@@ -1,30 +1,116 @@
-books/bookvol* add Mulders to ORE and LODO refs
+books/bookvolbib Axiom Citations in the Literature
Goal: Axiom Literate Programming
-\index{Mulders, Thom}
+\index{Tournier, Evelyne}
\begin{chunk}{axiom.bib}
-@misc{Muld95,
- author = "Mulders, Thom",
- title = "Primitives: Orepoly and Lodo",
- paper = "Muld95.pdf",
+@misc{Tour95,
+ author = "Tournier, Evelyne",
+ title = "Summary of organisation, history and possible future",
+ paper = "Tour95.pdf",
year = "1995",
url =
- "ftp://ftp.inf.ethz.ch/org/cathode/workshops/jan95/abstracts/mulders.ps",
+ "ftp://ftp.inf.ethz.ch/org/cathode/workshops/jan95/abstracts/tournier.ps",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
+\index{Watt, Stephen M.}
+\begin{chunk}{axiom.bib}
+@misc{Watt95a,
+ author = "Watt, Stephen M.",
+ title = "The A\# Programming Language and Compiler",
+ paper = "Watt95a.pdf",
+ year = "1995",
+ url = "ftp://ftp.inf.ethz.ch/org/cathode/workshops/march93/Watt.tex",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
+\index{Lecerf, Gr{\'e}goire}
+\begin{chunk}{axiom.bib}
+@article{Lece02,
+ author = "Lecerf, Gregoire",
+ title = "Quadratic Newton iteration for systems with multiplicity",
+ journal = "Found. Comput. Math.",
+ volume = "2",
+ number = "3",
+ pages = "247-293",
+ year = "2002",
+ keywords = "axiomref",
+ paper = "Lece02.pdf",
+ abstract =
+ "The author proposes an efficient iterator with quadratic convergence
+ that generalizes Newton iterator for multiple roots. It is based on an
+ $m$-adic topology where the ideal $m$ can be chosen generic
+ enough. Compared to the Newton iterator the proposed iterator
+ introduces a small overhead that grows with the square of the
+ multiplicity of the root."
+}
+
+\end{chunk}
+
+\index{Lecerf, Gr{\'e}goire}
+\begin{chunk}{axiom.bib}
+@article{Lece96,
+ author = "Lecerf, Gregoire",
+ title = "Dynamic Evaluation and Real Closure Implementation in Axiom",
+ year = "1996",
+ url = "http://lecerf.perso.math.cnrs.fr/software/drc/drc.ps",
+ paper = "Lece96.pdf",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
+\index{Lomonaco, Samual J.}
+\index{Kauffman, Louis H.}
+\begin{chunk}{axiom.bib}
+@InProceedings{Lomo02,
+ author = "Lomonaco, Samual J. and Kauffman, Louis H.",
+ title = "Quantum hidden subgroup algorithms: a mathematical perspective",
+ booktitle = "Quantum computation and information",
+ series = "AMS special session",
+ year = "2002",
+ isbn = "0-8218-2140-7",
+ location = "Washington",
+ pages = "139-202",
keywords = "axiomref",
- comment = "\newline\refto{category OREPCAT UnivariateSkewPolynomialCategory}
- \newline\refto{category LODOCAT LinearOrdinaryDifferentialOperatorCategory}
- \newline\refto{domain AUTOMOR Automorphism}
- \newline\refto{domain ORESUP SparseUnivariateSkewPolynomial}
- \newline\refto{domain OREUP UnivariateSkewPolynomial}
- \newline\refto{domain LODO LinearOrdinaryDifferentialOperator}
- \newline\refto{domain LODO1 LinearOrdinaryDifferentialOperator1}
- \newline\refto{domain LODO2 LinearOrdinaryDifferentialOperator2}
- \newline\refto{package APPLYORE ApplyUnivariateSkewPolynomial}
- \newline\refto{package OREPCTO UnivariateSkewPolynomialCategoryOps}
- \newline\refto{package LODOF LinearOrdinaryDifferentialOperatorFactorizer}
- \newline\refto{package LODOOPS LinearOrdinaryDifferentialOperatorsOps}"
+ paper = "Lomo02.pdf",
+ url = "https://arxiv.org/pdf/quant-ph/0201095v3.pdf",
+ abstract =
+ "The ultimate objective of this paper is to create a stepping stone to
+ the development of new quantum algorithms. The strategy chosen is to
+ begin by focusing on the class of abelian quantum hidden subgroup
+ algorithms, i.e., the class of abelian algorithms of the Shor/Simon
+ genre. Our strategy is to make this class of algorithms as
+ mathematically transparent as possible. By the phrase ``mathematically
+ transparent'' we mean to expose, to bring to the surface, and to make
+ explicit the concealed mathematical structures that are inherently and
+ fundamentally a part of such algorithms. In so doing, we create
+ symbolic abelian quantum hidden subgroup algorithms that are analogous
+ to the those symbolic algorithms found within such software packages
+ as Axiom, Cayley, Maple, Mathematica, and Magma.
+ As a spin-off of this effort, we create three different
+ generalizations of Shor’s quantum factoring algorithm to free abelian
+ groups of finite rank. We refer to these algorithms as wandering (or
+ vintage $\mathbb{Z}_Q$) Shor algorithms. They are essentially quantum
+ algorithms on free abelian groups of finite rank $n$ which, with each
+ iteration, first select a random cyclic direct summand $\mathbb{Z}$ of
+ the group and then apply one iteration of the standard Shor algorithm
+ to produce a random character of the “approximating” finite group
+ $\widetilde{A} = \mathbb{Z}_Q$, called the group probe. These
+ characters are then in turn used to find either the order $P$ of a
+ maximal cyclic subgroup $\mathbb{Z}_P$ of the hidden quotient group
+ $H_{\varphi}$, or the entire hidden quotient group $H_{\varphi}$. An
+ integral part of these wandering quantum algorithms is the selection
+ of a very special random transversal $t_{\mu}:\widetilde{A}\rightarrow A$,
+ which we refer to as a Shor transversal. The algorithmic time
+ complexity of the first of these wandering Shor algorithms is found to
+ be $O(n^2({rm lg\ } Q)^3 ({\rm lg\ }{\rm lg\ } Q)^{n+1})$."
}
\end{chunk}
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index 01441f1..af9c646 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -5408,6 +5408,8 @@ books/bookvol* add Abramov and Bronstein reference to LODO and ORE

books/bookvolbib Axiom Citations in the Literature

20160626.08.tpd.patch
books/bookvol* add Mulders to ORE and LODO refs

+20160626.09.tpd.patch
+books/bookvolbib Axiom Citations in the Literature

--
1.7.5.4