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 Yeats, Karen A Combinatorial Perspective on Quantum Field Theory I10034 2017 eBook  
2 Vourdas, Apostolos Finite and Profinite Quantum Systems I09755 2017 eBook  
3 Adamatzky, Andrew Cellular Automata I08961 2018 eBook  
4 Hahn, Gena Graph Symmetry I02352 1997 eBook  
5 Sauer, Norbert W Finite and Infinite Combinatorics in Sets and Logic I00234 1993 eBook  
6 Arthur Knoebel Mathematical master pieces: Further chronicles by the explorers 023026 2007 Book  
7 JOHNSON, NORMAN L. Discrete multivariate distributions 020010 2004 Book  
8 Steven Skiena Implementing discreet mathematics: Combinatorics and graph theory with mathematica 003765 1990 Book  
9 JOHNSONBAUGH , RICHARD. Discrete mathematics 002688 1989 Book  
10 Angela B. Shiflet Discrete mathematics for computer science 002589 1987 Book  
(page:1 / 2) [#14]    Next Page   Last Page 

1.    
No image available
TitleA Combinatorial Perspective on Quantum Field Theory
Author(s)Yeats, Karen
PublicationCham, 1. Imprint: Springer 2. Springer International Publishing, 2017.
DescriptionIX, 120 p. 16 illus : online resource
Abstract NoteThis book explores combinatorial problems and insights in quantum field theory. It is not comprehensive, but rather takes a tour, shaped by the author???s biases, through some of the important ways that a combinatorial perspective can be brought to bear on quantum field theory. Among the outcomes are both physical insights and interesting mathematics. The book begins by thinking of perturbative expansions as kinds of generating functions and then introduces renormalization Hopf algebras. The remainder is broken into two parts. The first part looks at Dyson-Schwinger equations, stepping gradually from the purely combinatorial to the more physical. The second part looks at Feynman graphs and their periods. The flavour of the book will appeal to mathematicians with a combinatorics background as well as mathematical physicists and other mathematicians
ISBN,Price9783319475516
Keyword(s)1. DISCRETE MATHEMATICS 2. EBOOK 3. EBOOK - SPRINGER 4. MATHEMATICAL PHYSICS 5. Quantum Field Theories, String Theory 6. QUANTUM FIELD THEORY 7. STRING THEORY
Item TypeeBook
Multi-Media Links
Please Click here for eBook
Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
I10034     On Shelf    

2.     
No image available
TitleFinite and Profinite Quantum Systems
Author(s)Vourdas, Apostolos
PublicationCham, 1. Imprint: Springer 2. Springer International Publishing, 2017.
DescriptionXIII, 196 p. 7 illus., 4 illus. in color : online resource
Abstract NoteThis monograph provides an introduction to finite quantum systems, a field at the interface between quantum information and number theory, with applications in quantum computation and condensed matter physics. The first major part of this monograph studies the so-called `qubits' and `qudits', systems with periodic finite lattice as position space. It also discusses the so-called mutually unbiased bases, which have applications in quantum information and quantum cryptography. Quantum logic and its applications to quantum gates is also studied. The second part studies finite quantum systems, where the position takes values in a Galois field. This combines quantum mechanics with Galois theory. The third part extends the discussion to quantum systems with variables in profinite groups, considering the limit where the dimension of the system becomes very large. It uses the concepts of inverse and direct limit and studies quantum mechanics on p-adic numbers. Applications of the formalism include quantum optics and quantum computing, two-dimensional electron systems in magnetic fields and the magnetic translation group, the quantum Hall effect, other areas in condensed matter physics, and Fast Fourier Transforms. The monograph combines ideas from quantum mechanics with discrete mathematics, algebra, and number theory. It is suitable for graduate students and researchers in quantum physics, mathematics and computer science
ISBN,Price9783319594958
Keyword(s)1. DISCRETE MATHEMATICS 2. EBOOK 3. EBOOK - SPRINGER 4. MATHEMATICAL PHYSICS 5. QUANTUM COMPUTERS 6. Quantum computing 7. QUANTUM OPTICS 8. QUANTUM PHYSICS
Item TypeeBook
Multi-Media Links
Please Click here for eBook
Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
I09755     On Shelf    

3.     
No image available
TitleCellular Automata : A Volume in the Encyclopedia of Complexity and Systems Science, Second Edition
Author(s)Adamatzky, Andrew
PublicationNew York, NY, 1. Imprint: Springer 2. Springer US, 2018.
Description425 illus., 190 illus. in color. eReference : online resource
Abstract NoteThis volume of the Encyclopedia of Complexity and Systems Science, Second Edition, provides an authoritative introduction and overview of the latest research in cellular automata (CA) models of physical systems, emergent phenomena, computational universality, chaos, growth phenomena, phase transitions, self-organised criticality, reaction-diffusion systems, self-replications, parallel computation, and more. Fundamental topics of algorithmic complexity, algebraic groups, language theory, evolving CA, ergodic theory, synchronisation, tiling problems and undecidability and topological dynamics of CA are addressed. Cellular automata are regular uniform networks of locally-connected finite-state machines, and represent discrete systems with non-trivial behavior, including waves, patterns and travelling localisations. CA are ubiquitous: they are mathematical models of computation and computer models of natural systems. Classes of CA presented in this book include additive CA, automata in hyperbolic spaces and non-compact spaces, CA in triangular, pentagonal and hexagonal tessellations, automata with memory, quantum and reversible automata, structurally-dynamic CA, and asynchronous automata. Topics added to the second edition include: asynchronous cellular automata, stochastic cellular automata as models of reaction-diffusion processes, cellular automata hardware implementation, cellular automata basins of attraction, orbits of Bernoulli measures in cellular automata, and graphs related to reversibility and complexity in cellular. This state-of-the-art reference is unique in bringing together unequalled expertise of interdisciplinary studies at the edge of mathematics, computer science, and physics
ISBN,Price9781493987009
Keyword(s)1. APPLIED MATHEMATICS 2. COMPLEX SYSTEMS 3. Computation by Abstract Devices 4. Computer logic 5. Computer science???Mathematics 6. COMPUTERS 7. DISCRETE MATHEMATICS 8. Discrete Mathematics in Computer Science 9. DYNAMICAL SYSTEMS 10. EBOOK 11. EBOOK - SPRINGER 12. ENGINEERING MATHEMATICS 13. Logics and Meanings of Programs 14. Mathematical and Computational Engineering 15. STATISTICAL PHYSICS
Item TypeeBook
Multi-Media Links
Please Click here for eBook
Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
I08961     On Shelf    

4.     
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    

5.     
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    

6.     
No image available
TitleMathematical master pieces: Further chronicles by the explorers
Author(s)Arthur Knoebel;Reinhard Laubendacher;Jerry Lodder;David Pengelley
PublicationNew Delhi 2007.
Descriptionxii, 333p.
Abstract NoteThis book traces the historical development of four different mathematical concepts by presenting readers with the original sources. Although primary sources can be more demanding, the investment yields the rewards of a deeper understanding of the subject, an appreciation of the details, and a glimpse into the direction research has taken. Each chapter contains a different story, each anchored around a sequence of selected primary sources showcasing a masterpiece of mathematical achievement. The authors begin by studying the interplay between the discrete and continuous, with a focus on sums of powers. They proceed to the development of algorithms for finding numerical solutions of equations as developed by Newton, Simpson and Smale. Next they explore our modern understanding of curvature, with its roots in the emerging calculus of the 17th century, while the final chapter ends with an exploration of the elusive properties of prime numbers, and the patterns found therein. This book emerged from a course taught at New Mexico State University to juniors and seniors majoring in mathematics. The intended audience is juniors and seniors majoring in mathematics, as well as anyone pursuing independent study. The authors have included exercises, numerous historical photographs, and an annotated bibliography.
ISBN,Price9788184895421 : Rs. 595(PB)
Classification510(091)
Keyword(s)1. ALGORITHMS 2. CONTINUOUS MATHEMATICS 3. CURVATURE 4. DISCRETE MATHEMATICS 5. MATHEMATICS 6. NUMBER THEORY 7. PRIME NUMBERS
Item TypeBook

Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
023026   510(091)/KNO/023026  On Shelf    

+Copy Specific Information
7.     
No image available
TitleDiscrete multivariate distributions
Author(s)Norman L. Johnson;Samuel Kotz;N. Balakrishnan
PublicationNew York, John Wiley and Sons, 2004.
Description299p.
Series(Wiley series in probability and statistics)
ISBN,Price9812530746 : US $4.5
Classification519.224
Keyword(s)1. DISCRETE MATHEMATICS 2. DISTRIBUTION (PROBABILITY THEORY)
Item TypeBook

Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
020010   519.224/JON/020010  On Shelf    

+Copy Specific Information
8.     
No image available
TitleImplementing discreet mathematics: Combinatorics and graph theory with mathematica
Author(s)Steven Skiena
PublicationCalifornia, Addison-Wesley Pub. Co., 1990.
Description334pp.;Bib. pp. 301-317
Classification519.1:681.3.06MATHEMATICA
Keyword(s)1. COMBINATORICS 2. DISCRETE MATHEMATICS 3. GRAPH THEORY 4. MATHEMATICA - PROGRAMMING LANG 5. MATHEMATICA-PROGRAMMING LANGUA 6. PROGRAMMING LANGUAGE - MATHEMATICA
Item TypeBook

Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
003765   519.1:681.3.06MATHEMATICA/SKI/003765  On Shelf    

+Copy Specific Information
9.     
No image available
TitleDiscrete mathematics
Author(s)Richard Johnsonbaugh
PublicationNew York, Macmillan Publishing Company, 1989.
Descriptionvii,479p.
Classification519.1
Keyword(s)DISCRETE MATHEMATICS
Item TypeBook

Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
002688   519.1/JOH/002688  On Shelf    

+Copy Specific Information
10.    
No image available
TitleDiscrete mathematics for computer science
Author(s)Angela B. Shiflet
PublicationNew York, West Publishing Company, 1987.
Descriptionix,450p.
Classification519.1:681.3
Keyword(s)1. DISCRETE MATHEMATICS 2. ELECTRONIC DATA PROCESSING-MAT
Item TypeBook

Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
002589   519.1:681.3/SHI/002589  On Shelf    

+Copy Specific Information
(page:1 / 2) [#14]    Next Page   Last Page