|
Showing 1 - 21 of
21 matches in All Departments
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. They combined set theory,
combinatorics, codes, algorithms, and a smattering of other fi
elds, leavened with a liberal dose of humor and wit. Their legacy
is a lively fi eld of study that still produces many surprises.
Despite being experts in other areas of mathematics, in the 50
years since its publication, they also mentored, talked, and played
games, giving their time, expertise, and guidance to several
generations of mathematicians. This volume is dedicated to Elwyn
Berlekamp, John Conway, and Richard Guy. It includes 20
contributions from colleagues that refl ect on their work in
combinatorial game theory.
Over a career that spanned 60 years, Ronald L. Graham (known to all
as Ron) made significant contributions to the fields of discrete
mathematics, number theory, Ramsey theory, computational geometry,
juggling and magical mathematics, and many more. Ron also was a
mentor to generations of mathematicians, he gave countless talks
and helped bring mathematics to a wider audience, and he held
signifi cant leadership roles in the mathematical community. This
volume is dedicated to the life and memory of Ron Graham, and
includes 20-articles by leading scientists across a broad range of
subjects that refl ect some of the many areas in which Ron worked.
This book collects the extended abstracts of the accepted
contributions to EuroComb21. A similar book is published at every
edition of EuroComb (every two years since 2001) collecting the
most recent advances in combinatorics, graph theory, and related
areas. It has a wide audience in the areas, and the papers are used
and referenced broadly.
This collection of high-quality articles in the field of
combinatorics, geometry, algebraic topology and theoretical
computer science is a tribute to Jiri Matousek, who passed away
prematurely in March 2015. It is a collaborative effort by his
colleagues and friends, who have paid particular attention to
clarity of exposition - something Jirka would have approved of. The
original research articles, surveys and expository articles,
written by leading experts in their respective fields, map Jiri
Matousek's numerous areas of mathematical interest.
This is the most comprehensive survey of the mathematical life of
the legendary Paul Erdos (1913-1996), one of the most versatile and
prolific mathematicians of our time. For the first time, all the
main areas of Erdos' research are covered in a single project.
Because of overwhelming response from the mathematical community,
the project now occupies over 1000 pages, arranged into two
volumes. These volumes contain both high level research articles as
well as key articles that survey some of the cornerstones of Erdos'
work, each written by a leading world specialist in the field. A
special chapter "Early Days", rare photographs, and art related to
Erdos complement this striking collection. A unique contribution is
the bibliography on Erdos' publications: the most comprehensive
ever published. This new edition, dedicated to the 100th
anniversary of Paul Erdos' birth, contains updates on many of the
articles from the two volumes of the first edition, several new
articles from prominent mathematicians, a new introduction, more
biographical information about Paul Erdos, and an updated list of
publications. The first volume contains the unique chapter "Early
Days", which features personal memories of Paul Erdos by a number
of his colleagues. The other three chapters cover number theory,
random methods, and geometry. All of these chapters are essentially
updated, most notably the geometry chapter that covers the recent
solution of the problem on the number of distinct distances in
finite planar sets, which was the most popular of Erdos' favorite
geometry problems.
This is the most comprehensive survey of the mathematical life of
the legendary Paul Erdos (1913-1996), one of the most versatile and
prolific mathematicians of our time. For the first time, all the
main areas of Erdos' research are covered in a single project.
Because of overwhelming response from the mathematical community,
the project now occupies over 1000 pages, arranged into two
volumes. These volumes contain both high level research articles as
well as key articles that survey some of the cornerstones of Erdos'
work, each written by a leading world specialist in the field. A
special chapter "Early Days", rare photographs, and art related to
Erdos complement this striking collection. A unique contribution is
the bibliography on Erdos' publications: the most comprehensive
ever published. This new edition, dedicated to the 100th
anniversary of Paul Erdos' birth, contains updates on many of the
articles from the two volumes of the first edition, several new
articles from prominent mathematicians, a new introduction, and
more biographical information about Paul Erdos with an updated list
of publications. The second volume contains chapters on graph
theory and combinatorics, extremal and Ramsey theory, and a section
on infinity that covers Erdos' research on set theory. All of these
chapters are essentially updated, particularly the extremal theory
chapter that contains a survey of flag algebras, a new technique
for solving extremal problems.
This is the first book devoted to the systematic study of sparse
graphs and sparse finite structures. Although the notion of
sparsity appears in various contexts and is a typical example of a
hard to define notion, the authors devised an unifying
classification of general classes of structures. This approach is
very robust and it has many remarkable properties. For example the
classification is expressible in many different ways involving most
extremal combinatorial invariants. This study of sparse structures
found applications in such diverse areas as algorithmic graph
theory, complexity of algorithms, property testing, descriptive
complexity and mathematical logic (homomorphism preservation,fixed
parameter tractability and constraint satisfaction problems). It
should be stressed that despite of its generality this approach
leads to linear (and nearly linear) algorithms. Jaroslav Nesetril
is a professor at Charles University, Prague; Patrice Ossona de
Mendez is a CNRS researcher et EHESS, Paris. This book is related
to the material presented by the first author at ICM 2010.
This is the most comprehensive survey of the mathematical life of
the legendary Paul Erdos (1913-1996), one of the most versatile and
prolific mathematicians of our time. For the first time, all the
main areas of Erdos' research are covered in a single project.
Because of overwhelming response from the mathematical community,
the project now occupies over 1000 pages, arranged into two
volumes. These volumes contain both high level research articles as
well as key articles that survey some of the cornerstones of Erdos'
work, each written by a leading world specialist in the field. A
special chapter "Early Days", rare photographs, and art related to
Erdos complement this striking collection. A unique contribution is
the bibliography on Erdos' publications: the most comprehensive
ever published. This new edition, dedicated to the 100th
anniversary of Paul Erdos' birth, contains updates on many of the
articles from the two volumes of the first edition, several new
articles from prominent mathematicians, a new introduction, more
biographical information about Paul Erdos, and an updated list of
publications. The first volume contains the unique chapter "Early
Days", which features personal memories of Paul Erdos by a number
of his colleagues. The other three chapters cover number theory,
random methods, and geometry. All of these chapters are essentially
updated, most notably the geometry chapter that covers the recent
solution of the problem on the number of distinct distances in
finite planar sets, which was the most popular of Erdos' favorite
geometry problems.
This is the most comprehensive survey of the mathematical life of
the legendary Paul Erdos (1913-1996), one of the most versatile and
prolific mathematicians of our time. For the first time, all the
main areas of Erdos' research are covered in a single project.
Because of overwhelming response from the mathematical community,
the project now occupies over 1000 pages, arranged into two
volumes. These volumes contain both high level research articles as
well as key articles that survey some of the cornerstones of Erdos'
work, each written by a leading world specialist in the field. A
special chapter "Early Days", rare photographs, and art related to
Erdos complement this striking collection. A unique contribution is
the bibliography on Erdos' publications: the most comprehensive
ever published. This new edition, dedicated to the 100th
anniversary of Paul Erdos' birth, contains updates on many of the
articles from the two volumes of the first edition, several new
articles from prominent mathematicians, a new introduction, and
more biographical information about Paul Erdos with an updated list
of publications. The second volume contains chapters on graph
theory and combinatorics, extremal and Ramsey theory, and a section
on infinity that covers Erdos' research on set theory. All of these
chapters are essentially updated, particularly the extremal theory
chapter that contains a survey of flag algebras, a new technique
for solving extremal problems.
|
Mathematical and Engineering Methods in Computer Science - 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers (Paperback, 2013 ed.)
Antonin Kucera, Thomas A. Henzinger, Jaroslav Nesetril, Tomas Vojnar, David Antos
|
R1,557
Discovery Miles 15 570
|
Ships in 10 - 15 working days
|
This volume contains the post-proceedings of the 8th Doctoral
Workshop on Mathematical and Engineering Methods in Computer
Science, MEMICS 2012, held in Znojmo, Czech Republic, in October,
2012. The 13 thoroughly revised papers were carefully selected out
of 31 submissions and are presented together with 6 invited papers.
The topics covered by the papers include: computer-aided analysis
and verification, applications of game theory in computer science,
networks and security, modern trends of graph theory in computer
science, electronic systems design and testing, and quantum
information processing.
This is the first book devoted to the systematic study of sparse
graphs and sparse finite structures. Although the notion of
sparsity appears in various contexts and is a typical example of a
hard to define notion, the authors devised an unifying
classification of general classes of structures. This approach is
very robust and it has many remarkable properties. For example the
classification is expressible in many different ways involving most
extremal combinatorial invariants. This study of sparse structures
found applications in such diverse areas as algorithmic graph
theory, complexity of algorithms, property testing, descriptive
complexity and mathematical logic (homomorphism preservation,fixed
parameter tractability and constraint satisfaction problems). It
should be stressed that despite of its generality this approach
leads to linear (and nearly linear) algorithms. Jaroslav Nesetril
is a professor at Charles University, Prague; Patrice Ossona de
Mendez is a CNRS researcher et EHESS, Paris. This book is related
to the material presented by the first author at ICM 2010.
One of the important areas of contemporary combinatorics is Ramsey
theory. Ramsey theory is basically the study of structure preserved
under partitions. The general philosophy is reflected by its
interdisciplinary character. The ideas of Ramsey theory are shared
by logicians, set theorists and combinatorists, and have been
successfully applied in other branches of mathematics. The whole
subject is quickly developing and has some new and unexpected
applications in areas as remote as functional analysis and
theoretical computer science. This book is a homogeneous collection
of research and survey articles by leading specialists. It surveys
recent activity in this diverse subject and brings the reader up to
the boundary of present knowledge. It covers virtually all main
approaches to the subject and suggests various problems for
individual research.
|
Combinatorial Number Theory - Proceedings of the 'Integers Conference 2007', Carrollton, Georgia, USA, October 24-27, 2007 (Hardcover)
Bruce Landman, Melvyn B Nathanson, Jaroslav Nesetril, Richard J. Nowakowski, Carl Pomerance, …
|
R9,852
Discovery Miles 98 520
|
Ships in 10 - 15 working days
|
This volume contains selected refereed papers based on lectures
presented at the 'Integers Conference 2007', an international
conference in combinatorial number theory that was held in
Carrollton, Georgia in October 2007. The proceedings include
contributions from many distinguished speakers, including George
Andrews, Neil Hindman, Florian Luca, Carl Pomerance, Ken Ono and
Igor E. Shparlinski. Among the topics considered in these papers
are additive number theory, multiplicative number theory,
sequences, elementary number theory, theory of partitions, and
Ramsey theory.
|
Combinatorial Number Theory - Proceedings of the 'Integers Conference 2005' in Celebration of the 70th Birthday of Ronald Graham, Carrollton, Georgia, October 27-30, 2005 (Hardcover, Reprint 2012)
Bruce Landman, Melvyn B Nathanson, Jaroslav Nesetril, Richard J. Nowakowski, Carl Pomerance
|
R8,137
Discovery Miles 81 370
|
Ships in 10 - 15 working days
|
This carefully edited volume contains selected refereed papers
based on lectures presented by many distinguished speakers at the
"Integers Conference 2005," an international conference in
combinatorial number theory. The conference was held in celebration
of the 70th birthday of Ronald Graham, a leader in several fields
of mathematics.
The 7th Annual European Symposium on Algorithms (ESA '99) is held
in Prague, Czech Republic, July 16-18, 1999. This continued the
tradition of the meetings which were held in - 1993 Bad Honnef
(Germany) - 1994 Utrecht (Netherlands) - 1995 Corfu (Greece) - 1996
Barcelona (Spain) - 1997 Graz (Austria) - 1998 Venice (Italy) (The
proceedingsof previousESA meetings were publishedas Springer LNCS
v- umes 726, 855, 979, 1136, 1284, 1461.) In the short time of its
history ESA (like its sister meeting SODA) has become a popular and
respected meeting. The call for papers stated that the "Symposium
covers research in the use, design, and analysis of ef?cient
algorithms and data structures as it is carried out in c- puter
science, discrete applied mathematics and mathematical programming.
Papers are solicited describing original results in all areas of
algorithmic research, including but not limited to: Approximation
Algorithms; Combinatorial Optimization; Compu- tional Biology;
Computational Geometry; Databases and Information Retrieval; Graph
and Network Algorithms; Machine Learning; Number Theory and
Computer Algebra; On-line Algorithms; Pattern Matching and Data
Compression; Symbolic Computation.
This book collects some surveys on current trends in discrete
mathematics and discrete geometry. The areas covered include: graph
representations, structural graphs theory, extremal graph theory,
Ramsey theory and constrained satisfaction problems.
In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague),
EuroComb'05 (Berlin), Eurocomb'07 (Seville), Eurocomb'09
(Bordeaux), and Eurocomb'11 (Budapest), this volume covers recent
advances in combinatorics and graph theory including applications
in other areas of mathematics, computer science and engineering.
Topics include, but are not limited to: Algebraic combinatorics,
combinatorial geometry, combinatorial number theory, combinatorial
optimization, designs and configurations, enumerative
combinatorics, extremal combinatorics, ordered sets, random
methods, topological combinatorics.
"Dieses Buch ist ...] eine hervorragende Einfuhrung in
Kombinatorik und Graphentheorie fur Studienanfanger ... das Buch
ist wegen des ungewohnlichen und sehr attraktiven Stiles der
Darstellung bemerkenswert. ...] Die Sprachform ist vorwiegend die
eines Gespraches mit dem Leser, ... Zum Beispiel werden bei einem
Beweis zuerst die Grundidee oder die Zielsetzung genannt und
erlautert, und auch im weiteren Verlauf wird immer wieder durch
alternative Formulierungen das Verstandnis vertieft ... Die Lekture
ist also anregend und sehr motivierend ..." (W. Dorfler
(Klagenfurt), in: Internationale Mathematische Nachrichten, 2003,
Vol 57, Issue 192, S. 46-47) "
In this paper the authors introduce a general framework for the
study of limits of relational structures and graphs in particular,
which is based on a combination of model theory and (functional)
analysis. The authors show how the various approaches to graph
limits fit to this framework and that the authors naturally appear
as ""tractable cases'' of a general theory. As an outcome of this,
the authors provide extensions of known results. The authors
believe that this puts these into a broader context. The second
part of the paper is devoted to the study of sparse structures.
First, the authors consider limits of structures with bounded
diameter connected components and prove that in this case the
convergence can be ""almost'' studied component-wise. They also
propose the structure of limit objects for convergent sequences of
sparse structures. Eventually, they consider the specific case of
limits of colored rooted trees with bounded height and of graphs
with bounded tree-depth, motivated by their role as ""elementary
bricks'' these graphs play in decompositions of sparse graphs, and
give an explicit construction of a limit object in this case. This
limit object is a graph built on a standard probability space with
the property that every first-order definable set of tuples is
measurable. This is an example of the general concept of modeling
the authors introduce here. Their example is also the first
``intermediate class'' with explicitly defined limit structures
where the inverse problem has been solved.
This is a book about graph homomorphisms. Graph theory is now an
established discipline but the study of graph homomorphisms has
only recently begun to gain wide acceptance and interest. The
subject gives a useful perspective in areas such as graph
reconstruction, products, fractional and circular colorings, and
has applications in complexity theory, artificial intelligence,
telecommunication, and, most recently, statistical physics.
Based on the authors' lecture notes for graduate courses, this
book can be used as a textbook for a second course in graph theory
at 4th year or master's level and has been used for courses at
Simon Fraser University (Vancouver), Charles University (Prague),
ETH (Zurich), and UFRJ (Rio de Janeiro).
The exercises vary in difficulty. The first few are usually
intended to give the reader an opportunity to practice the concepts
introduced in the chapter; the later ones explore related concepts,
or even introduce new ones. For the harder exercises hints and
references are provided.
The authors are well known for their research in this area and the
book will be invaluable to graduate students and researchers alike.
Cet ouvrage propose une initiation simple et complete aux
fondements des mathematiques discretes. Il encourage une approche
active de la matiere, fondee sur la resolution de nombreux
exercices, et le style utilise pour sa redaction ne peut que
stimuler l'interet du lecteur pour les mathematiques. L'expose
aborde des themes aussi varies que la combinatoire, la theorie des
graphes, les methodes probabilistes elementaires, les plans
projectifs finis, les applications combinatoires de l'algebre
lineaire et de l'analyse ainsi que les fonctions generatrices. Les
lecteurs apprecieront les quelques deux cents figures et quatre
cents exercices qui illustrent le propos. Ce livre s'adresse aux
etudiants des premier et deuxieme cycles universitaires
(informatique et mathematiques). Il comporte des rappels sur les
notions de mathematiques generales utilisees dans l'expose, ne
supposant ainsi pratiquement aucun prerequis.
|
You may like...
The Expendables 2
Sylvester Stallone, Jason Statham, …
Blu-ray disc
(1)
R64
Discovery Miles 640
Tenet
John David Washington, Robert Pattinson
Blu-ray disc
(1)
R54
Discovery Miles 540
|