- Table View
- List View
Discrete Calculus
by Carlo Mariconda Alberto TonoloThis book provides an introduction to combinatorics, finite calculus, formal series, recurrences, and approximations of sums. Readers will find not only coverage of the basic elements of the subjects but also deep insights into a range of less common topics rarely considered within a single book, such as counting with occupancy constraints, a clear distinction between algebraic and analytical properties of formal power series, an introduction to discrete dynamical systems with a thorough description of Sarkovskii's theorem, symbolic calculus, and a complete description of the Euler-Maclaurin formulas and their applications. Although several books touch on one or more of these aspects, precious few cover all of them. The authors, both pure mathematicians, have attempted to develop methods that will allow the student to formulate a given problem in a precise mathematical framework. The aim is to equip readers with a sound strategy for classifying and solving problems by pursuing a mathematically rigorous yet user-friendly approach. This is particularly useful in combinatorics, a field where, all too often, exercises are solved by means of ad hoc tricks. The book contains more than 400 examples and about 300 problems, and the reader will be able to find the proof of every result. To further assist students and teachers, important matters and comments are highlighted, and parts that can be omitted, at least during a first and perhaps second reading, are identified.
Discrete Calculus
by Leo J. Grady Jonathan R. PolimeniThe field of discrete calculus, also known as "discrete exterior calculus", focuses on finding a proper set of definitions and differential operators that make it possible to operate the machinery of multivariate calculus on a finite, discrete space. In contrast to traditional goals of finding an accurate discretization of conventional multivariate calculus, discrete calculus establishes a separate, equivalent calculus that operates purely in the discrete space without any reference to an underlying continuous process. This unique text brings together into a single framework current research in the three areas of discrete calculus, complex networks, and algorithmic content extraction. Although there have been a few intersections in the literature between these disciplines, they have developed largely independently of one another, yet researchers working in any one of these three areas can strongly benefit from the tools and techniques being used in the others. Many example applications from several fields of computational science are provided to demonstrate the usefulness of this framework to a broad range of problems. Readers are assumed to be familiar with the basics of vector calculus, graph theory, and linear algebra. Topics and features: presents a thorough review of discrete calculus, with a focus on key concepts required for successful application; unifies many standard image processing algorithms into a common framework for viewing a wide variety of standard algorithms in filtering, clustering, and manifold learning that may be applied to processing data associated with a graph or network; explains how discrete calculus provides a natural definition of "low-frequency" on a graph, which then yields filtering and denoising algorithms; discusses how filtering algorithms can give rise to clustering algorithms, which can be used to develop manifold learning and data discovery methods; examines ranking algorithms, as well as algorithms for analyzing the structure of a network. Graduate students and researchers interested in discrete calculus, complex networks, image processing and computer graphics will find this text/reference a clear introduction to the foundations of discrete calculus as well as a useful guide to have readily available for their work. Dr. Leo J. Grady is a Senior Research Scientist with Siemens Corporate Research in Princeton, New Jersey, USA. Dr. Jonathan R. Polimeni is a Research Fellow at the Massachusetts General Hospital in Boston, Massachusetts, USA, and Instructor in Radiology at Harvard Medical School, Boston, Massachusetts, USA.
Discrete Chaos: With Applications in Science and Engineering
by Saber N. ElaydiWhile maintaining the lucidity of the first edition, Discrete Chaos, Second Edition: With Applications in Science and Engineering now includes many recent results on global stability, bifurcation, chaos, and fractals. The first five chapters provide the most comprehensive material on discrete dynamical systems, including trace-determinant stability, bifurcation analysis, and the detailed analysis of the center manifold theory. This edition also covers L-systems and the periodic structure of the bulbs in the Mandelbrot set as well as new applications in biology, chemistry, and physics. The principal improvements to this book are the additions of PHASER software on an accompanying downloadable resources and the Maple™ and Mathematica® code available for download online.Incorporating numerous new topics and technology not found in similar texts, Discrete Chaos, Second Edition presents a thorough, up-to-date treatment of the theory and applications of discrete dynamical systems.
Discrete Choice Experiments Using R: A How-To Guide for Social and Managerial Sciences
by Yanto Chandra Liang ShangThis book delivers a user guide reference for researchers seeking to build their capabilities in conducting discrete choice experiment (DCE). The book is born out of the observation of the growing popularity – but lack of understanding – of the techniques to investigate preferences. It acknowledges that these broader decision-making processes are often difficult, or sometimes, impossible to study using conventional methods. While DCE is more mature in certain fields, it is relatively new in disciplines within social and managerial sciences. This text addresses these gaps as the first ‘how-to’ handbook that discusses the design and application of DCE methodology using R for social and managerial science research. Whereas existing books on DCE are either research monographs or largely focused on technical aspects, this book offers a step-by-step application of DCE in R, underpinned by a theoretical discussion on the strengths and weaknesses of the DCE approach, with supporting examples of best practices. Relevant to a broad spectrum of emerging and established researchers who are interested in experimental research techniques, particularly those that pertain to the measurements of preferences and decision-making, it is also useful to policymakers, government officials, and NGOs working in social scientific spaces.
Discrete Cuckoo Search for Combinatorial Optimization (Springer Tracts in Nature-Inspired Computing)
by Aziz OuaarabThis book provides a literature review of techniques used to pass from continuous to combinatorial space, before discussing a detailed example with individual steps of how cuckoo search (CS) can be adapted to solve combinatorial optimization problems. It demonstrates the application of CS to three different problems and describes their source code. The content is divided into five chapters, the first of which provides a technical description, together with examples of combinatorial search spaces. The second chapter summarizes a diverse range of methods used to solve combinatorial optimization problems. In turn, the third chapter presents a description of CS, its formulation and characteristics. In the fourth chapter, the application of discrete cuckoo search (DCS) to solve three POCs (the traveling salesman problem, quadratic assignment problem and job shop scheduling problem) is explained, focusing mainly on a reinterpretation of the terminology used in CS and its source of inspiration. In closing, the fifth chapter discusses random-key cuckoo search (RKCS) using random keys to represent positions found by cuckoo search in the TSP and QAP solution space.
Discrete Data Analysis with R: Visualization and Modeling Techniques for Categorical and Count Data (Chapman And Hall/crc Texts In Statistical Science Ser. #120)
by Michael Friendly David MeyerAn Applied Treatment of Modern Graphical Methods for Analyzing Categorical DataDiscrete Data Analysis with R: Visualization and Modeling Techniques for Categorical and Count Data presents an applied treatment of modern methods for the analysis of categorical data, both discrete response data and frequency data. It explains how to use graphical meth
Discrete Diversity and Dispersion Maximization: A Tutorial on Metaheuristic Optimization (Springer Optimization and Its Applications #204)
by Rafael Martí Anna Martínez-GavaraThis book demonstrates the metaheuristic methodologies that apply to maximum diversity problems to solve them. Maximum diversity problems arise in many practical settings from facility location to social network analysis and constitute an important class of NP-hard problems in combinatorial optimization. In fact, this volume presents a “missing link” in the combinatorial optimization-related literature. In providing the basic principles and fundamental ideas of the most successful methodologies for discrete optimization, this book allows readers to create their own applications for other discrete optimization problems. Additionally, the book is designed to be useful and accessible to researchers and practitioners in management science, industrial engineering, economics, and computer science, while also extending value to non-experts in combinatorial optimization. Owed to the tutorials presented in each chapter, this book may be used in a master course, a doctoral seminar, or as supplementary to a primary text in upper undergraduate courses.The chapters are divided into three main sections. The first section describes a metaheuristic methodology in a tutorial style, offering generic descriptions that, when applied, create an implementation of the methodology for any optimization problem. The second section presents the customization of the methodology to a given diversity problem, showing how to go from theory to application in creating a heuristic. The final part of the chapters is devoted to experimentation, describing the results obtained with the heuristic when solving the diversity problem. Experiments in the book target the so-called MDPLIB set of instances as a benchmark to evaluate the performance of the methods.
Discrete Dynamical Models
by Ernesto Salinelli Franco TomarelliThis book provides an introduction to the analysis of discrete dynamical systems. The content is presented by an unitary approach that blends the perspective of mathematical modeling together with the ones of several discipline as Mathematical Analysis, Linear Algebra, Numerical Analysis, Systems Theory and Probability. After a preliminary discussion of several models, the main tools for the study of linear and non-linear scalar dynamical systems are presented, paying particular attention to the stability analysis. Linear difference equations are studied in detail and an elementary introduction of Z and Discrete Fourier Transform is presented. A whole chapter is devoted to the study of bifurcations and chaotic dynamics. One-step vector-valued dynamical systems are the subject of three chapters, where the reader can find the applications to positive systems, Markov chains, networks and search engines. The book is addressed mainly to students in Mathematics, Engineering, Physics, Chemistry, Biology and Economics. The exposition is self-contained: some appendices present prerequisites, algorithms and suggestions for computer simulations. The analysis of several examples is enriched by the proposition of many related exercises of increasing difficulty; in the last chapter the detailed solution is given for most of them.
Discrete Dynamical Systems and Chaotic Machines: Theory and Applications (Chapman & Hall/CRC Numerical Analysis and Scientific Computing Series #20)
by Christophe Guyeux Jacques BahiUntil the authors' recent research, the practical implementation of the mathematical theory of chaos on finite machines raised several issues. This self-contained book shows how to make finite machines, such as computers, neural networks, and wireless sensor networks, work chaotically as defined in a rigorous mathematical framework. Taking into account that these machines must interact in the real world, the authors share their research results on the behaviors of discrete dynamical systems and their use in computer science.
Discrete Dynamical Systems and Difference Equations with Mathematica
by Mustafa R.S. Kulenovic Orlando MerinoFollowing the work of Yorke and Li in 1975, the theory of discrete dynamical systems and difference equations developed rapidly. The applications of difference equations also grew rapidly, especially with the introduction of graphical-interface software that can plot trajectories, calculate Lyapunov exponents, plot bifurcation diagrams, and find ba
Discrete Dynamics: Basic Theory and Examples (Mathematical Engineering)
by Andrea BacciottiThis book offers a complete and detailed introduction to the theory of discrete dynamical systems, with special attention to stability of fixed points and periodic orbits. It provides a solid mathematical background and the essential basic knowledge for further developments such as, for instance, deterministic chaos theory, for which many other references are available (but sometimes, without an exhaustive presentation of preliminary notions). Readers will find a discussion of topics sometimes neglected in the research literature, such as a comparison between different predictions achievable by the discrete time model and the continuous time model of the same application. Another novel aspect of this book is an accurate analysis of the way a fixed point may lose stability, introducing and comparing several notions of instability: simple instability, repulsivity, and complete instability. To help the reader and to show the flexibility and potentiality of the discrete approach to dynamics, many examples, numerical simulations, and figures have been included. The book is used as a reference material for courses at a doctoral or upper undergraduate level in mathematics and theoretical engineering.
Discrete Element Method for Multiphase Flows with Biogenic Particles: Agriculture Applications
by Ling Zhou Ramesh K. Agarwal Weidong Shi Mahmoud A. ElemamThis book presents the advanced theory and application of the combined Computational Fluid Dynamics – Discrete Element Method (CFD-DEM) to multiphase flow simulations of the gas and bio-particulate matter of non-uniformly shaped biomass. It explores how DEM can simulate the complex behaviour of biomass particles, such as their packing in the multiphase flows that occurs in the agricultural product processing industries. It offers an overview of aerodynamic systems, such as cyclone separators, used in the agricultural processing industry. A detailed description of DEM modeling, including the particle-particle, particle-boundary, and particle-fluid interactions in the context of biomass particles of varying sizes and shapes, is provided. Coverage includes the critical application of CFD-DEM simulation technology in designing and optimizing grain handling and processing equipment and the application of extended DEM to other granular flows of complex particles like sand, powders, and dust from mines where clumping and agglomeration occur. The application of DEM in modeling and simulation of complex multiphase systems can help improve productivity, reduce costs, and increase efficiency in the agricultural industry.
Discrete Element Method in the Design of Transport Systems: Verification and Validation of 3D Models
by Daniel Gelnar Jiri ZegzulkaThis book deals with the design and optimization of the bucket elevator using the discrete element method (DEM). It describes the underlying scientific basis for the design of transport equipment using computer simulations and is focused on issues relevant to the industrial sector, mechanical engineering; and the transport, treatment, measurement, and storage of bulk materials. It presents solutions for mitigating bulk material supply chain interruptions due to process malfunctions and failures, utilizing research on monitoring and evaluating of the dynamic processes of particulate matter.The aim of the book is to help readers new to the field with the design of innovative devices. Imparting practical information aimed at saving time and money in project design, the book is ideal for engineers, designers, and researchers concerned with all aspects of bulk materials.Introduces and explains fully the Discrete Element Method using measured values as inputs for the method;Shows whether calculated simulations and real measured values models can be used for design;Illustrates how to validate, calibrate, and optimize the dynamic processes of bulk elevators;Explains how to test transport and storage equipment before it is produced using dynamic simulation of material flow on transport lines, saving time and money.
Discrete Encounters (Chapman & Hall/CRC Cryptography and Network Security Series)
by Craig BauerEschewing the standard dry and static writing style of traditional textbooks, Discrete Explorations provides a refreshing approach to discrete mathematics. The author combines traditional course topics with popular culture, applications, and various historical examples. This book focuses on the historical development of the subject and provides details on the people behind mathematics and their motivations, which will deepen readers’ appreciation of mathematics. With its unique style, the book covers many of the same topics found in other texts but done in an alternative, entertaining style that better captures readers’ attention. Defining discrete mathematics, the author also covers many different topics. These include combinatorics, fractals, permutations, difference equations, graph theory, trees and financial mathematics. Not only will readers gain a greater impression of mathematics, but they’ll be encouraged to further explore the subject. Highlights: Features fascinating historical references to motivate readers Text includes numerous pop culture references throughout to provide a more engaging reading experience Its unique topic structure presents a fresh approach The text’s narrative style reads more like a popular book instead of a dry textbook Covers many topics from combinatorics, as well as discrete mathematics
Discrete Energy on Rectifiable Sets (Springer Monographs in Mathematics)
by Edward B. Saff Sergiy V. Borodachov Douglas P. HardinThis book aims to provide an introduction to the broad and dynamic subject of discrete energy problems and point configurations. Written by leading authorities on the topic, this treatise is designed with the graduate student and further explorers in mind. The presentation includes a chapter of preliminaries and an extensive Appendix that augments a course in Real Analysis and makes the text self-contained. Along with numerous attractive full-color images, the exposition conveys the beauty of the subject and its connection to several branches of mathematics, computational methods, and physical/biological applications. This work is destined to be a valuable research resource for such topics as packing and covering problems, generalizations of the famous Thomson Problem, and classical potential theory in Rd. It features three chapters dealing with point distributions on the sphere, including an extensive treatment of Delsarte–Yudin–Levenshtein linear programming methods for lower bounding energy, a thorough treatment of Cohn–Kumar universality, and a comparison of 'popular methods' for uniformly distributing points on the two-dimensional sphere. Some unique features of the work are its treatment of Gauss-type kernels for periodic energy problems, its asymptotic analysis of minimizing point configurations for non-integrable Riesz potentials (the so-called Poppy-seed bagel theorems), its applications to the generation of non-structured grids of prescribed densities, and its closing chapter on optimal discrete measures for Chebyshev (polarization) problems.
Discrete Event Simulation for Health Technology Assessment
by J. Jaime Caro Jörgen Möller Jonathan Karnon James Stahl Jack IshakThis is the first book to make all the central concepts of discrete event simulation relevant for health technology assessment. Accessible to beginners, the book requires no prerequisites and describes the concepts with as little jargon as possible. It presents essential concepts, a fully worked out implementation example, approaches to analyze the simulations, the development of the required equations, model verification techniques, and validation. The book also covers various special topics and includes a real case study involving screening strategies for breast cancer surveillance.
Discrete Event Systems in Dioid Algebra and Conventional Algebra (Focus Ser.)
by Philippe DeclerckThis book concerns the use of dioid algebra as (max, +) algebra to treat the synchronization of tasks expressed by the maximum of the ends of the tasks conditioning the beginning of another task – a criterion of linear programming. A classical example is the departure time of a train which should wait for the arrival of other trains in order to allow for the changeover of passengers. The content focuses on the modeling of a class of dynamic systems usually called “discrete event systems” where the timing of the events is crucial. Events are viewed as sudden changes in a process which is, essentially, a man-made system, such as automated manufacturing lines or transportation systems. Its main advantage is its formalism which allows us to clearly describe complex notions and the possibilities to transpose theoretical results between dioids and practical applications.
Discrete Fourier Analysis and Wavelets
by S. Allen Broughton Kurt M. BryanA thorough guide to the classical and contemporary mathematical methods of modern signal and image processingDiscrete Fourier Analysis and Wavelets presents a thorough introduction to the mathematical foundations of signal and image processing. Key concepts and applications are addressed in a thought-provoking manner and are implemented using vector, matrix, and linear algebra methods. With a balanced focus on mathematical theory and computational techniques, this self-contained book equips readers with the essential knowledge needed to transition smoothly from mathematical models to practical digital data applications.The book first establishes a complete vector space and matrix framework for analyzing signals and images. Classical methods such as the discrete Fourier transform, the discrete cosine transform, and their application to JPEG compression are outlined followed by coverage of the Fourier series and the general theory of inner product spaces and orthogonal bases. The book then addresses convolution, filtering, and windowing techniques for signals and images. Finally, modern approaches are introduced, including wavelets and the theory of filter banks as a means of understanding the multiscale localized analysis underlying the JPEG 2000 compression standard.Throughout the book, examples using image compression demonstrate how mathematical theory translates into application. Additional applications such as progressive transmission of images, image denoising, spectrographic analysis, and edge detection are discussed. Each chapter provides a series of exercises as well as a MATLAB project that allows readers to apply mathematical concepts to solving real problems. Additional MATLAB routines are available via the book's related Web site.With its insightful treatment of the underlying mathematics in image compression and signal processing, Discrete Fourier Analysis and Wavelets is an ideal book for mathematics, engineering, and computer science courses at the upper-undergraduate and beginning graduate levels. It is also a valuable resource for mathematicians, engineers, and other practitioners who would like to learn more about the relevance of mathematics in digital data processing.
Discrete Fourier Analysis and Wavelets: Applications to Signal and Image Processing
by S. Allen Broughton Kurt BryanDelivers an appropriate mix of theory and applications to help readers understand the process and problems of image and signal analysisMaintaining a comprehensive and accessible treatment of the concepts, methods, and applications of signal and image data transformation, this Second Edition of Discrete Fourier Analysis and Wavelets: Applications to Signal and Image Processing features updated and revised coverage throughout with an emphasis on key and recent developments in the field of signal and image processing. Topical coverage includes: vector spaces, signals, and images; the discrete Fourier transform; the discrete cosine transform; convolution and filtering; windowing and localization; spectrograms; frames; filter banks; lifting schemes; and wavelets. Discrete Fourier Analysis and Wavelets introduces a new chapter on frames—a new technology in which signals, images, and other data are redundantly measured. This redundancy allows for more sophisticated signal analysis. The new coverage also expands upon the discussion on spectrograms using a frames approach. In addition, the book includes a new chapter on lifting schemes for wavelets and provides a variation on the original low-pass/high-pass filter bank approach to the design and implementation of wavelets. These new chapters also include appropriate exercises and MATLAB® projects for further experimentation and practice. • Features updated and revised content throughout, continues to emphasize discreteand digital methods, and utilizes MATLAB® to illustrate these concepts • Contains two new chapters on frames and lifting schemes, which take into account crucial new advances in the field of signal and image processing • Expands the discussion on spectrograms using a frames approach, which is an ideal method for reconstructing signals after information has been lost or corrupted (packet erasure) • Maintains a comprehensive treatment of linear signal processing for audio and image signals with a well-balanced and accessible selection of topics that appeal to a diverse audience within mathematics and engineering • Focuses on the underlying mathematics, especially the concepts of finite-dimensional vector spaces and matrix methods, and provides a rigorous model for signals and images based on vector spaces and linear algebra methods • Supplemented with a companion website containing solution sets and software exploration support for MATLAB and SciPy (Scientific Python) Thoroughly class-tested over the past fifteen years, Discrete Fourier Analysis and Wavelets: Applications to Signal and Image Processing is an appropriately self-contained book ideal for a one-semester course on the subject.S. Allen Broughton, PhD, is Professor Emeritus of Mathematics at Rose-Hulman Institute of Technology. Dr. Broughton is a member of the American Mathematical Society (AMS) and the Society for the Industrial Applications of Mathematics (SIAM), and his research interests include the mathematics of image and signal processing, and wavelets. Kurt Bryan, PhD, is Professor of Mathematics at Rose-Hulman Institute of Technology. Dr. Bryanis a member of MAA and SIAM and has authored over twenty peer-reviewed journal articles. Kurt Bryan, PhD, is Professor of Mathematics at Rose-Hulman Institute of Technology. Dr. Bryanis a member of MAA and SIAM and has authored over twenty peer-reviewed journal articles.Maintaining a comprehensive and accessible treatment of the concepts, methods, and applications of signal and image data transformation, this Second Edition of Discrete Fourier Analysis and Wavelets: Applications to Signal and Image Processing features updated and r
Discrete Fractional Calculus
by Christopher Goodrich Allan C. PetersonThis text provides the first comprehensive treatment of the discrete fractional calculus. Experienced researchers will find the text useful as a reference for discrete fractional calculus and topics of current interest. Students who are interested in learning about discrete fractional calculus will find this text to provide a useful starting point. Several exercises are offered at the end of each chapter and select answers have been provided at the end of the book. The presentation of the content is designed to give ample flexibility for potential use in a myriad of courses and for independent study. The novel approach taken by the authors includes a simultaneous treatment of the fractional- and integer-order difference calculus (on a variety of time scales, including both the usual forward and backwards difference operators). The reader will acquire a solid foundation in the classical topics of the discrete calculus while being introduced to exciting recent developments, bringing them to the frontiers of the subject. Most chapters may be covered or omitted, depending upon the background of the student. For example, the text may be used as a primary reference in an introductory course for difference equations which also includes discrete fractional calculus. Chapters 1--2 provide a basic introduction to the delta calculus including fractional calculus on the set of integers. For courses where students already have background in elementary real analysis, Chapters 1--2 may be covered quickly and readers may then skip to Chapters 6--7 which present some basic results in fractional boundary value problems (FBVPs). Chapters 6--7 in conjunction with some of the current literature listed in the Bibliography can provide a basis for a seminar in the current theory of FBVPs. For a two-semester course, Chapters 1--5 may be covered in depth, providing a very thorough introduction to both the discrete fractional calculus as well as the integer-order calculus.
Discrete Fractional Calculus and Fractional Difference Equations (SpringerBriefs in Mathematics)
by Rui A. FerreiraThis brief aims to merge the theories of fractional calculus and discrete calculus in a concise but comprehensive manner. It is designed for graduate students, but will be useful for any researcher interested in the theory of discrete fractional calculus and fractional difference equations.
Discrete Geometry (Chapman & Hall/CRC Pure and Applied Mathematics)
by Andras BezdekCelebrating the work of Professor W. Kuperberg, this reference explores packing and covering theory, tilings, combinatorial and computational geometry, and convexity, featuring an extensive collection of problems compiled at the Discrete Geometry Special Session of the American Mathematical Society in New Orleans, Louisiana. Discrete Geometry analy
Discrete Geometry and Mathematical Morphology: Third International Joint Conference, DGMM 2024, Florence, Italy, April 15–18, 2024, Proceedings (Lecture Notes in Computer Science #14605)
by Andrea Frosini Simone Rinaldi Sara BrunettiThis book constitutes the refereed proceedings of the Third International Joint Conference on Discrete Geometry and Mathematical Morphology, DGMM 2024, held in Florence, Italy during April 15–18, 2024. The 34 full papers included in this book were carefully reviewed and selected from 51 submissions. They were organized in topical sections as follows: Digital Geometry - Models, Transforms, and Visualization; Computational Aspects of Discrete Structures and Tilings; Learning Based Morphology; Hierarchical and Graph-Based Models, Analysis and Segmentation; Discrete and Combinatorial Topology; and Mathematical Morphology and Digital Geometry for Applications.
Discrete Geometry and Optimization
by Yinyu Ye Antoine Deza Karoly BezdekOptimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, the Conference on Discrete Geometry and Optimization, and the Workshop on Optimization, held in September 2011 at the Fields Institute, Toronto, was to further stimulate the interaction between geometers and optimizers. This volume reflects the interplay between these areas. The inspiring Fejes Tóth Lecture Series, delivered by Thomas Hales of the University of Pittsburgh, exemplified this approach. While these fields have recently witnessed a lot of activity and successes, many questions remain open. For example, Fields medalist Stephen Smale stated that the question of the existence of a strongly polynomial time algorithm for linear optimization is one of the most important unsolved problems at the beginning of the 21st century. The broad range of topics covered in this volume demonstrates the many recent and fruitful connections between different approaches, and features novel results and state-of-the-art surveys as well as open problems.
Discrete Geometry and Symmetry: Dedicated to Károly Bezdek and Egon Schulte on the Occasion of Their 60th Birthdays (Springer Proceedings in Mathematics & Statistics #234)
by Antoine Deza Asia Ivić Weiss Marston D. ConderThis book consists of contributions from experts, presenting a fruitful interplay between different approaches to discrete geometry. Most of the chapters were collected at the conference “Geometry and Symmetry” in Veszprém, Hungary from 29 June to 3 July 2015. The conference was dedicated to Károly Bezdek and Egon Schulte on the occasion of their 60th birthdays, acknowledging their highly regarded contributions in these fields.While the classical problems of discrete geometry have a strong connection to geometric analysis, coding theory, symmetry groups, and number theory, their connection to combinatorics and optimization has become of particular importance. The last decades have seen a revival of interest in discrete geometric structures and their symmetry. The rapid development of abstract polytope theory has resulted in a rich theory featuring an attractive interplay of methods and tools from discrete geometry, group theory and geometry, combinatorial group theory, and hyperbolic geometry and topology. This book contains papers on new developments in these areas, including convex and abstract polytopes and their recent generalizations, tiling and packing, zonotopes, isoperimetric inequalities, and on the geometric and combinatorial aspects of linear optimization. The book is a valuable resource for researchers, both junior and senior, in the field of discrete geometry, combinatorics, or discrete optimization. Graduate students find state-of-the-art surveys and an open problem collection.