You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.

Following the success of Logic for Mathematicians, Dr Hamilton has written a text for mathematicians and students of mathematics that contains a description and discussion of the fundamental conceptual and formal apparatus upon which modern pure mathematics relies. The author's intention is to remove some of the mystery that surrounds the foundations of mathematics. He emphasises the intuitive basis of mathematics; the basic notions are numbers and sets and they are considered both informally and formally. The role of axiom systems is part of the discussion but their limitations are pointed out. Formal set theory has its place in the book but Dr Hamilton recognises that this is a part of mathematics and not the basis on which it rests. Throughout, the abstract ideas are liberally illustrated by examples so this account should be well-suited, both specifically as a course text and, more broadly, as background reading. The reader is presumed to have some mathematical experience but no knowledge of mathematical logic is required.

Emphasis is placed on applications in preference to more theoretical aspects throughout this readable introduction to linear algebra for specialists as well as non-specialists. An expanded version of A First Course in Linear Algebra.

This is a short, readable introduction to basic linear algebra, as usually encountered in a first course. The development of the subject is integrated with a large number of worked examples that illustrate the ideas and methods. The format of the book, with text and relevant examples on facing pages means that the reader can follow the text uninterrupted. The student should be able to work through the book and learn from it sequentially. Stress is placed on applications of the methods rather than on developing a logical system of theorems. Numerous exercises are provided.

This is an introductory textbook which is designed to be useful not only to intending logicians but also to mathematicians in general.

In the middle decades of the nineteenth century Jeremiah G. Hamilton was a well-known figure on Wall Street. Cornelius Vanderbilt, America's first tycoon, came to respect, grudgingly, his one-time opponent. The day after Vanderbilt's death on January 4, 1877, an almost full-page obituary on the front of the National Republican acknowledged that, in the context of his Wall Street share transactions, "There was only one man who ever fought the Commodore to the end, and that was Jeremiah Hamilton." What Vanderbilt's obituary failed to mention, perhaps as contemporaries already knew it well, was that Hamilton was African American. Hamilton, although his origins were lowly, possibly slave, was re...

In this paper the authors prove the following results (via a unified approach) for all sufficiently large n: (i) [1-factorization conjecture] Suppose that n is even and D≥2⌈n/4⌉−1. Then every D-regular graph G on n vertices has a decomposition into perfect matchings. Equivalently, χ′(G)=D. (ii) [Hamilton decomposition conjecture] Suppose that D≥⌊n/2⌋. Then every D-regular graph G on n vertices has a decomposition into Hamilton cycles and at most one perfect matching. (iii) [Optimal packings of Hamilton cycles] Suppose that G is a graph on n vertices with minimum degree δ≥n/2. Then G contains at least regeven(n,δ)/2≥(n−2)/8 edge-disjoint Hamilton cycles. Here regeven(n,δ) denotes the degree of the largest even-regular spanning subgraph one can guarantee in a graph on n vertices with minimum degree δ. (i) was first explicitly stated by Chetwynd and Hilton. (ii) and the special case δ=⌈n/2⌉ of (iii) answer questions of Nash-Williams from 1970. All of the above bounds are best possible.

A comprehensive overview of nonlinear H∞ control theory for both continuous-time and discrete-time systems, Nonlinear H∞-Control, Hamiltonian Systems and Hamilton-Jacobi Equations covers topics as diverse as singular nonlinear H∞-control, nonlinear H∞ -filtering, mixed H2/ H∞-nonlinear control and filtering, nonlinear H∞-almost-disturbance-decoupling, and algorithms for solving the ubiquitous Hamilton-Jacobi-Isaacs equations. The link between the subject and analytical mechanics as well as the theory of partial differential equations is also elegantly summarized in a single chapter. Recent progress in developing computational schemes for solving the Hamilton-Jacobi equation (HJE)...