Geometry.Net - the online learning center
Home  - Pure_And_Applied_Math - Combinatorics Bookstore
Page 6     101-120 of 166    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | Next 20

         Combinatorics:     more books (100)
  1. Probabilistic Methods for Algorithmic Discrete Mathematics (Algorithms and Combinatorics)
  2. Studies in Combinatorics (Maa Studies in Mathematics)
  3. Combinatorics on Words: Progress and Perspectives
  4. Graph Theory, Combinatorics, and Algorithms: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graph by Yousef Alavi, Allen Schwenk, 1995-01
  5. Theory and Problems of Combinatorics by C. Vasudev, 2006
  6. Aspects of Combinatorics: A Wide-ranging Introduction by Victor Bryant, 1993-01-29
  7. Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications) by M. Lothaire, 2005-07-25
  8. The Andrews Festschrift: Seventeen Papers on Classical Number Theory and Combinatorics
  9. Coding, Cryptography and Combinatorics (Progress in Computer Science and Applied Logic (PCS))
  10. Combinatorics, Geometry and Probability: A Tribute to Paul Erdös
  11. Problems in Combinatorics and Graph Theory (Wiley Interscience Series in Discrete Mathematics) by Ioan Tomescu, 1985-04
  12. Surveys in Combinatorics 1985: Invited Papers for the Tenth British Combinatorial Conference (London Mathematical Society Lecture Note Series)
  13. Surveys in Combinatorics: Invited Papers for the Ninth British Combinatorial Conference 1982 (London Mathematical Society Lecture Note Series)
  14. Algebraic Combinatorics and Quantum Groups

101. Diwan, Ajit
Indian Institute of Technology, Bombay Algorithms, Graph theory, combinatorics

102. Combinatorics
Web page supporting the book combinatorics Topics, Techniques, Algorithms by PeterJ. Cameron list of misprints, further exercises and problems, links, etc.
Combinatorics: Solutions, Additions, Corrections
This page relates to the book Combinatorics: Topics, Techniques, Algorithms by Peter J. Cameron Cambridge University Press , 1994 (reprinted 1996). The ISBN is
  • 521 45133 7 (hardback)
  • 521 45761 (paperback).
Bibliographical details are given here You can Other links are provided too. From the review by A. T. White in I highly recommend this book to anyone with an interest in the topics, techniques, and/or algorithms of combinatorics.
Solutions to the exercises
The solutions are in PDF format: there is one file for each chapter. Only the first eleven chapters are available as yet (work in progress on the remainder), and detailed solutions to projects are not given.
  • What is combinatorics?
  • On numbers and counting
  • Subsets, partitions, permutations
  • Recurrence relations and generating functions ...
  • Graphs Solutions to the remaining exercises are in preparation.
    From the book
    Here are LaTeX picture files for some of the diagrams in the book:
  • 103. Publication: Handbook Of Combinatorics (Elsevier Science)
    Handbook of combinatorics. Elsevier Science Complete Catalogue Usethe search engine provided to find full descriptive details about
    Handbook of Combinatorics
    Elsevier Science Complete Catalogue
    Use the search engine provided to find full descriptive details about any of our publications, together with ordering information.
    Elsevier Science Tables of Contents (ESTOC)
    The tables of contents for Elsevier Science journals since J anuary 1995.
    Elsevier Science Home Page
    Elsevier Science

    104. Algebra And Discrete Mathematics
    Contents and abstracts of original papers and surveys in various fields of modern algebra, mathematical logic, combinatorics.

    105. AC Published By Birkhäuser Verlag AG
    Annals of combinatorics (AC). For Table of Contents, Abstracts andArticles see El. edition, ISSN 02180006 (Printed edition) ISSN
    Annals of Combinatorics (AC)
    For Table of Contents,
    Abstracts and Articles
    ISSN 0218-0006 (Printed edition)
    ISSN 0219-3094 (Electronic edition)
    AC will publish outstanding contributions to combinatorial mathematics in all its aspects. Special regard will be given to new developments which have yet to be given proper recognition, but which in the opinion of the editors show promise of eventual mathematical breakthroughs. Download Your Free Electronic Sample Copy (AC Contents Volume 6 Number 2, 2002) About AC
    Subscription Information

    Editorial Board
    Notes to Authors

    Please send any comments and/or suggestions you may have by e-mail to Home Search For Authors Top ...
    Last update: 21.04.2004

    106. Permutation Groups Resources
    Webbased resources for permutation groups and related areas in group theory and combinatorics.
    Permutation groups resources
    This page includes pointers to Web-based resources for permutation groups and related topics in group theory, combinatorics, etc. We need your help. Please email me (p.j.cameron(at) to suggest inclusions in our list. Or email comments about the content, format, etc. The links in the tables below should open new browser windows: let me know if this is to your liking or not. At Queen Mary Elsewhere Books Journals ... Mathematical resources At Queen Mary: Permutation groups notes and preprints Permutation group problems Problems from "Permutations" "Permutation Groups" book homepage ... Top Elsewhere: Permutation Groups Permutation Groups section of the Mathematics Subject Classification World of Mathematics: Permutation Group Alexander Hulpke's transitive groups of small degree ... Model theory and permutation groups at the University of East Anglia , a course at UCLA Permutation Change ringing , a practical application of permutations (more information here Steven H. Cullinane's Diamond Theory page (hidden symmetries of Plato's diamond and generalisations) Adventure Games, Permutations, and Spreadsheets

    107. University Of Michigan Combinatorics Seminar
    The University of Michigan combinatorics Seminar Winter 2004 Fridays 410500,3866 East Hall. date, speaker, affiliation, title (click for an abstract).
    The University of Michigan Combinatorics Seminar
    Winter 2004: Fridays 4:10-5:00, 3866 East Hall date speaker affiliation title (click for an abstract) January 9
    Victor Kreiman
    Michigan State A generalization of the Robinson-Schensted-Knuth correspondence January 16
    Anders Buch
    Aarhus U. Alternating signs of quiver coefficients January 23
    David Speyer
    UC Berkeley Tropical linear spaces and the tropical Grassmannian January 30 Jennifer Morse U. Miami q t -Kostka polynomials and the affine Weyl group February 6
    Jeffrey Lagarias
    Approximate squaring and other iterations February 13 U. Michigan Packing density of permutations, patterns and words February 20 Boris Shapiro U. Stockholm On polynomial families satisfying linear ODE or finite recurrence relations March 5
    Greg Blekherman
    U. Michigan Convex geometry of orbits March 12 Marcelo Aguiar Hopf algebras related to symmetric functions March 19 Divakar Viswanath U. Michigan Shuffling cards for black-jack and other card games March 26 Frank Sottile Clay Mathematical Institute and MSRI Lower bounds for real polynomial systems from sign-imbalanced posets April 2 Alek Vainshtein U. Haifa

    108. Ralph McKenzie's Home Page
    Vanderbildt University and UC Berkeley Algebra, logic, combinatorics.
    Ralph McKenzie
    Distinguished Professor
    Office: Stevenson Center 1505
    Phone: (615) 322-7456
    Research Interests
    • Algebra, Logic, Combinatorics
    • Universal algebra and lattice theory
    Selected Publications
    • Tarski's finite basis problem is undecidable
      International Journal of Algebra and Computation 6 (1996), 49-104.
    • The residual bound of a finite algebra is not computable
      International Journal of Algebra and Computation 6 (1996), 29-48.
    • Arithmetic of finite ordered sets: cancellation of exponents, II
      Order 17 (2000), 309-332.
    • Full Bibliography
    • Curriculum Vitae and Recent papers (downloadable)
    Favorite WWW Sites

    13th Ontario combinatorics Workshop Royal Military College of 13th Ontario combinatorics Workshop. May 6 workshop. All areas of combinatoricsand discrete mathematics are included! Opportunities

    110. Mirka Miller
    University of Newcastle Optimal networks, constructions of large graphs and digraphs, data security, security of statistical databases, combinatorics and its applications.
    Mirka Miller
    Associate Professor
    Department of Computer Science and Software Engineering

    University of Newcastle

    Callaghan, Australia 2308. Phone: +61 2 4921 6034 Fax: +61 2 4921 6929 Email:
    B.A.(Sydney), M.A.(UNE), PhD(UNSW)
    Research Interests
    Optimal Networks, Constructions of Large Graphs and Digraphs, Data Security, Security of Statistical Databases, Graph Labelings, Combinatorics and its Applications.
    Recent Research Projects
  • 1. LARGE DIRECTED NETWORKS (in progress) The problem of finding large directed networks of given diameter and the maximum outdegree is considered a very difficult problem. We have been able to make significant new contributions to this problem, partly through the introduction of a new method, using so-called `repeat vertices', vertices which are reachable in more than one way from a given vertex. In many situations such vertices behave as permutations so that we can make use of known results from permutation groups. The breakdown of vertices into permutation cycles gives a new insight into the structure of such graphs - if they exist - or a new method for proving that they do not exist. We have also obtained new results by using adjacency matrices and their eigenvalues. Together with my collaborators we are now applying the technique of voltage assignments from topological graph theory to this area to construct large directed graphs. Main collaborators: Stefan Znam, Jan Plesnik, Jozef Siran, Edy Tri Baskoro, Slamin, Ljiljana Brankovic, Joe Ryan, Martin Sutton, Rinovia Simanjuntak, Joan Gimbert
  • 111. ACO Program Home Page
    This is the home page for the program in Algorithms, combinatorics and Optimizationat Carnegie Mellon University. Thomas A. Bohman, Extremal combinatorics.
    Welcome to the ACO Program Home Page
    This is the home page for the program in
    Algorithms, Combinatorics and Optimization
    at Carnegie Mellon University. Carnegie Mellon University has taken the initiative of offering an interdisciplinary Ph.D program in Algorithms, Combinatorics and Optimization. It is administered jointly by the Graduate School of Industrial Adminstration Operations Research group ), the Computer Science Department Algorithms and Complexity group ) and the Department of Mathematical Sciences (Discrete Mathematics group).
    More About the Program
    Admission/Application Information Ph.D. Program Requirements ACO Seminar ...
    Egon Balas Polyhedral combinatorics, combinatorial optimization. Guy Blelloch Parallel algorithms and languages. Avrim Blum Machine learning, approximation and on-line algorithms, AI planning. Manuel Blum Complexity Theory, cryptography, program checking. Thomas A. Bohman Extremal Combinatorics. Combinatorial optimization, graph theory, integer programming. Lisa Fleischer Combinatorial optimization, approximation algorithms, network routing and design, linear and integer programming. Alan Frieze Average case analysis of algorithms, combinatorics.

    112. The University Of Sydney - Categories And Combinatorics
    Categories and combinatorics Group.
    University of Sydney
    Research Research Seminars Publications Staff ... Research Categories and Combinatorics Category theory is a recent branch of mathematics originating in algebraic topology, but rapidly establishing connections with algebra, logic, algebraic and differential geometry, and most recently computer science. Category theory is particularly suited to providing conceptual frameworks for mathematical areas. The most rapidly developing areas in recent years have been in computer science, quantum groups and homotopy theory. The Sydney Category Seminar is a world centre of research in Category Theory. The main interests of the Combinatorics group concern applications of category theory to computer science, one of the hottest research areas of theoretical computer science, and to algebraic combinatorics, the name given to the recent cross-fertilization between two great areas of mathematics: algebra and combinatorics. Research Areas
    Categorical computer science, computational category theory, categories with structure, enriched category theory, braided tensor categories, quantum groups, higher dimensional categories. Contact
    Dr K. Wehrhahn (

    113. Informatik - Universität Des Saarlandes - Saarbrücken
    Department of Computer Science. Areas of research include combinatorics, computational geometry, compilers for realtime embedded systems, formal modelling of circuits, computer architecture, description and planning logics, formal grammars, cryptography, and distributed algorithms.
    AktuellesNeues aus der InformatikVorträgeJobbörse ... mehr ...
    Informatik Universität des Saarlandes Willkommen English Deutsch Sitemap

    114. Europäisches Graduiertenkolleg "Combinatorics, Geometry, And Computation"
    Translate this page
    Diese Seite verwendet Frames. Frames werden von Ihrem Browser aber nicht unterstützt.

    115. Europäisches Graduiertenkolleg "Combinatorics, Geometry, And Computation"
    Translate this page
    Diese Seite verwendet Frames. Frames werden von Ihrem Browser aber nicht unterstützt.

    116. MathInfo2002
    Colloquium on Mathematics and Computer Science Algorithms, Trees, combinatorics and Probabilities. Universit© de Versailles, France; 1619 September 2002.
    Colloquium on Mathematics and Computer Science :
    Algorithms, Trees, Combinatorics and Probabilities
    September 16-19, 2002
    45, avenue des Etats-Unis
    78035 Versailles cedex - France
    The third Colloquium on Mathematics and Computer Science will take place in Vienna (Austria) on September 13-17, 2004.

    Welcome to the home page of the Second International Colloquium on Mathematics and Computer Science.
    On this site you will find the following informations : Photo album of the colloquium Problems presented at the open problems session ( postscript file here) Scientific program How to get there Social program Learn here about the town of Versailles , including its history and famous castle Scientific committee Scope Organizing committee ... Invited speakers email : Registration Some hotels in Paris and Versailles Sponsors

    117. COCOON 2004
    Tenth International Computing and combinatorics Conference (COCOON2004). August 1720, 2004 Ramada Plaza Jeju Hotel, Jeju Island
    Tenth International Computing and Combinatorics Conference
    (COCOON 2004)
    August 17-20, 2004
    Ramada Plaza Jeju Hotel, Jeju Island, Korea

    Sponsored by
    Korea Advanced Institute of Science and Technology

    Korea Science and Engineering Foundation

    Korea Information Science Society
    Important Dates:
    • Submission of Papers: February 15, 2004
    • Notification of Acceptance: April 17, 2004
    • Final Camera-Ready Version: May 8, 2004
    • Early Registration: June 20, 2004
    • Late Registration: July 25, 2004
    • Conference: August 17-20, 2004
    Conference Program (PDF)
    • Registration Fees
      Until June 20 After June 20 / On-Site Regular 400,000 WON (US$ 350) 460,000 WON (US$ 400) Full Time Student 290,000 WON (US$ 250) 350,000 WON (US$ 300)
    • Registration fee covers the cost of a copy of the proceeding, coffee breaks, a reception, a banquet, lunches, and a tour of Jeju island.
    • Note that a post-doc will not be considered as a student.
    • At least one author for each paper must register for the presentation at the conference. Registration of the author with full payment needs to be done by June 20, 2004.
    • Note that a small overhead is included for payment in US Dollars. (See

    118. Welcome To MOPS -- Martin's Distributed Virtual Library
    6000 documents mainly in Complexity Theory and combinatorics, from DBLP and HPSearch.

    Martin Mundhenk
    M artin's O nline P aper S earch - a distributed virtual digital library About MOPS MOPS howto: when MOPS found an entry
    myhomedir/ my last paper on a selected web page, it allows you to make
  • an index search for words that appear in (e.g. search for papers which contain the word einstein a URL search, for URLs like myhomedir/ (e.g. search for papers whose URLs match einstein ), or a description search, for descriptions like my last paper (e.g. papers whose descriptions match einstein

  • Library:
    complexity combinatorics graph theory POMDPs/misc teaching all
    Search through
    title pages whole documents Match to
    lines whole text Match
    exact sloppy Results sorted
    alphabetically newest first Search index URLs descriptions for use glimpse expressions for index search: use ";" for AND, "," for OR (see About MOPS for more details)
    Other prominent web activities at ECCC Michael Ley's CS Bibliography Gerd Hoff's HomePageSearch M OPServe MOPS hotline ... MOPS homepage The MOPS family

    119. Research In Number Theory & Combinatorics
    Research in Number Theory combinatorics. The following member of staffare involved in research in Number Theory and combinatorics
    Mathematics Home Research Undergrad Postgrad ... Mathematical Education
    Both number theory and combinatorics are part of what is called discrete mathematics, which has important applications in computer science and information technology, as well as an intrinsic elegance and fascination for mathematicians, professionals and amateurs alike. Number theory In combinatorics one is usually concerned with a finite set with some additional structure (e.g. a projective geometry, a graph or a block-design), and seeks to relate it to some already-known set of the same kind, or perhaps to show that certain structures can (or cannot) be imposed on a given set. Another type of question is the enumeration of particular kinds of structures (e.g. how many connected graphs are there on n vertices?). Current topics of interest in the department include: combinatorial design theory; automorphism groups of graphs and designs; Hadamard matrices and symmetric designs and their classification; applications of combinatorics to computer graphics. The following member of staff are involved in research in Number Theory and Combinatorics: Dr I. Anderson

    120. Springer-Verlag - Number Theory & Combinatorics
    Home / Mathematics / Number Theory combinatorics, Select a discipline.,10735,5-40012-70-1058009-0,00.
    Please enable Javascript in your browser to browse this website. Select your subdiscipline Algebra Analysis Applications Mathematical Biology Mathematical Physics Probability Theory Quantitative Finance Home Mathematics
    Select a discipline Biomedical Sciences Chemistry Computer Science Engineering Environmental Sciences Geosciences Law Life Sciences Materials Mathematics Medicine Statistics preloadImage('/sgw/cda/pageitems/designobject/cda_displaydesignobject/0,10885,5-0-17-900120-0,00.gif'); preloadImage('/sgw/cda/pageitems/designobject/cda_displaydesignobject/0,10885,5-0-17-900180-0,00.gif'); preloadImage('/sgw/cda/pageitems/designobject/cda_displaydesignobject/0,10885,5-0-17-900170-0,00.gif'); preloadImage('/sgw/cda/pageitems/designobject/cda_displaydesignobject/0,10885,5-0-17-900190-0,00.gif'); preloadImage('/sgw/cda/pageitems/designobject/cda_displaydesignobject/0,10885,5-0-17-900200-0,00.gif'); preloadImage('/sgw/cda/pageitems/designobject/cda_displaydesignobject/0,10885,5-0-17-900160-0,00.gif');
    All Author/Editor Title ISBN/ISSN Series

    Page 6     101-120 of 166    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | Next 20

    free hit counter