Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Quaternions are a number system that has become increasingly useful for representing the rotations of objects in three-dimensional space and has important applications in theoretical and applied mathematics, physics, computer science, and engineering. This is the first book to provide a systematic, accessible, and self-contained exposition of quaternion linear algebra. It features previously unpublished research results with complete proofs and many open problems at various levels, as well as more than 200 exercises to facilitate use by students and instructors. Applications presented in the book include numerical ranges, invariant semidefinite subspaces, differential equations with symmetries, and matrix equations. Designed for researchers and students across a variety of disciplines, the book can be read by anyone with a background in linear algebra, rudimentary complex analysis, and some multivariable calculus. Instructors will find it useful as a complementary text for undergraduate linear algebra courses or as a basis for a graduate course in linear algebra. The open problems can serve as research projects for undergraduates, topics for graduate students, or problems to be tackled by professional research mathematicians. The book is also an invaluable reference tool for researchers in fields where techniques based on quaternion analysis are used.

Algebras, Linear --- Quaternions --- Algebra, Universal --- Algebraic fields --- Curves --- Surfaces --- Numbers, Complex --- Vector analysis --- Linear algebra --- Generalized spaces --- Mathematical analysis --- Calculus of operations --- Line geometry --- Topology --- Cholesky factorization. --- Hamiltonian matrices. --- Jordan canonical form. --- Jordan form. --- Kronecker canonical form. --- Kronecker form. --- Kronecker forms. --- Schur triangularization theorem. --- Smith form. --- Sylvester equation. --- algebraic Riccati equations. --- antiautomorphisms. --- automorphisms. --- bilateral quadratic equations. --- boundedness. --- canonical forms. --- complex hermitian matrices. --- complex matric pencils. --- complex matrices. --- complex matrix polynomials. --- congruence. --- conjugation. --- conventions. --- determinants. --- diagonal form. --- diagonalizability. --- differential equations. --- dissipative matrices. --- eigenvalues. --- eigenvectors. --- equivalence. --- expansive matrices. --- hermitian inner product. --- hermitian matrices. --- hermitian matrix pencils. --- hermitian pencils. --- indefinite inner products. --- inertia theorems. --- invariant Langragian subspaces. --- invariant Langrangian subspaces. --- invariant neutral subspaces. --- invariant semidefinite subspaces. --- invariant subspaces. --- involutions. --- linear quadratic regulators. --- matrix algebra. --- matrix decompositions. --- matrix equations. --- matrix pencils. --- matrix polynomials. --- maximal invariant semidefinite subspaces. --- metric space. --- mixed matrix pencils. --- mixed pencils. --- mixed quaternion matrix pencils. --- neutral subspaces. --- nondegenerate. --- nonstandard involution. --- nonstandard involutions. --- nonuniqueness. --- notations. --- numerical cones. --- numerical ranges. --- pencils. --- polynomial matrix equations. --- quadratic maps. --- quaternion algebra. --- quaternion coefficients. --- quaternion linear algebra. --- quaternion matrices. --- quaternion matrix pencils. --- quaternion subspaces. --- quaternions. --- real linear transformations. --- real matrices. --- real matrix pencils. --- real matrix polynomials. --- real symmetric matrices. --- root subspaces. --- scalar quaternions. --- semidefinite subspaces. --- skew-Hamiltonian matrices. --- skewhermitian inner product. --- skewhermitian matrices. --- skewhermitian pencils. --- skewsymmetric matrices. --- square-size quaternion matrices. --- standard matrices. --- symmetric matrices. --- symmetries. --- symmetry properties. --- unitary matrices. --- vector spaces.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book offers a self-contained account of the 3-manifold invariants arising from the original Jones polynomial. These are the Witten-Reshetikhin-Turaev and the Turaev-Viro invariants. Starting from the Kauffman bracket model for the Jones polynomial and the diagrammatic Temperley-Lieb algebra, higher-order polynomial invariants of links are constructed and combined to form the 3-manifold invariants. The methods in this book are based on a recoupling theory for the Temperley-Lieb algebra. This recoupling theory is a q-deformation of the SU(2) spin networks of Roger Penrose. The recoupling theory is developed in a purely combinatorial and elementary manner. Calculations are based on a reformulation of the Kirillov-Reshetikhin shadow world, leading to expressions for all the invariants in terms of state summations on 2-cell complexes. Extensive tables of the invariants are included. Manifolds in these tables are recognized by surgery presentations and by means of 3-gems (graph encoded 3-manifolds) in an approach pioneered by Sostenes Lins. The appendices include information about gems, examples of distinct manifolds with the same invariants, and applications to the Turaev-Viro invariant and to the Crane-Yetter invariant of 4-manifolds.

Drie-menigvuldigheden (Topologie) --- Knopentheorie --- Knot theory --- Noeuds [Theorie des ] --- Three-manifolds (Topology) --- Trois-variétés (Topologie) --- Knot theory. --- Algebraic topology --- Invariants --- Mathematics --- Invariants (Mathematics) --- Invariants. --- 3-manifolds (Topology) --- Manifolds, Three dimensional (Topology) --- Three-dimensional manifolds (Topology) --- Low-dimensional topology --- Topological manifolds --- Knots (Topology) --- 3-manifold. --- Addition. --- Algorithm. --- Ambient isotopy. --- Axiom. --- Backslash. --- Barycentric subdivision. --- Bijection. --- Bipartite graph. --- Borromean rings. --- Boundary parallel. --- Bracket polynomial. --- Calculation. --- Canonical form. --- Cartesian product. --- Cobordism. --- Coefficient. --- Combination. --- Commutator. --- Complex conjugate. --- Computation. --- Connected component (graph theory). --- Connected sum. --- Cubic graph. --- Diagram (category theory). --- Dimension. --- Disjoint sets. --- Disjoint union. --- Elaboration. --- Embedding. --- Equation. --- Equivalence class. --- Explicit formula. --- Explicit formulae (L-function). --- Factorial. --- Fundamental group. --- Graph (discrete mathematics). --- Graph embedding. --- Handlebody. --- Homeomorphism. --- Homology (mathematics). --- Identity element. --- Intersection form (4-manifold). --- Inverse function. --- Jones polynomial. --- Kirby calculus. --- Line segment. --- Linear independence. --- Matching (graph theory). --- Mathematical physics. --- Mathematical proof. --- Mathematics. --- Maxima and minima. --- Monograph. --- Natural number. --- Network theory. --- Notation. --- Numerical analysis. --- Orientability. --- Orthogonality. --- Pairing. --- Pairwise. --- Parametrization. --- Parity (mathematics). --- Partition function (mathematics). --- Permutation. --- Poincaré conjecture. --- Polyhedron. --- Quantum group. --- Quantum invariant. --- Recoupling. --- Recursion. --- Reidemeister move. --- Result. --- Roger Penrose. --- Root of unity. --- Scientific notation. --- Sequence. --- Significant figures. --- Simultaneous equations. --- Smoothing. --- Special case. --- Sphere. --- Spin network. --- Summation. --- Symmetric group. --- Tetrahedron. --- The Geometry Center. --- Theorem. --- Theory. --- Three-dimensional space (mathematics). --- Time complexity. --- Tubular neighborhood. --- Two-dimensional space. --- Vector field. --- Vector space. --- Vertex (graph theory). --- Winding number. --- Writhe.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book develops arithmetic without the induction principle, working in theories that are interpretable in Raphael Robinson's theory Q. Certain inductive formulas, the bounded ones, are interpretable in Q. A mathematically strong, but logically very weak, predicative arithmetic is constructed.Originally published in 1986.The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

Constructive mathematics. --- Arithmetic. --- Mathematics --- Set theory --- Calculators --- Numbers, Real --- Mathematics, Constructive --- Logic, Symbolic and mathematical --- Addition. --- Adjunction (field theory). --- Age of the universe. --- Almost surely. --- Arithmetic IF. --- Atomic formula. --- Axiom. --- Axiomatic system. --- Beta function. --- Big O notation. --- Binary number. --- Binary relation. --- Brownian motion. --- Canonical form. --- Cardinality. --- Cartesian coordinate system. --- Chessboard. --- Classical mathematics. --- Closed-form expression. --- Commutative property. --- Computation. --- Conservative extension. --- Consistency. --- Contradiction. --- Deduction theorem. --- Diameter. --- Direct proof. --- Domain of discourse. --- Elementary mathematics. --- Elias M. Stein. --- Existential quantification. --- Exponential function. --- Exponentiation. --- Extension by definitions. --- Finitary. --- Finite set. --- Formula C (SCCA). --- Foundations of mathematics. --- Fundamenta Mathematicae. --- Gödel's completeness theorem. --- Herbrand's theorem. --- Impredicativity. --- Inaccessible cardinal. --- Inference. --- Interpretability. --- John Milnor. --- Logic. --- Logical connective. --- Mathematical induction. --- Mathematical logic. --- Mathematician. --- Mathematics. --- Measurable cardinal. --- Metamathematics. --- Metatheorem. --- Model theory. --- Mostowski. --- Natural number. --- Negation. --- Non-standard analysis. --- Notation. --- P-adic analysis. --- Peano axioms. --- Polynomial. --- Positional notation. --- Power of two. --- Power set. --- Primitive notion. --- Primitive recursive function. --- Principia Mathematica. --- Probability theory. --- Quantifier (logic). --- Quantity. --- Ranking (information retrieval). --- Rational number. --- Real number. --- Recursion (computer science). --- Remainder. --- Requirement. --- Robert Langlands. --- Rule of inference. --- Scientific notation. --- Sequence. --- Set theory. --- Subset. --- Theorem. --- Theory. --- Transfer principle. --- Transfinite number. --- Triviality (mathematics). --- Tuple. --- Uniqueness. --- Universal quantification. --- Variable (mathematics). --- Zermelo–Fraenkel set theory.