Geometry.Net - the online learning center
Home  - Pure_And_Applied_Math - Combinatorics Bookstore
Page 1     1-20 of 80    1  | 2  | 3  | 4  | Next 20

         Combinatorics:     more books (100)
  1. Enumerative Combinatorics, Volume 2 by Richard P. Stanley, 2001-02-15
  2. A Course in Combinatorics by J. H. van Lint, R. M. Wilson, 2001-12-03
  3. Applied Combinatorics by Alan Tucker, 2006-11-29
  4. Combinatorics: Topics, Techniques, Algorithms by Peter J. Cameron, 1995-01-27
  5. Combinatorics and Graph Theory (Undergraduate Texts in Mathematics) by John Harris, Jeffry L. Hirst, et all 2010-11-02
  6. Schaum's Outline of Theory and Problems of Combinatorics including concepts of Graph Theory by V. K. Balakrishnan, 1994-11-01
  7. Applied Combinatorics by Fred Roberts, Barry Tesman, 2003-04
  8. Algebraic Combinatorics and Coinvariant Spaces (Cms Treatises in Mathematics/ Traites De Mathematiques De La Smc) by Francois Bergeron, 2009-07-31
  9. A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory by Miklos Bona, 2006-10-10
  10. Additive Combinatorics (Cambridge Studies in Advanced Mathematics) by Terence Tao, Van H. Vu, 2009-12-21
  11. Principles and Techniques in Combinatorics by Chen Chuan-Chong, Koh Khee-Meng, 1992-09
  12. Counting and Configurations: Problems in Combinatorics, Arithmetic, and Geometry (CMS Books in Mathematics) by Jiri Herman, Radan Kucera, et all 2010-11-02
  13. Combinatorics for Computer Science (Dover Books on Mathematics) by S. Gill Williamson, 2002-05-08
  14. Random Trees: An Interplay between Combinatorics and Probability by Michael Drmota, 2010-08-03

1. Combinatorics - Wikipedia, The Free Encyclopedia
combinatorics is a branch of pure mathematics concerning the study of discrete (and usually finite) objects. It is related to many other areas of
From Wikipedia, the free encyclopedia
Jump to: navigation search Combinatorics is a branch of pure mathematics concerning the study of discrete (and usually finite ) objects. It is related to many other areas of mathematics , such as algebra probability theory ergodic theory and geometry , as well as to applied subjects in computer science and statistical physics . Aspects of combinatorics include "counting" the objects satisfying certain criteria ( enumerative combinatorics ), deciding when the criteria can be met, and constructing and analyzing objects meeting the criteria (as in combinatorial designs and matroid theory ), finding "largest", "smallest", or "optimal" objects ( extremal combinatorics and combinatorial optimization ), and finding algebraic structures these objects may have ( algebraic combinatorics Combinatorics is as much about problem solving as theory building, though it has developed powerful theoretical methods, especially since the later twentieth century (see the page List of combinatorics topics for details of the more recent development of the subject). One of the oldest and most accessible parts of combinatorics is graph theory , which also has numerous natural connections to other areas.

2. The Electronic Journal Of Combinatorics
A refereed allelectronic journal that welcomes papers in all branches of discrete mathematics, including all kinds of combinatorics, graph theory,
The Electronic Journal of Combinatorics
If you are reading this, you must be either very clever or be using a browser that doesn't support frames. Please click here to continue.

3. Combinatorics -- From Wolfram MathWorld
MathWorld article with basic definitions and links.
Applied Mathematics

Calculus and Analysis

Discrete Mathematics
... Renze
Combinatorics Combinatorics is the branch of mathematics studying the enumeration combination , and permutation of sets of elements and the mathematical relations that characterize their properties. Mathematicians sometimes use the term "combinatorics" to refer to a larger subset of discrete mathematics that includes graph theory . In that case, what is commonly called combinatorics is then referred to as " enumeration ." The Season 1 episode " Noisy Edge " (2005) of the television crime drama mentions combinatorics. SEE ALSO: Algebraic Combinatorics Antichain Chain Concrete Mathematics ... van der Waerden's Theorem REFERENCES: Abramowitz, M. and Stegun, I. A. (Eds.). "Combinatorial Analysis." Ch. 24 in Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, 9th printing. New York: Dover, pp. 821-827, 1972. Aigner, M. Combinatorial Theory. New York: Springer-Verlag, 1997. Balakrishnan, V. K.

4. The Combinatorics Net
Annals of combinatorics will publish outstanding contributions to combinatorial mathematics in all its aspects. Special regard will be given to new
Sorry, this page used frame, but your browser couldn't hold out frame

5. MathPages: Combinatorics
combinatorics. Partitions into Distinct Parts Dedekind s Problem On Eulerian Numbers Permutation Loops The Four Color Theorem
Partitions into Distinct Parts
Dedekind's Problem

On Eulerian Numbers

Permutation Loops
Math Pages Main Menu

6. 05: Combinatorics
combinatorics is, loosely, the science of counting. This is the area of mathematics in which we study families of sets (usually finite) with certain
Search Subject Index MathMap Tour ... Help! ABOUT: Introduction History Related areas Subfields
POINTERS: Texts Software Web links Selected topics here
05: Combinatorics
Combinatorics is, loosely, the science of counting. This is the area of mathematics in which we study families of sets (usually finite) with certain characteristic arrangements of their elements or subsets, and ask what combinations are possible, and how many there are. This includes numerous quite elementary topics, such as enumerating all possible permutations or combinations of a finite set. Consequently, it is difficult to mention in this page all the topics with which a person new to combinatorics might come into contact. Moreover, because of the approachable nature of the subject, combinatorics is often presented with other fields (elementary probability, elementary number theory, and so on) to the exclusion of the more significant aspects of the subject. These include more sophisticated methods of counting sets. For example, the cardinalities of sequences of sets are often arranged into power series to form the generating functions, which can then be analyzed using techniques of analysis. (Since many counting procedures involve the binomial coefficients, it is not surprising to see the hypergeometric functions appear frequently in this regard.) In some cases the enumeration is asymptotic (for example the estimates for the number of partitions of an integer). In many cases the counting can be done in a purely synthetic manner using the "umbral calculus". Combinatorial arguments determining coefficients can be used to deduce identities among functions, particularly between infinite sums or products, such as some of the famous Ramanujan identities.

7. Mathematics Archives - Topics In Mathematics - Combinatorics
In the Mathematics Archive at University of Tennessee, Knoxville.
Topics in Mathematics Combinatorics

8. Front: Math.CO Combinatorics
combinatorics section of the Front for the Mathematics ArXiv.
Front for the arXiv Fri, 14 Mar 2008
math CO search register submit
... iFAQ math.CO Combinatorics Calendar Search Atom feed Search Author Title/ID Abstract+ Category articles per page Show Search help Recent New articles (last 12) 14 Mar arXiv:0803.1860 Two remarks on the Burr-Erdos conjecture. Jacob Fox , Benny Sudakov math.CO 13 Mar arXiv:0803.1816 Superization and (q,t)-specialization in combinatorial Hopf algebras. Jean-Christophe Novelli , Jean-Yves Thibon math.CO math.RA 13 Mar arXiv:0803.1659 Weighted enumeration of spanning subgraphs with degree constraints. David G. Wagner math.CO Cross-listings 14 Mar arXiv:0803.1947 SPM Bulletin 24. Boaz Tsaban (ed. ). math.GN math.CO math.LO 14 Mar arXiv:0803.1891 Partition statistics and quasiweak Maass forms. K. Bringmann , F. Garvan , K. Mahlburg math.NT math.CO Revisions 14 Mar arXiv:0803.0782 A statistic on the roots of a finite reflection group and a correspondence between the height function and Bruhat order. Mark Sterling math.CO math.GR 13 Mar arXiv:0803.1455 Acyclic edge coloring. J. Shen math.CO 13 Mar arXiv:0803.0956

9. 05-xx
05Axx Enumerative combinatorics; 05Bxx Designs and configurations {For applications of design theory, see 94C30}; 05Cxx Graph theory {For applications of
Home MathSciNet Journals Books ...
Contact Us
201 Charles Street
Providence, RI 02904
USA Phone: 401-455-4000
or 800-321-4AMS Or email us at Open Positions
  • 05-00 General reference works (handbooks, dictionaries, bibliographies, etc.) 05-01 Instructional exposition (textbooks, tutorial papers, etc.) 05-02 Research exposition (monographs, survey articles) 05-03 Historical (must also be assigned at least one classification number from Section 01) 05-04 Explicit machine computation and programs (not the theory of computation or programming) 05-06 Proceedings, conferences, collections, etc.
    Enumerative combinatorics Extremal combinatorics Algebraic combinatorics

Privacy Statement

, American Mathematical Society

10. Combinatorics
Web page supporting the book combinatorics Topics, Techniques, Algorithms by Peter J. Cameron list of misprints, further exercises and problems, links,
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:
  • 11. Algorithmic Combinatorics
    We are mainly interested in the connection of classical combinatorics, special functions, and computer algebra ( symbolic computation in combinatorics ).
    about welcome! the castle of hagenberg partners ... image archive search: sitemap

    12. Combinatorics Authors/titles Recent Submissions
    Subjects combinatorics (math.CO); Metric Geometry (math.MG). 2 arXiv0801.2524 ps, . DM); combinatorics (math.CO); Optimization and Control (math.OC) math math.CO
    Search or Article-id Help Advanced search All papers Titles Authors Abstracts Full text Help pages
    Authors and titles for recent submissions
    [ total of 27 entries:
    [ showing 25 entries per page: fewer more all
    Fri, 14 Mar 2008
    arXiv:0803.1860 ps pdf other
    Title: Two remarks on the Burr-Erdos conjecture Authors: Jacob Fox Benny Sudakov Comments: 18 pages Subjects: Combinatorics (math.CO)
    arXiv:0803.1947 (cross-list from math.GN) [ ps pdf other
    Title: SPM Bulletin 24 Authors: Boaz Tsaban (ed.) Subjects: General Topology (math.GN) ; Combinatorics (math.CO); Logic (math.LO)
    arXiv:0803.1891 (cross-list from math.NT) [ ps pdf other
    Title: Partition statistics and quasiweak Maass forms Authors: K. Bringmann F. Garvan K. Mahlburg Subjects: Number Theory (math.NT) ; Combinatorics (math.CO)
    Thu, 13 Mar 2008
    arXiv:0803.1816 ps pdf other
    Title: Superization and (q,t)-specialization in combinatorial Hopf algebras Authors: Jean-Christophe Novelli Jean-Yves Thibon Comments: 30 pages Subjects: Combinatorics (math.CO)

    13. European Journal Of Combinatorics - Elsevier
    The European Journal of combinatorics is an international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial
    Home Site map Elsevier websites Alerts ... European Journal of Combinatorics Journal information Product description Editorial board Abstracting/indexing Special issues and supplements ... Peer review policy Subscription information Bibliographic and ordering information Conditions of sale Dispatch dates Journal-related information Impact factor Most downloaded articles Other journals in same subject area About Elsevier ... Select your view EUROPEAN JOURNAL OF COMBINATORICS
    M. Deza, P. Rosenstiehl

    See editorial board for all editors information
    The European Journal of Combinatorics is an international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers, short notes, and research problems on important topics.
    ISSN: 0195-6698
    Subscriptions for the year 2008, Volume 29, 8 issues

    14. Combinatorics & Optimization
    We are intensely research oriented and hold a strong international reputation in each of our six major areas Algebraic combinatorics,
    /* Changed to use separate display and positioning CSS March 28 2007 */ @import url("/coreTemplates/CSSFiles/layout/positioning3ColHome.css"); @import url("/coreTemplates/CSSFiles/display/fontDefaults.css"); @import url("/coreTemplates/CSSFiles/display/MathExtraFonts.css"); @import url("/coreTemplates/CSSFiles/print/MathPrint.css") print; @import url('/templates/includeFiles/CandO/CandO.css'); @import url("/coreTemplates/CSSFiles/mobile/MathMobile.css") handheld; Search Math
    Useful Links
    News and Events
    Welcome to the Department of Combinatorics and Optimization. Please use the sidebar to navigate our website.
    University of Waterloo
    200 University Avenue West
    Waterloo, Ontario, Canada N2L 3G1

    15. MIT Combinatorics Seminar
    MIT combinatorics seminar. contact Alex Postnikov and Lauren Williams. time Wednesday and Friday, 415 515 pm. location room 2-142 (Wednesday),
    MIT combinatorics seminar
    contact: Alex Postnikov and Lauren Williams time: Wednesday and Friday, 4:15 - 5:15 pm location: room 2-105 schedule: MIT combinatorics seminar schedule
    If your browser doesn't show any events, then you can use the html-only version of the schedule
    You can automatically get the seminar schedule in your favorite calendar application. for visitors: You can view an on-line map of MIT , highlighting building 2. If you are coming by car, you can park on Memorial drive or in any of the campus lots after 3 pm. for speakers: Your talk should be approximately 1 hour. You can use a large chalk board, an overhead projector, and a computer projector. Parking passes are available if you intend to arrive before 3 pm. Please send the organizers a title and a short abstract in plain text (no TeX/LaTeX) several weeks before your talk. links:
    tree of mathematical descendents of Gian-Carlo Rota - Neil Sloan's on-line encyclopedia of integer sequences - Richard Stanley's EC page featuring exercises on Catalan numbers and Catalan addendum math.CO preprints

    16. ScienceDirect - European Journal Of Combinatorics, Volume 29, Issue 3, Pages 555
    GEOMETRIC AND ALGEBRAIC combinatorics Papers presented at the conference GAC3 pp. 13671552 (July 2007) combinatorics of point line geometries
    Athens/Institution Login Not Registered? User Name: Password: Remember me on this computer Forgotten password? Home Browse My Settings ... Help Quick Search Title, abstract, keywords Author e.g. j s smith Journal/book title Volume Issue Page European Journal of Combinatorics
    Shortcut URL to this page: Alert me about new Journal Issues Add to Favorites setCheckedBoxes ('/scidirimg/sci_dir', 'btn_apply1.gif', 'btn_apply1.gif');
    Sample Issue Online
    About this Journal Submit your Article = Full-text available
    = Non-subscribed
    What does this mean?
    Articles in Press Volume 29 (2008) Volume 29, Issue 3
    pp. 555-792 (April 2008) Volume 29, Issue 2
    pp. 361-554 (February 2008) Volume 29, Issue 1
    pp. 1-360 (January 2008) Volume 28 (2007) Volume 27 (2006) Volume 26 (2005) Volume 25 (2004) ... Volume 13 (1992) Volume 29, Issue 3, Pages 555-792 (April 2008) Article List Full Abstracts articles Tetravalent half-arc-transitive graphs of order p
    Pages 555-567
    Yan-Quan Feng, Jin Ho Kwak, Ming-Yao Xu and Jin-Xin Zhou

    17. Australasian Journal Of Combinatorics
    THE AUSTRALASIAN JOURNAL OF combinatorics. ISSN 10344942. Published for the Combinatorial Mathematics Society of Australasia (Inc.) by the Centre for
    ISSN 1034-4942 Published for the Combinatorial Mathematics Society of Australasia (Inc.) by the Centre for Discrete Mathematics and Computing , The University of Queensland, Queensland 4072, Australia
    Fax: +61-7-3365 1477
    HONORARY EDITORS: R.G. Stanton and Anne Penfold Street
    EDITOR-IN-CHIEF: Elizabeth J. Billington (UQ)
    PRODUCTION EDITOR: C. Paul Bonnington (UA, Mathematics)
    (School of Mathematics and Statistics, University of New South Wales, Sydney, Australia), Catherine Greenhill (School of Mathematics and Statistics, University of New South Wales, Sydney, Australia), Charles Little (on leave) (Institute of Fundamental Sciences, Massey University, Palmerston North, New Zealand), Asha Rao (Department of Mathematics and Statistics, RMIT University, Melbourne, Australia)
    ASSOCIATE EDITORS: Darryn Bryant (UQ), Diane Donovan (UQ), George Havas (UQ, Info Tech and Elec Eng), Jozef Siran (UA, Mathematics)
    (UQ = Department of Mathematics, The University of Queensland, Qld 4072, Australia. UA = University of Auckland, Private Bag 92019, Auckland, New Zealand)

    18. BUBL LINK: Combinatorics
    Subject categories are algebraic geometry, combinatorial groups, combinatorics, complex variables, differential geometry, functional analysis,
    BUBL LINK Catalogue of Internet Resources Home Search Subject Menus Countries ... Z
    Titles Descriptions
  • Computational Complexity Electronic Journal of Combinatorics and World Combinatorics Exchange Mathematics Preprint Archive Mathematics Preprints and Reports ... SIAM Journals Online
  • Comments:
    Computational Complexity
    Journal which presents research at the interface between mathematics and theoretical computer science, with a clear mathematical profile and strictly mathematical format. Specific areas of concentration include structure of complexity classes, algebraic complexity, cryptography, interactive proofs, complexity issues in: computational geometry, robotics, and motion planning, learning theory, number theory, logic, combinatorial optimisation and approximate solutions, and distributed computing.
    Author: Springer
    Subjects: combinatorics, complex systems, computational mathematics, cryptography, number theory, optimisation
    Resource type: journal
    Electronic Journal of Combinatorics and World Combinatorics Exchange
    A refereed all-electronic journal that welcomes papers in all branches of discrete mathematics.
    Subjects: combinatorics
    Resource type: index, journal

    19. Combinatorics --  Britannica Online Encyclopedia
    Britannica online encyclopedia article on combinatorics the field of mathematics concerned with problems of selection, arrangement, and operation within a
    var britAdCategory = "other";
    Already a member? LOGIN Encyclopædia Britannica - the Online Encyclopedia Home Blog Advocacy Board ... Free Trial Britannica Online Content Related to
    this Topic This Article's
    Table of Contents
    Expand all Collapse all Introduction History Early developments Combinatorics during the 20th century Problems of enumeration Permutations and combinations Binomial coefficients Multinomial coefficients Recurrence relations and generating functions Partitions ... Non-self-intersecting random walk Problems of choice Systems of distinct representatives Ramsey's numbers Design theory BIB (balanced incomplete block) designs. PBIB (partially balanced incomplete block) designs. Latin squares and the packing problem Orthogonal Latin squares Orthogonal arrays and the packing problem Graph theory Definitions Enumeration of graphs Characterization problems of graph theory Applications of graph theory Planar graphs The four-colour map problem Directed graphs Combinatorial geometry Some historically important topics of combinatorial geometry Packing and covering Polytopes Incidence problems Helly's theorem ... Print this Table of Contents Shopping
    New! Britannica Book of the Year

    20. Combinatorics, Probability And Computing
    Now published bimonthly, devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical
    Home Journals
    Features Related Journals
    Journals By Title By Subject Highlights Price List 2007 ... Advanced Search
    Cambridge Alerts Free journal TOC alerts New title information alerts
    Combinatorics, Probability and Computing Edited by B©la Bollob¡s
    DPMMS, Cambridge, UK; Memphis , USA
    Editorial Board
    Instructions for Contributors Advertising Rates Links
    Aims and Scope
    Published bimonthly, is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.
    Print ISSN: 0963-5483
    Online ISSN: 1469-2163 USD Online: $505.00 USD Print Only: $535.00 Full pricing details Current volume: 17:1 - 17:6, 2008 All issues View a free sample of this journal Cambridge University Press 2008.

    Page 1     1-20 of 80    1  | 2  | 3  | 4  | Next 20

    free hit counter