Discrete mathematics

At first sight discrete and fractional programming techniques appear to be two com- pletely unrelated fields in operations research.

Transportation problems belong to the domains mathematical program- ming and operations research.

Discrete Event Systems: Analysis and Control is the proceedings of WODES2000 (the 5th Workshop on Discrete Event Systems, held in Ghent, Belgium, on August 21-23, 2000).

This book grew out of our research, industry consulting and con- tinuing education courses.

Global optimization is one of the fastest developing fields in mathematical optimization.

Elliptic curves have been intensively studied in algebraic geometry and number theory.

Information theory is an exceptional field in many ways.

Error detecting codes are very popular for error control in practical systems for two reasons.

Supervision of Petri Nets presents supervisory control theory for Petri nets with a legal set as the control goal.

Error Coding for Engineers provides a useful tool for practicing engineers, students, and researchers, focusing on the applied rather than the theoretical.

Constrained Coding and Soft Iterative Decoding is the first work to combine the issues of constrained coding and soft iterative decoding (e.

Convexity of sets in linear spaces, and concavity and convexity of functions, lie at the root of beautiful theoretical results that are at the same time extremely useful in the analysis and solution of optimization problems, including problems of either single objective or multiple objectives.

Science involves descriptions of the world we live in.

Foreword by Dieter Jungnickel Finite Commutative Rings and their Applications answers a need for an introductory reference in finite commutative ring theory as applied to information and communication theory.

Foreword by James L.

Mathematical Properties of Sequences and Other Combinatorial Structures is an excellent reference for both professional and academic researchers working in telecommunications, cryptography, signal processing, discrete mathematics, and information theory.

Reasoning and Unification over Conceptual Graphs is an exploration of automated reasoning and resolution in the expanding field of Conceptual Structures.

Lectori salutem!

Simplicial Global Optimization is centered on deterministic covering methods partitioning feasible region by simplices.

What is a number?

?

This monograph gives a short introduction to the relevant modern parts of discrete geometry, in addition to leading the reader to the frontiers of geometric research on sphere arrangements.

This volume contains two types of papers-a selection of contributions from the "e;Second International Conference in Network Analysis"e; held in Nizhny Novgorod on May 7-9, 2012, and papers submitted to an "e;open call for papers"e; reflecting the activities of LATNA at the Higher School for Economics.

Topics in Matroid Theory provides a brief introduction to matroid theory with an emphasis on algorithmic consequences.

In the last decade, the areas of quadratic and higher degree forms have witnessed dramatic advances.

An Introduction to Quasisymmetric Schur Functions is aimed at researchers and graduate students in algebraic combinatorics.

This is the most comprehensive survey of the mathematical life of the legendary Paul Erdos (1913-1996), one of the most versatile and prolific mathematicians of our time.

Asymptotic Geometric Analysis is concerned with the geometric and linear properties of finite dimensional objects, normed spaces, and convex bodies, especially with the asymptotics of their various quantitative parameters as the dimension tends to infinity.

The self-avoiding walk is a mathematical model that has important applications in statistical mechanics and polymer science.

Written by one of the foremost experts in the field, Algebraic Combinatorics is a unique undergraduate textbook that will prepare the next generation of pure and applied mathematicians.

Digital Functions and Data Reconstruction: Digital-Discrete Methods provides a solid foundation to the theory of digital functions and its applications to image data analysis, digital object deformation, and data reconstruction.

?

Lectures on Finitely Generated Solvable Groups are based on the "e;Topics in Group Theory"e; course focused on finitely generated solvable groups that was given by Gilbert G.

Traditionally, Lorentzian geometry has been used as a necessary tool to understand general relativity, as well as to explore new genuine geometric behaviors, far from classical Riemannian techniques.

?

The connected dominating set has been a classic subject studied in graph theory since 1975.

As a student moves from basic calculus courses into upper-division courses in linear and abstract algebra, real and complex analysis, number theory, topology, and so on, a "e;bridge"e; course can help ensure a smooth transition.

The study of combinatorial block designs is a vibrant area of combinatorial mathematics with connections to finite geometries, graph theory, coding theory and statistics.

For the first two editions of the book Probability (GTM 95), each chapter included a comprehensive and diverse set of relevant exercises.

?

The Kepler conjecture, one of geometry's oldest unsolved problems, was formulated in 1611 by Johannes Kepler and mentioned by Hilbert in his famous 1900 problem list.

Discrete Event Systems: Diagnosis and Diagnosability addresses the problem of fault diagnosis of Discrete Event Systems (DESs).

Partitions, q-Series, and Modular Forms contains a collection of research and survey papers that grew out of a Conference on Partitions, q-Series and Modular Forms at the University of Florida, Gainesville in March 2008.

In many applications of graph theory, graphs are regarded as geometric objects drawn in the plane or in some other surface.

The main object of this book is to reorient and revitalize classical geometry in a way that will bring it closer to the mainstream of contemporary mathematics.

This IMA Volume in Mathematics and its Applications Coding Theory and Design Theory Part I: Coding Theory is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on APPLIED COMBINATORICS.

The major purpose of this book is to introduce the main concepts of discrete optimization problems which have a finite number of feasible solutions.

Computer science seeks to provide a scientific basis for the study of inform a- tion processing, the solution of problems by algorithms, and the design and programming of computers.