Author: Ki Hang Kim
Publisher: World Scientific
ISBN: 9814490687
Category : Mathematics
Languages : en
Pages : 286
Book Description
This book describes and summarizes past work in important areas of combinatorics and computation, as well as gives directions for researchers working in these areas in the 21st century. It contains primarily survey papers and presents original research by Peter Fishburn, Jim Ho Kwak, Jaeun Lee, K H Kim, F W Roush and Susan Williams. The papers deal with some of the most exciting and promising developments in the areas of coding theory in relation to number theory, lattice theory and its applications, graph theory and its applications, topological techniques in combinatorics, symbolic dynamics and mathematical social science.
Combinatorial And Computational Mathematics: Present And Future
Author: Ki Hang Kim
Publisher: World Scientific
ISBN: 9814490687
Category : Mathematics
Languages : en
Pages : 286
Book Description
This book describes and summarizes past work in important areas of combinatorics and computation, as well as gives directions for researchers working in these areas in the 21st century. It contains primarily survey papers and presents original research by Peter Fishburn, Jim Ho Kwak, Jaeun Lee, K H Kim, F W Roush and Susan Williams. The papers deal with some of the most exciting and promising developments in the areas of coding theory in relation to number theory, lattice theory and its applications, graph theory and its applications, topological techniques in combinatorics, symbolic dynamics and mathematical social science.
Publisher: World Scientific
ISBN: 9814490687
Category : Mathematics
Languages : en
Pages : 286
Book Description
This book describes and summarizes past work in important areas of combinatorics and computation, as well as gives directions for researchers working in these areas in the 21st century. It contains primarily survey papers and presents original research by Peter Fishburn, Jim Ho Kwak, Jaeun Lee, K H Kim, F W Roush and Susan Williams. The papers deal with some of the most exciting and promising developments in the areas of coding theory in relation to number theory, lattice theory and its applications, graph theory and its applications, topological techniques in combinatorics, symbolic dynamics and mathematical social science.
Subgroup Growth
Author: Alexander Lubotzky
Publisher: Birkhäuser
ISBN: 3034889658
Category : Mathematics
Languages : en
Pages : 463
Book Description
Award-winning monograph of the Ferran Sunyer i Balaguer Prize 2001. Subgroup growth studies the distribution of subgroups of finite index in a group as a function of the index. In the last two decades this topic has developed into one of the most active areas of research in infinite group theory; this book is a systematic and comprehensive account of the substantial theory which has emerged. As well as determining the range of possible 'growth types', for finitely generated groups in general and for groups in particular classes such as linear groups, a main focus of the book is on the tight connection between the subgroup growth of a group and its algebraic structure. A wide range of mathematical disciplines play a significant role in this work: as well as various aspects of infinite group theory, these include finite simple groups and permutation groups, profinite groups, arithmetic groups and Strong Approximation, algebraic and analytic number theory, probability, and p-adic model theory. Relevant aspects of such topics are explained in self-contained 'windows'.
Publisher: Birkhäuser
ISBN: 3034889658
Category : Mathematics
Languages : en
Pages : 463
Book Description
Award-winning monograph of the Ferran Sunyer i Balaguer Prize 2001. Subgroup growth studies the distribution of subgroups of finite index in a group as a function of the index. In the last two decades this topic has developed into one of the most active areas of research in infinite group theory; this book is a systematic and comprehensive account of the substantial theory which has emerged. As well as determining the range of possible 'growth types', for finitely generated groups in general and for groups in particular classes such as linear groups, a main focus of the book is on the tight connection between the subgroup growth of a group and its algebraic structure. A wide range of mathematical disciplines play a significant role in this work: as well as various aspects of infinite group theory, these include finite simple groups and permutation groups, profinite groups, arithmetic groups and Strong Approximation, algebraic and analytic number theory, probability, and p-adic model theory. Relevant aspects of such topics are explained in self-contained 'windows'.
Mathematics of Quantum Computation and Quantum Technology
Author: Louis Kauffman
Publisher: CRC Press
ISBN: 1584889004
Category : Mathematics
Languages : en
Pages : 625
Book Description
Research and development in the pioneering field of quantum computing involve just about every facet of science and engineering, including the significant areas of mathematics and physics. Based on the firm understanding that mathematics and physics are equal partners in the continuing study of quantum science, Mathematics of Quantum Computation an
Publisher: CRC Press
ISBN: 1584889004
Category : Mathematics
Languages : en
Pages : 625
Book Description
Research and development in the pioneering field of quantum computing involve just about every facet of science and engineering, including the significant areas of mathematics and physics. Based on the firm understanding that mathematics and physics are equal partners in the continuing study of quantum science, Mathematics of Quantum Computation an
Graphs on Surfaces and Their Applications
Author: Sergei K. Lando
Publisher: Springer Science & Business Media
ISBN: 3540383611
Category : Mathematics
Languages : en
Pages : 463
Book Description
Graphs drawn on two-dimensional surfaces have always attracted researchers by their beauty and by the variety of difficult questions to which they give rise. The theory of such embedded graphs, which long seemed rather isolated, has witnessed the appearance of entirely unexpected new applications in recent decades, ranging from Galois theory to quantum gravity models, and has become a kind of a focus of a vast field of research. The book provides an accessible introduction to this new domain, including such topics as coverings of Riemann surfaces, the Galois group action on embedded graphs (Grothendieck's theory of "dessins d'enfants"), the matrix integral method, moduli spaces of curves, the topology of meromorphic functions, and combinatorial aspects of Vassiliev's knot invariants and, in an appendix by Don Zagier, the use of finite group representation theory. The presentation is concrete throughout, with numerous figures, examples (including computer calculations) and exercises, and should appeal to both graduate students and researchers.
Publisher: Springer Science & Business Media
ISBN: 3540383611
Category : Mathematics
Languages : en
Pages : 463
Book Description
Graphs drawn on two-dimensional surfaces have always attracted researchers by their beauty and by the variety of difficult questions to which they give rise. The theory of such embedded graphs, which long seemed rather isolated, has witnessed the appearance of entirely unexpected new applications in recent decades, ranging from Galois theory to quantum gravity models, and has become a kind of a focus of a vast field of research. The book provides an accessible introduction to this new domain, including such topics as coverings of Riemann surfaces, the Galois group action on embedded graphs (Grothendieck's theory of "dessins d'enfants"), the matrix integral method, moduli spaces of curves, the topology of meromorphic functions, and combinatorial aspects of Vassiliev's knot invariants and, in an appendix by Don Zagier, the use of finite group representation theory. The presentation is concrete throughout, with numerous figures, examples (including computer calculations) and exercises, and should appeal to both graduate students and researchers.
A New Kind of Science
Author: Stephen Wolfram
Publisher: Wolfram Media
ISBN: 9781579550257
Category :
Languages : en
Pages : 1193
Book Description
NOW IN PAPERBACK"€"Starting from a collection of simple computer experiments"€"illustrated in the book by striking computer graphics"€"Stephen Wolfram shows how their unexpected results force a whole new way of looking at the operation of our universe.
Publisher: Wolfram Media
ISBN: 9781579550257
Category :
Languages : en
Pages : 1193
Book Description
NOW IN PAPERBACK"€"Starting from a collection of simple computer experiments"€"illustrated in the book by striking computer graphics"€"Stephen Wolfram shows how their unexpected results force a whole new way of looking at the operation of our universe.
Computing and Combinatorics
Author: Yong Zhang
Publisher: Springer Nature
ISBN: 3031221052
Category : Computers
Languages : en
Pages : 600
Book Description
Chapter(s) “Chapter Name or No.” is/are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
Publisher: Springer Nature
ISBN: 3031221052
Category : Computers
Languages : en
Pages : 600
Book Description
Chapter(s) “Chapter Name or No.” is/are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
Mathematics and Computation
Author: Avi Wigderson
Publisher: Princeton University Press
ISBN: 0691189137
Category : Computers
Languages : en
Pages : 434
Book Description
From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography
Publisher: Princeton University Press
ISBN: 0691189137
Category : Computers
Languages : en
Pages : 434
Book Description
From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography
Computing and Combinatorics
Author: Donghyun Kim
Publisher: Springer Nature
ISBN: 3030581500
Category : Computers
Languages : en
Pages : 691
Book Description
This book constitutes the proceedings of the 26th International Conference on Computing and Combinatorics, COCOON 2020, held in Atlanta, GA, USA, in August 2020. Due to the COVID-19 pandemic COCOON 2020 was organized as a fully online conference. The 54 papers presented in this volume were carefully reviewed and selected from 126 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory.
Publisher: Springer Nature
ISBN: 3030581500
Category : Computers
Languages : en
Pages : 691
Book Description
This book constitutes the proceedings of the 26th International Conference on Computing and Combinatorics, COCOON 2020, held in Atlanta, GA, USA, in August 2020. Due to the COVID-19 pandemic COCOON 2020 was organized as a fully online conference. The 54 papers presented in this volume were carefully reviewed and selected from 126 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory.
Analytic Combinatorics
Author: Philippe Flajolet
Publisher: Cambridge University Press
ISBN: 1139477161
Category : Mathematics
Languages : en
Pages : 825
Book Description
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.
Publisher: Cambridge University Press
ISBN: 1139477161
Category : Mathematics
Languages : en
Pages : 825
Book Description
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.
NBS Special Publication
Author:
Publisher:
ISBN:
Category : Weights and measures
Languages : en
Pages : 398
Book Description
Publisher:
ISBN:
Category : Weights and measures
Languages : en
Pages : 398
Book Description