SLIM21

Sort Order Display Format Items / Page  
 
  Click the serial number on the left to view the details of the item.
 #  AuthorTitleAccn#YearItem Type Claims
1 Damgaard, Poul Henrik New Developments in Quantum Field Theory I10475 2002 eBook  
2 Guttmann, A. J Polygons, Polyominoes and Polycubes I06967 2009 eBook  
3 Hall Jr., M Combinatorics I05139 1975 eBook  
4 Rival, Ivan Algorithms and Order I04761 1989 eBook  
5 Hahn, Gena Cycles and Rays I03556 1990 eBook  
6 Aigner, M Higher Combinatorics I02627 1977 eBook  
7 Hahn, Gena Graph Symmetry I02352 1997 eBook  
8 Pott, A Difference Sets, Sequences and their Correlation Properties I02043 1999 eBook  
9 Strobach, Peter Linear Prediction Theory I01472 1990 eBook  
10 Sauer, Norbert W Finite and Infinite Combinatorics in Sets and Logic I00234 1993 eBook  
(page:1 / 2) [#17]    Next Page   Last Page 

1.    
No image available
TitleNew Developments in Quantum Field Theory
Author(s)Damgaard, Poul Henrik;Jurkiewicz, Jerzy
PublicationNew York, NY, 1. Imprint: Springer 2. Springer US, 2002.
DescriptionIX, 364 p : online resource
Abstract NoteQuantum field theory is one of most central constructions in 20th century th- retical physics, and it continues to develop rapidly in many different directions. The aim of the workshop ???New Developments in Quantum Field Theory???, which was held in Zakopane, Poland, June 14-20, 1997, was to capture a broad selection of the most recent advances in this field. The conference was sponsored by the Scientific and - vironmental Affairs Division of NATO, as part of the Advanced Research Workshop series. This book contains the proceedings of that meeting. Major topics covered at the workshop include quantized theories of gravity, string theory, conformal field theory, cosmology, field theory approaches to critical phenomena and the renormalization group, matrix models, and field theory techniques applied to the theory of turbulence. One common theme at the conference was the use of large-Nmatrix models to obtain exact results in a variety of different disciplines. For example, it has been known for several years that by taking a suitable double-scaling limit, certain string theories (or two-dimensional quantum gravity coupled to matter) can be re-obtained from the large-Nexpansion of matrix models. There continues to be a large activity in this area of research, which was well reflected by talks given at our workshop. Remarkably, large- Nmatrix models have very recently ??? just a few months before our meeting ??? been shown to have yet another deep relation to string theory
ISBN,Price9780306470752
Keyword(s)1. COMBINATORICS 2. EBOOK 3. EBOOK - SPRINGER 4. MATHEMATICAL PHYSICS 5. Theoretical, Mathematical and Computational Physics
Item TypeeBook
Multi-Media Links
Please Click here for eBook
Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
I10475     On Shelf    

2.     
No image available
TitlePolygons, Polyominoes and Polycubes
Author(s)Guttmann, A. J
PublicationDordrecht, 1. Imprint: Springer 2. Springer Netherlands, 2009.
DescriptionXIX, 490 p : online resource
Abstract NoteThis unique book gives a comprehensive account of new mathematical tools used to solve polygon problems. In the 20th and 21st centuries, many problems in mathematics, theoretical physics and theoretical chemistry ??? and more recently in molecular biology and bio-informatics ??? can be expressed as counting problems, in which specified graphs, or shapes, are counted. One very special class of shapes is that of polygons. These are closed, connected paths in space. We usually sketch them in two-dimensions, but they can exist in any dimension. The typical questions asked include "how many are there of a given perimeter?", "how big is the average polygon of given perimeter?", and corresponding questions about the area or volume enclosed. That is to say "how many enclosing a given area?" and "how large is an average polygon of given area?" Simple though these questions are to pose, they are extraordinarily difficult to answer. They are important questions because of the application of polygon, and the related problems of polyomino and polycube counting, to phenomena occurring in the natural world, and also because the study of these problems has been responsible for the development of powerful new techniques in mathematics and mathematical physics, as well as in computer science. These new techniques then find application more broadly. The book brings together chapters from many of the major contributors in the field. An introductory chapter giving the history of the problem is followed by fourteen further chapters describing particular aspects of the problem, and applications to biology, to surface phenomena and to computer enumeration methods
ISBN,Price9781402099274
Keyword(s)1. ALGORITHMS 2. Chemometrics 3. COMBINATORICS 4. COMPLEX SYSTEMS 5. DYNAMICAL SYSTEMS 6. EBOOK 7. EBOOK - SPRINGER 8. Math. Applications in Chemistry 9. Mathematical Methods in Physics 10. Numeric Computing 11. NUMERICAL ANALYSIS 12. PHYSICS 13. STATISTICAL PHYSICS
Item TypeeBook
Multi-Media Links
Please Click here for eBook
Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
I06967     On Shelf    

3.     
No image available
TitleCombinatorics : Proceedings of the NATO Advanced Study Institute held at Nijenrode Castle, Breukelen, The Netherlands 8???20 July 1974
Author(s)Hall Jr., M;van Lint, J.H
PublicationDordrecht, 1. Imprint: Springer 2. Springer Netherlands, 1975.
DescriptionVIII, 482 p : online resource
Abstract NoteCombinatorics has come of age. It had its beginnings in a number of puzzles which have still not lost their charm. Among these are EULER'S problem of the 36 officers and the KONIGSBERG bridge problem, BACHET's problem of the weights, and the Reverend T.P. KIRKMAN'S problem of the schoolgirls. Many of the topics treated in ROUSE BALL'S Recreational Mathe?? matics belong to combinatorial theory. All of this has now changed. The solution of the puzzles has led to a large and sophisticated theory with many complex ramifications. And it seems probable that the four color problem will only be solved in terms of as yet undiscovered deep results in graph theory. Combinatorics and the theory of numbers have much in common. In both theories there are many prob?? lems which are easy to state in terms understandable by the layman, but whose solution depends on complicated and abstruse methods. And there are now interconnections between these theories in terms of which each enriches the other. Combinatorics includes a diversity of topics which do however have interrelations in superficially unexpected ways. The instructional lectures included in these proceedings have been divided into six major areas: 1. Theory of designs; 2. Graph theory; 3. Combinatorial group theory; 4. Finite geometry; 5. Foundations, partitions and combinatorial geometry; 6. Coding theory. They are designed to give an overview of the classical foundations of the subjects treated and also some indication of the present frontiers of research
ISBN,Price9789401018265
Keyword(s)1. COMBINATORICS 2. EBOOK 3. EBOOK - SPRINGER
Item TypeeBook
Multi-Media Links
Please Click here for eBook
Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
I05139     On Shelf    

4.     
No image available
TitleAlgorithms and Order
Author(s)Rival, Ivan
PublicationDordrecht, 1. Imprint: Springer 2. Springer Netherlands, 1989.
DescriptionX, 498 p : online resource
Abstract NoteThis volume contains the texts of the principal survey papers presented at ALGORITHMS -and ORDER, held?? at Ottawa, Canada from June 1 to June 12, 1987. The conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the University of Ottawa, and the Natural Sciences and Engineering Research Council of Canada. We are grateful for this considerable support. Over fifty years ago, the Symposium on Lattice Theory, in Charlottesville, U.S.A., proclaimed the vitality of ordered sets. Only twenty years later the Symposium on Partially Ordered Sets and Lattice Theory, held at Monterey, U.S.A., had solved many of the problems that had been originally posed. In 1981, the Symposium on Ordered Sets held at Banff, Canada, continued this tradition. It was marked by a landmark volume containing twenty-three articles on almost all current topics in the theory of ordered sets and its applications. Three years after, Graphs and Orders, also held at Banff, Canada, aimed to document the role of graphs in the theory of ordered sets and its applications. Because of its special place in the landscape of the mathematical sciences order is especially sensitive to new trends and developments. Today, the most important current in the theory and application of order springs from theoretical computer seience. Two themes of computer science lead the way. The first is data structure. Order is common to data structures
ISBN,Price9789400926394
Keyword(s)1. COMBINATORICS 2. COMPUTER PROGRAMMING 3. EBOOK 4. EBOOK - SPRINGER 5. Neurology 6. Neurology?? 7. Pediatrics 8. Programming Techniques
Item TypeeBook
Multi-Media Links
Please Click here for eBook
Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
I04761     On Shelf    

5.     
No image available
TitleCycles and Rays
Author(s)Hahn, Gena;Sabidussi, Gert;Woodrow, R.E
PublicationDordrecht, 1. Imprint: Springer 2. Springer Netherlands, 1990.
Description276 p : online resource
Abstract NoteWhat is the "archetypal" image that comes to mind when one thinks of an infinite graph? What with a finite graph - when it is thought of as opposed to an infinite one? What structural elements are typical for either - by their presence or absence - yet provide a common ground for both? In planning the workshop on "Cycles and Rays" it had been intended from the outset to bring infinite graphs to the fore as much as possible. There never had been a graph theoretical meeting in which infinite graphs were more than "also rans", let alone one in which they were a central theme. In part, this is a matter of fashion, inasmuch as they are perceived as not readily lending themselves to applications, in part it is a matter of psychology stemming from the insecurity that many graph theorists feel in the face of set theory - on which infinite graph theory relies to a considerable extent. The result is that by and large, infinite graph theorists know what is happening in finite graphs but not conversely. Lack of knowledge about infinite graph theory can also be found in authoritative l sources. For example, a recent edition (1987) of a major mathematical encyclopaedia proposes to ". . . restrict [itself] to finite graphs, since only they give a typical theory". If anything, the reverse is true, and needless to say, the graph theoretical world knows better. One may wonder, however, by how much
ISBN,Price9789400905177
Keyword(s)1. COMBINATORICS 2. COMPUTERS 3. EBOOK 4. EBOOK - SPRINGER 5. PROBABILITIES 6. Probability Theory and Stochastic Processes 7. Theory of Computation
Item TypeeBook
Multi-Media Links
Please Click here for eBook
Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
I03556     On Shelf    

6.     
No image available
TitleHigher Combinatorics : Proceedings of the NATO Advanced Study Institute held in Berlin (West Germany), September 1???10, 1976
Author(s)Aigner, M
PublicationDordrecht, 1. Imprint: Springer 2. Springer Netherlands, 1977.
DescriptionXIII, 256 p : online resource
Abstract NoteIt is general consensus that Combinatorics has developed into a full-fledged mathematical discipline whose beginnings as a charming pastime have long since been left behind and whose great signifi?? cance for other branches of both pure and applied mathematics is only beginning to be realized. The last ten years have witnessed a tremendous outburst of activity both in relatively new fields such as Coding Theory and the Theory of Matroids as well as in' more time honored endeavors such as Generating Functions and the Inver?? sion Calculus. Although the number of text books on these subjects is slowly increasing, there is also a great need for up-to-date surveys of the main lines of research designed to aid the beginner and serve as a reference for the expert. It was the aim of the Advanced Study Institute "Higher Combinatorics" in Berlin, 1976, to help fulfill this need. There were five sections: I. Counting Theory, II. Combinatorial Set Theory and Order Theory, III. Matroids, IV. Designs and V. Groups and Coding Theory, with three principal lecturers in each section. Expanded versions of most lectures form the contents of this book. The Institute was designed to offer, especially to young researchers, a comprehen?? sive picture of the most interesting developments currently under way. It is hoped that these proceedings will serve the same purpose for a wider audience
ISBN,Price9789401012201
Keyword(s)1. COMBINATORICS 2. EBOOK 3. EBOOK - SPRINGER
Item TypeeBook
Multi-Media Links
Please Click here for eBook
Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
I02627     On Shelf    

7.     
No image available
TitleGraph Symmetry : Algebraic Methods and Applications
Author(s)Hahn, Gena;Sabidussi, Gert
PublicationDordrecht, 1. Imprint: Springer 2. Springer Netherlands, 1997.
DescriptionXX, 418 p : online resource
Abstract NoteThe last decade has seen two parallel developments, one in computer science, the other in mathematics, both dealing with the same kind of combinatorial structures: networks with strong symmetry properties or, in graph-theoretical language, vertex-transitive graphs, in particular their prototypical examples, Cayley graphs. In the design of large interconnection networks it was realised that many of the most fre?? quently used models for such networks are Cayley graphs of various well-known groups. This has spawned a considerable amount of activity in the study of the combinatorial properties of such graphs. A number of symposia and congresses (such as the bi-annual IWIN, starting in 1991) bear witness to the interest of the computer science community in this subject. On the mathematical side, and independently of any interest in applications, progress in group theory has made it possible to make a realistic attempt at a complete description of vertex-transitive graphs. The classification of the finite simple groups has played an important role in this respect
ISBN,Price9789401589376
Keyword(s)1. COMBINATORICS 2. Computer Communication Networks 3. Computer communication systems 4. Computer science???Mathematics 5. DISCRETE MATHEMATICS 6. Discrete Mathematics in Computer Science 7. EBOOK 8. EBOOK - SPRINGER 9. GROUP THEORY 10. Group Theory and Generalizations 11. MICROPROCESSORS 12. Processor Architectures
Item TypeeBook
Multi-Media Links
Please Click here for eBook
Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
I02352     On Shelf    

8.     
No image available
TitleDifference Sets, Sequences and their Correlation Properties
Author(s)Pott, A;Kumar, P. Vijay;Helleseth, Tor;Jungnickel, Dieter
PublicationDordrecht, 1. Imprint: Springer 2. Springer Netherlands, 1999.
DescriptionVIII, 448 p. 7 illus : online resource
Abstract NoteThe explanation of the formal duality of Kerdock and Preparata codes is one of the outstanding results in the field of applied algebra in the last few years. This result is related to the discovery of large sets of quad?? riphase sequences over Z4 whose correlation properties are better than those of the best binary sequences. Moreover, the correlation properties of sequences are closely related to difference properties of certain sets in (cyclic) groups. It is the purpose of this book to illustrate the connection between these three topics. Most articles grew out of lectures given at the NATO Ad?? vanced Study Institute on "Difference sets, sequences and their correlation properties". This workshop took place in Bad Windsheim (Germany) in August 1998. The editors thank the NATO Scientific Affairs Division for the generous support of this workshop. Without this support, the present collection of articles would not have been realized
ISBN,Price9789401144599
Keyword(s)1. ALGEBRA 2. COMBINATORICS 3. Computer science???Mathematics 4. Discrete Mathematics in Computer Science 5. EBOOK 6. EBOOK - SPRINGER 7. ELECTRICAL ENGINEERING 8. Field theory (Physics) 9. Field Theory and Polynomials 10. IMAGE PROCESSING 11. SIGNAL PROCESSING 12. Signal, Image and Speech Processing 13. Speech processing systems
Item TypeeBook
Multi-Media Links
Please Click here for eBook
Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
I02043     On Shelf    

9.     
No image available
TitleLinear Prediction Theory : A Mathematical Basis for Adaptive Systems
Author(s)Strobach, Peter
PublicationBerlin, Heidelberg, 1. Imprint: Springer 2. Springer Berlin Heidelberg, 1990.
DescriptionXVI, 422 p : online resource
Abstract NoteLnear prediction theory and the related algorithms have matured to the point where they now form an integral part of many real-world adaptive systems. When it is necessary to extract information from a random process, we are frequently faced with the problem of analyzing and solving special systems of linear equations. In the general case these systems are overdetermined and may be characterized by additional properties, such as update and shift-invariance properties. Usually, one employs exact or approximate least-squares methods to solve the resulting class of linear equations. Mainly during the last decade, researchers in various fields have contributed techniques and nomenclature for this type of least-squares problem. This body of methods now constitutes what we call the theory of linear prediction. The immense interest that it has aroused clearly emerges from recent advances in processor technology, which provide the means to implement linear prediction algorithms, and to operate them in real time. The practical effect is the occurrence of a new class of high-performance adaptive systems for control, communications and system identification applications. This monograph presumes a background in discrete-time digital signal processing, including Z-transforms, and a basic knowledge of discrete-time random processes. One of the difficulties I have en?? countered while writing this book is that many engineers and computer scientists lack knowledge of fundamental mathematics and geometry
ISBN,Price9783642752063
Keyword(s)1. APPLIED MATHEMATICS 2. CALCULUS OF VARIATIONS 3. Calculus of Variations and Optimal Control; Optimization 4. COMBINATORICS 5. EBOOK 6. EBOOK - SPRINGER 7. ENGINEERING MATHEMATICS 8. Mathematical and Computational Engineering 9. Mathematical Methods in Physics 10. Numerical and Computational Physics, Simulation 11. PHYSICS 12. SYSTEM THEORY 13. Systems Theory, Control
Item TypeeBook
Multi-Media Links
Please Click here for eBook
Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
I01472     On Shelf    

10.    
No image available
TitleFinite and Infinite Combinatorics in Sets and Logic
Author(s)Sauer, Norbert W;Woodrow, R.E;Sands, B
PublicationDordrecht, 1. Imprint: Springer 2. Springer Netherlands, 1993.
DescriptionXVII, 453 p : online resource
Abstract NoteThis volume contains the accounts of papers delivered at the Nato Advanced Study Institute on Finite and Infinite Combinatorics in Sets and Logic held at the Banff Centre, Alberta, Canada from April 21 to May 4, 1991. As the title suggests the meeting brought together workers interested in the interplay between finite and infinite combinatorics, set theory, graph theory and logic. It used to be that infinite set theory, finite combinatorics and logic could be viewed as quite separate and independent subjects. But more and more those disciplines grow together and become interdependent of each other with ever more problems and results appearing which concern all of those disciplines. I appreciate the financial support which was provided by the N. A. T. O. Advanced Study Institute programme, the Natural Sciences and Engineering Research Council of Canada and the Department of Mathematics and Statistics of the University of Calgary. 11l'te meeting on Finite and Infinite Combinatorics in Sets and Logic followed two other meetings on discrete mathematics held in Banff, the Symposium on Ordered Sets in 1981 and the Symposium on Graphs and Order in 1984. The growing inter-relation between the different areas in discrete mathematics is maybe best illustrated by the fact that many of the participants who were present at the previous meetings also attended this meeting on Finite and Infinite Combinatorics in Sets and Logic
ISBN,Price9789401120807
Keyword(s)1. COMBINATORICS 2. Computer science???Mathematics 3. DISCRETE MATHEMATICS 4. Discrete Mathematics in Computer Science 5. EBOOK 6. EBOOK - SPRINGER 7. MATHEMATICAL LOGIC 8. Mathematical Logic and Foundations 9. MATHEMATICS 10. Mathematics, general
Item TypeeBook
Multi-Media Links
Please Click here for eBook
Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
I00234     On Shelf    

(page:1 / 2) [#17]    Next Page   Last Page