Computational Discrete Mathematics

This practically-oriented textbook presents an accessible introduction to discrete mathematics through a substantial collection of classroom-tested exercises. Each chapter opens with concise coverage of the theory underlying the topic, reviewing the basic concepts and establishing the terminology, as well as providing the key formulae and instructions on their use. This is then followed by a detailed account of the most common problems in the area, before the reader is invited to practice solving such problems for themselves through a varied series of questions and assignments.

The theory of formal languages is widely recognized as the backbone of theoretical computer science, originating from mathematics and generative linguistics, among others.

This volume presents an exhaustive treatment of computation and algorithms for finite fields.
Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other araes of mathematics. For completeness, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc.) The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics.
The level of discussion presuppose only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text.
For researchers and students interested in computational and algorithmic problems in finite fields.

This book constitutes the refereed proceedings of the 13th IMA International Conference on the Mathematics of Surfaces held in York, UK in September 2009. The papers in the present volume include seven invited papers, as well as 16 submitted papers. The topics covered include subdivision schemes and their continuity, polar patchworks, compressive algorithms for PDEs, surface invariant functions, swept volume parameterization, Willmore flow, computational conformal geometry, heat kernel embeddings, and self-organizing maps on manifolds, mesh and manifold construction, editing, flattening, morphing and interrogation, dissection of planar shapes, symmetry processing, morphable models, computation of isophotes, point membership classification and vertex blends. Surface types considered encompass polygon meshes as well as parametric and implicit surfaces.

The LNCS journal Transactions on Computational Systems Biology is devoted to inter- and multidisciplinary research in the fields of computer science and life sciences and supports a paradigmatic shift in the techniques from computer and information science to cope with the new challenges arising from the systems oriented point of view of biological phenomena.