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

         Combinatorics:     more books (100)
  1. Introductory Combinatorics by Kenneth P. Bogart, 2000-01-10
  2. Additive Combinatorics (Cambridge Studies in Advanced Mathematics) by Terence Tao, Van H. Vu, 2006-09-25
  3. Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica ® by Sriram Pemmaraju, Steven Skiena, 2003-12-08
  4. Combinatorial Optimization: Algorithms and Complexity by Christos H. Papadimitriou, Kenneth Steiglitz, 1998-01-29
  5. Algebraic Combinatorics I: Association Schemes (Mathematics lecture note series) by Eiichi Bannai, Tatsuro Ito, 1984-01
  6. Matrices in Combinatorics and Graph Theory (Network Theory and Applications Volume 3) (Network Theory and Applications) by Bolian Liu, Hong-Jian Lai, 2000-10-31
  7. Discrete Mathematics with Combinatorics, Second Edition by James A. Anderson, 2003-08-15
  8. Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications) by Francine Blanchet-Sadri, 2007-11-19
  9. Combinatorics: A Problem Oriented Approach (Classroom Resource Materials) by Daniel A. Marcus, 1999-01-14
  10. Introduction to Combinatorics (Chapman Hall/CrcMathematics Series) by Alan Slomson, 1991-02-01
  11. Probabilistic Combinatorics and Its Applications (Proceedings of Symposia in Applied Mathematics) by Fan R. K. Chung, 1992-01
  12. A Path to Combinatorics for Undergraduates: Counting Strategies by Titu Andreescu, Zuming Feng, 2003-11-11
  13. Enumerative Combinatorics (Discrete Mathematics and Its Applications) by Charalambos A. Charalambides, 2002-05-29
  14. Constructive Combinatorics (Undergraduate Texts in Mathematics) by Dennis Stanton, Dennis White, 1986-05-15

21. ScienceDirect - European Journal Of Combinatorics - List Of Issues
The combinatorics netMaintained by Bill Chen.
This Feature requires JavaScript
or Login: Password: Athens Login
European Journal of Combinatorics Bookmark this page as:
Articles in Press
Volume 25 Volume 25, Issue 5 , Pages 621-756 (July 2004) Volume 25, Issue 4 , Pages 457-620 (May 2004)
Arithmetique et Combinatoire Volume 25, Issue 3 , Pages 311-455 (April 2004) Volume 25, Issue 2 , Pages 145-310 (February 2004)
In memory of Jaap Seidel Volume 25, Issue 1 , Pages 1-144 (January 2004) Volume 24 Volume 23 Volume 22 Volume 21 ... Volume 14 Alert me when new Journal Issues are available Add this journal to My Favorite Journals Sample Issue Online More Publication Info
Elsevier B.V.

22. ACM-SIAM Symposium On Discrete Algorithms
ACMSIAM Symposium on Discrete Algorithms. To follow the 7th Workshop on Algorithm Engineering and Experiments (ALENEX05) and the 2nd Workshop on Analytic Algorithmics and combinatorics (ANALCO05). Vancouver, BC, Canada; 2325 January 2005.
If applying for a visa, please remember to allow ample time for the application process. See Conference Information for information about entering Canada. The 7th Workshop on Algorithm Engineering and Experiments (ALENEX05) and the 2nd Workshop on Analytic Algorithmics and Combinatorics ( ) will be held immediately preceding the conference at the same location.
This symposium focuses on research topics related to efficient algorithms and data structures for discrete problems. In addition to the design of such methods and structures, the scope also includes their use, performance analysis, and the mathematical problems related to their development or limitations. Performance analyses may be analytical or experimental and may address worst-case or expected-case performance. Studies can be theoretical or based on data sets that have arisen in practice and may address methodological issues involved in performance analysis.
Themes and application areas include, but are not limited to, the following topics: Combinatorics and other aspects of Discrete Mathematics such as:
  • Algebra Combinatorial Structures Discrete Optimization Discrete Probability Graph Drawing Graphs and Networks Mathematical Programming Number Theory Random Structures
other aspects of Computer Science such as:
  • Communication Networks Computational Geometry Computer Graphics and Computer Vision Computer Systems Cryptography and Security Data Compression Databases and Information Retrieval

23. 05: Combinatorics
05 combinatorics. Introduction. combinatorics is, loosely, the science of counting in this page all the topics with which a person new to combinatorics might come into contact
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.

24. Andreas R. Blass
University of Michigan, Ann Arbor Set theory, finite combinatorics, theoretical computer science.
Andreas R. Blass
Office: 3830 East Hall Mathematics Department
University of Michigan
(2072 East Hall
525 East University Ave.)
Ann Arbor, MI 48109-1109
U.S.A. Office phone: (734) 763-1183
Dept. fax: (734) 763-0937 e-mail:
My research is primarily in mathematical logic, especially set theory, but it extends into other areas, including finite combinatorics, category theory, and theoretical computer science. Here are some of the subjects I've worked in recently.
  • Set theory
    • Infinitary combinatorics, especially ultrafilters on the natural numbers
    • Cardinal characteristics of the continuum
    • Applied set theory, especially in abelian group theory
  • Category theory
    • Topoi and their internal logic
    • Logic of geometric morphisms
  • Finite combinatorics
  • Theoretical computer science
    • Complexity theory
    • Applications of mathematical logic
  • Linear logic
    • Game semantics
    • Connection with cardinal characteristics
    During the fall semester, 2004, I am scheduled to teach Math 681 (Mathematical Logic) and Math 481 (Introduction to Mathematical Logic).

25. Combinatorics And Graph Theory With Mathematica
Combinatorica is a library of 230 functions turning Mathematica into a powerful tool for graph theory and combinatorics.

26. Combinatorics, Probability & Computing
Home Journals combinatorics, Probability Computing. combinatorics, Probability Computing. Edited by Béla Bollobás University of Memphis, USA.

27. Qseries Conference
University of Illinois at UrbanaChampaign, USA; 2628 October 2000.
q-series with Applications to Combinatorics, Number Theory and Physics. October 26-28, 2000 University of Illinois at Urbana-Champaign.
Plenary Speakers
Scott Ahlgren (Colgate University)
George Andrews (Penn State University)
Richard Askey (University of Wisconsin)
Anne Schilling (MIT)
Dennis Stanton (University of Minnesota) Special Note: Some of the plenary lectures will highlight open problems and future trends. Invited Speakers
Krishnaswami Alladi (University of Florida)
Douglas Bowman (University of Illinois)
Youn-Seo Choi (Korea Institute for Advanced Study)
Thomas Ernst (Uppsala University) Tina Garrett (University of Minnesota) Frank Garvan (University of Florida) Christian Krattenthaler (University of Vienna) Jeremy Lovejoy (University of Wisconsin) Steve Milne (Ohio State University) Katsuhisa Mimachi (Kyushu University) Morris Newman (University of California, Santa Barbara) Peter Paule (University of Linz) Sasha Polishchuk (Boston University) Sergei Suslov (Arizona State University) Ole Warnaar (Melbourne University) Sander Zwegers (University of Utrecht) Contributed Talks (September 15, 2000 Deadline for titles and abstracts)

28. Kluwer Academic Publishers - Journal Of Algebraic Combinatorics
This web page uses frames, but your browser doesn't support them.

29. Kluwer Academic Publishers - Journal Of Algebraic Combinatorics
(Kluwer) Tables of contents and abstracts from vol.6 (1997) on. Full text to subscribers.
This web page uses frames, but your browser doesn't support them.

30. Research In Number Theory & Combinatorics
Number Theory and combinatorics. Staff, research interests.
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

31. SpringerLink - Publication
Annals of combinatorics(Birkhäuser) Tables of contents from vol.4 (2000) on. Full text to subscribers via Springer LINK.
Articles Publications Publishers

Publication Graphs and Combinatorics Publisher: Springer-Verlag Tokyo ISSN: 0911-0119 (Paper) 1435-5914 (Online) Subject: Computer Science Engineering Mathematics Issues in bold contain article full text that you are entitled to view. Volume 20 Number 1 Volume 19 Number 4 Number 3 Number 2 Number 1 ... Request a sample Volume 18 Number 4 Number 3 Number 2 Number 1 Volume 17 Number 4 Number 3 Number 2 Number 1 Volume 16 Number 4 Number 3 Number 2 Number 1 Volume 15 Number 4 Number 3 Number 2 Number 1 Volume 14 Number 4 Number 3 Number 2 Number 1 Publication 1 of 1 Previous Publication Next Publication Linking Options About This Journal Editorial Board Manuscript Submission Quick Search Search within this publication... For:
Table Of Contents Alerting Click the button below to enable Table Of Contents Alerting for this publication.
For assistance inside the Americas: , For assistance outside the Americas:

32. Hanaki
Shinshu University. Representation Theory of Finite Groups; Algebraic combinatorics; Computational Algebra.
Akihide HANAKI
Japanese Field of Reseach : Representation Theory of Finite Groups, Algebraic Combinatorics, Computational Algebra My Publications
Unpublished Notes

Data of association schemes

Young Mathematician's Conference (in Japanese)

Shinshu University, Depertment of Mathematics

33. Bridge Probabilities, Combinatorics And Probability Analysis For Bridge Hands
Features combinatorics and probability analysis for bridge hands.
Durango Bill's
Bridge Probabilities and Combinatorics Bridge Probabilities
Combinatorics and Probability Analysis for Bridge Hands
(Includes how to calculate the results and computer source code) The following sections cover several aspects of Bridge probabilities and combinatorics. Each section has a link that gives the statistical results and another link that shows how the results are calculated. The "How to" sections give both a generalized description of the calculations and algorithm as well as the "C" source code.
Math Symbols/Notation:
Use this link for explanations of the math symbols used. Generally, we will use math notation as expressed/used in Microsoft's Excel spreadsheets.
Bidding Combinatorics: Statistics "How to" calculations There are 1.28746 E+47 (Scientific notation for 128+ billion billion billion billion billion (American billion = 1,000,000,000)) different ways to bid after the cards have been dealt. Most of these sequences are nonsensical, but they are legal, hence they must be counted. This is about 2.4 billion billion times larger than the number of ways that four hands can be dealt from a deck of cards. (Total number of possible deals = FACT(52) / ((FACT(13)^4) = 5.36447 E+28) (Note: The order of the cards in a bridge hand is not relevant.)
Bidding combinatorics for a hand is divided into 3 parts. Part one is just to 3 "Passes" before someone mentions a quantity (1 - 7) and a suit (or No Trump). Part 2 contains all quantity and suit bids (We will count suit bids for the stats output) through the last "quantity-suit" bid. This will include all possible intervening bids of "pass", "double", and "redouble". Part 3 comes after the last "quantity-suit" bid, and the only words allowed are "pass", "double", and "redouble".

34. Australasian Journal Of Combinatorics
THE AUSTRALASIAN JOURNAL OF combinatorics. ISSN 10344942. Publishedfor the Combinatorial Mathematics Society of Australasia (Inc
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)
CHIEF MANAGING EDITOR: C. Paul Bonnington (UA, Mathematics)
MANAGING EDITORS: Charles Little (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), Peter Gibbons (UA, Computer Science), George Havas (UQ, Info Tech and Elec Eng), Barry D. Jones (UQ), Sheila Oates-Williams (UQ)
(UQ = Department of Mathematics, The University of Queensland, Qld 4072, Australia. UA = University of Auckland, Private Bag 92019, Auckland, New Zealand)

35. The Math Forum - Math Library - Combinatorics
This page contains sites relating to combinatorics. Browse and Searchthe Library Home Math Topics Discrete Math combinatorics.
Browse and Search the Library
Math Topics Discrete Math : Combinatorics

Library Home
Search Full Table of Contents Suggest a Link ... Library Help
Subcategories (see also All Sites in this category Selected Sites (see also All Sites in this category
  • AMOF: The Amazing Mathematical Object Factory - Canada's SchoolNet
    Combinatorial objects are everywhere. How many ways are there to make change for $1 using unlimited numbers of coins of all denominations? Each way is a combinatorial object. AMOF is part encyclopedia and part calculator, a teaching tool that generates mathematical permutations for such combinatorial objects as subsets and combinations, partitions, magic squares, and Fibonacci sequences by allowing the user to define the parameters of discrete objects. The Object Factory returns a list of all objects that satisfy those parameters. The site can be used to learn more about many types of discrete mathematical structures; descriptions of objects progress in complexity for students at different levels. For more advanced materials, see the Combinatorial Object Server (COS).
  • 36. Extremal Combinatorics
    Web page supporting the book Extremal combinatorics list of misprints,further exercises and problems, links, etc. To Indré

    37. Combinatorics -- From MathWorld
    combinatorics. New York SpringerVerlag, 1997. Balakrishnan, V. K. combinatorics,including Concepts of Graph Theory. New York McGraw-Hill, 1995.
    INDEX Algebra Applied Mathematics Calculus and Analysis Discrete Mathematics ... Alphabetical Index
    ABOUT THIS SITE About MathWorld About the Author
    DESTINATIONS What's New MathWorld Headline News Random Entry ... Live 3D Graphics
    CONTACT Email Comments Contribute! Sign the Guestbook
    MATHWORLD - IN PRINT Order book from Amazon Discrete Mathematics Combinatorics General Combinatorics
    Combinatorics The branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations which characterize these properties. Algebraic Combinatorics Antichain Chain Dilworth's Lemma ... search
    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. Combinatorics, including Concepts of Graph Theory. New York: McGraw-Hill, 1995. Bellman, R. and Hall, M. Combinatorial Analysis.

    38. Information About Prof S.D. Cohen
    University of Glasgow. Number theory, algebea, combinatorics.

    39. Arnold Adelberg
    Grinnell College. Number theory, algebraic geometry, combinatorics. Recent publications and information.
    Arnold Adelberg
    Myra Steele Professor of Mathematics
    Grinnell College

    Ph.D. in mathematics, Princeton University, 1996.
    M.A. in mathematics, Princeton University, 1959.
    A.B. summa cum laude with distinction in mathematics, Columbia College, 1956. Interests: Number theory, algebraic geometry, combinatorics. Referee for The American mathematical monthly Discrete mathematics The Fibonacci quarterly , and The journal of number theory
    Reviewer for Mathematical reviews Positions held Recent publications:

    40. The MIT Combinatorics Seminar Web Page
    MIT combinatorics Seminar Room 45pm. General Information The combinatoricsseminar at MIT covers a wide range of topics each year.
    Home Archives February March ... May
    MIT Combinatorics Seminar
    Room 2 - 338
    Wednesdays and Fridays 4:15pm sharp
    Refreshments at 3:45pm
    General Information:
    The combinatorics seminar at MIT covers a wide range of topics each year. We emphasize applications of combinatorics to various areas of mathematics and theoretical computer science . This year the seminar is organized by Igor Pak . Feel free to contact Igor for more information or to get on or off the e-mailing list for this seminar. Refreshments are served at 3:45 p.m. in the Applied Math Common room (just down the hall from 2-338). You can view an on-line map of MIT, highlighting Building 2, from THIS link. If you are coming by car, you can park in any of the campus lots after 3:00 p.m. (e.g. building 70 ) or on Memorial drive if you can find a spot.
    Spring 2004 Schedule:
    All announcements for past years: archive
    Additional Information for Speakers:
    Your talk should be approximately 1 hour. We have a large chalk board and an overhead projector in the room. People use both. Also this year, we can obtain a computer projector and/or a TV/VCR. Parking passes are available if you intend to arrive before 3:00pm.

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

    free hit counter