Diskret matematik

This volume contains both invited lectures and contributed talks presented at the meeting on Total Positivity and its Applications held at the guest house of the University of Zaragoza in Jaca, Spain, during the week of September 26-30, 1994. There were present at the meeting almost fifty researchers from fourteen countries. Their interest in thesubject of Total Positivity made for a stimulating and fruitful exchange of scientific information. Interest to participate in the meeting exceeded our expectations. Regrettably, budgetary constraints forced us to restriet the number of attendees. Professor S. Karlin, of Stanford University, who planned to attend the meeting had to cancel his participation at the last moment. Nonetheless, his almost universal spiritual presence energized and inspired all of us in Jaca. More than anyone, he influenced the content, style and quality of the presentations given at the meeting. Every article in these Proceedings (except some by Karlin hirnself) references his influential treatise Total Positivity, Volume I, Stanford University Press, 1968. Since its appearance, this book has intrigued and inspired the minds of many researchers (one of us, in his formative years, read the galley proofs and the other of us first doubted its value but then later became its totally committed disciple). All of us present at the meeting encourage Professor Karlin to return to the task of completing the anxiously awaited Volume 11 of Total Positivity.

Computers have stretched the limits of what is possible in mathematics. More: they have given rise to new fields of mathematical study; the analysis of new and traditional algorithms, the creation of new paradigms for implementing computational methods, the viewing of old techniques from a concrete algorithmic vantage point, to name but a few. Computational Algebra and Number Theory lies at the lively intersection of computer science and mathematics. It highlights the surprising width and depth of the field through examples drawn from current activity, ranging from category theory, graph theory and combinatorics, to more classical computational areas, such as group theory and number theory. Many of the papers in the book provide a survey of their topic, as well as a description of present research. Throughout the variety of mathematical and computational fields represented, the emphasis is placed on the common principles and the methods employed. Audience: Students, experts, and those performing current research in any of the topics mentioned above.

This book contains the courses given at the Third School on Statistical Physics and Cooperative Systems held at Santiago, Chile, from 14th to 18th December 1992. The main idea of this periodic school was to bring together scientists work- with recent trends in Statistical Physics. More precisely ing on subjects related related with non linear phenomena, dynamical systems, ergodic theory, cellular au- tomata, symbolic dynamics, large deviation theory and neural networks. Scientists working in these subjects come from several areas: mathematics, biology, physics, computer science, electrical engineering and artificial intelligence. Recently, a very important cross-fertilization has taken place with regard to the aforesaid scientific and technological disciplines, so as to give a new approach to the research whose common core remains in statistical physics. Each contribution is devoted to one or more of the previous subjects. In most cases they are structured as surveys, presenting at the same time an original point of view about the topic and showing mostly new results. The expository text of Fran

Random Generation of Trees is about a field on the crossroads between computer science, combinatorics and probability theory. Computer scientists need random generators for performance analysis, simulation, image synthesis, etc. In this context random generation of trees is of particular interest. The algorithms presented here are efficient and easy to code. Some aspects of Horton--Strahler numbers, programs written in C and pictures are presented in the appendices. The complexity analysis is done rigorously both in the worst and average cases. Random Generation of Trees is intended for students in computer science and applied mathematics as well as researchers interested in random generation.

This textbook illuminates the field of discrete mathematics with examples, theory, and applications of the discrete volume of a polytope. The authors have weaved a unifying thread through basic yet deep ideas in discrete geometry, combinatorics, and number theory. Because there is no other book that puts together all of these ideas in one place, this text is truly a service to the mathematical community. We encounter here a friendly invitation to the field of "e;counting integer points in polytopes,"e; also known as Ehrhart theory, and its various connections to elementary finite Fourier analysis, generating functions, the Frobenius coin-exchange problem, solid angles, magic squares, Dedekind sums, computational geometry, and more. With 250 exercises and open problems, the reader feels like an active participant, and the authors' engaging style encourages such participation. The many compelling pictures that accompany the proofs and examples add to the inviting style. This new edition will contain at least one new chapter, new exercises, many new references, corrections, important updates to the open problems, and some new, professionally done illustrationsFor teachers, this text is ideally suited as a capstone course for undergraduate students or as a compelling text in discrete mathematical topics for beginning graduate students. For scientists, this text can be utilized as a quick tooling device, especially for those who want a self-contained, easy-to-read introduction to these topics.

This book constitutes the refereed proceedings of the 23rd International Conference on Integer Programming and Combinatorial Optimization, IPCO 2022, held in Eindhoven, The Netherlands, in June 2022. The 33 full papers presented were carefully reviewed and selected from 93 submissions addressing key techniques of document analysis. IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting the latest results of theory and practice of the various aspects of discrete optimization.

This book constitutes the refereed proceedings of the 33rd International Workshop on Combinatorial Algorithms, IWOCA 2022, which took place as a hybrid event in Trier, Germany, during June 7-9, 2022.The 35 papers presented in these proceedings were carefully reviewed and selected from 86 submissions. They deal with diverse topics related to combinatorial algorithms, such as algorithms and data structures; algorithmic and combinatorical aspects of cryptography and information security; algorithmic game theory and complexity of games; approximation algorithms; complexity theory; combinatorics and graph theory; combinatorial generation, enumeration and counting; combinatorial optimization; combinatorics of words; computational biology; computational geometry; decompositions and combinatorial designs; distributed and network algorithms; experimental combinatorics; fine-grained complexity; graph algorithms and modelling with graphs; graph drawing and graph labelling; network theory and temporal graphs; quantum computing and algorithms for quantum computers; online algorithms; parameterized and exact algorithms; probabilistic andrandomized algorithms; and streaming algorithms.

This book is an introduction to the language and standard proof methods of mathematics. It is a bridge from the computational courses (such as calculus or differential equations) that students typically encounter in their first year of college to a more abstract outlook. It lays a foundation for more theoretical courses such as topology, analysis and abstract algebra.

Fundamentals of mathematics are presented in the two-volume set in an exciting and pedagogically sound way. The present volume examines the most important basic results in geometry and discrete mathematics, along with their proofs, and also their history. New: A chapter on discrete Morse theory and still more graph theory for solving further classical problems as the Travelling Salesman and Postman problem.