Combinatorics and graph theory

Hilbert functions and resolutions are both central objects in commutative algebra and fruitful tools in the fields of algebraic geometry, combinatorics, commutative algebra, and computational algebra.

Books on information theory and coding have proliferated over the last few years, but few succeed in covering the fundamentals without losing students in mathematical abstraction.

Recent developments in nonlinear dynamics has significantly altered our basic understanding of the foundations of classical physics.

This book illustrates how modern mathematical wavelet transform techniques offer fresh insights into the complex behavior of neural systems at different levels: from the microscopic dynamics of individual cells to the macroscopic behavior of large neural networks.

Explore the multidisciplinary nature of complex networks through machine learning techniques Statistical and Machine Learning Approaches for Network Analysis provides an accessible framework for structurally analyzing graphs by bringing together known and novel approaches on graph classes and graph measures for classification.

This book provides a foundation for the mathematics of blockchain.

This is a revised and updated version of the classic first edition.

Introduction to Radar Analysis, Second Edition is a major revision of the popular textbook.

This volume in the Encyclopedia of Complexity and Systems Science (ECSS) covers such fascinating and practical topics as (i) Vehicular traffic flow theory, (ii) Studies of real field traffic data, (iii) Complex phenomena of self-organization in vehicular traffic, (iv) Effect of automatic driving (self-driving vehicles) on traffic flow, v) Complex dynamics of city traffic, (vi) Dynamic control and optimization of traffic and transportation networks, including dynamic traffic assignment in the network, (vii) Pedestrian traffic, (viii) Evacuation scenarios, and (ix) Network characteristics of air control.

This book comprises carefully selected contributions derived from plenary and invited talks delivered during the International Conference on Mathematics of Intelligent Computing and Data Science (ICMICDS-22), held at the Rajagiri School of Engineering and Technology, Cochin, India, from 15 to 17 September 2022.

Introduction to Abstract Algebra, Second Edition presents abstract algebra as the main tool underlying discrete mathematics and the digital world.

Elwyn Berlekamp, John Conway, and Richard Guy wrote 'Winning Ways for your Mathematical Plays' and turned a recreational mathematics topic into a full mathematical fi eld.

With Chromatic Graph Theory, Second Edition, the authors present various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings.

Applications of Fractional Calculus to Modeling in Dynamics and Chaos aims to present novel developments, trends, and applications of fractional-order derivatives with power law and Mittag-Leffler kernel in the areas of chemistry, mechanics, chaos, epidemiology, fluid mechanics, modeling, and engineering.

Emphasizes a Problem Solving ApproachA first course in combinatoricsCompletely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems.

This book focuses on the computational aspects of graph convexity, with a particular emphasis on path convexity within graphs.

The book gives a comprehensive overview of the state-of-the-art research and engineering in theory and application of Lattice Automata in design and control of autonomous Robots.

There is no other book with such a wide scope of both areas of algebraic graph theory.

This graduate level text is distinguished both by the range of topics and the novelty of the material it treats--more than half of the material in it has previously only appeared in research papers.

Graph Theory: An Introduction to Proofs, Algorithms, and ApplicationsGraph theory is the study of interactions, conflicts, and connections.

The leading reference on probabilistic methods in combinatorics-now expanded and updated When it was first published in 1991, The Probabilistic Method became instantly the standard reference on one of the most powerful and widely used tools in combinatorics.

A close look at the codes and ciphers used by private individuals, spies, governments and industry throughout history.

Comprehensive 2002 introduction to combinatorics on words for mathematicians and theoretical computer scientists.

Volume of geometric objects plays an important role in applied and theoretical mathematics.

This book addresses interconnections between contemporary advances in mathematics, especially algebra, with applications in the social sciences and the arts.

The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields.

The discrete mathematics and theoretical computer science communities have recently witnessed explosive growth in the area of algorithmic combinatorics on words.

The present book is based on the curriculum of undergraduate and postgraduate courses of universities in India and abroad.

This is the first in a series of volumes, which provide an extensive overview of conjectures and open problems in graph theory.

While its roots reach back to the third century, diophantine analysis continues to be an extremely active and powerful area of number theory.

A mathematical gem freshly cleaned and polished This book is intended to be used as the text for a first course in combinatorics.

Combinatorial Nullstellensatz is a novel theorem in algebra introduced by Noga Alon to tackle combinatorial problems in diverse areas of mathematics.

Mathematical tools for the study of generalisations of graphs appearing in the modelling of molecular structures.

This concise text is based on a series of lectures held only a few years ago and originally intended as an introduction to known results on linear hyperbolic and parabolic equations.

The book reviews inequalities for weighted entry sums of matrix powers.

A treatment of a lively topic from number theory for graduate students and researchers.

A unique, systematic and comprehensive introduction to rippling and to the wider subject of automated inductive theorem proving.

This book provides two conceptual frameworks for further investigation of map literacy and fills in a gap in map literacy studies, addressing the distinction between reference maps and thematic maps and the varying uses of quantitative map literacy (QML) within and between the two.

Commutation Relations, Normal Ordering, and Stirling Numbers provides an introduction to the combinatorial aspects of normal ordering in the Weyl algebra and some of its close relatives.

Adopting a student-centered approach, this book anticipates and addresses the common challenges that students face when learning abstract concepts like limits, continuity, and inequalities.

 This second edition includes two new chapters: one on domination in graphs and the other on the spectral properties of graphs, the latter including a discussion on graph energy.

An in-depth coverage of selected areas of graph theory focusing on symmetry properties of graphs, ideal for beginners and specialists.

This book provides an introduction to hypergraphs, its aim being to overcome the lack of recent manuscripts on this theory.