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

         Combinatorics:     more books (100)
  1. Graphs, Combinatorics, Algorithms and Applications
  2. Greedoids (Algorithms and Combinatorics) by B. H. Korte, Laszlo Lovasz, et all 1991-10
  3. Lattice Path Combinatorics With Statistical Applications (Mathematical Expositions Ser.) by T. V. Narayana, 1979-05
  4. Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics) by Bernhard Korte, Jens Vygen, 2007-11-29
  5. Combinatorics (Wiley-Interscience Series in Discrete Mathematics and Optimization) by Russell Merris, 2003-08-15
  6. Association Schemes: Designed Experiments, Algebra and Combinatorics (Cambridge Studies in Advanced Mathematics) by R. A. Bailey, 2004-04-05
  7. Matrices and Matroids for Systems Analysis (Algorithms and Combinatorics) by Kazuo Murota, 2000-03-15
  8. Advanced Combinatorics: The Art of Finite and Infinite Expansions by L. Comtet, 1974-05-31
  9. Mathematical Problems and Proofs: Combinatorics, Number Theory, and Geometry by Branislav Kisacanin, 1998-10-31
  10. Combinatorics of Symmetric Designs (New Mathematical Monographs) by Yury J. Ionin, Mohan S. Shrikhande, 2006-05-29
  11. Applied Combinatorics 1980 Edition by Alan Tucker, 1980
  12. Surveys in Combinatorics, 1993 (London Mathematical Society Lecture Note Series)
  13. Algebraic, Extremal and Metric Combinatorics 1986 (London Mathematical Society Lecture Note Series)
  14. Additive Combinatorics (Crm Proceedings and Lecture Notes)

61. The Book "A=B"
combinatorics text by Marko Petkovsek, Herbert Wilf and Doron Zeilberger. Published by A. K. Peters. PDF.
Home Page for the Book "A=B"
by Marko Petkovsek Herbert Wilf and Doron Zeilberger
with a Foreword by Donald E. Knuth (read it below)
About the Book
"A=B" is about identities in general, and hypergeometric identities in particular, with emphasis on computer methods of discovery and proof. The book describes a number of algorithms for doing these tasks, and we intend to maintain the latest versions of the programs that carry out these algorithms on this page. So be sure to consult this page from time to time, and help yourself to the latest versions of the programs. In addition to programs, we will post here other items of interest relating to the book, such as the current errata sheet (see below). The other side of the coin is that we invite your comments about the content of the book, the programs, any errors that you may discover, or whatever. You can send us your comments by e-mail if you wish. The book is a selection of the Library of Science. A Japanese translation of A=B, by Toppan Co., Ltd., appeared in November of 1997.

62. Walter Alexandre Carnielli - Personal Homepage
State University of Campinas, Brazil Foundations of non-classical logics, many-valued logics, paraconsistent logics, finite and infinite combinatorics.
Centre for Logic, Epistemology and the History of Science [CLE]
Current Position
Reserch Interests Academic Qualifications Professional Positions ... Recent Students Prof.Dr.Walter Alexandre Carnielli Personal Homepage Postal Address: Centre for Logic, Epistemology and the History of Science - CLEHC
State University of Campinas - UNICAMP
P.O. Box 6133, 13083-970
Campinas - SP - Brazil Fax:+55-19-3289-3269 - Tel.:+55-19-3788-6515
Interesting Sites Forthcoming papers ...
Workgroup on Logic National Graduate Association for Philosophy (ANPOF)
Last Update: May 07 th

63. Lothaire
Lothaire s Books. Applied combinatorics on Words. This is the third Algebraiccombinatorics on Words. This book covers developments
Lothaire's Books
Applied Combinatorics on Words This is the third book in the Lothaire's series, following the volumes ``Combinatorics on Words'' and ``Algebraic Combinatorics on Words'' already published. Its objective is to present in a unified manner the various applications of combinatorics on words. The application areas include core algorithms for text processing, natural language processing, speech processing, bioinformatics, and several areas of applied mathematics such as combinatorial enumeration and fractal analysis. The intended audience is the general scientific community. No special knowledge is needed, and familiarity with the application areas or with the material covered by the previous volumes is not required. In particular, the content, including problems and algorithms, is accessible to anyone working in the area of computer science. As with the previous volumes, this book is written in collaboration by a group of authors, under the guidance of the editors.
The book is available in compressed PostScript (2.5 MB): Applied Combinatorics on Words . It is organized as follows with links to chapters.
(Last modification: June 1, 2004)

Number Theory (analytic number theory, Diophantine approximations, uniform distribution), combinatorics and Physics. University of Bordeaux, 1114 September 2000.
First Announcement
Please inform us at your earliest convenience (before end of June) whether you intend to take part in the conference. The conference fee is Fr 150 to be paid at the beginning of the conference, September 11, 2000. You may find on this link ( speakers ) the first list of invited speakers but also more detailed informations on the program of the conference ( program ) and a map to find the location of the colloquium ( map
Please let us know if you need further information (you may also see the page information) . We expect your reply, questions and suggestions by e-mail to our address: or by traditional mail to the address:
Jean-Jacques Ruch
You will find a registration form on the following page: registration. journal
Advisory Committee: Organizing Committee: Pierre Cartier (chairman), Jean-Paul Allouche (chairman), Anne Bertrand, Christophe Doche Jean-Marc Deshouillers, Jean-Jacques Ruch. Pierre Liardet, Michel Olivier

65. Combinatorics/Number Theory RESEARCH DIRECTORY
combinatorics/Number Theory Directory.
Combinatorics/Number Theory Directory
The main subareas of interest and the faculty connected with them are listed below. Some of these faculty have additional research interests
Graph Theory
Arthur Hobbs
Analytic Number Theory
Doug Hensley
Combinatoric Number Theory
Itshak Borosh
Combinatorial Topology
Laura Anderson
Toric Varieties
J. Maurice Rojas
Hal Schenck
Research Directory

66. Algebraic Combinatorics In Europe
A Research Training Network of the European Community. Algebraic combinatoricsin Europe. (ACE). Project overview. When a variety of fields meets combinatorics.
A Research Training Network of the European Community
Algebraic Combinatorics in Europe
Overview The Teams Programme Open Positions Activities ... Preprints Project overview When a variety of fields meets combinatorics The origins of Algebraic Combinatorics lie in the desire to advance combinatorial theory from the state as a ``bag of various, isolated tricks" (as it is often seen) to an organised body of algebraic theories that bring order into seemingly disorder. Of course, Gian-Carlo Rota's name has to be mentioned here. He started this development by the introduction of the theory of , and the systematical use and development of umbral calculus in the 60's and 70's. Since then many more algebraic theories have evolved and are still being developed, e.g., theory of "species" and "generatingfunctionology" combinatorial representation theory symmetric functions and tableau calculus combinatorial topology (to mention just a few), bringing increasing insight in and understanding of combinatorial structures. Today, Algebraic Combinatorics concerns itself with the study of combinatorial problems arising from other branches of mathematics and, on the other hand, with the application and use of techniques coming from other parts of mathematics to combinatorial problems. At the heart of the subject there is the development of algebraic theories for the solution of such problems. The implied interactions with other fields are mutually beneficial and concern particularly

67. Peter M Neumann
The Queen's College, University of Oxford. Varieties of groups; finite permutation groups; infinite permutation groups; design of grouptheoretic algorithms; soluble groups; quantitative topics in group theory; matrices over finite fields; miscellaneous questions in combinatorics, geometry and general group theory; history of group theory. Chairman of the UK Mathematics Trust.
Dr Peter M Neumann
Tel: 01865 279178 Fax: 01865 790819 Email:
Fellow and Praelector in Mathematics at The Queen's College , since 1966 and Lecturer (CUF) in the University of Oxford since 1967; visiting lecturer or visiting professor at various times at various universities in many parts of the world. In Queen's I teach all branches of pure mathematics to undergraduates. For the University I lecture to undergraduates and graduate students on anything of interest to myself and, I hope, to them; I also supervise MSc and DPhil students in any area related to my own research. So far 30 students have completed doctorates under my supervision. For the three academic years October 1995 to September 1998 I was seconded half-time to Staff Development to help with University Teacher Training within Oxford. Other positions include: Chairman of the United Kingdom Mathematics Trust (UKMT) ; Vice-President of the British Society for History of Mathematics (BSHM) ; Editor of London Mathematical Society Monographs (published for the Society by OUP); editor of

68. SwetsWise: Login More results from Ingenta all issues European Journal of combinatorics user name. password. remember me. enter. Athens click here to loginvia Athens. European Journal of combinatorics, ISSN 0195-6698 in our

69. Robin Chapman
University of Exeter. Number theory, algebra, combinatorics and problem solving. Papers, lecture notes and survey articles.
Robin Chapman's Home Page
I'm a lecturer in Mathematics at the University of Exeter . My mathematical interests include number theory, algebra, combinatorics and problem solving. This is how I looked on 20th March 1999. This is my teaching page where you'll find details of courses, undergraduate projects etc. And this is my list of publications I have the following manuscripts available:
  • Lecture notes:
  • Preprints:
    • Cubic identities for theta series in three variables ( dvi ps pdf
      submitted to The Ramanujan Journal
    • A probabilistic proof of the Andrews-Gordon identities ( dvi ps pdf
      submitted to Discrete Mathematics
    • Determinants of Legendre symbol matrices ( dvi ps pdf
      submitted to Acta Arithmetica
    • Evaluation of the Dedekind eta function (with William Hart) ( dvi ps pdf
      submitted to Canadian Mathematical Bulletin
  • Miscellaneous articles and surveys:
    • Evaluating zeta(2) ( dvi ps pdf
      This gives (so far) fourteen proofs that the sum of the reciprocals of the squares of the natural numbers equals pi squared over six.
    • Constructions of the Golay codes ( dvi ps pdf
      So far this is restricted to the binary Golay code. Eight constructions are given.

70. Ingenta: All Issues -- Journal Of Algebraic Combinatorics
user name. password. remember me. enter. Athens click here to loginvia Athens. Journal of Algebraic combinatorics, ISSN 09259899 in

need help?
online articles
fax/ariel articles
user name
remember me Athens
click here to login via Athens

Journal of Algebraic Combinatorics ISSN 0925-9899
in our archives:
Volume 01 (1992) through Volume 19 (2004) Publisher: Kluwer Academic Publishers see publisher's website LATEST NEXT PREVIOUS EARLIEST Volume 19, Issue 2, March 2004 Volume 19, Issue 1, January 2004 Volume 18, Issue 3, November 2003 Volume 18, Issue 2, September 2003 Volume 18, Issue 1, July 2003 Volume 17, Issue 3, May 2003 Volume 17, Issue 2, March 2003 Volume 17, Issue 1, January 2003 LATEST NEXT PREVIOUS EARLIEST Publisher: Kluwer Academic Publishers terms and conditions

71. S. D. Adhikari
HarishChandra Research Institute. Number theory and combinatorics. List of publications.
Sukumar Das Adhikari
click to enlarge Email Professor ( Mathematics) Academic Qualifications
  • M. Sc. in Pure Mathematics from University of Burdwan.
  • Ph. D. in Mathematics from the Institute of Mathematical Sciences, Madras (Degree awarded by the University of Madras).
    Thesis supervisor : Prof. R. Balasubramanian.
Mathematical Interests : Number Theory and Combinatorics. Research Papers
  • On an error term related to the greatest divisor of $n$, which is prime to $k$.
    (Written jointly with R. Balasubramanian and A. Sankaranarayanan)
    Indian J. Pure Appl. Math.

  • (with R. Balasubramanian and A. Sankaranarayanan)
    Hardy - Ramanujan Journal
  • On an error term related to the Jordan totient function $J_k(n)$.
    (Written jointly with A. Sankaranarayanan)
    J. Number Theory 34, no 2., 178-188 (1990).
  • A note on a certain error term.
    (Written jointly with R. Balasubramanian)
    Arch. Math.

  • Acta Arithmetica
    57, no. 2, 83-92 (1991)
  • Lattice points in ellipsoids. Acta Arithmetica 59, no. 4, 329-338 (1991)
  • Towards the exact nature of a certain error term.
  • 72. Bridge Probabilities, Combinatorics And Probability Analysis For Bridge Hands
    Bridge Probabilities, combinatorics and probability analysis for Bridgehands. Durango Bill s Bridge Probabilities and combinatorics,
    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".

    73. Home Page For Cristina Ballantine
    College of the Holy Cross. Number Theory, representation theory, automorphic forms, and algebraic combinatorics. Curriculum vitae and publications.
    College of the Holy Cross
    Department of Mathematics and Computer Science
    Cristina M. Ballantine
    Mathematical Interests:
    • Number Theory, Representation Theory and Automorphic Forms Algebraic Combinatorics

    74. CBMS 2004 Lecture Series At CSUSM, June 7 -11, 2004
    The combinatorics of Large Sparse Graphs An NSFCBMS Regional Conference June 7-11,2004. Department of Mathematics California State University at San Marcos.
    The Combinatorics of Large Sparse Graphs An NSF-CBMS Regional Conference
    June 7-11, 2004 Department of Mathematics
    California State University at San Marcos A randomly generated power law graph Fan Chung Graham A random subgraph of the Collaboration graph
    Series of ten lectures by Fan Chung Graham (UC San Diego).
    Large sparse graphs refer to graphs that can be used to model very large scale distributed networks that arise in internet computing and biological applications. Analyzing these graphs and understanding their properties is an exciting new area of research that combines techniques from probabilistic combinatorics and classical graph theory. In this CBMS Lecture Series to be held at CSUSM, Professor Fan Chung Graham, who is a leading authority in this area, will give 10 lectures that establish the main results in the field and chart possible future directions for research. Support for interested participants is available, with first priority given to graduate students, postdocs and junior faculty. All interested students and faculty are encouraged to follow the links below and apply.
    The talks will be held in Room 100, University Hall (across from the main entrance of the library). There will be coffee and snacks starting at 9:00 a.m.; the talks start at 9:30 a.m.

    75. Zhi-Wei Sun's Home Page
    Nanjing University. Number theory (especially combinatorial number theory); combinatorics; Group theory; Mathematical logic. Papers and lectures.
    Initial day: July 31, 2001 Last modified: visits since April 10, 2002 ¡¡¡¡¡¡ ¡¡¡¡¡¡ ¡¡¡¡¡¡
    ¡¡¡¡¡¡¡¡¡¡Prof. Dr. Zhi-Wei SUN
    ¡¡¡¡¡¡¡¡¡¡¡¡Department of Mathematics
    ¡¡¡¡¡¡¡¡¡¡¡¡Nanjing University
    ¡¡¡¡¡¡¡¡¡¡¡¡Nanjing 210093
    ¡¡¡¡¡¡¡¡¡¡¡¡The People's Republic of China
    ¡¡¡¡¡¡¡¡¡¡¡¡Telephone: 0086-25-83594840
    ¡¡¡¡¡¡¡¡¡¡¡¡Office in the Dept.: 111A
    Family Name Sun Zhi Wei Date of Birth October 16, 1965 ¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡¡Nationality The People's Republic of China Research Interests
    Number Theory (especially Combinatorial Number Theory), ¡¡¡¡¡¡ Combinatorics, Group Theory, Mathematical Logic. Academic Service ¡¡¡¡¡¡ Reviewer for Mathematical Reviews ¡¡¡¡¡¡ Member of the American Mathematical Society ¡¡¡¡¡¡ Referee for J. Number Theory, Discrete Math., Fibonacci Quart., ¡¡¡¡¡¡¡¡ Publ. Math. Debrecen, Math. Slovaca, INTEGERS etc.

    76. European Graduate Program ``Combinatorics, Geometry, And Computation'', Berlin -
    Translate this page A European graduate programme.

    77. Florence, University Of
    Department of Systems and Computer Science. Research areas include adaptive and predictive control, algorithms and data structures, applied mathematics, artificial intelligence, bioengineering and medical informatics, combinatorics, computer vision, databases, formal methods, modeling and identification, nonlinear dynamics, operations research, robust control, and software engineering.
    Dipartimento di Sistemi e Informatica Department offices are in two different locations. Via di Santa Marta, 3 (Direction)
    50139 Firenze
    Seg: +39.055.4796257
    Fax: +39.055.47967363 Via C. Lombroso 6/17
    50134 Firenze
    Fax: +39.055.4796730 Visitatori Events People Research Teaching ... Webadmin

    78. Statistical Mechnics & Combinatorics Research Group
    Statistical Mechanics and combinatorics Group. Group members My general interestlies in lattice path problems in combinatorics and statistical mechanics.
    Statistical Mechanics and Combinatorics Group
    Group members:
    Academic Staff Professor Anthony J. Guttmann
    Professor Colin J. Thompson FAA

    Dr Omar E. Foda
    (Associate Professor)
    Dr Paul A. Pearce
    (Associate Professor)
    Dr Nicholas C. Wormald
    (Associate Professor)
    Dr Richard Brak
    (Senior Lecturer)
    Dr Peter Forrester
    (ARC Senior Research Fellow)
    Dr Aleks L. Owczarek
    (ARC Senior Research Fellow)
    Dr Iwan Jensen
    (ARC Research Fellow)
    Postdoctoral Research Fellows
    Dr. Catherine Greenhill
    Dr William Orrick Dr Trevor Welsh Postgraduate Students Henry Wong
    Our Research Area.
    Statistical mechanics involves the understanding of large complex systems by averaging the behaviour of the individual components. For example, one can understand the behaviour of a gas without describing the motion of all the molecules involved, simply by knowing the type and strength of the forces between the molecules, using the principles of statistical mechanics. This powerful idea can be applied to many and varied systems in the natural world and in the human arena. It was

    79. Computer Science Departement - Bordeaux 1 University
    Computer Science Department. Research areas include combinatorics, algorithmics, logic, automata, parallel computing, symbolic programming, and graphics.
    Université Bordeaux I
    UFR Mathématiques et Informatique
    Computer Science Department
    The Department

    80. Park City Mathematics Institute
    The 2004 Summer Session will be held July 1131 in Park City, Utah.2004 Research topic Geometric combinatorics;. Organizers Ezra

    Institute for Advanced Study Questions and Comments
    The 2004 Summer Session will be held July 11-31 in Park City, Utah. 2004 Research topic: Geometric Combinatorics; Organizers:
    Ezra Miller, University of Minnesota
    Victor Reiner, University of Minnesota
    Bernd Sturmfels, Clay Senior Scholar in Residence,
    University of California Berkeley
    2004 Education topic: From Policy to Practice: Partnerships with School Districts Coordinators:
    Gail Burrill, Michigan State University;
    Joan Ferrini-Mundy, Michigan State University;
    Daniel Goroff, Harvard University; Carol Hattan, Skyview High School, Vancouver, WA. James King, University of Washington PCMI Program Director C. Herbert Clemens, The Ohio State University PCMI Program Staff Catherine Giesbrecht , Program Administrator Carleen Inderieden , Project Coordinator Contact Information: PCMI is a program of the Institute for Advanced Study, Einstein Drive, Princeton, NJ 08540

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

    free hit counter