Fermilab Fermilab Core Computing Division

Library Home |  Ask a Librarian library@fnal.gov |  Book Catalog |  Library Journals |  Requests |  SPIRES |  Fermilab Documents |

Fermilab Library
SPIRES-BOOKS: FIND KEYWORD WORD PROBLEMS MATHEMATICS *END*INIT* use /tmp/qspiwww.webspi1/32186.22 QRY 131.225.70.96 . find keyword "word problems mathematics" ( in books using www Cover
Image
Call number:SPRINGER-2014-9781493907489:ONLINE Show nearby items on shelf
Title:The Compressed Word Problem for Groups [electronic resource]
Author(s): Markus Lohrey
Date:2014
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:The Compressed Word Problem for Groups provides a detailed exposition of known results on the compressed word problem, emphasizing efficient algorithms for the compressed word problem in various groups.The authorpresents thenecessary background along with the most recent results on the compressed word problem to create a cohesive self-contained book accessible to computer scientists as well as mathematicians. Readers will quickly reach the frontierofcurrent research which makes the book especially ap pealing for students looking for a currently active research topic at theintersection of group theory and computer science. The word problem introduced in 1910 by Max Dehnisone of the most important decision problems in group theory. For many groups, high ly efficient algorithms for the word problem exist. In recent years, a new technique based on data compression for providing more efficient algorithmsfor word problems, has been developed, by representing long words over group generators in a compressed f orm using a straight-line program. Algorithmic techniques used for manipulating compressed words has shown that the compressedword problem can be solved in polynomial time for a large class of groups such as free groups, graph groups and nilpotent groups. These results have important implications for algorithmic questions related to automorphism groups
Contents:1. Preliminaries from Theoretical Computer Science
2. Preliminaries from Combinatorial Group Theory
3. Algorithms on Compressed Words
4. The Compressed Word Problem
5. The Compressed Word Problem in Graph Products
6. The Compressed Word Problem in HNN
Extensions
7.Outlook
References
Index
ISBN:9781493907489
Series:eBooks
Series:SpringerLink
Series:SpringerBriefs in Mathematics, 2191-8198
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Group theory , Topological Groups , Global analysis (Mathematics)
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2010-9780387754703:ONLINE Show nearby items on shelf
Title:Geometric Etudes in Combinatorial Mathematics [electronic resource]
Author(s): Alexander Soifer
Date:2010
Edition:Second
Publisher:New York, NY : Springer New York
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:The etudes presented here are not simply those of Czerny, but are better compared to the etudes of Chopin, not only technically demanding and addressed to a variety of specific skills, but at the same time possessing anexceptional beauty that charact erizes the best of art... Keep this book at hand as you plan your next problem solving seminar. Don Chakerian THE AMERICAN MATHEMATICAL MONTHLY Alexander Soifers Geometrical Etudes in CombinatorialMathematics is concerned with beautiful mathematics, and i t will likely occupy a special and permanent place in the mathematical literature, challenging and inspiring both novice and expert readers with surprising and exquisiteproblems and theorems He conveys the joy of discovery as well as anyone, and he has ch osen a topic that will stand the test of time. Cecil Rousseau MEMPHIS STATE UNIVERSITY Each time I looked at Geometrical Etudes inCombinatorial Mathematics I found something that was new and surprising to me, even after more than fifty years working in co mbinatorial geometry. The new edition has been expanded (and updated where needed), by several new delightfulchapters. The careful and gradual introduction of topics and results is equally inviting for beginners and for jaded specialists. I hope that the appeal of the book will attract many young mathematicians to the visually attractiveproblems that keep you guessing how the questions will be answered in the end. Branko Grnbaum UNIVERSITY OF WASHINGTON, SEATTLE All of Alexander Soifers books can be viewe d as excellent and artful entrees to mathematics in theMAPS mode... Different people will have different preferences among them, but here is something that Geometric Etudes does better than the others: after bringing the reader into a topic by posing inte resting problems, starting from acompletely elementary level, it then goes deep. The depth achieved is most spectacular in Chapter 4, on Combinatorial Geometry, which could be used a
Note:Springer eBooks
Contents:Forewords
Preface to the Second Edition
Preface to the First Edition
Part I: Original Etudes
Tiling a Checker Rectangle
Proofs of Existence
A Word About Graphs
Ideas of Combinatorial Geometry
Part II: New Landscape or the View 18 Years Later
Mitya Karabash on a Tiling Conjecture
Norton Starr's Three
Dimensional Tromino Tiling
Large Progress in Small Ramsey Numbers
The Borsuk Problem Conquered
Etude on the Chromatic Number of the Plane
Farewell to the Reader
Bibliography
Notation
Index
ISBN:9780387754703
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Algebra , Combinatorics , Geometry
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2008-9780387754819:ONLINE Show nearby items on shelf
Title:History of Mathematics [electronic resource] : A Supplement
Author(s): Craig Smoryski
Date:2008
Publisher:New York, NY : Springer New York
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This book attempts to fill two gaps which exist in the standard textbooks on the History of Mathematics. One is to provide students with material that could encourage more critical thinking. General textbooks, attempting to coverthree thousand years of mathematical history, must necessarily oversimplify almost everything, the practice of which can scarcely promote a critical approach to the subject. For this reason, Craig Smorynski chooses a more narrow butdeeper coverage of a few select topics. The second aim of this book is to include the proofs of important results which are typically neglected in the modern history of mathematics curriculum. The most obvious of these is the oft-citednecessity of introducing complex numbers in applying the algebra ic solution of cubic equations. This solution, though it is now relegated to courses in the History of Mathematics, was a major occurrence in the history of mathematics.It was the first substantial piece of mathematics in Europe that was not a mere extens ion of what the Greeks had done and thus signified the coming of age of European mathematics. The fact that the solution, in the case of threedistinct real roots to a cubic, necessarily involved complex numbers both made inevitable the acceptance and stud y of these numbers and provided a stimulus for the development of numerical approximation methods. Other unique featuresinclude: * a prefatory essay on the ways in which sources may be unreliable, followed by an annotated bibliography * a modern recountin g of a Chinese word problem from the 13th century, illustrating the need for consulting multiplesources when the primary source is unavailable * the solution of the cubic equation, including multiple proofs that the algebraic solution uses complex numbers whenever the cubic equation has three distinct real solutions * acritical reappraisal of Horner's Method The final chapter contains lighter material, including a critical look at North Korea's stam
Note:Springer eBooks
Contents:Introduction
Annotated Bibliography
Foundations of Geometry
The Construction Problems of Antiquity
A Chinese Problem
The Cubic Equation
Horners Method
Some Lighter Material
Appendix A: Small Projects
Index
ISBN:9780387754819
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Algebra , Geometry , Mathematics_$xHistory
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2008-9780387735122:ONLINE Show nearby items on shelf
Title:40 Puzzles and Problems in Probability and Mathematical Statistics [electronic resource]
Author(s): Wolfgang Schwarz
Date:2008
Publisher:New York, NY : Springer New York
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:40 Puzzles and Problems in Probability and Mathematical Statistics is intended to teach the reader to think probabilistically by solving challenging, non-standard probability problems. The motivation for this clearly writtencollection lies in the bel ief that challenging problems help to develop, and to sharpen, our probabilistic intuition much better than plain-style deductions from abstract concepts. The selected problems fall into two broad categories.Problems related to probability theory come fir st, followed by problems related to the application of probability to the field of mathematical statistics. All problems seek to convey a non-standard aspect or an approach which is notimmediately obvious. The word puzzles in the title refers to questions in which some qualitative, non-technical insight is most important. Ideally, puzzles can teach a productive new way of framing or representing a given situation.Although the border between the two is not always clearly defined, problems tend to require a more systematic application of formal tools, and to stress more technical aspects. Thus, a major aim of the present collection is to bridgethe gap between introductory texts and rigorous state-of-the-art books. Anyone with a basic knowledge of probabilit y, calculus and statistics will benefit from this book however, many of the problems collected require little more thanelementary probability and straight logical reasoning. To assist anyone using this book for self-study, the author has included very det ailed step-for-step solutions of all problems and also short hints which point the reader in theappropriate direction
Note:Springer eBooks
Contents:Preface
Notation and Terminology
Problems
Hints
Solutions
References
Index
ISBN:9780387735122
Series:e-books
Series:SpringerLink (Online service)
Series:Problem Books in Mathematics, 0941-3502
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Distribution (Probability theory)
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2007-9783764379506:ONLINE Show nearby items on shelf
Title:The Geometry of the Word Problem for Finitely Generated Groups [electronic resource]
Author(s): Noel Brady
Tim Riley
Hamish Short
Date:2007
Publisher:Basel : Birkhuser Basel
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:The origins of the word problem are in group theory, decidability and complexity, but, through the vision of M. Gromov and the language of filling functions, the topic now impacts the world of large-scale geometry, includingtopics such as soap films, isoperimetry, coarse invariants and curvature. The first part introduces van Kampen diagrams in Cayley graphs of finitely generated, infinite groups it discusses the van Kampen lemma, the isoperimetricfunctions or Dehn functions, the theory of small canc ellation groups and an introduction to hyperbolic groups. One of the main tools in geometric group theory is the study of spaces, in particular geodesic spaces and manifolds, suchthat the groups act upon. The second part is thus dedicated to Dehn function s, negatively curved groups, in particular, CAT(0) groups, cubings and cubical complexes. In the last part, filling functions are presented from geometric,algebraic and algorithmic points of view it is discussed how filling functions interact, and applica tions to nilpotent groups, hyperbolic groups and asymptotic cones are given. Many examples and open problems are included
Note:Springer eBooks
Contents:Foreword
Diagrams and Groups
Dehn Functions and Non
Positive Curvature
Filling Functions
ISBN:9783764379506
Series:e-books
Series:SpringerLink (Online service)
Series:Advanced Courses in Mathematics CRM Barcelona, Centre de Recerca Matemtica
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Group theory , Algebra , Combinatorics , Discrete groups
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2006-9783764375478:ONLINE Show nearby items on shelf
Title:Interpolation, Schur Functions and Moment Problems [electronic resource]
Author(s): Daniel Alpay
Israel Gohberg
Date:2006
Publisher:Basel : Birkhuser Basel
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Schur analysis originates with an 1917 article of Schur where he associated to a function, which is analytic and contractive in the open unit disk, a sequence, finite or infinite, of numbers in the open unit disk, called Schurcoefficients. In signal processing, they are often named reflection coefficients. Under the word Schur analysis one encounters a variety of problems related to Schur functions, such as interpolation problems, moment problems, thestudy of the relationships between the Schur coeff icients and the properties of the function, or the study of underlying operators. Such questions are also considered for some generalizations of Schur functions. Furthermore, there isan extension of the notion of a Schur function for functions that are an alytic and have a positive real part in the open upper half-plane these functions are called Carathodory functions. This volume is almost entirely dedicated tothe analysis of Schur and Carathodory functions and to the solutions of problems for these class es
Note:Springer eBooks
Contents:Editorial introduction
Basic Boundary Interpolation for Generalized Schur Functions and Factorization of Rational J
Unitary Matrix Functions
Discrete Analogs of Canonical Systems with Pseudo
exponential Potential. Inverse Problems
Boundary Nevanlinna
Pick Interpolation Problems for Generalized Schur Functions
A Truncated Matricial Moment Problem on a Finite Interval
Shift Operators Contained in Contractions, Schur Parameters and Pseudo
continuable Schur Functions
The Matricial Carathodory Problem in Both Nondegenerate and Degenerate Cases
A Gohberg
Heinig Type Inversion
ISBN:9783764375478
Series:e-books
Series:SpringerLink (Online service)
Series:Operator Theory: Advances and Applications, Linear Operators and Linear Systems : v165
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Functional analysis , Operator theory , Systems theory
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2004-9783540247777:ONLINE Show nearby items on shelf
Title:Knapsack Problems
Author(s): Hans Kellerer
Date:2004
Size:1 online resource (548 p.)
Note:10.1007/978-3-540-24777-7
Contents:1 Introduction -- 1.1 Introducing the Knapsack Problem -- 1.2 Variants and Extensions of the Knapsack Pr©blem -- 1.3 Single-Capacity Versus All-Capacities Problem -- 1.4 Assumptions on the Input Data -- 1.5 Performance of Algorithms
-- 2. Basic Algorithmic Concepts -- 2.1 The Greedy Algorithm -- 2.2 Linear Programming Relaxation -- 2.3 Dynamic Programming -- 2.4 Branch-and-Bound -- 2.5 Approximation Algorithms -- 2.6 Approximation Schemes -- 3. Advanced
Algorithmic Concepts -- 3.1 Finding the Split Item in Linear Time -- 3.2 Variable Reduction -- 3.3 Storage Reduction in Dynamic Programming -- 3.4 Dynamic Programming with Lists -- 3.5 Combining Dynamic Programming and Upper Bounds --
3.6 Balancing -- 3.7 Word RAM Algorithms -- 3.8 Relaxations -- 3.9 Lagrangian Decomposition -- 3.10 The Knapsack Polytope -- 4. The Subset Sum Problem -- 4.1 Dynamic Programming -- 4.2 Branch-and-Bound -- 4.3 Core Algorithms -- 4.4
Computational Results: Exact Algorithms -- 4.5 Polynomial Time Approximation Schemes for Subset Sum -- 4.6 A Fully Polynomial Time Approximation Scheme for Subset Sum -- 4.7 Computational Results: FPTAS -- 5. Exact Solution of the
Knapsack Problem -- 5.1 Branch-and-Bound -- 5.2 Primal Dynamic Programming Algorithms -- 5.3 Primal-Dual Dynamic Programming Algorithms -- 5.4 The Core Concept -- 5.5 Computational Experiments -- 6. Approximation Algorithms for the
Knapsack Problem -- 6.1 Polynomial Time Approximation Schemes -- 6.2 Fully Polynomial Time Approximation Schemes -- 7. The Bounded Knapsack Problem -- 7.1 Introduction -- 7.2 Dynamic Programming -- 7.3 Branch-and-Bound -- 7.4
Approximation Algorithms -- 8. The Unbounded Knapsack Problem -- 8.1 Introduction -- 8.2 Periodicity and Dominance -- 8.3 Dynamic Programming -- 8.4 Branch-and-Bound -- 8.5 Approximation Algorithms -- 9 Multidimensional Knapsack
Problems -- 9.1 Introduction -- 9.2 Relaxations and Reductions -- 9.3 Exact Algorithms -- 9.4 Approximation -- 9.5 Heuristic Algorithms -- 9.6 The Two-Dimensional Knapsack Problem -- 9.7 The Cardinality Constrained Knapsack Problem --
9.8 The Multidimensional Multiple-Choice Knapsack Problem -- 10. Multiple Knapsack Problems -- 10.1 Introduction -- 10.2 Upper Bounds -- 10.3 Branch-and-Bound -- 10.4 Approximation Algorithms -- 10.5 Polynomial Time Approximation
Schemes -- 10.6 Variants of the Multiple Knapsack Problem -- 11. The Multiple-Choice Knapsack Problem -- 11.1 Introduction -- 11.2 Dominance and Upper Bounds -- 11.3 Class Reduction -- 11.4 Branch-and-Bound -- 11.5 Dynamic Programming
-- 11.6 Reduction of States -- 11.7 Hybrid Algorithms and Expanding Core Algorithms -- 11.8 Computational Experiments -- 11.9 Heuristics and Approximation Algorithms -- 11.10 Variants of the Multiple-Choice Knapsack Problem -- 12. The
Quadratic Knapsack Problem -- 12.1 Introduction -- 12.2 Upper Bounds -- 12.3 Variable Reduction -- 12.4 Branch-and-Bound -- 12.5 The Algorithm by Caprara, Pisinger and Toth -- 12.6 Heuristics -- 12.7 Approximation Algorithms -- 12.8
Computational Experiments Exact Algorithms -- 12.9 Computational Experiments Upper Bounds -- 13. Other Knapsack Problems -- 13.1 Multiobjective Knapsack Problems -- 13.2 The Precedence Constraint Knapsack Problem (PCKP) -- 13.3 Further
Variants -- 14. Stochastic Aspects of Knapsack Problems -- 14.1 The Probabilistic Model -- 14.2 Structural Results -- 14.3 Algorithms with Expected Performance Guarantee -- 14.4 Expected Performance of Greedy-Type Algorithms -- 14.5
Algorithms with Expected Running Time -- 14.6 Results for the Subset Sum Problem -- 14.7 Results for the Multidimensional Knapsack Problem -- 14.8 The On-Line Knapsack Problem -- 15. Some Selected Applications -- 15.1 Two-Dimensional
Two-Stage Cutting Problems -- 15.2 Column Generation in Cutting Stock Problems -- 15.3 Separation of Cover Inequalities -- 15.4 Financial Decision Problems -- 15.5 Asset-Backed Securitization -- 15.6 Knapsack Cryptosystems -- 15.7
Combinatorial Auctions -- A. Introduction to NP-Completeness of Knapsack Problems -- A.1 Definitions -- A.2 NP-Completeness of the Subset Sum Problem -- A.3 NP-Completeness of the Knapsack Problem -- A.4 NP-Completeness of Other
Knapsack Problems -- References -- Author Index
ISBN:9783540247777
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Operations research , Decision making , Computer science , Mathematical optimization , Management science , Mathematics , Optimization , Operation Research/Decision Theory , Discrete Mathematics in Computer Science , Operations Research, Management Science
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2002-9783642562402:ONLINE Show nearby items on shelf
Title:Multimedia Tools for Communicating Mathematics
Author(s):
Date:2002
Size:1 online resource (314 p.)
Note:10.1007/978-3-642-56240-2
Contents:1 Computer Animated Mathematics Videotapes -- 2 A Virtual Reconstruction of a Virtual Exhibit -- 3 An Intuitive Approach to Elementary Mathematics on the Web -- 4 OpenMath Technology for Interactive Mathematical Documents -- 5 The
StageTools Package for Creating Geometry for the Web -- 6 Communicating and Learning Mathematics with Hypervideo -- 7 Collaboration in a Multimedia Laboratory -- 8 jDvi — A Way to Put Interactive TeX on the Web -- 9 Visual Calculus —
Development and Tools -- Color Plates -- 10 EG-Models — A New Journal for Digital Geometry Models -- 11 The Future of Mathematical Software -- 12 A Dynamic Setup for Elementary Geometry -- 13 Dynamic Geometry on WWW -- 14 Minimalistic
Tools for Mathematical Multimedia -- 15 Publication of Interactive Visualizations with JavaView -- 16 The Solver Learning Environment for Solving Mathematical Word Problems: Pupils’ Discussions -- 17 Interactive Knot Theory with Knot
Plot -- 18 Developing Gato and CATBox with Python: Teaching Graph Algorithms through Visualization Experimentation -- 19 Rescalable Real-Time Interactive Computer Animations
ISBN:9783642562402
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Computer science , Software engineering , Multimedia information systems , Application software , Mathematics , Visualization , Computer Science , Computer Applications , Mathematics, general , Software Engineering/Programming and Operating Systems , Visualization , Multimedia Information Systems
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2002-9781475736274:ONLINE Show nearby items on shelf
Title:Ordered Algebraic Structures Proceedings of the Gainesville Conference Sponsored by the University of Florida 28th February — 3rd March, 2001
Author(s):
Date:2002
Size:1 online resource (322 p.)
Note:10.1007/978-1-4757-3627-4
Contents:The Bornological Tensor Product of two Riesz Spaces -- Old and New Unsolved Problems in Lattice-Ordered Rings -- A Survey of Residuated Lattices -- MV-Algebras and Abelian l-Groups: a Fruitful Interaction -- Hull Classes of
Archimedean Lattice-Ordered Groups -- Surveying Lattice-Ordered Fields -- Stone’s Real Gelfand Duality in Pointfree Topology -- The Range of Lattice Homomorphisms on f-Algebras -- The Bornological Tensor Product of two Riesz Spaces:
Proof and Background Material -- Non-distributive Cancellative Residuated Lattices -- Reconstructing C(G) from a Plenary Subset -- The Undecidability of the Word Problem for Distributive Residuated Lattices -- Least Integer Closed
Groups -- Structure Spaces of Maximal l-Ideals of Lattice-Ordered Rings -- Polar Functions I: The Summand-Inducing Hull of an Archimedean l-Group with Unit -- A Priestley-type Method for Generating Free l-Groups -- On the Epimorphic
Hull of a Ring of Continuous Functions
ISBN:9781475736274
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Developments in Mathematics: 7
Keywords: Mathematics , Group theory , Algebra , Ordered algebraic structures , Topology , Mathematics , Order, Lattices, Ordered Algebraic Structures , Group Theory and Generalizations , Topology
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2001-9783642618963:ONLINE Show nearby items on shelf
Title:Combinatorial Group Theory
Author(s): Roger C Lyndon
Date:2001
Size:1 online resource (339 p.)
Note:10.1007/978-3-642-61896-3
Contents:I. Free Groups and Their Subgroups -- 1. Introduction -- 2. Nielsen’s Method -- 3. Subgroups of Free Groups -- 4. Automorphisms of Free Groups -- 5. Stabilizers in Aut(F) -- 6. Equations over Groups -- 7. Quadratic Sets of Word -- 8.
Equations in Free Groups -- 9. Abstract Length Functions -- 10. Representations of Free Groups the Fox Calculus -- 11. Free Products with Amalgamation -- II Generators and Relations -- 1. Introduction -- 2. Finite Presentations -- 3.
Fox Calculus, Relation Matrices, Connections with Cohomology -- 4. The Reidemeister-Schreier Method -- 5. Groups with a Single Defining Relator -- 6. Magnus’ Treatment of One-Relator Groups -- III. Geometric Methods -- 1. Introduction
-- 2. Complexes -- 3. Covering Maps -- 4. Cayley Complexes -- 5. Planar Caley Complexes -- 6. F-Groups Continued -- 7. Fuchsian Complexes -- 8. Planar Groups with Reflections -- 9. Singular Subcomplexes -- 10. Spherical Diagrams -- 11.
Aspherical Groups -- 12. Coset Diagrams and Permutation Representations -- 13. Behr Graphs -- IV. Free Products and HNN Extensions -- 1. Free Products -- 2. Higman-Neumann-Neumann Extensions and Free Products with Amalgamation -- 3.
Some Embedding Theorems -- 4. Some Decision Problems -- 5. One-Relator Groups -- 6. Bipolar Structures -- 7. The Higman Embedding Theorem -- 8. Algebraically Closed Groups -- V. Small Cancellation Theory -- 1. Diagrams -- 2. The Small
Cancellation Hypotheses -- 3. The Basic Formulas -- 4. Dehn’s Algorithm and Greendlinger’s Lemma -- 5. The Conjugacy Problem -- 6. The Word Problem -- 7. The Conjugacy Problem -- 8. Applications to Knot Groups -- 9. The Theory over
Free Products -- 10. Small Cancellation Products -- 11. Small Cancellation Theory over Free Products with Amalgamation and HNN Extensions -- Russian Names in Cyrillic -- Index of Names
ISBN:9783642618963
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Classics in Mathematics: 89
Keywords: Mathematics , Group theory , Numerical analysis , Mathematics , Group Theory and Generalizations , Numerical Analysis
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2000-9783662041666:ONLINE Show nearby items on shelf
Title:Formal Power Series and Algebraic Combinatorics 12th International Conference, FPSAC’00, Moscow, Russia, June 2000, Proceedings
Author(s):
Date:2000
Size:1 online resource (808 p.)
Note:10.1007/978-3-662-04166-6
Contents:Exact Asymptotics of Meander Numbers -- Algorithms of Integral Representation of Combinatorial Sums and Their Applications -- Quasi-Symmetric Functions -- Equations over Free and Fully Residually Free Groups -- Recurring Sequences --
On Modules Supported in the Nullcone -- Towards Topological Classification of Univariate Complex Polynomials -- Applicability of Zeilberger’s Algorithm to Rational Functions -- Bases explicites et conjecture n! -- A Generalized Cover
Time for Random Walks on Graphs -- On the Square Root of Languages -- A General Cyclic Lemma for Multiset Permutation Inversions -- Enumeration of Some Labelled Trees -- On Aperiodic and Star-free Formal Power Series in Partially
Commuting Variables -- Some Generalizations of Quasi-symmetric Functions and Noncommutative Symmetric Functions -- The Skeleton of a Reduced Word and a Correspondence of Edelman and Greene -- Analytic Combinatorics of Chord Diagrams --
Specifying 2-trees -- About the Dynamics of Some Systems Based on Integer Partitions and Compositions -- Hecke Algebras of Type A at q = 0 and Quasi-differential Operators -- Central Characters and Conjugacy Classes of the Symmetric
Group -- The Füredi-Hajnal Conjecture Implies the Stanley-Wilf Conjecture -- Generalized Integer Partitions, Tilings of Zonotopes and Lattices -- Topology of Colors -- The Number of Subgroups in the Fundamental Groups of Some
Non-orientable 3-Manifolds -- Unranking of Labelled Combinatorial Structures -- On Gelfand-Tsetlin Bases for Representations of Classical Lie Algebras -- A Common Asymptotic Behavior for Different Classes of Sparse Labelled Graphs with
Given Number of Vertices and Edges -- On Functions Which are Limits of Domino Tilings -- Jeux de tableaux -- The Kronecker Product of Schur Functions Indexed by Two-Row Shapes or Hook Shapes -- Special Formal Series Solutions of Linear
Ordinary Differential Equations -- New Expressions for Level-restricted Kostka Polynomials -- A Combinatorial Interpretation of the Quotient-Difference Algorithm -- Regular Unicellular Dessins d’Enfants and Weil Curves -- Quantum
Division Ring -- On the Integer Models of Plane Trees -- Congruences Compatible with the Shuffle Product -- Arithmetical Properties of [pk]-Series Associated to p-Typical Formal Group Laws and Applications -- A Note on Linear
Preservers of a Certain Matrix Partial Order -- Trees of Diameter 4 -- The Makar-Limanov’s Construction of Algebraically Closed Skew Field via Mal’cev—Newmann Series -- About Nilpotency of Engel Algebras -- Belyi Functions Related to
Plane Graphs: Multiplicities and Parasitic Solutions -- Construction of the Annihilator of a Linear Recurring Sequence over Finite Module with the help of the Berlekamp—Massey Algorithm -- Polylinear Recurring Sequences over a Bimodule
-- An Improved Version of Standard Bases -- Effective Matrix Methods in Commutative Domains -- Polylinear Shift Registers and Standard Bases -- Burnside Matrices and Subgroup Embeddings in Finite Groups -- Distribution of Elements on
Cycles of Linear Recurrences over Galois Field -- On Witt’s Formula and Invariants for Free Lie Superalgebras -- Gröbner-Shirshov Bases for Kac-Moody Algebras An(1) and Bn(1) -- On Some Classes of Linear Representable Matroids -- On a
Class of Families of Belyi Functions -- Finite Basis Property of S-Ideals of Finite Dimensional Forms -- Peak Reduction Technique in Commutative Algebra -- On Algebraic Degrees and Multiplicities for Parameters of Some Finite Group
Rings -- Some Ring and Module Properties of Skew Power Series -- Some Ring and Module Properties of Skew Laurent Series -- Extending a Partially Ordered Set: Links with its Lattice of Ideals -- From Rational Functions to Regular
Languages -- Proving a Class of Hypergeometric Identities by Means of Generating Functions -- Séries génératrices exponentielles pour les ECO-systèmes signés -- New Statistics on Non-crossing Trees -- Expected Number of Inversions
After a Sequence of Random Adjacent Transpositions -- The Variety of Associative Rings, Which Satisfy the Identity x32 = 0, is Not Specht -- Polynomials of Bounded Tree Width -- Permutations Containing and Avoiding Certain Patterns --
On the Center of the Quantum Pseudoplactic Algebra -- ECO-Approximation of Algebraic Functions -- Methods for Computing the Concurrency Degree of Commutation Monoids -- An Application of Dumont’s Statistic -- On Wohlfahrt Formula for
Finite Abelian Groups -- Induction and Auslander-Reiten Sequences Over Crossed Products -- On Acceleration of Multiprecision Computation of Products and Sums of Products of Rational Numbers -- Combinatorial Aspects of Capelli
Identities and Structure of Algebras -- Generators and the Template Method Pattern. A Paradigm for Combinatorial Experimentation -- A Software to Solve Strip Tiling Problems -- Author Index
ISBN:9783662041666
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Computer science , Discrete mathematics , Combinatorics , Mathematics , Discrete Mathematics , Combinatorics , Mathematics of Computing
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1996-9789400901070:ONLINE Show nearby items on shelf
Title:Maximum Entropy and Bayesian Methods Cambridge, England, 1994 Proceedings of the Fourteenth International Workshop on Maximum Entropy and Bayesian Methods
Author(s):
Date:1996
Size:1 online resource (323 p.)
Note:10.1007/978-94-009-0107-0
Contents:Applications -- Flow and diffusion images from Bayesian spectral analysis of motion-encoded NMR data -- Bayesian estimation of MR images from incomplete raw data -- Quantified maximum entropy and biological EPR spectra -- The vital
importance of prior information for the decomposition of ion scattering spectroscopy data -- Bayesian consideration of the tomography problem -- Using MaxEnt to determine nuclear level densities -- A fresh look at model selection in
inverse scattering -- The maximum entropy method in small-angle scattering -- Maximum entropy multi-resolution EM tomography by adaptive subdivision -- High resolution image construction from IRAS survey — parallelization and artifact
suppression -- Maximum entropy performance analysis of spread-spectrum multiple-access communications -- Noise analysis in optical fibre sensing: A study using the maximum entropy method -- Algorithms -- AutoClass — a Bayesian approach
to classification -- Evolution reviews of BayesCalc, a MATHEMATICA package for doing Bayesian calculations -- Bayesian inference for basis function selection in nonlinear system identification using genetic algorithms -- The meaning of
the word “Probability” -- The hard truth -- Are the samples doped — If so, how much? -- Confidence intervals from one observation -- Hypothesis refinement -- Bayesian density estimation -- Scale-invariant Markov models for Bayesian
inversion of linear inverse problems -- Foundations: Indifference, independence and MaxEnt -- The maximum entropy on the mean method, noise and sensitivity -- The maximum entropy algorithm applied to the two-dimensional random packing
problem -- Neural Networks -- Bayesian comparison of models for images -- Interpolation models with multiple hyperparameters -- Density networks and their application to protein modelling -- The cluster expansion: A hierarchical
density model -- The partitioned mixture distribution: Multiple overlapping density models -- Physics -- Generating functional for the BBGKY hierarchy and the N-identical-body problem -- Entropies for continua: Fluids and magnetofluids
-- A logical foundation for real thermodynamics
ISBN:9789400901070
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Fundamental Theories of Physics, An International Book Series on The Fundamental Theories of Physics: Their Clarification, Development and Application : 70
Keywords: Mathematics , Analytical chemistry , Probabilities , Statistical physics , Dynamical systems , Statistics , Mathematics , Probability Theory and Stochastic Processes , Statistical Physics, Dynamical Systems and Complexity , Analytical Chemistry , Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Scien
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1994-9789401120029:ONLINE Show nearby items on shelf
Title:Algorithmic and Combinatorial Algebra
Author(s): L. A Bokut’
Date:1994
Size:1 online resource (384 p.)
Note:10.1007/978-94-011-2002-9
Contents:1 Composition Method for Associative Algebras -- 1.1 Introduction -- 1.2 Free Semigroups and Free Groups -- 1.3 The Composition Lemma -- 1.4 The Composition Lemma for Semigroup Algebras -- 1.5 The Generalised Clifford Algebra and Some
Other Examples -- 1.6 Finite-Dimensional Representation of a Generalised Clifford Algebra -- 1.7 More on Embeddings into Simple Algebras -- 2 Free Lie Algebras -- 2.1 Introduction -- 2.2 The Definition of Free Lie Algebras -- 2.3
Projective Algebras -- 2.4 Elementary Transformations and Automorphisms of Free Algebras -- 2.5 Lie Algebra Derivations -- 2.6 The Ideal of Codimension 1 -- 2.7 Constructing Generators for an Arbitrary Subalgebra in a Free Lie Algebra
-- 2.8 The Shirshov Theorem on Free Lie Algebra Subalgebras -- 2.9 Automorphisms of Free Lie Algebras of Finite Rank -- 2.10 A Criterion for a Lie Algebra to be Free -- 2.11 Bases of a Free Lie Algebra -- 2.12 Construction of Free Lie
Algebras -- 2.13 Universal Enveloping Associative Algebra -- 2.14 On Subrings of Free Rings with Operators -- 2.15 Embedding Lie Rings into Associative Rings with Operators -- 2.16 Restricted Lie Algebras -- 2.17 Relatively Free Lie
Algebras -- 2.18 Embedding Countable-Dimensional Lie Algebras into Lie Algebras with Two Generators -- 2.19 The Residual Finiteness of Associative and Lie Algebras -- 2.20 Residual Finiteness of Free Rings and Algebras -- 3 The
Composition Method in the Theory of Lie Algebras -- 3.1 Introduction -- 3.2 The Composition Lemma -- 3.3 Formulation of Decision Problems. One-Relator Lie Algebras -- 3.4 Embedding Lie Algebras into Simple Lie Algebras -- 3.5 The Main
Algorithmic Problems for Lie Algebras are Unsolvable -- 3.6 Unrecognizable Markov Properties for Finitely Presented Lie Algebras -- 3.7 Defining Relations of a Subalgebra -- 3.8 Residual Finiteness and Decision Problems -- 3.9 On
Residual Finiteness of One-Relator Lie Algebras -- 3.10 Constructing Free Resolutions -- 3.11 Cohomological Dimension of Almost Free Lie Algebras -- 4 Amalgamated Products of Lie Algebras -- 4.1 Introduction -- 4.2 Definition of
Amalgamated Products -- 4.3 Constructing the Free Product of Associative Algebras without 1 -- 4.4 Constructing the Amalgamated Product of Lie Algebras -- 4.5 Subalgebras of the Free Product of Lie Algebras -- 4.6 Generators of a
Subalgebra of the Free Product of Lie Algebras -- 4.7 Decomposition of a Free Product into the Sum of Two Subalgebras, One Free -- 4.8 Decomposition of a Subalgebra of a Free Product into the Sum of Two Subalgebras, One Free -- 4.9 The
Theorem on Subalgebras of an Amalgamated Product of Lie Algebras -- 4.10 Free Subalgebras in a Free Product of Lie Algebras -- 4.11 The Case in Which the Kurosh Formula Almost Holds -- 4.12 Supplementary Facts on Free Products -- 4.13
Residual Finiteness of Free Products of Associative and Lie Algebras -- 4.14 Residual Finiteness of Free Soluble Lie Algebras with respect to Inclusion into Finitely Generated Subalgebras -- 4.15 On Residual Finiteness of Free Soluble
Groups with respect to Inclusion into Finitely Generated Subgroups -- 4.16 On Residual Properties of Free Products of Lie Algebras. Central Systems in Free Products -- 5 The Problem of Endomorph Reducibility and Relatively Free Groups
with the Word Problem Unsolvable -- 5.1 Introduction -- 5.2 When the Problem of Endomorph Reducibility for Relatively Free Rings is Unsolvable -- 5.3 When the Problem of Endomorph Reducibility is Solvable -- 5.4 The Problem of
Endomorph Reducibility for Relatively Free Groups -- 5.5 The Variety R Included in NN -- 5.6 The Free Group T of the Variety $$ (\mathcal{A}_2^2 \cap \mathcal{N}_2 )\mathcal{A}_2 \mathcal{R} $$ and its Quotient Group S -- 5.7 The Main
Construction -- 5.8 Application to Constructing Non-Finitely-Based Varieties -- 5.9 An Interpretation of Polynomials -- 5.10 Unsolvability of Some Algorithmic Problems in the Theory of Group -- 6 The Constructive Method in the Theory
of HNN-extensions. Groups with Standard Normal Form -- 6.1 Introduction -- 6.2 Novikov-Boone Groups -- 6.3 The Novikov Lemma and the Britton Lemma -- 6.4 The Definition of Groups with Standard Normal Form -- 6.5 The Novikov Group AP1P2
-- 6.6 The Boone Group -- 7 The Constructive Method for HNN-extensions and the Conjugacy Problem for Novikov-Boone Groups -- 7.1 Introduction -- 7.2 The Conjugacy Problem for the Group G1 -- 7.3 The Group G2 -- 7.4 Some Calculuses --
7.5 The Conjugacy Problem for the Group AP1P2 -- 7.6 Auxiliary facts -- Appendix 1 Calculations in Free Groups -- Appendix 2 Algorithmic Properties of the Wreath Products of Groups -- Appendix 3 Survey of the Theory of Absolutely Free
Algebras
ISBN:9789401120029
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Mathematics and Its Applications : 255
Keywords: Mathematics , Algebra , Algorithms , Mathematics , Algebra , Algorithms
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1994-9781461570127:ONLINE Show nearby items on shelf
Title:Fractals in Science An Introductory Course
Author(s): Pilot Edition
Date:1994
Size:1 online resource (320 p.)
Note:10.1007/978-1-4615-7012-7
Contents:1. From Coin Flipping to Motion of Molecules -- 1.1 Introduction -- 1.2. Randomness: Making Predictions Even When No One Knows What Will Happen Next -- 1.3. How Often Something Happens (Probability Distributions) -- 1.4 Random
Movement (Random Walks) -- 1.5 Pascal’s Triangle -- 1.6 Average Displacement and Average Squared Displacement -- 1.7 Diffusion -- 1.8 Periodic Precipitation: Liesegang Rings -- 1.9 Postlude: The Meaning of Models -- Appendix A
Demonstration that Average Squared Displacement Is Equal to Number of Steps Taken -- Appendix B. Preparation for Liesegang Ring Experiment -- 2. Fractals in Nature. Growing and Measuring Random Fractals -- 2.1 Introduction -- 2.2.
Coastline -- 2.3. The Meaning of Dimension -- 2.4. Growing Random Patterns -- 2.5. Computer Measurement of Fractal Dimension -- 2.6. Modeling the Growth of a Fractal Pattern -- 2.7. The Hele-Shaw Experiment -- 2.8 Branching Patterns
Formed by Bacterial Colonies -- 2.9 Termite Nesting and Foraging in Two Dimensions -- 2.10 Fractal Root Systems -- 2.11. Research! -- Appendix A. Dimensions and Logarithms -- Appendix B. Construction of ECD and Hele-Shaw Cells --
Appendix C. Using Video Frame Grabbing -- Appendix D. Using the Scanner for Imaging -- Appendix E. Preparing the Carrageenan Solutions -- Appendix F. Using the Vernier pH Meter -- Appendix G. Preparation of Bacterial Growth Experiment
-- Appendix H. Constructing the Cell for a Termite Colony -- Appendix I. Constructing Rhizotron for Root Systems -- 3. Growth Patterns in Nature: Percolation -- 3.1 Growing a Forest -- 3.2 Burning a Forest -- 4 DNA and Literature --
4.1 DNA Sequences -- 4.2 Storing Information in DNA -- 4.3 Word Occurences and Zipf’s Law -- 4.4 Landscapes of Literature and DNA -- 4.5 Discover coding regions in DNA -- A Answers to problems. -- B Log-Log-paper -- C This and That --
5 Spin Glasses and Neural Networks -- 5.1 Introduction -- 5.2 Magnetic Order -- 5.3 Ising Model -- 5.4 Magnetic Disorder -- 5.5 Spin Glasses -- 5.6 Hopfield Model -- 5.7 Bibliography -- 6 Lightning and Soap Films -- 6.1 Introduction --
6.2 Electric Field -- 6.3 Electrostatics -- 6.4 Laplace Equation -- 6.5 Numerical Approach to our Main Task -- 6.6 Fractal Growth -- 6.7 Bibliography -- 7 Analyzing Rough Surfaces Digitally -- 7.1 Introduction -- 7.2 Defining the
Self-Affine Surface -- 7.3 Activity: The Paper Tear Experiment -- 7.4 The Paper Tear: Understanding Experiments with Models -- 7.5 Testing the Minimal Energy Model -- 7.6 Conclusion
ISBN:9781461570127
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Dynamics , Ergodic theory , Geometry , Mathematical physics , Statistical physics , Dynamical systems , Mathematics , Geometry , Mathematical Physics , Dynamical Systems and Ergodic Theory , Statistical Physics, Dynamical Systems and Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1993-9789401120586:ONLINE Show nearby items on shelf
Title:Applications of Fibonacci Numbers Volume 5 Proceedings of ‘The Fifth International Conference on Fibonacci Numbers and Their Applications’, The University of St. Andrews, Scotland, July 20–July 24, 1992
Author(s):
Date:1993
Size:1 online resource (625 p.)
Note:10.1007/978-94-011-2058-6
Contents:Multidimensional Golden Means -- A Necessary and Sufficient Condition that Rays of A Star Configuration on Pascal’s Triangle Cover Its Center With Respect to GCD and LCM -- On the Minimal Center Covering Stars With Respect to GCD In
Pascal’s Pyramid and Its Generalizations -- An Extension of an Old Classical Diophantine Problem -- Fourier Analysis in Finite Nilpotent Groups -- Wall and Vinson Revisited -- Designer Decimals: Fractions Which Contain Second Order
Recursion Sequences in Their Decimal Expansions, Reading Left to Right or Right to Left -- Semigroup Presentations and Number Sequences -- Counting the Number of Solutions of Congruences -- On the Number of Overlapping Success Runs in
A Sequence of Independent Bernoulli Trials -- Embedding Fibonacci Words Into Fibonacci Word Patterns -- On Sums of Cubes of Fibonacci Numbers -- Integer Sided Triangles Whose Ratio of Altitude to Base Is an Integer -- On a class of
Iterative Recurrence Relations -- Discrete Operational Calculi for Two-Sided Sequences -- Transformations of Fibonacci-Lucas Identities -- Fibonacci Numbers and Continued Fraction Expansions -- The DFF and DFFZ Triangles and Their
Mathematical Properties -- Contributions from Cascaded Combinations to the Naming of Special Permutations -- The Zeckendorf Representation of {Fkn/Fn} -- Fractal Patterns Derived from Rational Binomial Coefficients -- Hausdorff
Dimension in Pascal’s Triangle -- Chaos, Elliptic Curves and All that -- Co-Related Sequences Satisfying the General Second Order Recurrence Relation -- On the Moments of The Sum-of-Digits Function -- Problems on Fibonacci and B-Adic
Tree Representations by Regular K-Gons -- Two-Distance Sets and the Golden Ratio -- A Fibionacci Problem Classification Scheme Useful to Undergraduate Pedagogy -- Zeckendorf Representations of Positive and Negative Integers by Pell
Numbers -- Integration Sequences of Fibonacci and Lucas Polynomials -- Pell-Type Number Generators of Pythagorean Triples -- Balance Morphology of a Binary Tree -- Nörlund’s Number B(n)n -- On Stirling-Type Pairs and Extended
Gegenbauer-Humbert-Fibonacci Polynomials -- A Sequence Arising from Reflections in Multiple Glass Plates -- Diophantine Representation of Non-Fibonacci Numbers -- On Some Problems Related to the Fibonacci Group -- Congruence Properties
of Fibonacci Numbers and Fibonacci Coefficients Modulo P2 -- Orderings of the Set of All Positive Fibonacci Sequences -- Some Results Concerning the Reciprocal Sum of Prime Divisors of a Lucas Number -- Rational Numbers with
Predictable Engel Product Expansions -- Two Families of Orthogonal Polynomial Systems Related to Fibonacci Chains -- On the Formation of Higher Order Higher Dimensional Line-Sequential Vector Spaces -- Arithmetic Sequences and Second
Order Recurrences -- Generalized Fibonacci Pseudoprimes and Probable Primes -- A Generalization of the Fibonacci Sequence -- How to Advance on a Stairway by Coin Flippings -- Fibonacci Sequence and Its Generalizations Hidden in
Algorithms for Generating Morse Codes -- On Matrix Representations of Generalized Fibonacci Numbers and Their Applications -- A Cholesky Decomposition in Matching Insulin Profiles -- Generalized Exponential and Trigonometric Functions
-- Divisibility of Terms in Lucas Sequences by Their Subscripts -- Upper Bounds for Frequencies of Elements in Second-Order Recurrences Over a Finite Field -- On the Convergence of Quotients of Some Recursive Sequences -- Two
Distribution Problems for Polynomials -- The Elements of Enteger Geometry -- Totient Functions on the Euler Number Tree -- Using Matrix Techniques to Establish Properties of k-Order Linear Recursive Sequences
ISBN:9789401120586
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algebra , Group theory , Computer mathematics , Number theory , Statistics , Mathematics , Algebra , Number Theory , Statistics, general , Computational Mathematics and Numerical Analysis , Group Theory and Generalizations
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1993-9783034885874:ONLINE Show nearby items on shelf
Title:Topics in Combinatorial Group Theory
Author(s): Gilbert Baumslag
Date:1993
Size:1 online resource (170 p.)
Note:10.1007/978-3-0348-8587-4
Contents:I History -- 1. Introduction -- 2. The beginnings -- 3. Finitely presented groups -- 4. More history -- 5. Higman’s marvellous theorem -- 6. Varieties of groups -- 7. Small Cancellation Theory -- II The Weak Burnside Problem -- 1.
Introduction -- 2. The Grigorchuk-Gupta-Sidki groups -- 3. An application to associative algebras -- III Free groups, the calculus of presentations and the method of Reidemeister and Schreier -- 1. Frobenius’ representation -- 2.
Semidirect products -- 3. Subgroups of free groups are free -- 4. The calculus of presentations -- 5. The calculus of presentations (continued) -- 6. The Reidemeister-Schreier method -- 7. Generalized free products -- IV Recursively
presented groups, word problems and some applications of the Reidemeister-Schreier method -- 1. Recursively presented groups -- 2. Some word problems -- 3. Groups with free subgroups -- V Affine algebraic sets and the representative
theory of finitely generated groups -- 1. Background -- 2. Some basic algebraic geometry -- 3. More basic algebraic geometry -- 4. Useful notions from topology -- 5. Morphisms -- 6. Dimension -- 7. Representations of the free group of
rank two in SL(2,C) -- 8. Affine algebraic sets of characters -- VI Generalized free products and HNN extensions -- 1. Applications -- 2. Back to basics -- 3. More applicatone -- 4. Some word, conjugacy and isomorphism problems -- VII
Groups acting on trees -- 1. Basic definitions -- 2. Covering space theory -- 3. Graphs of groups -- 4. Trees -- 5. The fundamental group of a graph of groups -- 6. The fundamental group of a graph of groups (continued) -- 7. Group
actions and graphs of groups -- 8. Universal covers -- 9. The proof of Theorem 2 -- 10. Some consequences of Theorem 2 and 3 -- 11. The tree of SL2
ISBN:9783034885874
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Science , Group theory , Mathematics , Group Theory and Generalizations , Science, general
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1993-9781461209133:ONLINE Show nearby items on shelf
Title:Gröbner Bases A Computational Approach to Commutative Algebra
Author(s): Thomas Becker
Date:1993
Size:1 online resource (576 p.)
Note:10.1007/978-1-4612-0913-3
Contents:0 Basics -- 0.1 Natural Numbers and Integers -- 0.2 Maps -- 0.3 Mathematical Algorithms -- Notes -- 1 Commutative Rings with Unity -- 1.1 Why Abstract Algebra? -- 1.2 Groups -- 1.3 Rings -- 1.4 Subrings and Homomorphisms -- 1.5 Ideals
and Residue Class Rings -- 1.6 The Homomorphism Theorem -- 1.7 Gcd’s, Lcm’s, and Principal Ideal Domains -- 1.8 Maximal and Prime Ideals -- 1.9 Prime Rings and Characteristic -- 1.10 Adjunction, Products, and Quotient Rings -- Notes --
2 Polynomial Rings -- 2.1 Definitions -- 2.2 Euclidean Domains -- 2.3 Unique Factorization Domains -- 2.4 The Gaussian Lemma -- 2.5 Polynomial Gcd’s -- 2.6 Squarefree Decomposition of Polynomials -- 2.7 Factorization of Polynomials --
2.8 The Chinese Remainder Theorem -- Notes -- 3 Vector Spaces and Modules -- 3.1 Vector Spaces -- 3.2 Independent Sets and Dimension -- 3.3 Modules -- Notes -- 4 Orders and Abstract Reduction Relations -- 4.1 The Axiom of Choice and
Some Consequences in Algebra -- 4.2 Relations -- 4.3 Foundedness Properties -- 4.4 Some Special Orders -- 4.5 Reduction Relations -- 4.6 Computing in Algebraic Structures -- Notes -- 5 Gröbner Bases -- 5.1 Term Orders and Polynomial
Reductions -- 5.2 Gröbner Bases—Existence and Uniqueness -- 5.3 Gröbner Bases—Construction -- 5.4 Standard Representations -- 5.5 Improved Gröbner Basis Algorithms -- 5.6 The Extended Gröbner Basis Algorithm -- Notes -- 6 First
Applications of Gröbner Bases -- 6.1 Computation of Syzygies -- 6.2 Basic Algorithms in Ideal Theory -- 6.3 Dimension of Ideals -- 6.4 Uniform Word Problems -- Notes -- 7 Field Extensions and the Hilbert Nullstellensatz -- 7.1 Field
Extensions -- 7.2 The Algebraic Closure of a Field -- 7.3 Separable Polynomials and Perfect Fields -- 7.4 The Hilbert Nullstellensatz -- 7.5 Height and Depth of Prime Ideals -- 7.6 Implicitization of Rational Parametrizations -- 7.7
Invertibility of Polynomial Maps -- Notes -- 8 Decomposition, Radical, and Zeroes of Ideals -- 8.1 Preliminaries -- 8.2 The Radical of a Zero-Dimensional Ideal -- 8.3 The Number of Zeroes of an Ideal -- 8.4 Primary Ideals -- 8.5
Primary Decomposition in Noetherian Rings -- 8.6 Primary Decomposition of Zero-Dimensional Ideals -- 8.7 Radical and Decomposition in Higher Dimensions -- 8.8 Computing Real Zeroes of Polynomial Systems -- Notes -- 9 Linear Algebra in
Residue Class Rings -- 9.1 Gröbner Bases and Reduced Terms -- 9.2 Computing in Finitely Generated Algebras -- 9.3 Dimensions and the Hilbert Function -- Notes -- 10 Variations on Gröbner Bases -- 10.1 Gröbner Bases over PID’s and
Euclidean Domains -- 10.2 Homogeneous Gröbner Bases -- 10.3 Homogenization -- 10.4 Gröbner Bases for Polynomial Modules -- 10.5 Systems of Linear Equations -- 10.6 Standard Bases and the Tangent Cone -- 10.7 Symmetric Functions --
Notes -- Appendix: Outlook on Advanced and Related Topics -- Complexity of Gröbner Basis Constructions -- Term Orders and Universal Gröbner Bases -- Comprehensive Gröbner Bases -- Gröbner Bases and Automatic Theorem Proving --
Characteristic Sets and Wu-Ritt Reduction -- Term Rewriting -- Standard Bases in Power Series Rings -- Non-Commutative Gröbner Bases -- Gröbner Bases and Differential Algebra -- Selected Bibliography -- Conference Proceedings -- Books
and Monographs -- Articles -- List of Symbols
ISBN:9781461209133
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Graduate Texts in Mathematics: 141
Keywords: Mathematics , Algebra , Group theory , Mathematics , Group Theory and Generalizations , Algebra
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1992-9784431681892:ONLINE Show nearby items on shelf
Title:Global Interdependence Simulation and Gaming Perspectives Proceedings of the 22nd International Conference of the International Simulation and Gaming Association (ISAGA) Kyoto, Japan: 15–19 July 1991
Author(s):
Date:1992
Size:1 online resource (341 p.)
Note:10.1007/978-4-431-68189-2
Contents:Section 1 Professional and Methodological Issues -- Preparing the Gaming Profession to Deal with Problems of the Twenty-first Century -- Applying Principles of Graphic Design to Game Design -- A Global Model of Simulation and Game
Evaluation -- Information Technology and Simulation Games -- Towards a Concept of Meta-Game: Some Applied Results -- Software to Communicate Global Models -- Modeling Organizations with Visual Agents -- Future Perspectives for Global
Modeling -- Behavioral/Social System Simulation -- Section 2 Communication and Culture -- Communication and Understanding Around the World -- Synchrony in Intercultural Communication -- Global Network Simulation: An Environment for
Global Awareness -- Global University for Global Peace Gaming -- Establishing Cross-Cultural Connections in the Classroom -- Collaborative Creation of Adventure Games in the ESL One-Computer Classroom -- Chinese Word Games for School
Children -- Simulation/Gaming for Language Learning in China -- Training International Commercial Negotiators Through Simulation -- Global Modelling: A Game-Generating Game -- Simulation Structure and Attitude Change in a High
Technology Culture -- Section 3 Environmental and Developmental Issues -- Introducing Gaming-Simulations into the Planning Process in a Developing Country -- The NEW COMMONS GAME -- Asian Agriculture: A Tragedy of the Commons in the
Making? -- Three Simulation/Games and Their Impact on Participants -- Global Change and the Cross-Cultural Transfer of Policy Games -- Policy Exercises on Global Environmental Problems -- An Open Simulation-Game with a TV Studio as a
Tool for Long-Term Policy Formation -- A Computer-Supported Meeting Environment for Policy Exercises -- Municipal Planning Room for Policy Exercises -- Space Influences on Earth’s Ecological and Economic Systems -- Section 4 Economics
and Business -- Global Changes in Business and Economics -- An Econometric Simulation Model: The Case of FUGI/MS -- Managing Post-Communist Economy: A Gaming/Simulation Study -- Strategic Decision Making in Business Gaming --
Management Games in the International Business Classroom -- Business and Engineering Gaming in the Ukraine -- Stock Market Simulation -- Using Spreadsheets for Complex Business Simulations -- A Holistic Approach to Using a Marketing
Strategy Simulation -- Simulation Gaming and the Improvement of Quality -- Section 5 Assembled Abstracts -- Building More Meaning into the Organizational Modeling Process -- Organizational Modeling: Rationales, Issues, and Methods --
Using a Simulation Tool for Defining Global Problems -- A Proposal for the Development of an International Business Simulation Laboratory -- Law, Contract, and Power -- Design of a Computer Game for Managing an Apparel Retail Store --
A Micro World for Kanji Learning -- Game Paradigm CAI -- Residents’ Attitude Shifts in an Environmental Dispute: A Case Study on a Golf Course Location Dispute -- Future Status of Airborne Infectious Diseases: Evolution and Eradication
-- Development of a Game-Wise CAI and the Prerequisites -- Heat Trap: Methodological Considerations for a Policy Exercise on Greenhouse Gas Emissions -- History Education and the Use of Simulation/Games -- Modeling and Managing a Top
Management Game by an Expert System Tool -- Differences that Make a Difference: Intercultural Communication, Simulation, and the Debriefing Process -- Capturing Organizational Knowledge Through Modeling -- Modeling and Diagnosing a
Misconception by Hypothesis-Based Reasoning for ITS -- On Problem Solving and Decision Making of MUSAS, a Musical Arrangement System -- Simulation of Polarization from Each Group Decision -- Gaming/Simulation for Research into Road
Pricing -- A Simulation Based on a Self-Referential Model of Organizational Intelligence -- Business Games in Managerial Training/Development and the Transition to a Free Market Economy -- A Simplified Simulation Model for Country Risk
Evaluation -- Analysis and Simulation of Credential Competition -- Strategy Formation in Universities: Changing Strategic Decision Processes of Loosely Coupled Systems Through Information Technologies -- Concept Formation Model of the
Shape of Two-Dimensional Multimodal Functions and Its Application to Optimization -- A Classroom Simulator for Computer Language Education -- One Step Beyond: Problems with Traditional Game Evaluation -- Automating Model Formulation
for Decision Support -- A Simulation Approach to Process Modeling in Information Systems Analysis and Design
ISBN:9784431681892
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Game theory , Economic theory , Mathematics , Game Theory, Economics, Social and Behav. Sciences , Economic Theory/Quantitative Economics/Mathematical Methods
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1992-9781461397304:ONLINE Show nearby items on shelf
Title:Algorithms and Classification in Combinatorial Group Theory
Author(s):
Date:1992
Size:1 online resource (13 p.)
Note:10.1007/978-1-4613-9730-4
Contents:Decision Problems for Groups Survey and Reflections -- The Word Problem for Solvable Groups and Lie Algebras -- Solution of the Conjugacy Problem in One-Relator Groups -- A Tour Around Finitely Presented Infinite Simple Groups -- The
Geometry of Finitely Presented Infinite Simple Groups -- The Geometry of Rewriting Systems: A Proof of the Anick-Groves-Squier Theorem -- Combings of Groups -- Automatic Groups and Amalgams — A Survey -- Dehn Functions and l1-Norms of
Finite Presentations -- Problems on Automatic Groups
ISBN:9781461397304
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Mathematical Sciences Research Institute Publications: 23
Keywords: Mathematics , Combinatorics , Mathematics , Combinatorics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1990-9783642469084:ONLINE Show nearby items on shelf
Title:Topics in Combinatorics and Graph Theory Essays in Honour of Gerhard Ringel
Author(s):
Date:1990
Size:1 online resource (792 p.)
Note:10.1007/978-3-642-46908-4
Contents:On the Problem of Relative Components of Minimal Graphs -- Irregular Assignments and Two Problems á la Ringel -- A Recursive Bound for the Number of Complete K-Subgraphs of a Graph -- One-Factorizations of Tensor Products of Graphs --
Non-Commutative Geometry and Graphs -- The Complexity of the Graph Embedding Problem -- Helly Theorems for Dismantlable Graphs and Pseudo-Modular Graphs -- On the Level-Oriented Two-Dimensional Packing with Rotation of the Rectangles
-- On Planar Tilings with Finitely Many Sorts of Tiles -- Examples of Space-Tiling Polyhedra Related to Hilbert’s Problem 18, Question 2 -- The Historical Background to Gerhard Ringel’s Work -- Around Three Lemmas in Hamiltonian Graph
Theory -- A Note on Metric Properties of Infinite Graphs -- Automotphism Groups of Directed Cayley Graphs -- Triangular Embeddings of Tensor Products of Graphs -- Computing Light Edges in Planar Graphs -- On the Domination Problem for
Bipartite Graphs -- Polyhedral Maps with Few Edges -- Aut Gm,n for the Hasse Graph Gm,n of the Subword Poset Bm,n of an m-Ary Cyclic Word of Length n -- Status of Graceful Tree Conjecture in 1989 -- Embedded Graphs, Facial Colorings,
and Double Cycle Covers -- On Peripheral Vertices in Graphs -- The Vertex-Degrees of Steiner Minimal Trees in Minkowski Planes -- Unfolding Weighted Concensus Orders into Consistent Numerical Scales -- Forbidden Ordered Subgraphs -- On
Normal Tournaments with the Least Number of 3-Cycles -- Two-Irregular Graphs -- Cell Complexes and Lower Bounds in Computational Geometry -- Characterizing Directed Postman Tours -- Some Properties of “Almost All” Functions from pk --
Composition of Facets of the Clique Partitioning Polytope -- Optimal Edge-Numbering of Binary Trees -- On Independent Vertices and Edges of a Graph -- The Outerthickness & Outercoarseness of Graphs I. the Complete Graph & the n-Cube --
On Some Graphic Aspects of Addition Theorems -- On the Circumference of Regular Polyhedral Graphs -- Longest Cycles in Circulant Graphs -- Spanning Trees of the Complete Bipartite Graph -- A Combinatorial Theorem Which is Related to
the Invariance of the Separating Set for the Plane -- On Certain Trees in Hypercubes -- Extending Hall’s Theorem -- On the Coupling Condition and Hamiltonicity -- Transversals and Matroids -- Classification and Construction of Geodetic
Block with Diameter Two -- Graph Distances and Similarity -- Witt Rings and Semiorderings of Planar Ternary Rings -- Linear Inequalities Describing the Class of Intersecting Sperner Families of Subsets, I -- Integral Drawings of the
Complete Graph K6 -- On Certain Binomial Sums -- Colouring of Spider Graphs -- A Las-Vergnas Type Theorem for Trees -- Quick Gossiping by Multi-Telegraphs -- Numberings on Graphs Having Small Edge Weights -- On Vertexminimal Graphs
with Radius r and Connectivity 2m -- Embedding Schemes and the Jordan Curve Theorem -- Subgraph Packing — A Survey -- On the Radius of Random Subgraphs of the n-Cube -- A Result in Combinatorial Matroid Theory -- On Graphs Embeqdable
with Short Faces -- On Cyclic Representations of Triples by Pairs -- On the Steiner Periphery and Steiner Eccentricity of a Graph -- Cycles Containing Three Consecutive Edges in 2k-Edge-Connected Graphs -- Graph Distance and Euclidean
Distance on the Grid -- About the Complexity of Some Homomorphism Problems on Graphs -- On an Inequality of Sperner -- Counting Perfect Matchings in Lattice Graphs -- Genus — Minimal Edges and Kuratowski Subgraphs of a Graph -- From
Tree Path-Factors and Doubly Exponential Sequences to a Binomial Inequality -- A Characterization of Point-Colour-Symmetric Hypergraphs -- A Linear Algorithm for the Pathwidth of Trees -- The Time Travelling Problem -- An Aperiodic
Triple of Prototiles -- Representation of Graphs by Integers -- Special Systems of Linear Equations and Graphs of Convex Polytopes -- On 2-Embeddable Graphs -- On an Application of the Boolean Differential Calculus to Digital System
Theory -- Equtareal Sets in Rd -- On the Piaget Graph -- On a Characterization of Closure Operators by Identities on Semigroups -- Symmetries of Group-Triangulations -- Experimental Mathematics — Tesselations of Convex Polygons in a
Hexagonal Lattice -- Domination in Cubic Graphs -- A Generalization of the Bodendiek Conjecture About Graceful Graphs -- A Sparse callai-Witt Theorem -- Edges with at Most One Crossing in Drawings of the Complete Graph -- Long Cycles
in Graphs with Moderate Connectivity -- Independent Covers in Plane Graphs -- List of Contributors
ISBN:9783642469084
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Operations research , Decision making , Combinatorics , Mathematics , Combinatorics , Operation Research/Decision Theory
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1988-9781461210337:ONLINE Show nearby items on shelf
Title:Differential Geometry: Manifolds, Curves, and Surfaces
Author(s): Marcel Berger
Date:1988
Size:1 online resource (476 p.)
Note:10.1007/978-1-4612-1033-7
Contents:0. Background -- 0.0 Notation and Recap -- 0.1 Exterior Algebra -- 0.2 Differential Calculus -- 0.3 Differential Forms -- 0.4 Integration -- 0.5 Exercises -- 1. Differential Equations -- 1.1 Generalities -- 1.2 Equations with Constant
Coefficients. Existence of Local Solutions -- 1.3 Global Uniqueness and Global Flows -- 1.4 Time- and Parameter-Dependent Vector Fields -- 1.5 Time-Dependent Vector Fields: Uniqueness And Global Flow -- 1.6 Cultural Digression -- 2.
Differentiable Manifolds -- 2.1 Submanifolds of Rn -- 2.2 Abstract Manifolds -- 2.3 Differentiable Maps -- 2.4 Covering Maps and Quotients -- 2.5 Tangent Spaces -- 2.6 Submanifolds, Immersions, Submersions and Embeddings -- 2.7 Normal
Bundles and Tubular Neighborhoods -- 2.8 Exercises -- 3. Partitions of Unity, Densities and Curves -- 3.1 Embeddings of Compact Manifolds -- 3.2 Partitions of Unity -- 3.3 Densities -- 3.4 Classification of Connected One-Dimensional
Manifolds -- 3.5 Vector Fields and Differential Equations on Manifolds -- 3.6 Exercises -- 4. Critical Points -- 4.1 Definitions and Examples -- 4.2 Non-Degenerate Critical Points -- 4.3 Sard’s Theorem -- 4.4 Exercises -- 5.
Differential Forms -- 5.1 The Bundle ?rT*X -- 5.2 Differential Forms on a Manifold -- 5.3 Volume Forms and Orientation -- 5.4 De Rham Groups -- 5.5 Lie Derivatives -- 5.6 Star-shaped Sets and Poincaré’s Lemma -- 5.7 De Rham Groups of
Spheres and Projective Spaces -- 5.8 De Rham Groups of Tori -- 5.9 Exercises -- 6. Integration of Differential Forms -- 6.1 Integrating Forms of Maximal Degree -- 6.2 Stokes’ Theorem -- 6.3 First Applications of Stokes’ Theorem -- 6.4
Canonical Volume Forms -- 6.5 Volume of a Submanifold of Euclidean Space -- 6.6 Canonical Density on a Submanifold of Euclidean Space -- 6.7 Volume of Tubes I -- 6.8 Volume of Tubes II -- 6.9 Volume of Tubes III -- 6.10 Exercises -- 7.
Degree Theory -- 7.1 Preliminary Lemmas -- 7.2 Calculation of Rd(X) -- 7.3 The Degree of a Map -- 7.4 Invariance under Homotopy. Applications -- 7.5 Volume of Tubes and the Gauss-Bonnet Formula -- 7.6 Self-Maps of the Circle -- 7.7
Index of Vector Fields on Abstract Manifolds -- 7.8 Exercises -- 8. Curves: The Local Theory -- 8.0 Introduction -- 8.1 Definitions -- 8.2 Affine Invariants: Tangent, Osculating Plan, Concavity -- 8.3 Arclength -- 8.4 Curvature -- 8.5
Signed Curvature of a Plane Curve -- 8.6 Torsion of Three-Dimensional Curves -- 8.7 Exercises -- 9. Plane Curves: The Global Theory -- 9.1 Definitions -- 9.2 Jordan’s Theorem -- 9.3 The Isoperimetric Inequality -- 9.4 The Turning
Number -- 9.5 The Turning Tangent Theorem -- 9.6 Global Convexity -- 9.7 The Four-Vertex Theorem -- 9.8 The Fabricius-Bjerre-Halpern Formula -- 9.9 Exercises -- 10. A Guide to the Local Theory of Surfaces in R3 -- 10.1 Definitions --
10.2 Examples -- 10.3 The Two Fundamental Forms -- 10.4 What the First Fundamental Form Is Good For -- 10.5 Gaussian Curvature -- 10.6 What the Second Fundamental Form Is Good For -- 10.7 Links Between the two Fundamental Forms -- 10.8
A Word about Hypersurfaces in Rn+1 -- 11. A Guide to the Global Theory of Surfaces -- 11.1 Shortest Paths -- 11.2 Surfaces of Constant Curvature -- 11.3 The Two Variation Formulas -- 11.4 Shortest Paths and the Injectivity Radius --
11.5 Manifolds with Curvature Bounded Below -- 11.6 Manifolds with Curvature Bounded Above -- 11.7 The Gauss-Bonnet and Hopf Formulas -- 11.8 The Isoperimetric Inequality on Surfaces -- 11.9 Closed Geodesics and Isosystolic
Inequalities -- 11.10 Surfaces AU of Whose Geodesics Are Closed -- 11.11 Transition: Embedding and Immersion Problems -- 11.12 Surfaces of Zero Curvature -- 11.13 Surfaces of Non-Negative Curvature -- 11.14 Uniqueness and Rigidity
Results -- 11.15 Surfaces of Negative Curvature -- 11.16 Minimal Surfaces -- 11.17 Surfaces of Constant Mean Curvature, or Soap Bubbles -- 11.18 Weingarten Surfaces -- 11.19 Envelopes of Families of Planes -- 11.20 Isoperimetric
Inequalities for Surfaces -- 11.21 A Pot-pourri of Characteristic Properties -- Index of Symbols and Notations
ISBN:9781461210337
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Graduate Texts in Mathematics: 115
Keywords: Mathematics , Differential geometry , Mathematics , Differential Geometry
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1987-9783540478935:ONLINE Show nearby items on shelf
Title:Complex Analysis III Proceedings of the Special Year held at the University of Maryland, College Park, 1985–86
Author(s):
Date:1987
Size:1 online resource (352 p.)
Note:10.1007/BFb0078241
Contents:Some recent successes in value-distribution theory -- Bergman — Szegö type theory for CR structures -- Regular complex geodesics for the domain Dn=((z1, ..., zn) ? ?n : |z1| + ... + |zn| < 1) -- Subelliptic, second order differential
operators -- Recent results on homogeneous complex manifolds -- Kähler-Einstein metrics for the case of positive first chern class -- Algebroid reduction of Nevanlinna theory -- An infinite-dimensional generalization of the Shilov
boundary and infinite dimensional analytic structures in the spectrum of a uniform algebra -- New relations between Sibony-Basener boundaries -- Picard-fuchs differential equations for the quadratic periods of Abelian integrals of the
first kind -- Holomorphic families of holomorphic isometries -- Complex Monge-Ampère equation and related problems -- Liouville theorems -- A final word
ISBN:9783540478935
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Lecture Notes in Mathematics: 1277
Keywords: Mathematics , Topological groups , Lie groups , Mathematical analysis , Analysis (Mathematics) , Mathematics , Analysis , Topological Groups, Lie Groups
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1987-9781461246381:ONLINE Show nearby items on shelf
Title:Counting for Something Statistical Principles and Personalities
Author(s): William S Peters
Date:1987
Size:1 online resource (275 p.)
Note:10.1007/978-1-4612-4638-1
Contents:1 Statistics—The Word -- Descriptive Statistics -- Inferential Statistics -- References -- 2 Distributions -- The Frequency Distribution -- Summary Measures -- Graphs -- References -- 3 Special Averages -- Index Numbers -- Some
History -- The Harmonic Mean -- Averaging Time Rates -- Simpson’s Paradox -- References -- 4 Making Comparisons -- Comparing Observations -- Standard Scores -- Comparing Variables -- Median and Quartiles -- Boxplots -- Ordinal Data --
The Dollar Scale -- References -- 5 Probability -- Laplaoe’s Principles of Probability -- Counting the Ways -- Poker Hands -- The Birthday Problem -- Probability in Court -- Which Question Was That? -- References -- 6 Craps and
Binomial -- Probabilities for Craps -- The Binomial Distribution -- Inference from the Binomial -- Interval Estimates -- References -- 7 Horsekicks, Deadly Quarrels, and Flying Bombs -- The Poisson Distribution -- The Exponential
Distribution -- A Problem of Authorship -- References -- 8 Normal Distribution -- The Standard Normal Distribution -- Probability Distribution of the Sample Mean -- Process Control Chart -- The Central Limit Theorem -- References -- 9
Political Arithmetic -- Beginnings in England -- America to 1790 -- The United States, 1790–1900 -- Statistics and Social Issues -- 1900–1950 -- Since 1950 -- References -- 10 Regression and Correlation -- The Regression Line --
Variation from Regression -- Correlation and Gallon -- References -- 11 Karl Pearson -- Karl Pearson—to 1901 -- Chi-Square Goodness-of-Fit Test -- Karl Pearson—from 1901 -- References -- 12 Pearson to Cosset to Fisher -- William S.
Gosset (Student) -- Ronald A. Fisher -- Using the t-Distribution -- References -- 13 More Regression -- Standard Error of the Regression Coefficient -- Transformations -- Multiple Regression and Correlation -- History and Applications
-- References -- 14 R. A. Fisher -- The Analysis of Variance -- R. A. Fisher—from 1925 -- Experimental Design -- Postscript -- References -- 15 Sampling: Polls and Surveys -- Proportions -- Coefficient of Variation -- Random Numbers --
Sampling Methods -- Election Polls -- Estimating Sample Size -- A National Sample -- References -- 16 Quality Control -- Quality Control to 1930 -- Sampling Inspection -- The 1930s -- QC Goes to War -- Sequential Sampling -- Post-World
War and Today -- References -- 17 Principal Components and Factor Analysis -- The Principal Component -- General Intelligence -- Criticism -- Ways of Life—An Example -- Factor Rotation -- Semantic Analysis of the Ways -- A
Three-Dimensional Map -- References -- 18 Jerzy Neyman -- E. S. Pearson to Gosset to Neyman -- Neyman-Pearson Tests -- The Power of a Test -- Confidence Intervals -- Statistical Issues and Personalities of the 1930s -- Neyman in
America -- References -- 19 The Bayesian Bandwagon -- Utility -- Utility After Bernoulli -- Bayes’ Theorem -- The Value of Information -- Break-Even Problems -- Bayesian Estimation—The Newsboy Problem -- Subjective Probability --
Assessing Subjective Probabilities -- Bayesian Statistics -- References -- 20 Observational Studies and Program Evaluation -- The Language of Cause -- Rival Explanations -- Analytical Control -- Auto Death Rates and Safety Inspections
-- Systems of Relationships -- Discriminant Analysis -- A Discriminant Analysis of Selection Factors -- Evaluation and Controlled Experimentation -- References -- 21 Nonparametrics and Robust Methods -- The Wilcoxon Signed-Rank Test --
Robustness and Student’s t -- Robust Estimation -- The Jacknife -- Exploratory Data Analysis -- References -- 22 Statistics—A Summing Up -- References -- List of Names
ISBN:9781461246381
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Applied mathematics , Engineering mathematics , Probabilities , Mathematics , Probability Theory and Stochastic Processes , Applications of Mathematics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1985-9783642824562:ONLINE Show nearby items on shelf
Title:Combinatorial Algorithms on Words
Author(s):
Date:1985
Size:1 online resource (363 p.)
Note:10.1007/978-3-642-82456-2
Contents:Open Problems in Stringology -- 1 — String Matching -- Efficient String Matching with Don’t-care Patterns -- Optimal Factor Transducers -- Relating the Average-case Cost of the Brute force and the Knuth-Morris-Pratt String Matching
Algorithm -- Algorithms for Factorizing and Testing Subsemigroups -- 2 — Subword Trees -- The Myriad Virtues of Subword Trees -- Efficient and Elegant Subword Tree Construction -- 3 — Data Compression -- Textual Substitution Techniques
for Data Compression -- Variations on a Theme by Ziv and Lempel -- Compression of Two-dimensional Images -- Optimal Parsing of Strings -- Novel Compression of Sparse Bit Strings -- 4 — Counting -- The Use and Usefulness of Numeration
Systems -- Enumeration of Strings -- Two Counting Problems Solved via String Encodings -- Some Uses of the Mellin integral Transform in the Analysis of Algorithms -- 5 — Periods and Other Regularities -- Periodicities in Strings --
Linear Time Recognition of Square free Strings -- Discovering Repetitions in Strings -- Some Decision Results on Nonrepetitive Words -- 6 — Miscellaneous -- On the Complexity of some Word Problems Which Arise in Testing the Security of
Protocols -- Code Properties and Derivatives of DOL Systems -- Words over a Partially Commutative Alphabet -- The Complexity of Two-way Pushdown Automata and Recursive Programs -- On Context Free Grammars and Random Number Generation
ISBN:9783642824562
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:NATO ASI Series, Series F: Computer and Systems Sciences : 12
Keywords: Mathematics , Mathematical logic , Combinatorics , Mathematics , Mathematical Logic and Foundations , Combinatorics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1985-9783540396383:ONLINE Show nearby items on shelf
Title:Universal Algebra and Lattice Theory Proceedings of a Conference held at Charleston, July 11–14, 1984
Author(s):
Date:1985
Size:1 online resource (288 p.)
Note:10.1007/BFb0098450
Contents:Universal terms for pseudo-complemented distributive lattices and Heyting algebras -- Clones of operations on relations -- Separation conditions on convexity lattices -- Some independence results in the co-ordinization of arguesian
lattices -- Unary operations on completely distributive complete lattices -- Connected components of the covering relation in free lattices -- Varieties with linear subalgebra geometries -- Generalized commutativity -- The word and
isomorphism problems in universal algebra -- Linear lattice proof theory: An overview -- Interpolation antichains in lattices -- Subdirectly irreducible and simple boolean algebras with endomorphisms -- A note on varieties of graph
algebras -- How to construct finite algebras which are not finitely based -- Finite integral relation algebras -- Some varieties of semidistributive lattices -- Homomorphisms of partial and of complete steiner triple systems and
quasigroups -- Principal congruence formulas in arithmetical varieties -- From affine to projective geometry via convexity -- More conditions equivalent to congruence modularity
ISBN:9783540396383
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Lecture Notes in Mathematics: 1149
Keywords: Mathematics , Algebra , Mathematics , Algebra
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1985-9781461251460:ONLINE Show nearby items on shelf
Title:Student’s Guide to Calculus by J. Marsden and A. Weinstein Volume I
Author(s): Frederick H Soon
Date:1985
Size:1 online resource (312 p.)
Note:10.1007/978-1-4612-5146-0
Contents:R -- Review of Fundamentals -- R.1 Basic Algebra: Real Numbers and Inequalities -- R.2 Intervals and Absolute Values -- R.3 Laws of Exponents -- R.4 Straight Lines -- R.5 Circles and Parabolas -- R.6 Functions and Graphs -- R.R Review
Exercises for Chapter R -- 1 -- Derivatives and Limits -- 1.1 Introduction to the Derivative -- 1.2 Limits -- 1.3 The Derivative as a Limit and the Leibniz Notation -- 1.4 Differentiating Polynomials -- 1.5 Products and Quotients --
1.6 The Linear Approximation and Tangent Lines -- 1.R Review Exercises for Chapter 1 -- 2 -- Rates of Change and the Chain Rule -- 2.1 Rates of Change and the Second Derivative -- 2.2 The Chain Rule -- 2.3 Fractional Powers and
Implicit Differentiation -- 2.4 Related Rates and Parametric Curves -- 2.5 Antiderivatives -- 2.R Review Exercises for Chapter 2 -- 3 -- Graphing and Maximum-Minimum Problems -- 3.1 Continuity and the Intermediate Value Theorem -- 3.2
Increasing and Decreasing Functions -- 3.3 The Second Derivative and Concavity -- 3.4 Drawing Graphs -- 3.5 Maximum-Minimum Problems -- 3.6 The Mean Value Theorem -- 3.R Review Exercises for Chapter 3 -- Comprehensive Test for Chapters
1 – 3 -- 4 -- The Integral -- 4.1 Summation -- 4.2 Sums and Areas -- 4.3 The Definition of the Integral -- 4.4 The Fundamental Theorem of Calculus -- 4.5 Definite and Indefinite Integrals -- 4.6 Applications of the Integral -- 4.R
Review Exercises for Chapter 4 -- 5 -- Trigonometric Functions -- 5.1 Polar Coordinates and Trigonometry -- 5.2 Differentiation of the Trigonometric Functions -- 5.3 Inverse Functions -- 5.4 The Inverse Trigonometric Functions -- 5.5
Graphing and Word Problems -- 5.6 Graphing in Polar Coordinates -- 5.S Supplement to Chapter 5: Length of Days -- 5.R Review Exercises for Chapter 5 -- 6 -- Exponentials and Logarithms -- 6.1 Exponential Functions -- 6.2 Logarithms --
6.3 Differentiation of the Exponential and Logarithmic Functions -- 6.4 Graphing and Word Problems -- 6.R Review Exercises for Chapter 6 -- Comprehensive Test for Chapters 1 – 6
ISBN:9781461251460
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Mathematical analysis , Analysis (Mathematics) , Mathematics , Analysis
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1985-9781461250241:ONLINE Show nearby items on shelf
Title:Calculus I
Author(s): Jerrold Marsden
Date:1985
Edition:Second Edition
Size:1 online resource (388 p.)
Note:10.1007/978-1-4612-5024-1
Contents:Orientation Quizzes -- R Review of Fundamentals -- R.1 Basic Algebra: Real Numbers and Inequalities -- R.2 Intervals and Absolute Values -- R.3 Laws of Exponents -- R.4 Straight Lines -- R.5 Circles and Parabolas -- R.6 Functions and
Graphs -- 1 Derivatives and Limits -- 1.1 Introduction to the Derivative -- 1.2 Limits -- 1.3 The Derivative as a Limit and the Leibniz Notation -- 1.4 Differentiating Polynomials -- 1.5 Products and Quotients -- 1.6 The Linear
Approximation and Tangent Lines -- 2 Rates of Change and the Chain Rule -- 2.1 Rates of Change and the Second Derivative -- 2.2 The Chain Rule -- 2.3 Fractional Powers and Implicit Differentiation -- 2.4 Related Rates and Parametric
Curves -- 2.5 Antiderivatives -- 3 Graphing and Maximum—Minimum Problems -- 3.1 Continuity and the Intermediate Value Theorem -- 3.2 Increasing and Decreasing Functions -- 3.3 The Second Derivative and Concavity -- 3.4 Drawing Graphs
-- 3.5 Maximum—Minimum Problems -- 3.6 The Mean Value Theorem -- 4 The Integral -- 4.1 Summation -- 4.2 Sums and Areas -- 4.3 The Definition of the Integral -- 4.4 The Fundamental Theorem of Calculus -- 4.5 Definite and Indefinite
Integrals -- 4.6 Applications of the Integral -- 5 Trigonometric Functions -- 5.1 Polar Coordinates and Trigonometry -- 5.2 Differentiation of the Trigonometric Functions -- 5.3 Inverse Functions -- 5.4 The Inverse Trigonometric
Functions -- 5.5 Graphing and Word Problems -- 5.6 Graphing in Polar Coordinates -- 6 Exponentials and Logarithms -- 6.1 Exponential Functions -- 6.2 Logarithms -- 6.3 Differentiation of the Exponential and Logarithmic Functions -- 6.4
Graphing and Word Problems -- Answers A.1 -- Index I.1.
ISBN:9781461250241
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Functions of real variables , Mathematics , Real Functions
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1983-9781461254270:ONLINE Show nearby items on shelf
Title:Differential Equation Models
Author(s):
Date:1983
Size:1 online resource (380 p.)
Note:10.1007/978-1-4612-5427-0
Contents:I. Differential Equations, Models, and What To Do with Them -- 1. Setting Up First-Order Differential Equations from Word Problems -- 2. Qualitative Solution Sketching for First-Order Differential Equations -- 3. Difference and
Differential Equation Population Growth Models -- II. Growth and Decay Models: First-Order Differential Equations -- 4. The Van Meegeren Art Forgeries -- 5. Single Species Population Models -- 6. The Spread of Technological Innovations
-- III. Higher Order Linear Models -- 7. A Model for the Detection of Diabetes -- 8. Combat Models -- 9. Modeling Linear Systems by Frequency Response Methods -- IV. Traffic Models -- 10. How Long Should a Traffic Light Remain Amber?
-- 11. Queue Length at a Traffic Light via Flow Theory -- 12. Car-Following Models -- 13. Equilibrium Speed Distributions -- 14. Traffic Flow Theory -- V. Interacting Species: Steady States of Nonlinear Systems -- 15. Why the
Percentage of Sharks Caught in the Mediterranean Sea Rose Dramatically During World War I -- 16. Quadratic Population Models: Almost Never Any Cycles -- 17. The Principle of Competitive Exclusion in Population Biology -- 18. Biological
Cycles and the Fivefold Way -- 19. Hilbert’s 16th Problem: How Many Cycles? -- VI. Models Leading to Partial Differential Equations -- 20. Surge Tank Analysis -- 21. Shaking a Piece of String to Rest -- 22. Heat Transfer in Frozen Soil
-- 23. Network Analysis of Steam Generator Flow
ISBN:9781461254270
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Mathematical analysis , Analysis (Mathematics) , Mathematics , Analysis
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1982-9783642818974:ONLINE Show nearby items on shelf
Title:Fast Fourier Transform and Convolution Algorithms
Author(s): Henri J Nussbaumer
Date:1982
Edition:Second Corrected and Updated Edition
Size:1 online resource (38 p.)
Note:10.1007/978-3-642-81897-4
Contents:1 Introduction -- 1.1 Introductory Remarks -- 1.2 Notations -- 1.3 The Structure of the Book -- 2 Elements of Number Theory and Polynomial Algebra -- 2.1 Elementary Number Theory -- 2.2 Polynomial Algebra -- 3 Fast Convolution
Algorithms -- 3.1 Digital Filtering Using Cyclic Convolutions -- 3.2 Computation of Short Convolutions and Polynomial Products -- 3.3 Computation of Large Convolutions by Nesting of Small Convolutions -- 3.4 Digital Filtering by
Multidimensional Techniques -- 3.5 Computation of Convolutions by Recursive Nesting of Polynomials -- 3.6 Distributed Arithmetic -- 3.7 Short Convolution and Polynomial Product Algorithms -- 4 The Fast Fourier Transform -- 4.1 The
Discrete Fourier Transform -- 4.2 The Fast Fourier Transform Algorithm -- 4.3 The Rader-Brenner FFT -- 4.4 Multidimensional FFTs -- 4.5 The Bruun Algorithm -- 4.6 FFT Computation of Convolutions -- 5 Linear Filtering Computation of
Discrete Fourier Transforms -- 5.1 The Chirp z-Transform Algorithm -- 5.2 Rader’s Algorithm -- 5.3 The Prime Factor FFT -- 5.4 The Winograd Fourier Transform Algorithm (WFTA) -- 5.5 Short DFT Algorithms -- 6 Polynomial Transforms --
6.1 Introduction to Polynomial Transforms -- 6.2 General Definition of Polynomial Transforms -- 6.3 Computation of Polynomial Transforms and Reductions -- 6.4 Two-Dimensional Filtering Using Polynomial Transforms -- 6.5 Polynomial
Transforms Defined in Modified Rings -- 6.6 Complex Convolutions -- 6.7 Multidimensional Polynomial Transforms -- 7 Computation of Discrete Fourier Transforms by Polynomial Transforms -- 7.1 Computation of Multidimensional DFTs by
Polynomial Transforms -- 7.2 DFTs Evaluated by Multidimensional Correlations and Polynomial Transforms -- 7.3 Comparison with the Conventional FFT -- 7.4 Odd DFT Algorithms -- 8 Number Theoretic Transforms -- 8.1 Definition of the
Number Theoretic Transforms -- 8.2 Mersenne Transforms -- 8.3 Fermat Number Transforms -- 8.4 Word Length and Transform Length Limitations -- 8.5 Pseudo Transforms -- 8.6 Complex NTTs -- 8.7 Comparison with the FFT -- Appendix A
Relationship Between DFT and Conyolution Polynomial Transform Algorithms -- A.1 Computation of Multidimensional DFT’s by the Inverse Polynomial Transform Algorithm -- A.1.1 The Inverse Polynomial Transform Algorithm -- A.1.2 Complex
Polynomial Transform Algorithms -- A.1.3 Round-off Error Analysis -- A.2 Computation of Multidimensional Convolutions by a Combination of the Direct and Inverse Polynomial Transform Methods -- A.2.1 Computation of Convolutions by DFT
Polynomial Transform Algorithms -- A.2.2 Convolution Algorithms Based on Polynomial Transforms and Permutations -- A.3 Computation of Multidimensional Discrete Cosine Transforms by Polynomial Transforms -- A.3.1 Computation of Direct
Multidimensional DCT’s -- A.3.2 Computation of Inverse Multidimensional DCT’s -- Appendix B Short Polynomial Product Algorithms -- Problems -- References
ISBN:9783642818974
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Springer Series in Information Sciences: 2
Keywords: Mathematics , Numerical analysis , Mathematics , Numerical Analysis
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1980-9783540381204:ONLINE Show nearby items on shelf
Title:Burnside Groups Proceedings of a Workshop Held at the University of Bielefeld, Germany June–July 1977
Author(s):
Date:1980
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg
Size:1 online resource (278 p.)
Note:10.1007/BFb0091265
Contents:Classifications of periodic words and their application in group theory -- On the word problem for groups defined by periodic relations -- An application of the nilpotent quotient program -- Groups of exponent eight -- Finiteness
proofs for groups of exponent 8 -- Application of computers to questions like those of Burnside -- On certain groups of exponent eight generated by three involutions -- Generalized power laws -- Problems
ISBN:9783540381204
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Lecture Notes in Mathematics: 806
Keywords: Mathematics , Group theory , Mathematics , Group Theory and Generalizations
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1975-9781475744897:ONLINE Show nearby items on shelf
Title:An Algebraic Introduction to Mathematical Logic
Author(s): Donald W Barnes
Date:1975
Size:1 online resource (123 p.)
Note:10.1007/978-1-4757-4489-7
Contents:I Universal Algebra -- II Propositional Calculus -- III Properties of the Propositional Calculus -- IV Predicate Calculus -- V First-Order Mathematics -- VI Zermelo-Fraenkel Set Theory -- VII Ultraproducts -- VIII Non-Standard Models
-- IX Turing Machines and Gödel Numbers -- X Hilbert’s Tenth Problem, Word Problems -- References and Further Reading -- Index of Notations
ISBN:9781475744897
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Graduate Texts in Mathematics: 22
Keywords: Mathematics , Algebra , Mathematical logic , Mathematics , Mathematical Logic and Foundations , Algebra
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:LB2367.4.O34::2014:V1 Show nearby items on shelf
Title:Official GRE quantitative reasoning practice questions
Author(s): Educational Testing Service
Date:2014
Publisher:New York : McGraw Hill Education
Size:340 p
Contents:Overview of the GRE quantitative reasoning measure -- Text content -- Arithmetic -- Algebra -- Geometry -- Data analysis -- Mixed practice sets -- Appendix A. GRE math review -- Appendix B. Mathematical conventions for the quantitative reasoning mea sure of the GRE revised general test.
ISBN:9780071834322
Keywords: Educational tests and measurements , Graduate Record Examination , Mathematics , Word problems (Mathematics) , Universities and colleges examinations
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Location: MAIN

Return to the Fermilab Library catalog