Narrow your search

Library

KU Leuven (19)

Odisee (19)

Thomas More Kempen (19)

Thomas More Mechelen (19)

UCLL (19)

VIVES (19)

LUCA School of Arts (16)

ULiège (14)

ULB (13)

VUB (12)

More...

Resource type

book (19)


Language

English (18)

Dutch (1)


Year
From To Submit

2021 (2)

2019 (1)

2016 (1)

2015 (1)

2011 (1)

More...
Listing 1 - 10 of 19 << page
of 2
>>
Sort by
Surveys in combinatorics
Authors: ---
ISBN: 1107370574 0511662130 1107365848 1107360935 113988381X 9781107360938 9780511662133 0521228468 9780521228466 9781107370579 9781107365841 Year: 1979 Volume: 38 Publisher: Cambridge New York Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

Combinatorics is an active field of mathematical study and the British Combinatorial Conference, held biennially, aims to survey the most important developments by inviting distinguished mathematicians to lecture at the meeting. The contributions of the principal lecturers at the Seventh Conference, held in Cambridge, are published here and the topics reflect the breadth of the subject. Each author has written a broadly conceived survey, not limited to his own work, but intended for wide readership. Important aspects of the subject are emphasized so that non-specialists will find them understandable. Topics covered include graph theory, matroids, combinatorial set theory, projective geometry and combinatorial group theory. All those researching into any aspect of Combinatorics and its applications will find much in these articles of use and interest.

Combinatorics
Authors: ---
ISBN: 9780511662072 9780521204545 0511662076 9781107087026 1107087023 9781107099425 1107099420 9781139883634 1139883631 0521204542 1107093244 9781107093249 1107090091 9781107090095 1107101972 9781107101975 Year: 1974 Volume: 13 Publisher: Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

This volume is a record of the papers presented to the fourth British Combinatorial Conference held in Aberystwyth in July 1973. Contributors from all over the world took part and the result is a very useful and up-to-date account of what is happening in the field of combinatorics. A section of problems illustrates some of the topics in need of further investigation.

Some topics in graph theory
Author:
ISBN: 113988431X 1107366305 1107371023 1107361397 1107369177 129940409X 1107363845 0511662068 9781107361393 9780511662065 0521339448 9780521339445 Year: 1986 Publisher: Cambridge [Cambridgeshire] New York Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book provides a rapid introduction to topics in graph theory typically covered in a graduate course. The author sets out the main recent results in several areas of current research in graph theory. Topics covered include edge-colourings, symmetries of graphs, packing of graphs, and computational complexity. Professor Yap is able to lead the reader to the forefront of research and to describe some of the open problems in the field. The choice of material presented has arisen from courses given at the National University of Singapore and each chapter contains numerous examples and exercises for the reader.

Enumerative combinatorics.
Author:
ISBN: 1107192129 113981172X 1139811479 0511609582 0511966555 1283871157 1139811592 9781139811729 0521560691 9780521560696 9780511609589 9780521789875 0521553091 0521663512 9780521553094 0521789877 9780521663519 9780511805967 Year: 1999 Publisher: Cambridge Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

This second volume of a two-volume basic introduction to enumerative combinatorics covers the composition of generating functions, trees, algebraic generating functions, D-finite generating functions, noncommutative generating functions, and symmetric functions. The chapter on symmetric functions provides the only available treatment of this subject suitable for an introductory graduate course on combinatorics, and includes the important Robinson-Schensted-Knuth algorithm. Also covered are connections between symmetric functions and representation theory. An appendix by Sergey Fomin covers some deeper aspects of symmetric function theory, including jeu de taquin and the Littlewood-Richardson rule. As in Volume 1, the exercises play a vital role in developing the material. There are over 250 exercises, all with solutions or references to solutions, many of which concern previously unpublished results. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.

Groups combinatorics & geometry : Durham 2001
Authors: --- --- ---
ISBN: 1281876879 9786611876876 9812564489 9789812564481 9789812383129 9812383123 9781281876874 9812383123 6611876871 Year: 2003 Publisher: New Jersey ; London : World Scientific,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Over the past 20 years, the theory of groups in particular simplegroups, finite and algebraic has influenced a number of diverseareas of mathematics. Such areas include topics where groups have beentraditionally applied, such as algebraic combinatorics, finitegeometries, Galois theory and permutation groups, as well as severalmore recent developments.


Book
Algorithmic aspects of combinatorics
Authors: --- ---
ISBN: 0720410436 9780720410433 9780080867656 0080867650 9780444851451 0444851453 1281777625 9786611777623 Year: 1978 Publisher: Amsterdam North-Holland


Book
Graph spectra for complex networks
Author:
ISBN: 9780521194587 9780511921681 9781107411470 9780511992445 0511992440 9780511988653 0511988656 0511921683 052119458X 1282976559 9781282976559 0511993641 9780511993640 1107214408 9781107214408 9786612976551 6612976551 0511984901 9780511984907 0511991452 9780511991455 0511986858 9780511986857 0511990464 9780511990465 Year: 2011 Publisher: Cambridge New York Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

Analyzing the behavior of complex networks is an important element in the design of new man-made structures such as communication systems and biologically engineered molecules. Because any complex network can be represented by a graph, and therefore in turn by a matrix, graph theory has become a powerful tool in the investigation of network performance. This self-contained 2010 book provides a concise introduction to the theory of graph spectra and its applications to the study of complex networks. Covering a range of types of graphs and topics important to the analysis of complex systems, this guide provides the mathematical foundation needed to understand and apply spectral insight to real-world systems. In particular, the general properties of both the adjacency and Laplacian spectrum of graphs are derived and applied to complex networks. An ideal resource for researchers and students in communications networking as well as in physics and mathematics.


Book
Grafen in de praktijk
Author:
ISBN: 9050410782 Year: 2002 Publisher: Utrecht Epsilon Uitgaven

Loading...
Export citation

Choose an application

Bookmark

Abstract

Het wegennet, het internet, de spoorrails verbindingen, de buizenstelsels voor gas en water, het kabelnet voor tv, het telefoonnet zijn allemaal voorbeelden van netwerken. Dergelijke netwerken kunnen worden beschreven met een eenvoudig wiskundig hulpmiddel, de graaf. Afhankelijk van het toepassingsgebied, bijvoorbeeld een reisplanner voor de Nederlandse Spoorwegen of snel transport van emails tussen internet gebruikers, worden verschillende eisen aan deze grafen gesteld. In deze Zebra worden drie karakteristieke probleemgebieden voor grafen behandeld, waarna alles samenkomt in een hoofdstuk over optische netwerken die een belangrijke rol spelen in de telecommunicatie.

Interaction models
Author:
ISBN: 1139883755 1107365791 1107370523 1107360889 1107368472 1299403603 1107363330 0511662122 9781107360884 9780511662126 0521217709 9780521217705 9781139883757 9781107365797 9781107370524 9781107368477 9781299403604 9781107363335 Year: 1977 Publisher: Cambridge [England] New York Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book is based on a set of lectures given to a mixed audience of physicists and mathematicians. The desire to be intelligible to both groups is the underlying preoccupation of the author. Physicists nowadays are particularly interested in phase transitions. The typical situation is that a system of interacting particles exhibits an abrupt change of behaviour at a certain temperature, although the local forces between the particles are thought to be smooth functions of temperature. This account discusses the theory behind a simple model of such phenomena. An important tool is the mathematical discipline known as the Theory of Graphs. There are five chapters, each subdivided into sections. The first chapter is intended as a broad introduction to the subject, and it is written in a more informal manner than the rest. Notes and references for each chapter are given at the end of the chapter.

Analysis and design of algorithms for combinatorial problems
Authors: --- ---
ISBN: 0444876995 9780444876997 9780080872209 0080872204 1281788279 9781281788276 9786611788278 6611788271 Year: 1985 Volume: 25 109 Publisher: Amsterdam New York New York, N.Y., U.S.A. North-Holland Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.

Loading...
Export citation

Choose an application

Bookmark

Abstract

Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed. The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in compu

Listing 1 - 10 of 19 << page
of 2
>>
Sort by