Discrete mathematics

Optimization Approaches for Solving String Selection Problems provides an overview of optimization methods for a wide class of genomics-related problems in relation to the string selection problems.

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.

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.

The author, who died in 1984, is well-known both as a person and through his research in mathematical logic and theoretical computer science.

Techniques and principles of minimax theory play a key role in many areas of research, including game theory, optimization, and computational complexity.

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.

Although the monograph Progress in Optimization I: Contributions from Aus- tralasia grew from the idea of publishing a proceedings of the Fourth Optimiza- tion Day, held in July 1997 at the Royal Melbourne Institute of Technology, the focus soon changed to a refereed volume in optimization.

The goal of the research out of which this monograph grew, was to make annealing as much as possible a general purpose optimization routine.

Fuzzy Logic Foundations and Industrial Applications is an organized edited collection of contributed chapters covering basic fuzzy logic theory, fuzzy linear programming, and applications.

Codes, Designs, and Geometry brings together in one place important contributions and up-to-date research results in this important area.

Designs and Finite Geometries brings together in one place important contributions and up-to-date research results in this important area of mathematics.

Representations of Discrete Functions is an edited volume containing 13 chapter contributions from leading researchers with a focus on the latest research results.

From July 31 through August 3,1997, the Pennsylvania State University hosted the Topics in Number Theory Conference.

Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math- ematics.

With the rapid growth of bandwidth demand from network users and the advances in optical technologies, optical networks with multiterabits- per-second capacity has received significant interest from both researchers and practitioners.

This volume is a sequel to our 1996 compilation, Computational and Constructive Design Theory.

The research and development of pattern recognition have proven to be of importance in science, technology, and human activity.

The analysis of orthogonal polynomials associated with general weights was a major theme in classical analysis in the twentieth century, and undoubtedly will continue to grow in importance in the future.