Geometry.Net - Pure_And_Applied


Home - Pure_And_Applied_Math - Combinatorics

e99.com Bookstore

Images

Newsgroups

121-140 of 167 Back | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | Next 20

Combinatorics: more books (100)

Algebraic combinatorics via finite group actions by Adalbert Kerber, 1991

An Introduction to Computational Combinatorics (Cambridge Computer Science Texts) by E. S. Page, L. B. Wilson, 1979-05-31

Algebraic Combinatorics and Computer Science

Applications of Combinatorics (Shiva Mathematics Series) by R. J. Wilson, 1982-08

Combinatorics, representation theory, and statistical methods in groups: Young day proceedings (Lecture notes in pure and applied mathematics)

Clever Counting: Combinatorics by James T. Fey, 1997-06

Applied Finite Group Actions (Algorithms and Combinatorics) by Adalbert Kerber, 1999-09-24

Contemporary Combinatorics

Paths, Flows and VLSI-Layout (Algorithms and Combinatorics, Vol 9) by Bernhard Korte, Laszlo Lovasz, et all 1990-12

Polytopes - Combinatorics and Computation (Oberwolfach Seminars)

Applied Combinatorics With Problem Solving by Bradley Jackson, Dmitri Thoro, 1989-10

Q-Series: Their Development and Application in Analysis, Number Theory, Combinatorics, Physics and Computer Algebra (Cbms Regional Conference Series in Mathematics) by George E. Andrews, 1986-09

Lectures on the Combinatorics of Free Probability (London Mathematical Society Lecture Note Series) by Alexandru Nica, Roland Speicher, 2006-09-11

Graph Theory & Combinatorics (Research Notes in Mathematics)

lists with details

Home Page Of Sundar Vishwanathan
Indian Institute of Technology, Bombay Algorithms, combinatorics, Complexity theory.
http://www.cse.iitb.ac.in/~sundar/

Extractions: Algorithms, Combinatorics, Complexity Theory. Sundar Vishwanathan, `` An Approximation Algorithm for finding a long path in Hamiltonian Graphs,'' Journal of Algorithms, Vol 50, 2004. pp 246-256. An earlier version appeared in Proceedings of the Eleventh Annual ACM-SIAM symposium on Discrete Algorithms, jan 2000. Sundar Vishwanathan, On 2-Coloring Certain $k$-Uniform Hypergraphs, Jour. Comb. Theory( Series A), Vol 101, pp 168-172, 2003. Jaikumar Radhakrishnan, Pranab Sen and Sundar Vishwanathan, Depth-3 arithmetic circuits for S_n^2(X) and extensions of the Graham-Pollack theorem, 20th FSTTCS, Lecture Notes in CS, Vol 1974, pp 176187, 2000. Arvind Sankar and Sundar Vishwanathan, ``Multilinear Polynomials and a Conjecture of Frankl and Furedi,'' In
SIMUW 2005: Combinatorics
combinatorics is the art of counting how many ways are there to do something? From this humblesounding beginning, combinatorics expands in a huge
http://research.microsoft.com/~cohn/simuwdesc05.html

Extractions: Henry Cohn Combinatorics is the art of counting: how many ways are there to do something? For example, how many different ways are there to make change for $1.00, i.e., to break up a dollar into coins? From this humble-sounding beginning, combinatorics expands in a huge number of directions. It turns out that a number of powerful principles underlie much of the field, and gather apparently disparate problems into a unified theory. This theory applies to many different sorts of mathematical objects. Furthermore, it has connections with many other fields, ranging from probability to computer science. In this course, we will study several different sorts of combinatorics, including enumerative combinatorics and graph theory. The focus will be on solving challenging problems, since one of the beauties of combinatorics is that frequently, once one has absorbed a certain principle, problems that previously seemed impossible suddenly become quite doable.
13th Ontario Combinatorics Workshop - Royal Military College Of Canada
Royal Military College of Canada, Kingston, Ontario, Canada; 67 May 2004.
http://www.rmc.ca/academic/conference/ocw/index_e.html

Extractions: Queen's University Royal Military College The 13th Ontario Combinatorics Workshop will be hosted by the Royal Military College and Queen's University on May 6-7, 2004, at the Royal Military College. The meeting is intended to be informal; participants are encouraged to present a short talk (30 min.) on their current or future research. Graduate students, postdocs and young researchers are especially encouraged to talk in this comfortable and friendly meeting! Supervisors, please encourage your graduates students to attend and speak. There are limited support funds available for students from out of town who speak at the workshop. All areas of combinatorics and discrete mathematics are included! Opportunities for discussion and joint research will be emphasized. There is no registration fee. There will be two plenary speakers: Shlomo Hoory (University of Toronto), and Bruce Reed (McGill University). The remainder of the two days is reserved for contributed talks. Directions: You can use this map to find your way around Kingston. By car, the best way to get to the hotel is to exit the 401 at highway 15 (exit 623), head south and turn right at highway 2 (where the road ends). After the bridge, the left lane becomes Ontario street; Princess street is at the second light on Ontario street, and the Waterfront Holiday Inn is on the left, just before the lake.
Conference On Arithmetic Geometry, Gainesville 2005
Padic methods in arithmetic and algebraic geometry part of the Special Year in Number Theory and combinatorics. University of Florida, Gainesville, FL, USA; 28 February 4 March 2005.
http://www.math.ufl.edu/~crew/agconf.html

Extractions: Gainesville 2005 The conference will be devoted to p -adic methods in arithmetic and algebraic geometry. It is a part of the Mathematics Department's Special Year in Number Theory and Combinatorics, 2004-2005. SCHEDULE OF TALKS Here is the final list of speakers: Participants may register by sending an email to one of the organizers, listed below. A block of rooms has been reserved at: Holiday Inn University Center 1250 W University Ave. Gainesville, FL 32601 (352) 376-1661 Rooms are $72 per night, plus 9% room tax. Call the hotel for reservations. The rooms will be held until January 31, 2005.
COCOON 2004
Tenth International Computing and combinatorics Conference. Jeju Island, Korea; 1720 August 2004.
http://tclab.kaist.ac.kr/~cocoon04/

Extractions: 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 proceedings, coffee breaks, a reception, a banquet, lunches, and a tour of Jeju island. Note that a small overhead is included for payment in US Dollars.
Finite And Infinite Combinatorics
Topics include graph theory, extremal and random graphs, combinatorial optimization and number theory, discrepancy theory, infinite combinatorics,
http://www.renyi.hu/~finf/

Extractions: Finite and Infinite Combinatorics Dear Colleagues, The special occasion for this meeting is to honour the 70th birthdays of Professors and Download the list of the presented talks in DVI format or in PostScript format. Download the list of participants in DVI format or in PostScript format We thank all participants for coming to Budapest The Organizing Commitee
Computational Harmonic Analysis
Graph Theory, combinatorics and Computing in conjunction with the 16th Annual Shanks Lectures. Vanderbilt University, Nashville, Tennessee; May 2124, 2001.
http://www.math.vanderbilt.edu/~shanks/
AC Commutative Algebra
Articles cover commutative rings, modules, ideals, homological algebra, computational aspects, invariant theory, connections to algebraic geometry and combinatorics.
http://front.math.ucdavis.edu/math.AC

Extractions: Authors: All AB CDE FGH ... U-Z 14 Sep math.AG/0509285 The Multiplicity Polar Theorem and Isolated Singularities. Terence Gaffney . 22 pages. AG AC 14 Sep math.AG/0509282 A Briancon-Skoda type theorem for graded systems of ideals. Alex Kuronya , Alexandre Wolfe . 8 pages. AG AC 13 Sep math.AG/0509243 On Igusa zeta functions of monomial ideals. Jason Howald , Mircea Mustata , Cornelia Oichi Yuen . 9 pages. AG AC 9 Sep math.AT/0509187
Winter Combinatorics Meeting
Winter combinatorics Meeting. Wednesday 25 January 2006. This is the seventh annual OU winter combinatorics meeting. It will take place in the Christodoulou
http://puremaths.open.ac.uk/combin/

Extractions: Open University Winter Combinatorics Meeting Wednesday 25 January 2006 This is the seventh annual OU winter combinatorics meeting. It will take place in the Christodoulou Meeting Room 15 (CMR 15) on the Open University campus. All are welcome. Coffee will be available from 10:15 in Room Q229 (M Block). See the campus map for locations of buildings. The speakers will be: For the programme schedule for the day, please see schedule. The programme schedule for the day, titles of talks, and abstracts are available ( in pdf format ) by following this link: abstracts. For information on how to get to the OU, and a campus map, please see http://www.open.ac.uk/maps/. For advice on parking at the Open University, please see parking. For advice on getting to the Open University by public transport, please see public transport. For further information please contact: Mike Grannell, M.J.Grannell@open.ac.uk
Applied Extremal Combinatorics
Applied Extremal combinatorics. 18.409 Topics in Theoretical Computer Science. Instructor Dan Spielman. This class meets TTh 230400 in room 8-119.
http://www.cs.yale.edu/homes/spielman/AEC/
A2X - Page Personnelle De Christine Bachoc
UniversitÃ© de Bordeaux. Number theory, theory of Lattices, coding theory, and combinatorics. Publications, teaching, events.
http://www.math.u-bordeaux.fr/~bachoc/
Journal Of Automata, Languages And Combinatorics
Journal of Automata, Languages and combinatorics. formerly Journal of Information Processing and Cybernetics / Elektronische Informationsverarbeitung und
http://www.informatik.uni-trier.de/~ley/db/journals/jalc/
Sophie Huczynska
University of St Andrews. Number theory and combinatorics; algebra and theoretical computer science. Publications and teaching material.
http://www-groups.mcs.st-andrews.ac.uk/~sophieh/

Extractions: I am currently a Royal Society Dorothy Hodgkin Research Fellow in Pure Mathematics at the School of Mathematics and Statistics at the University of St Andrews . My research is mainly in the areas of number theory and combinatorics; I also have interests in algebra and theoretical computer science. I am a member of the Centre for Interdiscipinary Research in Computational Algebra (CIRCA) I have no undergraduate lecture courses this session. During the session 2003-2004, I taught two courses: the Honours course Groups-MT4603 and the Level 2 course Linear Algebra-MT2001 Course materials for Groups-MT4603 may be found here , while course materials for Linear Algebra-MT2001 may be found here I obtained my PhD in the Department of Mathematics at the University of Glasgow . I was a postgraduate student there from October 1999 to December 2002. I spent the first year of my postgraduate studies working on Drinfeld modules under the supervision of the late Professor Bob Odoni . Subsequently, I moved into the area of Galois fields, and worked on this topic for my PhD thesis, supervised by
Algebraic Combinatorics In Europe
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
http://www.mat.univie.ac.at/~kratt/ace/

Extractions: A Research Training Network of the European Community Overview The Teams Programme Open Positions Activities ... An article about the network 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
Home Page For Cristina Ballantine
College of the Holy Cross. Number Theory, representation theory, automorphic forms, and algebraic combinatorics. Curriculum vitae and publications.
http://mathcs.holycross.edu/~cballant/index.html
Prof. W.T. Gowers, FRS
Analysis, combinatorics, number theory. Fields medal 1998.
http://www.dpmms.cam.ac.uk/site2002/People/gowers_wt.html
Research In Number Theory & Combinatorics
Number Theory and combinatorics. Staff, research interests.
http://www.maths.gla.ac.uk/research/groups/ntc/

Extractions: Text only Department of Mathematics Home Research Home Research ... Contact 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
A Survey Of Venn Diagrams
Various facts and figures about Venn diagrams by Frank Ruskey.
http://www.combinatorics.org/Surveys/ds5/VennEJC.html

Extractions: Note: This is an updated version of a survey that first appeared as a Dynamic Survey in February, 1997, and was revised in 2001 and 2005. There is a summary of changes The purpose of these pages is to collect together various facts and figures about Venn diagrams, particularly as they relate to combinatorial and geometric properties of the diagrams. Aperiodic updates are planned and comments and suggestions are most welcome. What is a Venn diagram? Formal definition of Venn diagrams
Thirty-Sixth Southeastern International Conference On Combinatorics, Graph Theor
The 36th Southeastern International Conference on combinatorics, Graph Theory, and Computing will be Mar 711, 2005 at Florida Atlantic University in Boca
http://www.math.fau.edu/cgtc/cgtc36/se36.html

Extractions: Click here for Advanced Search The 36 th Southeastern International Conference on Combinatorics, Graph Theory, and Computing will be Mar 7-11, 2005 at Florida Atlantic University in Boca Raton, FL Conference registration and check-in will begin at 8:00 a.m. Monday, March 7, 2005 For the Thirty-Sixth Conference, the following speakers will present instructional lectures: This talk is about the mathematical foundations of circuit theory. It outlines an exposition of elementary DC circuit theory from the point of view that circuits (not just elements) are voltage-current mappings. Rather than focusing on the internal details of circuits as is customary in introductory texts, the focus is on their external behaviour: a "black box" view. This change in focus enables the definitions of the theory to be stated precisely and the theorems to be proved rigorously.
Bressoud, David
Macalester College. Number theory and combinatorics. Book list, course information, and links.
http://www.macalester.edu/~bressoud/

121-140 of 167 Back | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | Next 20