Rakuten Kobo

Panier

Article(s) non disponible(s) à la vente

Veuillez vérifier votre panier. Vous pouvez supprimer le ou les articles qui ne sont pas disponibles maintenant ou nous les supprimerons automatiquement au moment du règlement de la commande.

articlesarticle

- Comprend les eBooks
  
  Comprend les livres audio
  
  Comprend 30 heures d'écoute
  
  Sans engagement, résiliez à tout moment sur kobo.com/account/subscriptions
  
  Obtenez 1•crédit chaque mois pour le livre audio de votre choix
  
  Sans engagement, résiliez à tout moment sur kobo.com/account/subscriptions
  
  Comprend les eBooks
  
  Comprend les livres audio
  
  Comprend 30 heures d'écoute
  
  Sans engagement, résiliez à tout moment sur kobo.com/account/subscriptions
  Livre audio
  par ,
  
  Disponible:
  
  . Sans engagement, résiliez à tout moment sur kobo.com/account/subscriptions.
  
  Pré-commander
  1 livre audio par mois
  
  + Essai gratuit pendant 30 jours
  
  Offre spéciale
  
  Obtenez 1 crédit chaque mois pour un livre audio de votre choix
  
  * Sans engagement, résiliez à tout moment
  
  GRATUIT

articlesarticle

Comprend les eBooks

Comprend les livres audio

Comprend 30 heures d'écoute

Sans engagement, résiliez à tout moment sur kobo.com/account/subscriptions

Obtenez 1•crédit chaque mois pour le livre audio de votre choix

Sans engagement, résiliez à tout moment sur kobo.com/account/subscriptions

Comprend les eBooks

Comprend les livres audio

Comprend 30 heures d'écoute

Sans engagement, résiliez à tout moment sur kobo.com/account/subscriptions
Livre audio
par ,

Disponible:
. Sans engagement, résiliez à tout moment sur kobo.com/account/subscriptions.

Pré-commander
1 livre audio par mois

+ Essai gratuit pendant 30 jours

Offre spéciale

Obtenez 1 crédit chaque mois pour un livre audio de votre choix

* Sans engagement, résiliez à tout moment

GRATUIT

Recommandé pour vous

Combinatorics: Ancient & Modern

Modifié par Robin Wilson, John J. Watkins ...

Who first presented Pascal's triangle? (It was not Pascal.) Who first presented Hamiltonian graphs? (It was not Hamilton.) Who first presented Steiner triple systems? (It was not Steiner.) The history of mathematics is a well-studied and vibrant area of research, with books and scholarly articles published on various aspects of the subject. Yet, the history of combinatorics seems to have been ... En savoir plus

43,72 €

Who first presented Pascal's triangle? (It was not Pascal.) Who first presented Hamiltonian graphs? (It was not Hamilton.) Who first presented Steiner triple systems? (It was not Steiner.) The history of mathematics is a well-studied and vibrant area of research, with books and scholarly articles published on various aspects of the subject. Yet, the history of combinatorics seems to have been
... En savoir plus
Graph Theory and Its Applications

par Jonathan L. Gross, Jay Yellen, Mark Anderson ...

Collection series Textbooks in Mathematics
Graph Theory and Its Applications, Third Edition is the latest edition of the international, bestselling textbook for undergraduate courses in graph theory, yet it is expansive enough to be used for graduate courses as well. The textbook takes a comprehensive, accessible approach to graph theory, integrating careful exposition of classical developments with emerging methods, models, and practical ... En savoir plus

64,10 €

Graph Theory and Its Applications, Third Edition is the latest edition of the international, bestselling textbook for undergraduate courses in graph theory, yet it is expansive enough to be used for graduate courses as well. The textbook takes a comprehensive, accessible approach to graph theory, integrating careful exposition of classical developments with emerging methods, models, and practical
... En savoir plus
Combinatorics

A Very Short Introduction

par Robin Wilson ...

Collection series Very Short Introductions
How many possible sudoku puzzles are there? In the lottery, what is the chance that two winning balls have consecutive numbers? Who invented Pascal's triangle? (it was not Pascal) Combinatorics, the branch of mathematics concerned with selecting, arranging, and listing or counting collections of objects, works to answer all these questions. Dating back some 3000 years, and initially consisting ... En savoir plus

7,43 €

How many possible sudoku puzzles are there? In the lottery, what is the chance that two winning balls have consecutive numbers? Who invented Pascal's triangle? (it was not Pascal) Combinatorics, the branch of mathematics concerned with selecting, arranging, and listing or counting collections of objects, works to answer all these questions. Dating back some 3000 years, and initially consisting
... En savoir plus
Mathematics of Tabletop Games

par Aaron Montgomery ...

Collection series AK Peters/CRC Recreational Mathematics Series
Mathematics of Tabletop Games provides a bridge between mathematics and hobby tabletop gaming. Instead of focusing on games mathematicians play, such as nim and chomp, this book starts with the tabletop games played by avid gamers and hopes to address the question: which field of mathematics concerns itself with this situation?Readers interested in either mathematics or tabletop games will find ... En savoir plus

35,74 €

Mathematics of Tabletop Games provides a bridge between mathematics and hobby tabletop gaming. Instead of focusing on games mathematicians play, such as nim and chomp, this book starts with the tabletop games played by avid gamers and hopes to address the question: which field of mathematics concerns itself with this situation?Readers interested in either mathematics or tabletop games will find
... En savoir plus
Basic Phylogenetic Combinatorics

par Andreas Dress, Katharina T. Huber, Jacobus Koolen, Vincent Moulton, Andreas Spillner ...

Phylogenetic combinatorics is a branch of discrete applied mathematics concerned with the combinatorial description and analysis of phylogenetic trees and related mathematical structures such as phylogenetic networks and tight spans. Based on a natural conceptual framework, the book focuses on the interrelationship between the principal options for encoding phylogenetic trees: split systems, ... En savoir plus

56,91 €

Phylogenetic combinatorics is a branch of discrete applied mathematics concerned with the combinatorial description and analysis of phylogenetic trees and related mathematical structures such as phylogenetic networks and tight spans. Based on a natural conceptual framework, the book focuses on the interrelationship between the principal options for encoding phylogenetic trees: split systems,
... En savoir plus
Walk Through Combinatorics, A: An Introduction To Enumeration And Graph Theory (Second Edition)

par Miklos Bona ...

This is a textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their ... En savoir plus

64,20 €

This is a textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their
... En savoir plus
Principles And Techniques In Combinatorics

par Chuan Chong Chen, Khee-meng Koh ...

28,84 €
An Atlas of Edge-Reversal Dynamics

par V.C. Barbosa ...

Collection series Chapman & Hall/CRC Research Notes in Mathematics Series
This important resource offers the first in-depth account of the graph dynamics system SER (Scheduling by Edge Reversal),. In Part 1: Edge-Reversal Dynamics, the author discusses the main applications and properties of SER, provides data from statistics and correlations computed over several graph classes, and gives an overview of the algorithmic aspects of the construction of the catalogue. Part ... En savoir plus

244,10 €

This important resource offers the first in-depth account of the graph dynamics system SER (Scheduling by Edge Reversal),. In Part 1: Edge-Reversal Dynamics, the author discusses the main applications and properties of SER, provides data from statistics and correlations computed over several graph classes, and gives an overview of the algorithmic aspects of the construction of the catalogue. Part
... En savoir plus
Fundamentals of Ramsey Theory

par Aaron Robertson ...

Collection series Discrete Mathematics and Its Applications
Ramsey theory is a fascinating topic. The author shares his view of the topic in this contemporary overview of Ramsey theory. He presents from several points of view, adding intuition and detailed proofs, in an accessible manner unique among most books on the topic. This book covers all of the main results in Ramsey theory along with results that have not appeared in a book before.The presentation ... En savoir plus

77,66 €

Ramsey theory is a fascinating topic. The author shares his view of the topic in this contemporary overview of Ramsey theory. He presents from several points of view, adding intuition and detailed proofs, in an accessible manner unique among most books on the topic. This book covers all of the main results in Ramsey theory along with results that have not appeared in a book before.The presentation
... En savoir plus
Miscellaneous Mathematical Constants

par Various ...

Miscellaneous Mathematical Constants is a comprehensive compilation of mathematical constants, originally published in 1873 by Simon Newcomb. The book presents a wide array of constants used in various branches of mathematics and science, including geometry, trigonometry, logarithms, and physics. Each constant is carefully listed with its value and, where applicable, its historical context or ... En savoir plus

19,99 €

Miscellaneous Mathematical Constants is a comprehensive compilation of mathematical constants, originally published in 1873 by Simon Newcomb. The book presents a wide array of constants used in various branches of mathematics and science, including geometry, trigonometry, logarithms, and physics. Each constant is carefully listed with its value and, where applicable, its historical context or
... En savoir plus
Algorithmics Of Matching Under Preferences

par David Manlove ...

Collection Livre 2 - Series On Theoretical Computer Science
Matching problems with preferences are all around us: they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists.In recent years there has been a sharp increase in the study of algorithmic aspects of ... En savoir plus

59,55 €

Matching problems with preferences are all around us: they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists.In recent years there has been a sharp increase in the study of algorithmic aspects of
... En savoir plus
Wearing Gauss’s Jersey

par Dean Hathout ...

Wearing Gauss's Jersey focuses on "Gauss problems," problems that can be very tedious and time consuming when tackled in a traditional, straightforward way but if approached in a more insightful fashion, can yield the solution much more easily and elegantly. The book shows how mathematical problem solving can be fun and how students can improve the ... En savoir plus

87,52 €

Wearing Gauss's Jersey focuses on "Gauss problems," problems that can be very tedious and time consuming when tackled in a traditional, straightforward way but if approached in a more insightful fashion, can yield the solution much more easily and elegantly. The book shows how mathematical problem solving can be fun and how students can improve the
... En savoir plus
Applications of Group Theory to Combinatorics

Modifié par Jack Koolen, Jin Ho Kwak, Ming-Yao Xu ...

Applications of Group Theory to Combinatorics contains 11 survey papers from international experts in combinatorics, group theory and combinatorial topology. The contributions cover topics from quite a diverse spectrum, such as design theory, Belyi functions, group theory, transitive graphs, regular maps, and Hurwitz problems, and present the state ... En savoir plus

258,90 €

Applications of Group Theory to Combinatorics contains 11 survey papers from international experts in combinatorics, group theory and combinatorial topology. The contributions cover topics from quite a diverse spectrum, such as design theory, Belyi functions, group theory, transitive graphs, regular maps, and Hurwitz problems, and present the state
... En savoir plus
Discrete Mathematics with Coding

par Hugo D Junghenn ...

Collection series Textbooks in Mathematics
This book, for a first undergraduate course in Discrete Mathematics, systematically exploits the relationship between discrete mathematics and computer programming. Unlike most discrete mathematics texts focusing on one of the other, the book explores the rich and important connection between these two disciplines and shows how each discipline reinforces and enhances the other.The mathematics in ... En savoir plus

124,51 €

This book, for a first undergraduate course in Discrete Mathematics, systematically exploits the relationship between discrete mathematics and computer programming. Unlike most discrete mathematics texts focusing on one of the other, the book explores the rich and important connection between these two disciplines and shows how each discipline reinforces and enhances the other.The mathematics in
... En savoir plus
Handbook of Applied Cryptography

par Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone ...

Collection series Discrete Mathematics and Its Applications
Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an important discipline that is not only the subject of an enormous amount of research, but provides the foundation for information security in many applications. Standards are emerging to meet the demands for cryptographic protection in most areas of data communications. Public-key cryptographic techniques ... En savoir plus

218,21 €

Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an important discipline that is not only the subject of an enormous amount of research, but provides the foundation for information security in many applications. Standards are emerging to meet the demands for cryptographic protection in most areas of data communications. Public-key cryptographic techniques
... En savoir plus
Graph Theory As I Have Known It

par Prof W. T. Tutte ...

Collection Livre 11 - Oxford Lecture Series in Mathematics and Its Applications
This book provides a unique and unusual introduction to graph theory by one of the founding fathers, and will be of interest to all researchers in the subject. It is not intended as a comprehensive treatise, but rather as an account of those parts of the theory that have been of special interest to the author. Professor Tutte details his experience in the area, and provides a fascinating insight ... En savoir plus

45,58 €

This book provides a unique and unusual introduction to graph theory by one of the founding fathers, and will be of interest to all researchers in the subject. It is not intended as a comprehensive treatise, but rather as an account of those parts of the theory that have been of special interest to the author. Professor Tutte details his experience in the area, and provides a fascinating insight
... En savoir plus
Boundaries and Hulls of Euclidean Graphs

From Theory to Practice

par Ahcene Bounceur, Madani Bezoui, Reinhardt Euler ...

Boundaries and Hulls of Euclidean Graphs: From Theory to Practice presents concepts and algorithms for finding convex, concave and polygon hulls of Euclidean graphs. It also includes some implementations, determining and comparing their complexities. Since the implementation is application-dependent, either centralized or distributed, some basic concepts of the centralized and distributed versions ... En savoir plus

66,56 €

Boundaries and Hulls of Euclidean Graphs: From Theory to Practice presents concepts and algorithms for finding convex, concave and polygon hulls of Euclidean graphs. It also includes some implementations, determining and comparing their complexities. Since the implementation is application-dependent, either centralized or distributed, some basic concepts of the centralized and distributed versions
... En savoir plus
Distribution Modulo One and Diophantine Approximation

par Yann Bugeaud ...

Collection Livre 193 - Cambridge Tracts in Mathematics
This book presents state-of-the-art research on the distribution modulo one of sequences of integral powers of real numbers and related topics. Most of the results have never before appeared in one book and many of them were proved only during the last decade. Topics covered include the distribution modulo one of the integral powers of 3/2 and the frequency of occurrence of each digit in the ... En savoir plus

149,69 €

This book presents state-of-the-art research on the distribution modulo one of sequences of integral powers of real numbers and related topics. Most of the results have never before appeared in one book and many of them were proved only during the last decade. Topics covered include the distribution modulo one of the integral powers of 3/2 and the frequency of occurrence of each digit in the
... En savoir plus
Introduction to Network Security

par Douglas Jacobson ...

Collection series Chapman & Hall/CRC Cryptography and Network Security Series
Unlike data communications of the past, today’s networks consist of numerous devices that handle the data as it passes from the sender to the receiver. However, security concerns are frequently raised in circumstances where interconnected computers use a network not controlled by any one entity or organization. Introduction to Network Security examines various network protocols, focusing on ... En savoir plus

122,04 €

Unlike data communications of the past, today’s networks consist of numerous devices that handle the data as it passes from the sender to the receiver. However, security concerns are frequently raised in circumstances where interconnected computers use a network not controlled by any one entity or organization. Introduction to Network Security examines various network protocols, focusing on
... En savoir plus
Periodicities in Nonlinear Difference Equations

par E.A. Grove, G. Ladas ...

Sharkovsky's Theorem, Li and Yorke's "period three implies chaos" result, and the (3x+1) conjecture are beautiful and deep results that demonstrate the rich periodic character of first-order, nonlinear difference equations. To date, however, we still know surprisingly little about higher-order nonlinear difference equations. During the last ... En savoir plus

237,93 €

Sharkovsky's Theorem, Li and Yorke's "period three implies chaos" result, and the (3x+1) conjecture are beautiful and deep results that demonstrate the rich periodic character of first-order, nonlinear difference equations. To date, however, we still know surprisingly little about higher-order nonlinear difference equations. During the last
... En savoir plus
Buildings and Schubert Schemes

par Carlos Contou-Carrere ...

The first part of this book introduces the Schubert Cells and varieties of the general linear group Gl (k^(r+1)) over a field k according to Ehresmann geometric way. Smooth resolutions for these varieties are constructed in terms of Flag Configurations in k^(r+1) given by linear graphs called Minimal Galleries. In the second part, Schubert Schemes, the Universal Schubert Scheme and their Canonical ... En savoir plus

66,56 €

The first part of this book introduces the Schubert Cells and varieties of the general linear group Gl (k^(r+1)) over a field k according to Ehresmann geometric way. Smooth resolutions for these varieties are constructed in terms of Flag Configurations in k^(r+1) given by linear graphs called Minimal Galleries. In the second part, Schubert Schemes, the Universal Schubert Scheme and their Canonical
... En savoir plus
Models of Network Reliability

Analysis, Combinatorics, and Monte Carlo

par Ilya B. Gertsbakh, Yoseph Shpungin ...

Unique in its approach, Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo provides a brief introduction to Monte Carlo methods along with a concise exposition of reliability theory ideas. From there, the text investigates a collection of principal network reliability models, such as terminal connectivity for networks with unre ... En savoir plus

89,99 €

Unique in its approach, Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo provides a brief introduction to Monte Carlo methods along with a concise exposition of reliability theory ideas. From there, the text investigates a collection of principal network reliability models, such as terminal connectivity for networks with unre
... En savoir plus
Sums of Squares of Integers

par Carlos J. Moreno, Jr. Wagstaff ...

Sums of Squares of Integers covers topics in combinatorial number theory as they relate to counting representations of integers as sums of a certain number of squares. The book introduces a stimulating area of number theory where research continues to proliferate. It is a book of firsts - namely it is the first book to combine Liouville's elementary methods with the analytic methods of modular ... En savoir plus

87,52 €

Sums of Squares of Integers covers topics in combinatorial number theory as they relate to counting representations of integers as sums of a certain number of squares. The book introduces a stimulating area of number theory where research continues to proliferate. It is a book of firsts - namely it is the first book to combine Liouville's elementary methods with the analytic methods of modular
... En savoir plus
Algebraic Operads

An Algorithmic Companion

par Murray R. Bremner, Vladimir Dotsenko ...

This book presents a systematic treatment of Grobner bases in several contexts. The book builds up to the theory of Grobner bases for operads due to the second author and Khoroshkin as well as various applications of the corresponding diamond lemmas in algebra. Throughout the book, both the mathematical theory and computational methods are emphasized and numerous algorithms, examples, and ... En savoir plus

101,08 €

This book presents a systematic treatment of Grobner bases in several contexts. The book builds up to the theory of Grobner bases for operads due to the second author and Khoroshkin as well as various applications of the corresponding diamond lemmas in algebra. Throughout the book, both the mathematical theory and computational methods are emphasized and numerous algorithms, examples, and
... En savoir plus

Kobo Rakuten

Liseuses

Applis

Accessoires

Panier

Vous profitez des avantages réservés aux VIP !

Votre panier est vide

Disponible:

1 livre audio par mois

+ Essai gratuit pendant 30 jours

Disponible:

1 livre audio par mois

+ Essai gratuit pendant 30 jours

Recommandé pour vous

eBooks Combinatoire

Combinatorics: Ancient & Modern

Graph Theory and Its Applications

Combinatorics

Mathematics of Tabletop Games

Basic Phylogenetic Combinatorics

Walk Through Combinatorics, A: An Introduction To Enumeration And Graph Theory (Second Edition)

Principles And Techniques In Combinatorics

An Atlas of Edge-Reversal Dynamics

Fundamentals of Ramsey Theory

Miscellaneous Mathematical Constants

Algorithmics Of Matching Under Preferences

Wearing Gauss’s Jersey

Applications of Group Theory to Combinatorics

Discrete Mathematics with Coding

Handbook of Applied Cryptography

Graph Theory As I Have Known It

Boundaries and Hulls of Euclidean Graphs

Distribution Modulo One and Diophantine Approximation

Introduction to Network Security

Periodicities in Nonlinear Difference Equations

Buildings and Schubert Schemes

Models of Network Reliability

Sums of Squares of Integers

Algebraic Operads