Дискретная математика
Математика
  • формат pdf
  • размер 5.86 МБ
  • добавлен 31 января 2012 г.
Gazeau J.-P., Ne?et?il N., Rovan B. (eds.) Physics and Theoretical Computer Science. From Numbers and Languages to (Quantum) Cryptography
Издательство IOS Press, 2007, -348 pp.

As a part of the NATO Security Through Science Programme, the goal of the Advanced Study Institute Physics and Computer Science was to reinforce the interface between physical sciences, theoretical computer science, and discrete mathematics.
No one can dispute the current importance of applied as well as theoretical Computer Science in the development and the practice of Physical Sciences. Physicists of course use computers in communication as well as in teaching tasks and research: software for symbolic calculus, data processing, programming, modeling and numerical simulations, leaing and teaching with the aid of computers.
On the other hand, and besides the fundamental role played by mathematics in physics, methods imported from computer science are of increasing importance in theoretical physics: algorithmics, symbolic calculus, non-standard numeration systems, algebraic combinatorics, automata, cryptography. Some of them, like numeration, tilings and their associated dynamical systems, algebraic combinatorics, have already played an important role in recent developments in physics, like those accompanying the emergence of new materials (e.g. quasicrystals, uncommensurate structures) or the research around quantum information and cryptography (entanglement), or yet around quantum spin systems and related questions of integrability, and more generally in statistical physics. The intersection of combinatorics and statistical physics has been an area of great activity over the past few years, fertilized by an exchange not only of techniques but of objectives. Spurred by computing theoreticians interested in approximation algorithms, statistical physicists and discrete mathematicians have overcome language problems and found a wealth of common ground in probabilistic and algebraic combinatorics. Close connections between percolation and random graphs, between graph morphisms and hard-constraint models, and between slow mixing and phase transition have led to new results and new perspectives. These connections can help in understanding typical, as opposed to extremal, behavior of combinatorial phenomena such as graph coloring and homomorphisms. Some of the topics of particular interest are: percolation, random coloring, mixing, homomorphisms from and to fixed graph, phase transitions, threshold phenomena.
Hence, this NATO ASI School was aimed at assembling theoretical physicists and specialists of theoretical informatics and discrete mathematics in order to lea more about recent developments in cryptography, algorithmics, symbolic calculus, nonstandard numeration systems, algebraic combinatorics, automata. which could reveal themselves to be of crucial interest in natural sciences. In tu, the School offered specialists in statistical physics or dynamical systems or in quantum information and quantum cryptography, or yet in new materials (e.g. quasicrystals, uncommensurate structures), the opportunity to describe aspects of their research in which new approaches imported from computer science are particularly needed.
Therefore, nearly 70 participants (students + lecturers + organizers), coming from 20 different countries (actually more than 25 nationalities), most of them being PhD students or in post-doctoral positions working in various fields, have attended courses given by 16 specialists in algorithmics, numeration systems, algebraic combinatorics, automata, languages, cryptography, quantum information, graphs and statistical mechanics. Generally, the lectures have been introductory and pedagogical. They perfectly complied with the objective of a real transmission of knowledge between the various communities attending the Institute.
During the ten working days of the School, a total of 40 hours was reserved for lectures, and two half days were devoted to short presentations (30 or 45 min) mainly by young researchers and PhD participants. Around 35 participants presented their own research on posters displayed during the whole duration of the School. The list of participants is given in the annex of this book.
Mathematical Aspects of Quantum Information Theory.
Dynamical Symmetry Approach to Entanglement.
Mathematics of Phase Transitions.
The Topology of Deterministic Chaos: Stretching, Squeezing and Linking.
Random Fractals.
Quasicrystals: Algebraic, Combinatorial and Geometrical Aspects.
Pisot Number System and Its Dual Tiling.
Non-Standard Number Representation: Computer Arithmetic, Beta-Numeration and Quasicrystals.
An Introduction to the Theory of Finite Transducers.
Generating Languages.
Basic Enumerative Combinatorics.
An Introduction to Noncommutative Symmetric Functions.
An Introduction to Combinatorial Hopf Algebras — Examples and Realizations.
Complex Networks: Deterministic Models.
Homomorphisms of Structures Concepts and Highlight.
Some Discrete Tools in Statistical Physics.
Похожие разделы
Смотрите также

Davis M.D., Weyuker E.J. Computability, Complexity, and Languages

  • формат djvu
  • размер 2.47 МБ
  • добавлен 24 октября 2011 г.
Издательство Academic Press, 1983, -435 pp. Theoretical computer science is the mathematical study of models of computation. As such, it originated in the 1930s, well before the existence of modern computers, in the work of the logicians Church, Godel, Kleene, Post, and Turing. This early work has had a profound influence on the practical and theoretical development of computer science. Not only has the Turing-machine model proved basic for theo...

Feil T., Krone J. Essential Discrete Math for Computer Science

  • формат pdf
  • размер 8.91 МБ
  • добавлен 19 января 2011 г.
Prentice Hall, 2002. - 216 Pages. This book introduces readers to the mathematics of computer science and prepares them for the math they will encounter in other college courses. It includes applications that are specific to computer science, helps learners to develop reasoning skills, and provides the fundamental mathematics necessary for computer scientists. Chapter topics include sets, functions and relations, Boolean algebra, natural numbers...

Hromkovi? J. Theoretical Computer Science. Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

  • формат djvu
  • размер 5.94 МБ
  • добавлен 31 января 2012 г.
Издательство Springer, 2004, -318 pp. This textbook is an introduction to theoretical computer science with a focus on the development of its algorithmic concepts. It is based on a substantially extended translation of the German textbook "Algorithmische Konzepte der Informatik" written for the first introductory course to theoretical fundamentals of computer science at the University of Aachen. The topics have been chosen to strike a balance be...

Ito M. Automata, Formal Languages and Algebraic Systems

  • формат pdf
  • размер 1.69 МБ
  • добавлен 18 октября 2011 г.
World Scientific Publishing Company, 2010. - 248 pages. This volume consists of papers selected from the presentations at the workshop and includes mainly recent developments in the fields of formal languages, automata theory and algebraic systems related to the theoretical computer science and informatics. It covers the areas such as automata and grammars, languages and codes, combinatorics on words, cryptosystems, logics and trees, Grobner ba...

McEvoy K., Tucker J.V. Theoretical Foundations of VLSI Design

  • формат djvu
  • размер 3.02 МБ
  • добавлен 02 февраля 2012 г.
Издательство Cambridge University Press, 1990, -443 pp. The development of VLSI fabrication technology has resulted in a wide range of new ideas for application specific hardware and computer architectures, and in an extensive set of significant new theoretical problems for the design of hardware. The design of hardware is a process of creating a device that realises an algorithm, and many of the problems are concerned with the nature of algorith...

McNaughton R. Elementary Computability, Formal Languages, and Automata

  • формат djvu
  • размер 3.4 МБ
  • добавлен 24 августа 2011 г.
Prentice Hall, 1982. - 417 Pages. This book is an introduction to theoretical computer science emphasizing two interrelated areas: the theory of computability (how to tell whether problems are algorithmically solvable) and the theory of formal languages (how to design and use special languages, as for algorithms). Automata (idealized computer devices) are used as precise models of computation in studies that have actual computers as their primar...

Paun G., Rozenberg G., Salomaa A. (eds.) Current Trends in Theoretical Computer Science. The Challenge of the New Century

  • формат pdf
  • размер 57.38 МБ
  • добавлен 31 января 2012 г.
Издательство World Scientific, 2004, -1317 pp. This book continues the tradition of two previous books Current Trends in Theoretical Computer Science, published by World Scientific Publishing Company in 1993 and 2001. We have been very impressed and encouraged by the exceptionally good reception of the two previous books. The positive comments received show that books of this nature are really needed. The book is based on columns and tutorials p...

Savage J.E. Models of Computation. Exploring the Power of Computing

  • формат pdf
  • размер 4.2 МБ
  • добавлен 28 октября 2011 г.
Издательство Addison-Wesley, 1998, -699 pp. Theoretical computer science treats any computational subject for which a good model can be created. Research on formal models of computation was initiated in the 1930s and 1940s by Turing, Post, Kleene, Church, and others. In the 1950s and 1960s programming languages, language translators, and operating systems were under development and therefore became both the subject and basis for a great deal of...

Scheinerman E.A. Mathematics: A Discrete Introduction

  • формат pdf
  • размер 21.56 МБ
  • добавлен 11 августа 2011 г.
Brooks Cole, 2005. - 592 pages. This book has two primary objectives: It teaches students fundamental concepts in discrete mathematics (from counting to basic cryptography to graph theory), and it teaches students proof-writing skills. With a wealth of learning aids and a clear presentation, the book teaches students not only how to write proofs, but how to think clearly and present cases logically beyond this course. Overall, this book is an i...

Singh A. Elements of Computation Theory

  • формат pdf
  • размер 4.5 МБ
  • добавлен 08 декабря 2011 г.
Издательство Springer, 2009, -428 pp. The foundation of computer science is built upon the following questions: What is an algorithm? What can be computed and what cannot be computed? What does it mean for a function to be computable? How does computational power depend upon programming constructs? Which algorithms can be considered feasible? For more than 70 years, computer scientists are searching for answers to such questions. Their inge...