1. 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, http://www.combinatorics.org/

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.

2. The Combinatorics Net Maintained by Bill Chen. http://www.combinatorics.net/

3. CO Combinatorics combinatorics section of the Front for the Mathematics ArXiv. http://front.math.ucdavis.edu/math.CO

Fri 16 Sep 2005 Search Submit Retrieve Subscribe ... iFAQ CO Combinatorics Calendar Search Authors: All AB CDE FGH ... U-Z New articles (last 12) 16 Sep math.CO/0509358 On decomposability of 4-ary distance 2 MDS codes, double-codes, and n-quasigroups of order 4. Denis Krotov (Sobolev Institute of Mathematics, Novosibirsk, Russia). 17 pages. CO 16 Sep math.CO/0509347 A Proof of the Loehr-Warrington Amazing TEN to the Power n Conjecture. Shalosh B. Ekhad , Vince Vatter , Doron Zeilberger CO 16 Sep math.CO/0509339 Recent Progress in Graph Pebbling. Glenn Hurlbert . 24 pages. CO GR NT 16 Sep math.CO/0509337 Graphical condensation of plane graphs: a combinatorial approach. Weigen Yan , Yeong-Nan Yeh , Fuji Zhang . 14 pages. CO 16 Sep math.CO/0509325 Denis Krotov (Sobolev Institute of Mathematics, Novosibirsk, Russia). 12 pages. CO 15 Sep math.CO/0509298 Eigenproblem for Jacobi matrices: hypergeometric series solution. Vadim B. Kuznetsov , Evgeny K. Sklyanin . 15 pages. CO MP Cross-listings 16 Sep math.NT/0509350 Evaluating Determinants of Two Classes of Special Matrices. Shujun Li . 9 pages. NT CO 15 Sep math.PR/0509322

4. Mathematics Archives - Topics In Mathematics - Combinatorics Algebraic combinatorics Via Finite Group Actions TECHNOLOGY Postscript and DVI readers; Dynamic Surveys in combinatorics http://archives.math.utk.edu/topics/combinatorics.html

Topics in Mathematics Combinatorics Algebraic Combinatorics Via Finite Group Actions ADD. KEYWORDS: Lecture Notes Algorithms Project at INRIA ADD. KEYWORDS: Publications, Analysis of Algorithms, Software, Seminars, Books, On-line Encyclopedia AMOF: The Amazing Mathematical Object Factory ADD. KEYWORDS: Subsets, Combinations, Permutations, 8-Queens Problem, Pentominoes, Permutations of a Multiset, Partitions, Fibonacci Sequences, Magic Squares AMS's Materials Organized by Mathematical Subject Classification - Combinatorics ADD. KEYWORDS: Electronic Journals, Preprints, Web Sites, Databases Combinatorial Catalogues ADD. KEYWORDS: Data, Graphs, Geometries, Designs, Groups SOURCE: Gordon Royle, University of Western Australia Combinatorial Object Server ADD. KEYWORDS: Permutations, Subsets or Combinations, Permutations or Combinations of a Multiset, Set Partitions, Numerical Partitions and relatives, Trees, Necklaces, Lyndon words, DeBruijn Sequences, Ideals or Linear Extensions of a Poset, Spanning Trees Combinatorics ADD. KEYWORDS:

5. Combinatorics, Probability And Computing (CUP) 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. Contact information; full text to subscribers. http://uk.cambridge.org/journals/cpc/

Home Journals Features Related Journals Journals By Title By Subject Highlights New Journals 2004 ... Advanced Search Cambridge Alerts Free journal TOC alerts New title information alerts Combinatorics, Probability and Computing Edited by Béla Bollobás University of 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 Full pricing details Current volume: 14:1 - 14:6, 2005 All issues View a free sample of this journal Cambridge University Press 2005.

6. Www.jalc.de Formerly Journal of Information Processing and Cybernetics. Table of contents, all volumes. http://www.jalc.de/

http://theo.cs.uni-magdeburg.de/jalc/ http://theo.cs.uni-magdeburg.de/jalc/

7. Algebraic Combinatorics HTML book by A. Betten, H. Fripertinger, and A. Kerber. http://www.mathe2.uni-bayreuth.de/frib/html/book/hyl00.html

Algebraic Combinatorics Via Finite Group Actions A. Betten, H. Fripertinger, A. Kerber January 19, 2005 Important hint: If you have problems with reading the mathematical symbols, please try to find some information how to adjust your browser configuration from TTH in Action or Enabling Symbol font for Mozilla on Windows or Browser problems Actions Actions of groups Orbits ... Index harald.fripertinger "at" uni-graz.at http://www-ang.kfunigraz.ac.at/~fripert/ UNI-Graz UNI-Bayreuth last changed: January 19, 2005

8. Combinatorics Jobs Maintained by British Combinatorial Committee, but worldwide scope. http://www.maths.qmw.ac.uk/~pjc/bcc/jobs.html

Jobs in combinatorics and related areas See also the website of jobs.ac.uk for a listing of academic job vacancies in the United Kingdom, or the Jobs section on the LMS website for mathematics jobs. More mathematical jobs are listed at math-jobs.com , part of the Luchsinger Mathematics Group Research assistant/research student in the School of Mathematics and Statistics, University of Glamorgan, to work in the Data and Software Integrity Research Unit on a project in Coding Theory. Closing date 12 July 2002: application forms from the web page , or by email (quote reference CS101). (Posted 4 July 2002.) Chair in Mathematical Aspects of Computing, Open University, closing date 17 May 2002: email addresses for informal enquiries or for application form . (Posted 19 March 2002.) Temporary lectureship in Mathematics at the London School of Economics (any area but discrete mathematics, game theory or financial mathematics preferred), closing date 1 May 2002, start date September 2002: see the Web page . (Posted 19 March 2002.) Postdoctoral fellowship at the Department of Mathematics and Statistics, University of Regina, 1 year commencing 1 April 2002, in the area of graph theory: applications and references to

9. The Hyperbook Of Combinatorics A project to develop a hypertext on major topics in combinatorics. http://www.combinatorics.net/hyper/

10. MathPages: Combinatorics About 40 informal notes on combinatorics by Kevin Brown. http://www.mathpages.com/home/icombina.htm

Combinatorics Partitions into Distinct Parts Dedekind's Problem On Eulerian Numbers Permutation Loops ... Math Pages Main Menu

11. Combinatorics And Graph Theory With Mathematica Combinatorica is a library of 230 functions turning Mathematica into a powerful tool for graph theory and combinatorics. http://www.combinatorica.com/

12. Bridge Probabilities - Bidding Combinatorics And Statistics Features combinatorics and probability analysis for bridge hands. http://www.durangobill.com/BrBidStats.html

Durango Bill's Bridge Probabilities and Combinatorics Bridge Probabilities - Bidding Combinatorics and Statistics Computer Program by Bill Butler (How many ways are there to bid a set of four hands) When we calculate the number of bidding combinations, we are only looking at legal sequences of bids. What cards are in the four hands has no relevance. The players could just as easily be bidding without looking at their cards. Each line in the table below gives the total number of combinations that are possible for any given number of suit bids. If there are no suit bids, then only the single sequence of "Pass, pass, pass, pass" is possible. If there is one suit bid, then the 980 combinations are calculated as follows: Zero, 1, 2, or 3 leading "passes" (4 combinations) times 35 possible suit bids (Any of 7 quantities times 5 suits) times 7 trailing combinations (mixed "passes", "double", and "redouble") equals 4 times 35 times 7 = 980 combinations See the "How to" section for more details. Number of Number of Suit Bids Combinations 7 1.614861 E+16

13. 05-xx combinatorics. {For finite fields, see 11Txx} 05Axx Enumerative combinatorics 05Bxx Designs and configurations {For applications of design theory, http://www.ams.org/msc/05-xx.html

05-xx Top Combinatorics 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

14. Extremal Combinatorics Web page supporting the book Extremal combinatorics list of misprints, further exercises and problems, links, etc. http://www.thi.informatik.uni-frankfurt.de/~jukna/EC_Book/

To who essentially contributed to the proof of Ramsey's theorem with 6 guests at a party ... Home page of the book S. Jukna Extremal Combinatorics With Applications in Computer Science 2001, XVII, 375 pp., 36 Figs., 315 exercises Springer-Verlag, ISBN 3-540-66313-4 Ordering information: Springer -Heidelberg Springer-New York Amazon.com Amazon.de Preface ( html) List of errata Table of contents ( html pdf Additional topics All this + Introduction ( pdf More hints/solutions/exercises Some fragments Related material (links, etc.) Back cover : english german AMS Mathematics Subject Classification (2000): 05-01 Instructional exposition (textbooks, tutorial papers, etc.) 05Dxx Extremal combinatorics 15A03 Vector spaces, linear dependence, rank 60C05 Combinatorial probability 68Rxx Discrete mathematics in relation to computer science 68Q17 Computational difficulty of problems (lower bounds,etc.) ACM Computing Classification (1998): G.2 Discrete mathematics G.3 Probability and statistics F.1-2 Computation by abstract devices, analysis of algorithms, problem complexity Stasys Jukna email home page April 9, 2002

15. 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 http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

16. The Electronic Journal Of Combinatorics And World Combinatorics Exchange The World combinatorics Exchange Note This is the old home page. The new home page can be found at www.combinatorics.org. http://www.combinatorics.org/ejc-wce.html

The Electronic Journal of Combinatorics and The World Combinatorics Exchange Editors in Chief: Brendan D. McKay, Australian National University, and Herbert S. Wilf, University of Pennsylvania Managing Editor: Neil Calkin, Clemson University Note: This is the old home page. The new home page can be found at www.combinatorics.org A print version of this Journal is now being published The Electronic Journal of Combinatorics View the Journal ... The Current Volume All Volumes Dynamic Surveys About the Journal ... Editorial board Editorial policy General information Submitting a paper to the Journal Alternate viewing sites (mirror sites) Preparing your paper for publication, after acceptance Subscribing to the Journal File download statistics The World Combinatorics Exchange Pointers to databases of the state-of-the-art Pointers to software, books, lecture notes, etc. of interest to combinatorialists Home pages of combinatorial people and groups Some other free and refereed mathematics journals on the WWW Forthcoming conferences Other pages of interest to combinatorialists Current Volume All Volumes Dynamic Surveys

17. Math 254A Lecture notes and resources on combinatorial number theory by Terence Tao. http://www.math.ucla.edu/~tao/254a.1.03w/

MATH 254A Some highlights of arithmetic combinatorics MW 3-4:30, MS 6221 Terence Tao, tao@math.ucla.edu , x64844, MS 5622 A brief summary of the course can be found here Lecture notes: Lecture notes 1: Cauchy-Davenport inequality, Plunnecke's theorem, sum set estimates Lecture notes 2: Freiman's theorem (both in the torsion and torsion-free cases), Gowers-Walters theorem, Chang's refinement of Freiman's theorem Lecture notes 3: Gowers' quantitative Balog-Szemeredi theorem; applications to the Kakeya problem; applications to a multilinear convolution integral. Errata to Q4: The theorem as stated is false; it is best to forget this question entirely. Lecture notes 4: Roth's theorem for APs of length 3; Gowers' proof of Szemeredi's theorem for APs of length 4. Lecture notes 5: Behrend's example; Bourgain's refinement of Roth's theorem. Lecture notes 6: Crossing numbers and Szemeredi's theorem; Elekes's sum-product theorem; Bourgain-Katz-Tao sum-product theorem; finite field Szemeredi-Trotter and distance set problem results. Further reading: The web page of Ben Green , including his lecture notes on Freiman's theorem The web page of Tim Gowers The web page of Imre Ruzsa Van Vu's grad course home page on combinatorial number theory (a course running in parallel with ours wich much overlap of topics, but a different mathematical perspective).

18. The Electronic Journal Of Combinatorics And World Combinatorics The Electronic Journal of combinatorics http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

19. Mathematics Archives - Topics In Mathematics - Combinatorics combinatorics Topics for K8 Teachers ADD. KEYWORDS Course Notes, combinatorics combinatorics Tutorials ADD. http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

20. Special Year In Number Theory And Combinatorics Parallel programmes of conferences, colloquia and lectures. University of Florida, Gainesville, FL, USA; September 2004 September 2005. http://www.math.ufl.edu/specialyears/2004-5/

UF Mathematics Special Year 2004-5 Research Courses Undergraduate Graduate ... People Special Year in Number Theory and Combinatorics, 2004-2005 The year 2004-2005 will be a special year in Number Theory and Combinatorics, and will feature two parallel programs, one in Number Theory and one in Combinatorics. The Special Year in Number Theory and Combinatorics will feature four conferences, two in each area. The Number Theory Program , organized by Frank Garvan and Richard Crew , will include the following activities: A Conference on Additive Number Theory , November 17-20, 2004, organized by Krishnaswami Alladi Alexander Berkovich and Frank Garvan A Conference on Arithmetic Geometry , February 28 to March 4, 2005, organized by Richard Crew Kevin Keating and Norm Levin Erdos Colloquium (Monday, March 7) will be delivered by Richard E. Borcherds (Berkeley) History Lectures (partial list) Richard A. Askey (Wisconsin) (Monday, March 21) Bruce C. Berndt (Illinois) (during Nov. 17-20 conference) David M. Bressoud (Macalester College) (October 29) Carl Pomerance (Dartmouth) (Friday, March 11)

Page 1     1-20 of 167    1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | Next 20