Diskrete und kontinuierliche Methoden der mathematischen Optimierung werden in diesem Lehrbuch integriert behandelt. Nach einer Einfuhrung werden konvexe Mengen (mit einer Anwendung auf notwendige Optimalitatsbedingungen bei Ungleichungsrestriktionen) behandelt, gefolgt von einer genaueren Betrachtung des Spezialfalls von Polyedern und dessen Zusammenhang zum Linearen Programmieren. Eine ausfuhrliche Darstellung des Simplexverfahrens schliesst diesen Teil ab. Danach wird die Konvexitat von Funktionen (inklusive einiger Abschwachungen) untersucht und fur ein grundliches Studium von Optimalitatskriterien sowie der Lagrange-Dualitat verwendet. Schliesslich folgen noch ein Ausblick auf allgemeine Algorithmen sowie ein kurzer Anhang zur affinen Geometrie. In der Neuauflage ist Anordnung und Darstellung des behandelten Stoffs nochmals grundlich im Sinne der aktuellen BA-Studiengange Mathematik, Wirtschaftswissenschaften und Informatik uberarbeitet worden.

The theory of lattices, initiated by Dedekind in the past centu- ry, and revived in the thirties by Garrett Birkhoff, F. Klein-Barmen, ore, and von Neumann, is only in our time coming into its own. The fledgling theory was handicapped by a contingent historical circumstance. The peculiarities of mathematical personality of the founders made lattice theory less welcome to the mathematical public of the time than it otherwise might have been. Thus Dedekind was wi- dely thought in his time to be far too abstract for his own good, and some of his peers, notably Kronecker, did not hesitate to state their loud and clear disapproval. Later on, the tempers of Garrett Birkhoff and John von Neumann clashed with those of some of the "mainstream"' mathematicians of their time. Norman Levinson once related to me the following anecdote about von Neumann. Invited to deliver the weekly mathematics colloquium at Harvard sometime in the thirties, he chose the subject of his current interest, namely, continuous geometries. At the end of the lecture, as the public was streaming out, G. H. Hardy, who was at the time visiting Cambridge, was overheard whispering to G. D. Birkhoff (Gar- rett's father): "He is quite clearly a very brilliant man, but why does he waste his time on this stuff?" I myself, when still an assistant professor, was once stopped in the hall of M. I. T.

Who first presented Pascal's triangle? (It was not Pascal.) Who first presented Hamiltonian graphs? (It was not Hamilton.) Who first presented Steiner triple systems? (It was not Steiner.) The history of mathematics is a well-studied and vibrant area of research, with books and scholarly articles published on various aspects of the subject. Yet, the history of combinatorics seems to have been largely overlooked. This book goes some way to redress this and serves two main purposes: 1) it constitutes the first book-length survey of the history of combinatorics; and 2) it assembles, for the first time in a single source, researches on the history of combinatorics that would otherwise be inaccessible to the general reader. Individual chapters have been contributed by sixteen experts. The book opens with an introduction by Donald E. Knuth to two thousand years of combinatorics. This is followed by seven chapters on early combinatorics, leading from Indian and Chinese writings on permutations to late-Renaissance publications on the arithmetical triangle. The next seven chapters trace the subsequent story, from Euler's contributions to such wide-ranging topics as partitions, polyhedra, and latin squares to the 20th century advances in combinatorial set theory, enumeration, and graph theory. The book concludes with some combinatorial reflections by the distinguished combinatorialist, Peter J. Cameron. This book is not expected to be read from cover to cover, although it can be. Rather, it aims to serve as a valuable resource to a variety of audiences. Combinatorialists with little or no knowledge about the development of their subject will find the historical treatment stimulating. A historian of mathematics will view its assorted surveys as an encouragement for further research in combinatorics. The more general reader will discover an introduction to a fascinating and too little known subject that continues to stimulate and inspire the work of scholars today.

Introducing the reader to the mathematics beyond complex networked systems, these lecture notes investigate graph theory, graphical models, and methods from statistical physics. Complex networked systems play a fundamental role in our society, both in everyday life and in scientific research, with applications ranging from physics and biology to economics and finance. The book is self-contained, and requires only an undergraduate mathematical background.

This is the first book to focus on the topological index, the Harary index, of a graph, including its mathematical properties, chemical applications and some related and attractive open problems. This book is dedicated to Professor Frank Harary (1921-2005), the grandmaster of graph theory and its applications. It has be written by experts in the field of graph theory and its applications. For a connected graph G, as an important distance-based topological index, the Harary index H(G) is defined as the sum of the reciprocals of the distance between any two unordered vertices of the graph G. In this book, the authors report on the newest results on the Harary index of a graph. These results mainly concern external graphs with respect to the Harary index; the relations to other topological indices; its properties and applications to pure graph theory and chemical graph theory; and two significant variants, i.e., additively and multiplicatively weighted Harary indices. In the last chapter, we present a number of open problems related to the Harary index. As such, the book will not only be of interest to graph researchers, but to mathematical chemists as well.

This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics. An overview of graph theory definitions and polynomial invariants for graphs prepares the reader for the subsequent dive into the applications of graph theory. To pique the reader's interest in areas of possible exploration, recent results in mathematics appear throughout the book, accompanied with examples of related graphs, how they arise, and what their valuable uses are. The consequences of graph theory covered by the authors are complicated and far-reaching, so topics are always exhibited in a user-friendly manner with copious graphs, exercises, and Sage code for the computation of equations. Samples of the book's source code can be found at github.com/springer-math/adventures-in-graph-theory. The text is geared towards advanced undergraduate and graduate students and is particularly useful for those trying to decide what type of problem to tackle for their dissertation. This book can also serve as a reference for anyone interested in exploring how they can apply graph theory to other parts of mathematics.

Dieser Band dokumentiert ein Kolloquium mit dem Titel "Informatik im Kreuzungspunkt von Numerischer Mathematik, Rechnerentwurf, Programmierung, Algebra und Logik". Es fand im 14. Juni 1989 an der Bayerischen Akademie der Wissenschaften anlasslich des 65. Geburtstags von Herrn Prof. Dr. Dr. h.c. mult. Friedrich L. Bauer statt, dem die Informatik von Anfang an entscheidende Impulse verdankt. Die Beitrage spannen ein breites Themenspektrum auf, das durch die Dichte der Zusammenhange fasziniert. Mehrere Jahrzehnte der Entwicklung der Informatik haben gezeigt, wie eng Fragestellungen der Numerik, des Rechnerentwurfs, aber auch Fragen der Programmierung und allgemein Fragen der Logik und der Algebra miteinander verknupft sind. Im Schnittbereich dieser Themengebiete erscheint der Kern der Informatik als eine Grundlagendisziplin fur die Beschreibung von System- und Algorithmen strukturen, die sich Methoden der Logik und der Algebra zunutze macht. Die Vielfalt der Einzelprobleme in der Numerischen Mathematik, in der Schaltalgebra und der Relationentheorie, bei Zerteilungs- und Erkennungsproblemen, in der Algebraischen Logik, in der Programmiertechnik und im Ubersetzerbau, und schliesslich in der Programmtransformation und der Methodik der Programmierung lassen gemeinsame Grundfragestellungen erkennen. Der asthetische und kulturelle Gehalt dieser Themengebiete erschliesst sich uber technische Einzelaspekte hinaus besonders durch den Beitrag von Prof. Roland Bulirsch, der gleichermassen vom Nutzen und von der Schonheit der Formeln in der Mathematik und in der Informatik handelt.

Gli Automi sono modelli matematici di macchine digitali di grande interesse sia dal punto di vista teorico che applicativo. La teoria degli Automi Finiti costituisce una delle parti fondamentali dell Informatica Teorica. Questo volume fornisce, per la prima volta, nel panorama didattico italiano una trattazione matematicamente rigorosa della teoria degli Automi Finiti e delle macchine sequenziali generalizzate nell ambito della teoria algebrica dei semigruppi. Il volume, la cui lettura presuppone solamente conoscenze elementari di algebra, si rivolge agli studenti sia dei corsi di laurea magistrale e specialistica che di master e di dottorato in Informatica, in Matematica, ed in Ingegneria. Il libro e anche uno strumento utilissimo per gli studiosi di Informatica e, in particolare, di Informatica Teorica, ai quali fornisce una trattazione completa e rigorosa della teoria algebrica degli Automi. Ogni capitolo ha una sezione di esercizi ed una di note bibliografiche. La risoluzione della maggior parte degli esercizi e riportata alla fine del volume.

Graphentheorie ist eine junge mathematische Disziplin, 1936 erschien das erste Lehrbuch yom ungarischen Mathematiker DENES KONIG. Mit der stiirmischen Ent- wicklung der Operationsforschung erlebte auch die Graphentheorie eine ungeahnte Bliite, so daB die Zahl der Biicher zur Graphentheorie heute schon Legion ist. Das Gros der Autoren setzt jedoch beim Leser einen relativ hohen mathematischen Aus- bildungsgrad sowie ein hohes Abstraktionsvermogen voraus. Wir verlangen yom Leser im allgemeinen nicht mehr mathematische Kenntnisse, als in den allgemein- bildenden Schulen vermittelt werden (sieht man einmal von den Begriffen Vektor und Matrix ab) und auch nicht mehr als element are Kenntnisse iiber Programmierung (Ergibtanweisung, Laufanweisung, bedingter Sprung u. a. ). Was wir jedoch yom Leser erwarten, ist die Bereitschaft, sich Zeile fUr Zeile durch einen Algorithmus hindurchzuarbeiten. Dabei kann der Leser stiindig testen, ob er den behandelten Algorithmus verstanden hat, wenn er niimlich das sich anschlieBende Beispiel selb- stiindig zu Ende fiihren kann. Kleine Aufgaben sind ebenfalls in die einzelnen Ab- schnitte eingestreut. Das vorliegende Lehrbuch wendet sich an Studierende von Fach- und Hochschulen technischer, naturwissenschaftlicher und okonomischer Fachrichtungen, ferner an in der Praxis Tiitige, die sich mit Modellierung, Strukturanalyse und Optimierung diskreter Systeme befassen. Aber auch der Leser, welcher bloB SpaB an der Losung kombinatorischer Probleme hat, wird nicht umsonst zu diesem Buch greifen.

This volume contains a variety of problems from classical set theory and represents the first comprehensive collection of such problems. Many of these problems are also related to other fields of mathematics, including algebra, combinatorics, topology and real analysis. Rather than using drill exercises, most problems are challenging and require work, wit, and inspiration. They vary in difficulty, and are organized in such a way that earlier problems help in the solution of later ones. For many of the problems, the authors also trace the history of the problems and then provide proper reference at the end of the solution.

Der vorliegende Band vermittelt einen aktuellen Einblick in funfzig Verbundprojekte zwischen Hochschulinstituten und Industrieunternehmen, die gefordert werden durch das Bundesministrium fur Bildung, Wissenschaft, Forschung und Technologie. Die vorliegenden Artikel entstanden auf der Grundlage von Vortragen, die anlasslich des BMBF-Statusseminars im Oktober 1995 in Munchen gehalten wurden. Sie beschreiben sowohl die grundlegenden mathematischen Fortschritte, als auch die Ansatze zur Losung konkreter Anwenderprobleme. Deren Spektrum reicht von der Bildverarbeitung uber chemische Reaktionen, Computertomographie, Fahrzeugdynamik, Muster- und Strukturerkennung, Prozesssteuerung und Roboter in der industriellen Praxis bis hin zu Stromungsvorgangen und Verkehrsfuhrungssystemen."

On March 28~31, 1994 (Farvardin 8~11, 1373 by Iranian calendar), the Twenty fifth Annual Iranian Mathematics Conference (AIMC25) was held at Sharif University of Technology in Tehran, Islamic Republic of Iran. Its sponsors in~ eluded the Iranian Mathematical Society, and the Department of Mathematical Sciences at Sharif University of Technology. Among the keynote speakers were Professor Dr. Andreas Dress and Professor Richard K. Guy. Their plenary lec~ tures on combinatorial themes were complemented by invited and contributed lectures in a Combinatorics Session. This book is a collection of refereed papers, submitted primarily by the participants after the conference. The topics covered are diverse, spanning a wide range of combinatorics and al~ lied areas in discrete mathematics. Perhaps the strength and variety of the pa~ pers here serve as the best indications that combinatorics is advancing quickly, and that the Iranian mathematics community contains very active contributors. We hope that you find the papers mathematically stimulating, and look forward to a long and productive growth of combinatorial mathematics in Iran.

H. Soubies-Camy: L alg bre logique appliqu e aux techniques binaires, I parte: lezioni.- H. Soubies-Camy: L alg bre logique appliqu e aux techniques binaires, II parte: disegni.- J. Piesch: Switching Algebra.- J.P. Roth: Una teoria per la progettazione logica dei Meccanismi Automatici.

This book discusses the basic geometric contents of an image and presents a treedatastructuretohandleite?ciently.Itanalyzesalsosomemorphological operators that simplify this geometric contents and their implementation in termsofthe datastructuresintroduced.It?nallyreviewsseveralapplications to image comparison and registration, to edge and corner computation, and the selection of features associated to a given scale in images. Let us ?rst say that, to avoid a long list, we shall not give references in this summary; they are obviously contained in this monograph. A gray level image is usually modeled as a function de?ned in a bounded N domain D? R (typically N = 2 for usual snapshots, N=3formedical images or movies) with values in R. The sensors of a camera or a CCD array transform the continuum of light energies to a ?nite interval of values by means of a nonlinear function g. The contrast change g depends on the pr- ertiesofthesensors,butalsoontheilluminationconditionsandthere?ection propertiesofthe objects,andthoseconditionsaregenerallyunknown.Images are thus observed modulo an arbitrary and unknown contrast change.

Graph theory goes back several centuries and revolves around the study of graphs--mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathematics--and some of its most famous problems. The Fascinating World of Graph Theory explores the questions and puzzles that have been studied, and often solved, through graph theory. This book looks at graph theory's development and the vibrant individuals responsible for the field's growth. Introducing fundamental concepts, the authors explore a diverse plethora of classic problems such as the Lights Out Puzzle, and each chapter contains math exercises for readers to savor. An eye-opening journey into the world of graphs, The Fascinating World of Graph Theory offers exciting problem-solving possibilities for mathematics and beyond.

Mit diesem Buch wollen wir verschiedene Teilgebiete der Mathematik aus algorithmischer Perspektive vorstellen und dabei auch Implementierungs- und Laufzeitaspekte diskutieren. Gleichzeitig mochten wir, bei einer verkurzten Grundausbildung in Mathematik in naturwissenschaftlichen und informatischen Studiengangen, moglichst viele Teilaspekte der Mathematik vorstellen und vielleicht zu einer vertiefenden Beschaftigung mit dem einen oder anderen Aspekt anregen.

Unser Ziel ist es dabei nicht, den Leser zu einem versierten Anwender der besprochenen Algorithmen auszubilden, sondern wir wollen, immer ausgehend von konkreten Problemen, Analyse- und Losungsstrategien in den Mittelpunkt stellen. Hierbei spielen insbesondere Beweise und Beweistechniken eine zentrale Rolle."

Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, combinatorial matrix theory, statistical physics, VLSI design etc.

This book presents a wealth of results, from different mathematical disciplines, in a unified comprehensive manner, and establishes new and old links, which cannot be found elsewhere. It provides a unique and invaluable source for researchers and graduate students.

From the Reviews:

"This book is definitely a milestone in the literature of integer programming and combinatorial optimization. It draws from the Interdisciplinarity of these fields ...]. With knowledge about the relevant terms, one can enjoy special subsections without being entirely familiar with the rest of the chapter. This makes it not only an interesting research book but even a dictionary. ...] The longer one works with it, the more beautiful it becomes." Optima 56, 1997.

Emphasizes a Problem Solving Approach
A first course in combinatorics

Completely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems. The authors take an easily accessible approach that introduces problems before leading into the theory involved. Although the authors present most of the topics through concrete problems, they also emphasize the importance of proofs in mathematics.

New to the Second Edition
This second edition incorporates 50 percent more material. It includes seven new chapters that cover occupancy problems, Stirling and Catalan numbers, graph theory, trees, Dirichlet 's pigeonhole principle, Ramsey theory, and rook polynomials. This edition also contains more than 450 exercises.

Ideal for both classroom teaching and self-study, this text requires only a modest amount of mathematical background. In an engaging way, it covers many combinatorial tools, such as the inclusion-exclusion principle, generating functions, recurrence relations, and P lya 's counting theorem.

Written by the author of the lattice system, this book describes lattice in considerable depth, beginning with the essentials and systematically delving into specific low levels details as necessary. No prior experience with lattice is required to read the book, although basic familiarity with R is assumed. The book contains close to 150 figures produced with lattice. Many of the examples emphasize principles of good graphical design; almost all use real data sets that are publicly available in various R packages. All code and figures in the book are also available online, along with supplementary material covering more advanced topics.

Das Gebiet des Zahlens von Gitterpunkten in Polytopen," auch Ehrhart-Theorie genannt, bietet verschiedene Verbindungen zu elementarer endlicher Fourier-Analysis, Erzeugendenfunktionen, dem Munzenproblem von Frobenius, Raumwinkeln, magischen Quadraten, Dedekind-Summen, algorithmischer Geometrie und mehr. Die Autoren haben mit dem Buch einen roten Faden geknupft, der diese Verbindungen aufzeigt und so die grundlegenden und dennoch tiefgehenden Ideen aus diskreter Geometrie, Kombinatorik und Zahlentheorie anschaulich verbindet.

Mit 250 Aufgaben und offenen Problemen fuhlt sich der Leser als aktiver Teilnehmer, und der einnehmende Stil der Autoren fordert solche Beteiligung. Die vielen fesselnden Bilder, die die Beweise und Beispiele begleiten, tragen zu dem einladenden Stil dieses einzigartigen Buches bei."

Questo libro ha lo scopo di familiarizzare gli studenti con aspetti anche abbastanza moderni della teoria dei sistemi dinamici facendo quasi del tutto a meno dell'apparato matematico di analisi, algebra e geometria. L'uso della simulazione numerica al calcolatore, sempre piu importante nello studio dei sistemi dinamici, costituisce parte integrante di questo processo. Oltre ad abituare fin da subito gli studenti a mettere le mani sul calcolo scientifico, si mira a far si che la presentazione di questi argomenti possa contribuire a due ulteriori processi formativi di sicuro valore: da una parte, vedere nascere in modo quasi spontaneo concetti matematici profondi e sottili e vederli all'opera nel concreto; dall'altra abituarsi fin da subito a lavorare con la matematica per analizzare quantitativamente le scienze della natura.

Il libro e rivolto agli studenti dei corsi di laurea in matematica, fisica, biologia, ingegneria, ma anche economia, informatica e scienze della comunicazione."

This book introduces combinatorial analysis to the beginning student. The author begins with the theory of permutation and combinations and their applications to generating functions. In subsequent chapters, he presents Bell polynomials; the principle of inclusion and exclusion; the enumeration of permutations in cyclic representation; the theory of distributions; partitions, compositions, trees and linear graphs; and the enumeration of restricted permutations. Originally published in 1980. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

Petri-Netze sind das meist beachtete und am besten untersuchte Modell fur nebenlaufige, parallele Rechnungen. In diesem Lehrbuch werden zum ersten Mal zahlreich Resultate der Originalliteratur uber Unmoglichkeiten, Moglichkeiten und die Komplexitat der Ausdrucksmittel von Petri-Netzen didaktisch aufgearbeitet und im Detail einer breiteren Leserschaft vorgestellt. Alle fur die Beweise notwendigen Techniken und mathematischen Begriffe werden erlautert. Damit wendet sich das Buch sowohl an Studierende als auch an Lehrende und Forscher. Der Inhalt konzentriert sich neben einer Darstellung der Grundbegriffe und deren Zusammenhange insbesondere auf einen Algorithmus fur die Erreichbarkeitsfrage, die Ausdrucksfahigkeit verschiedener Berechnungsbegriffe, ausgewahlte Fragen zur Entscheidbarkeit und Komplexitat, sowie Petri-Netz Semantiken mittels Sprachen und partiell geordneten Mengen und deren algebraische Charakterisierung."