Choose an application

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

This book gives a new foundation for the theory of links in 3-space modeled on the modern developmentby Jaco, Shalen, Johannson, Thurston et al. of the theory of 3-manifolds. The basic construction is a method of obtaining any link by "splicing" links of the simplest kinds, namely those whose exteriors are Seifert fibered or hyperbolic. This approach to link theory is particularly attractive since most invariants of links are additive under splicing.Specially distinguished from this viewpoint is the class of links, none of whose splice components is hyperbolic. It includes all links constructed by cabling and connected sums, in particular all links of singularities of complex plane curves. One of the main contributions of this monograph is the calculation of invariants of these classes of links, such as the Alexander polynomials, monodromy, and Seifert forms.

Algebraic geometry --- Differential geometry. Global analysis --- Link theory. --- Curves, Plane. --- SINGULARITIES (Mathematics) --- Curves, Plane --- Invariants --- Link theory --- Singularities (Mathematics) --- Geometry, Algebraic --- Low-dimensional topology --- Piecewise linear topology --- Higher plane curves --- Plane curves --- Invariants. --- 3-sphere. --- Alexander Grothendieck. --- Alexander polynomial. --- Algebraic curve. --- Algebraic equation. --- Algebraic geometry. --- Algebraic surface. --- Algorithm. --- Ambient space. --- Analytic function. --- Approximation. --- Big O notation. --- Call graph. --- Cartesian coordinate system. --- Characteristic polynomial. --- Closed-form expression. --- Cohomology. --- Computation. --- Conjecture. --- Connected sum. --- Contradiction. --- Coprime integers. --- Corollary. --- Curve. --- Cyclic group. --- Determinant. --- Diagram (category theory). --- Diffeomorphism. --- Dimension. --- Disjoint union. --- Eigenvalues and eigenvectors. --- Equation. --- Equivalence class. --- Euler number. --- Existential quantification. --- Exterior (topology). --- Fiber bundle. --- Fibration. --- Foliation. --- Fundamental group. --- Geometry. --- Graph (discrete mathematics). --- Ground field. --- Homeomorphism. --- Homology sphere. --- Identity matrix. --- Integer matrix. --- Intersection form (4-manifold). --- Isolated point. --- Isolated singularity. --- Jordan normal form. --- Knot theory. --- Mathematical induction. --- Monodromy matrix. --- Monodromy. --- N-sphere. --- Natural transformation. --- Newton polygon. --- Newton's method. --- Normal (geometry). --- Notation. --- Pairwise. --- Parametrization. --- Plane curve. --- Polynomial. --- Power series. --- Projective plane. --- Puiseux series. --- Quantity. --- Rational function. --- Resolution of singularities. --- Riemann sphere. --- Riemann surface. --- Root of unity. --- Scientific notation. --- Seifert surface. --- Set (mathematics). --- Sign (mathematics). --- Solid torus. --- Special case. --- Stereographic projection. --- Submanifold. --- Summation. --- Theorem. --- Three-dimensional space (mathematics). --- Topology. --- Torus knot. --- Torus. --- Tubular neighborhood. --- Unit circle. --- Unit vector. --- Unknot. --- Variable (mathematics).

Choose an application

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

This accessible book provides an introduction to the analysis and design of dynamic multiagent networks. Such networks are of great interest in a wide range of areas in science and engineering, including: mobile sensor networks, distributed robotics such as formation flying and swarming, quantum networks, networked economics, biological synchronization, and social networks. Focusing on graph theoretic methods for the analysis and synthesis of dynamic multiagent networks, the book presents a powerful new formalism and set of tools for networked systems. The book's three sections look at foundations, multiagent networks, and networks as systems. The authors give an overview of important ideas from graph theory, followed by a detailed account of the agreement protocol and its various extensions, including the behavior of the protocol over undirected, directed, switching, and random networks. They cover topics such as formation control, coverage, distributed estimation, social networks, and games over networks. And they explore intriguing aspects of viewing networks as systems, by making these networks amenable to control-theoretic analysis and automatic synthesis, by monitoring their dynamic evolution, and by examining higher-order interaction models in terms of simplicial complexes and their applications. The book will interest graduate students working in systems and control, as well as in computer science and robotics. It will be a standard reference for researchers seeking a self-contained account of system-theoretic aspects of multiagent networks and their wide-ranging applications. This book has been adopted as a textbook at the following universities: ? University of Stuttgart, Germany Royal Institute of Technology, Sweden Johannes Kepler University, Austria Georgia Tech, USA University of Washington, USA Ohio University, USA

Network analysis (Planning) --- Multiagent systems --- Agent-based model (Computer software) --- MASs (Multiagent systems) --- Multi-agent systems --- Systems, Multiagent --- Intelligent agents (Computer software) --- Project networks --- Planning --- System analysis --- Graphic methods. --- Mathematical models. --- Mathematical models --- Graphic methods --- Addition. --- Adjacency matrix. --- Algebraic graph theory. --- Algorithm. --- Automorphism. --- Bipartite graph. --- Cardinality. --- Cartesian product. --- Circulant graph. --- Combinatorics. --- Complete graph. --- Computation. --- Connectivity (graph theory). --- Controllability. --- Convex combination. --- Corollary. --- Cycle graph (algebra). --- Cycle space. --- Degree (graph theory). --- Degree matrix. --- Diagonal matrix. --- Diameter. --- Differentiable function. --- Dimension. --- Directed graph. --- Division by zero. --- Dynamical system. --- Eigenvalues and eigenvectors. --- Equilibrium point. --- Estimation. --- Estimator. --- Existential quantification. --- Extremal graph theory. --- Graph (discrete mathematics). --- Graph theory. --- Identity matrix. --- Incidence matrix. --- Information exchange. --- Initial condition. --- Interconnection. --- Iteration. --- Kalman filter. --- Kronecker product. --- LTI system theory. --- LaSalle's invariance principle. --- Laplacian matrix. --- Least squares. --- Line graph. --- Linear map. --- Lipschitz continuity. --- Lyapunov function. --- Lyapunov stability. --- Markov chain. --- Mathematical optimization. --- Matrix exponential. --- Measurement. --- Multi-agent system. --- Nash equilibrium. --- Natural number. --- Network topology. --- Nonnegative matrix. --- Notation. --- Observability. --- Optimal control. --- Optimization problem. --- Pairwise. --- Parameter. --- Path graph. --- Permutation matrix. --- Permutation. --- Positive semidefinite. --- Positive-definite matrix. --- Probability. --- Quantity. --- Random graph. --- Random variable. --- Rate of convergence. --- Requirement. --- Result. --- Robotics. --- Scientific notation. --- Sensor. --- Sign (mathematics). --- Simplicial complex. --- Special case. --- Spectral graph theory. --- Stochastic matrix. --- Strongly connected component. --- Subset. --- Summation. --- Supergraph. --- Symmetric matrix. --- Systems theory. --- Theorem. --- Theory. --- Unit interval. --- Upper and lower bounds. --- Variable (mathematics). --- Vector space. --- Without loss of generality.

Choose an application

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

Group theory and topology are closely related. The region of their interaction, combining the logical clarity of algebra with the depths of geometric intuition, is the subject of Combinatorial Group Theory and Topology. The work includes papers from a conference held in July 1984 at Alta Lodge, Utah.Contributors to the book include Roger Alperin, Hyman Bass, Max Benson, Joan S. Birman, Andrew J. Casson, Marshall Cohen, Donald J. Collins, Robert Craggs, Michael Dyer, Beno Eckmann, Stephen M. Gersten, Jane Gilman, Robert H. Gilman, Narain D. Gupta, John Hempel, James Howie, Roger Lyndon, Martin Lustig, Lee P. Neuwirth, Andrew J. Nicas, N. Patterson, John G. Ratcliffe, Frank Rimlinger, Caroline Series, John R. Stallings, C. W. Stark, and A. Royce Wolf.

Combinatorial group theory --- Topology --- Abelian group. --- Algebraic equation. --- Algebraic integer. --- Automorphism. --- Basis (linear algebra). --- Betti number. --- Cayley graph. --- Cayley–Hamilton theorem. --- Characteristic polynomial. --- Characteristic subgroup. --- Characterization (mathematics). --- Classifying space. --- Combinatorial group theory. --- Combinatorics. --- Commutative algebra. --- Commutative property. --- Commutator subgroup. --- Compactification (mathematics). --- Complement (set theory). --- Conformal map. --- Conjugacy class. --- Connected component (graph theory). --- Connectivity (graph theory). --- Coprime integers. --- Coset. --- Coxeter group. --- Cyclic group. --- Cyclic permutation. --- Degeneracy (mathematics). --- Dehn's lemma. --- Diagram (category theory). --- Dirac delta function. --- Disk (mathematics). --- Epimorphism. --- Equation. --- Euclidean group. --- Finite group. --- Finitely generated abelian group. --- Finitely generated group. --- Free abelian group. --- Free group. --- Freiheitssatz. --- Fuchsian group. --- Function (mathematics). --- Fundamental domain. --- Fundamental group. --- Fundamental lemma (Langlands program). --- G-module. --- General linear group. --- Generating set of a group. --- Geodesic. --- Graph (discrete mathematics). --- Graph of groups. --- Graph product. --- Group theory. --- Haken manifold. --- Harmonic analysis. --- Homological algebra. --- Homology (mathematics). --- Homomorphism. --- Homotopy. --- Hurwitz's theorem (number theory). --- Hyperbolic 3-manifold. --- Identity theorem. --- Inclusion map. --- Inequality (mathematics). --- Inner automorphism. --- Intersection (set theory). --- Intersection number (graph theory). --- Intersection number. --- Invertible matrix. --- Jacobian matrix and determinant. --- Knot theory. --- Limit point. --- Mapping class group. --- Mapping cone (homological algebra). --- Mathematical induction. --- Module (mathematics). --- Parity (mathematics). --- Poincaré conjecture. --- Prime number. --- Pullback (category theory). --- Quotient group. --- Representation theory. --- Residually finite group. --- Riemann surface. --- Seifert–van Kampen theorem. --- Separatrix (mathematics). --- Set theory. --- Simplicial complex. --- Sphere theorem (3-manifolds). --- Sphere theorem. --- Subgroup. --- Sylow theorems. --- Theorem. --- Topology. --- Union (set theory). --- Uniqueness theorem. --- Variable (mathematics). --- Word problem (mathematics).