Evasiveness of Graph Properties and Topological Fixed-Point Theorems provides the reader with an integrated treatment of the underlying proofs in the body of research around the use of topological methods to prove lower bounds on the complexity of graph properties.

Geometric combinatorics describes a wide area of mathematics that is primarily the study of geometric objects and their combinatorial structure. This text is a compilation of expository articles at the interface between combinatorics and geometry.

This book is the first in the world literature presenting all new trends in topological fixed point theory. Until now all books connected to the topological fixed point theory were devoted only to some parts of this theory. This book will be especially useful for post-graduate students and researchers interested in the fixed point theory, particularly in topological methods in nonlinear analysis, differential equations and dynamical systems. The content is also likely to stimulate the interest of mathematical economists, population dynamics experts as well as theoretical physicists exploring the topological dynamics.

Fixed Point Theory and Graph Theory provides an intersection between the theories of fixed point theorems that give the conditions under which maps (single or multivalued) have solutions and graph theory which uses mathematical structures to illustrate the relationship between ordered pairs of objects in terms of their vertices and directed edges. This edited reference work is perhaps the first to provide a link between the two theories, describing not only their foundational aspects, but also the most recent advances and the fascinating intersection of the domains. The authors provide solution methods for fixed points in different settings, with two chapters devoted to the solutions method for critically important non-linear problems in engineering, namely, variational inequalities, fixed point, split feasibility, and hierarchical variational inequality problems. The last two chapters are devoted to integrating fixed point theory in spaces with the graph and the use of retractions in the fixed point theory for ordered sets. Introduces both metric fixed point and graph theory in terms of their disparate foundations and common application environments Provides a unique integration of otherwise disparate domains that aids both students seeking to understand either area and researchers interested in establishing an integrated research approach Emphasizes solution methods for fixed points in non-linear problems such as variational inequalities, split feasibility, and hierarchical variational inequality problems that is particularly appropriate for engineering and core science applications

This book constitutes the proceedings of the Third International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2017, held in Goa, India, in February 2017. The 32 papers presented in this volume were carefully reviewed and selected from 103 submissions. They deal with the following areas: algorithms, graph theory, codes, polyhedral combinatorics, computational geometry, and discrete geometry.

The book is devoted to the topological fixed point theory both for single-valued and multivalued mappings in locally convex spaces, including its application to boundary value problems for ordinary differential equations (inclusions) and to (multivalued) dynamical systems. It is the first monograph dealing with the topological fixed point theory in non-metric spaces. Although the theoretical material was tendentiously selected with respect to applications, the text is self-contained. Therefore, three appendices concerning almost-periodic and derivo-periodic single-valued (multivalued) functions and (multivalued) fractals are supplied to the main three chapters.