- Fully searchable CD that puts information at your
fingertips included with text
- Most up to date listing of integrals, series and
products
- Provides accuracy and efficiency in work
Description
The Table of Integrals, Series, and Products is the essential
reference for integrals in the English language. Mathematicians,
scientists, and engineers, rely on it when identifying and
subsequently solving extremely complex problems. Since
publication of the first English-language edition in 1965, it has
been thoroughly revised and enlarged on a regular basis, with
substantial additions and, where necessary, existing entries
corrected or revised. The seventh edition includes a fully
searchable CD-Rom.
Contents
0 Introduction; 1 Elementary Functions; 2 Indefinite Integrals of
Elementary Functions; 3 Definite Integrals of Elementary
Functions; 4.Combinations involving trigonometric and hyperbolic
functions and power; 5 Indefinite Integrals of Special Functions;
6 Definite Integrals of Special Functions; 7.Associated Legendre
Functions; 8 Special Functions; 9 Hypergeometric Functions; 10
Vector Field Theory; 11 Algebraic Inequalities; 12 Integral
Inequalities; 13 Matrices and related results; 14 Determinants;
15 Norms; 16 Ordinary differential equations; 17 Fourier,
Laplace, and Mellin Transforms; 18 The z-transform
ISBN: 978-0-12-373637-6
ISBN10: 0-12-373637-4 Book/Hardback
Measurements: 7 1/2 X 9 1/4 in
Pages: 1200
Publication Date: 16 February 2007
Series: Frontiers in Mathematics
2007, Approx. 300 p., Softcover
ISBN: 978-3-7643-7795-3
Due: May 2007
About this book
The theory of functional identities is a relatively new one - the
first papers were published at the beginning of the 1990s, and
this is the first book on this subject. A functional identity can
be informally described as an identical relation involving
arbitrary elements in an associative ring together with arbitrary
(unknown) functions. The goal of the general theory is to
describe these functions, or, when this is not possible, to
describe the structure of the ring admitting the functional
identity in question. This abstract theory has turned out to be a
powerful tool for solving a variety of problems in ring theory,
Lie algebras, Jordan algebras, linear algebra, and operator
theory.
Table of contents
Prerequisites.- Part I. An Introductory Course - What is a
functional identity?- Strong degree and FI-degree.- Part II. The
General Theory- Constructing d-free sets-FIs on d-free sets- FIs
in (semi-) prime rings.- Part III. Applications - Lie maps and
related topics.- Appendices.- Bibliography.
Hardback (ISBN-13: 9780521848992)
The book is intended for lectures on string processes and pattern
matching in Master's courses of computer science and software
engineering curricula. The details of algorithms are given with
correctness proofs and complexity analysis, which make them ready
to implement. Algorithms are described in a C-like language. The
book is also a reference for students in computational
linguistics or computational biology. It presents examples of
questions related to the automatic processing of natural
language, to the analysis of molecular sequences, and to the
management of textual databases.
* Few books on the topic, some of which are research monographs
or conference proceedings, not suitable for teaching
* Well adapted to Masters courses on algorithms or text
processing
* Many concepts and examples explained in 135 figures
Contents
1. Tools; 2. Pattern matching automata; 3. String searching with
a sliding window; 4. Suffix arrays; 5. Structures for indexes; 6.
Indexes; 7. Alignments; 8. Approximate patterns; 9. Local periods.
Hardback (ISBN-13: 9780521857574)
Folding and unfolding problems have been implicit since Albrecht
Durer in the early 1500s, but have only recently been studied in
the mathematical literature. Over the past decade, there has been
a surge of interest in these problems, with applications ranging
from robotics to protein folding. With an emphasis on algorithmic
or computational aspects, this comprehensive treatment of the
geometry of folding and unfolding presents hundreds of results
and over 60 unsolved 'open problems' to spur further research.
The authors cover one-dimensional objects (linkages), 2D objects
(paper), and 3D objects (polyhedra). Aimed primarily at advanced
undergraduate and graduate students in mathematics or computer
science, this lavishly illustrated book will fascinate a broad
audience, from high school students to researchers.
* Fascinating, tangible, accessible cutting-edge research with
applications throughout science and engineering
* Full color throughout ? Erik Demaine won a MacArthur fellowship
in 2003 for his work on the mathematics of origami
Contents
Introduction; Part I. Linkages: 1. Problem classification and
examples; 2. Upper and lower bounds; 3. Planar linkage
mechanisms; 4. Rigid frameworks; 5. Reconfiguration of chains; 6.
Locked chains; 7. Interlocked chains; 8. Joint-constrained
motion; 9. Protein folding; Part II. Paper: 10. Introduction; 11.
One-dimensional paper; 12. Two-dimensional paper and continuous
foldability; 13. Single-vertex foldability; 14. Multi-vertex flat
foldability; 15. 2D Map folding; 16. Silhouettes and gift
wrapping; 17. Tree method; 18. One complete straight cut; 19.
Flattening polyhedra; 20. Geometric constructibility; 21. Curved
and curved-fold origami; Part III. Polyhedra: 22. Introduction
and overview; 23. Edge unfolding of polyhedra; 24. Reconstruction
of polyhedra; 25. Shortest paths and geodesics; 26. Folding
polygons to polyhedra; 27. Higher dimensions.
Original French edition published by Editions, Berlin, 2004
2007, Approx. 250 p., Hardcover
ISBN: 978-3-540-36349-1
About this book
A.N. Kolmogorov (Tambov 1903, Moscow 1987) was one of the most
brilliant mathematicians that the world has ever known.
Incredibly deep and creative, he was able to approach each
subject with a completely new point of view: in a few magnificent
pages, which are models of shrewdness and imagination, and which
astounded his contemporaries, he changed drastically the
landscape of the subject.
Most mathematicians prove what they can, Kolmogorov was of those
who prove what they want. In this book several world experts
present (one part of) the mathematical heritage left to us by
Kolmogorov.
Each chapter treats one of Kolmogorov's research themes, or a
subject that was invented as a consequence of his discoveries.
The authors present here his contributions, his methods, the
perspectives he opened to us, the way in which this research has
evolved up to now, along with examples of recent applications and
a presentation of the modern prospects.
This book can be read by anyone with a master's (or even a
bachelor's) degree in mathematics, computer science or physics,
or more generally by anyone who likes mathematical ideas. Rather
than presenting detailed proofs, the main ideas are described,
and a bibliography for those who wish to understand the technical
details. One can see that sometimes very simple reasoning (with
the right interpretation and tools) can lead in a few lines to
very substantial results.
Table of contents
Introduction: Eric Charpentier, Annick Lesne, Nikolai Nikolski .-
The youth of Andrei Nikolaevich and Fourier series: Jean-Pierre
Kahane .- Kolmogorov's contribution to intuitionistic logic:
Thierry Coquand.- Some aspects of the probabilistic work: Loic
Chaumont, Laurent Mazliak, Marc Yor.- Infinite dimensional
Kolmogorov equations: Giuseppe Da Prato.- From Kolmogorov's
theorem on empirical distribution to number theory: Kevin Ford.-
Kolmogorov's -entropy and the problem of statistical estimation:
Mikhail Nikouline, Valentin Solev.- Kolmogorov and topology:
Victor M. Buchstaber .- Geometry and approximation theory in A. N.
Kolmogorov's works: Vladimir M. Tikhomirov.- Kolmogorov and
population dynamics: Karl Sigmund.- Resonances and small divisors:
Etienne Ghys.- The KAM Theorem: John H. Hubbard .-From
Kolmogorov's Work on Entropy of Dynamical Systems to Non-uniformly
Hyperbolic Dynamics: Denis V. Kosygin, Yakov G. Sinai.- From
Hilbert's 13th Problem to the theory of neural networks:
constructive aspects of Kolmogorov's Superposition Theorem: Vasco
Brattka .- Kolmogorov Complexity: Bruno Durand, Alexander Zvonkin.-
Algorithmic Chaos and the Incompressibility Method: Paul Vitanyi.