41. Erik Demaine combinatorics, theory of computation and algorithms. http://theory.lcs.mit.edu/~edemaine/

[photo by William Plowman] Computational Origami Martin Demaine , part of the Museum of Modern Art permanent collection Erik Demaine MacArthur Fellow Alfred P. Sloan Research Fellow Associate Professor of Electrical Engineering and Computer Science Member of the Computer Science and Artificial Intelligence Lab in the Theory of Computation group, specifically Algorithms Massachusetts Institute of Technology Research Papers Sculpture Videos Puzzles ... Software Movies: I appear in the documentaries Between The Folds about origami (which you can watch online ) and The Man Who Saved Geometry about Coxeter (which you can watch online in Canada CV in PostScript or PDF , last updated on September 9, 2010. I co-edit The Open Problems Project with Joseph Mitchell and Joseph O'Rourke I am interested in most areas of research in mathematics and computer science broadly connected to algorithms. Particular interests include Discrete and computational geometry: Folding and unfolding linkages , robotics, motion planning, dissections, simple polygonizations Data structures: Dynamic data structures, succinct encodings of data structures, memory management, cache-efficient and disk-efficient data structures, average-case data structures, text indexing

42. Combinatorics & Optimization Aug 5, 2009 Holds a strong international reputation in six major areas. http://www.math.uwaterloo.ca/CandO_Dept/

/* 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('/CandO_Dept/supportFiles/cssFiles/CandO.css'); @import url("/coreTemplates/CSSFiles/mobile/MathMobile.css") handheld; Search Math uwaterloo.ca Graduate Studies Undergraduate Studies MATH @ Your Library MATH Home ... UW Home Useful Links Journal of Combinatorial Theory, Series B Center for Applied Cryptographic Research Computational Mathematics Centre Institute for Quantum Computing ... Perimeter Institute News and Events V. Vazirani Short Course Summer School Awards and Achievements Weekly Seminars Friday Tutte Seminar Positions Available Summer Undergraduate Research Program ... 40th Conference Welcome to the Department of Combinatorics and Optimization. Please use the sidebars to navigate our website.

43. Combinatorics Authors/titles "new.CO" Submissions received from Wed 20 Oct 10 to Thu 21 Oct 10, announced Fri, 22 Oct 10 http://arxiv.org/list/math.CO/new

arXiv.org math math.CO Search or Article-id Help Advanced search All papers Titles Authors Abstracts Full text Help pages Combinatorics New submissions Submissions received from Wed 27 Oct 10 to Thu 28 Oct 10, announced Fri, 29 Oct 10 New submissions Cross-lists Replacements [ total of 16 entries: [ showing up to 2000 entries per page: fewer more New submissions for Fri, 29 Oct 10 arXiv:1010.5816 pdf ps other Title: Blocking Wythoff Nim Authors: Urban Larsson Comments: 14 pages, 1 Figure Subjects: Combinatorics (math.CO) ; Number Theory (math.NT) arXiv:1010.5841 pdf ps other Title: On graphs with cyclic defect or excess Authors: Charles Delorme Guillermo Pineda-Villavicencio Comments: 20 pages, 3 Postscript figures Subjects: Combinatorics (math.CO) arXiv:1010.5846 pdf ps other Title: Lit-only sigma-game on some trees Authors: Hau-wen Huang Comments: 20 pages Subjects: Combinatorics (math.CO) arXiv:1010.5857 pdf ps other Title: Linear chord diagrams on two intervals Authors: Robert C. Penner Christian M. Reidys Rita R. Wang Comments: 19 pages, 4 figures Subjects: Combinatorics (math.CO)

44. Gilles ZEMOR's WWW Home Page combinatorics, coding theory, cryptography and additive number theory. http://www.infres.enst.fr/~zemor/

I have moved

45. European Journal Of Combinatorics - Elsevier International, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. Academic Press. Tables of contents plus http://www.elsevier.com/locate/ejc

46. Combinatorics Definition Of Combinatorics In The Free Online Encyclopedia. combinatorics (kŏm'bənət r`ĭks) or combinatorial analysis (kŏm'bĭnət r`ēəl), sometimes called the science of counting, the branch of mathematics mathematics http://encyclopedia2.thefreedictionary.com/combinatorics

47. Erlendur S. Thorsteinsson (home Page) - Erlendur S. �orsteinsson (heimas��a) Algorithms, combinatorics and optimization. http://www.mmedia.is/esth/

Erlendur S. Thorsteinsson Ph.D. in Algorithms, Combinatorics and Optimization from Carnegie Mellon University in Pittsburgh, Pennsylvania, United States of America. Address: Dr. Erlendur S. Thorsteinsson Haulind 24 IS-201 Kopavogur ICELAND Mobile: +354 ( ) 662-5626 Phone: +354 ( ) 561-2340 Publications: Available papers Available slides Blog: Blog and other thoughts (in Icelandic) List sorted by topic RSS (Atom 1.0) Software: Eudora plugins

48. MIT Combinatorics Seminar schedule MIT combinatorics seminar schedule. If your browser doesn t show any events, then you can use the htmlonly version of the schedule. http://www-math.mit.edu/~combin/

MIT combinatorics seminar contact: Sami Assaf Henry Cohn Jacob Fox time: Wednesday and Friday, 4:15 - 5:15 pm refreshments at 3:30 pm in the math common room 2-290 location: WED MIT room 2-105 FRI MSR First Floor Conference Center 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: MIT: You can view an on-line map of MIT , highlighting building 2. MSR: Microsoft Research is located at 1 Memorial Drive, two blocks from the MIT Mathematics Department along Memorial Drive towards the Longfellow Bridge. Upon arrival, please check-in at the lobby security desk (be prepared to show photo ID) and proceed up one floor. The conference room is located on the left past the reception desk. for speakers: Your talk should be approximately 1 hour. PLEASE AIM TO MAKE IT ACCESSIBLE TO FIRST YEAR GRADUATE STUDENTS. Our facilities are equipped with: a large chalk/white board

49. Wesley Pegden combinatorics and graph theory. http://people.cs.uchicago.edu/~wes

Navigation Home Research Publications Play a Game! ... Links Wesley Pegden Department of Mathematics Rutgers University Piscataway, NJ 08854 I work in combinatorics and combinatorial game theory. Beginning in September, I will be a NSF postdoctoral fellow at New York University. (I finished my Ph.D. at Rutgers University in May 2010). To send me encrypted email, get my public key

50. Combinatorics Web page supporting the book combinatorics Topics, Techniques, Algorithms by Peter J. Cameron list of misprints, further exercises and problems, links, etc. http://www.maths.qmul.ac.uk/~pjc/comb/

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 download solutions to the exercises read about further topics (this is in preparation), find more problems and exercises , or get a list of misprints 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: The 7-point STS (p. 108)

51. David Galvin's Home Page Graph theory, combinatorics and discrete probability. http://www.math.upenn.edu/~dgalvin/

I have moved from the Uninversity of Pennsylvania to Notre Dame. Please visit my homepage there, http://www.nd.edu/~dgalvin1/

52. The Math Forum - Math Library - Combinatorics Comprehensive catalog of websites relating to combinatorics. http://www.mathforum.org/library/topics/combinatorics/

Browse and Search the Library Home 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 Permutations/Combinations Selected Sites (see also All Sites in this category AMOF: The Amazing Mathematical Object Factory - Frank Ruskey 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).

53. Jānis Buls combinatorics on words, algebraic automata theory. http://home.lanet.lv/~buls/

Jānis Buls Sākums Curriculum vitae Pētniecība Studentiem ... Fizikas un matemātikas fakultāte Matemātikas nodaļa Matemātiskās analīzes katedra Zeļļu iela 8, M232. kabinets Adrese: Zeļļu iela 8, Rīga, LV - 1002 Darba tālrunis: 7033726 E-pasts: buls[at]fmf.lu.lv

54. Combinatorics: Facts, Discussion Forum, And Encyclopedia Article Mathematics is the study of quantity, structure, space, and change. Mathematicians seek out patterns, formulate new conjectures, and establish truth by rigorous deduction from http://www.absoluteastronomy.com/topics/Combinatorics

Home Discussion Topics Dictionary ... Login Combinatorics Combinatorics Topic Home Discussion Definition Overview Combinatorics is a branch of mathematics Mathematics Mathematics is the study of quantity, structure, space, and change. Mathematicians seek out patterns, formulate new conjectures, and establish truth by rigorous deduction from appropriately chosen axioms and definitions.... concerning the study of finite or countable Countable set In mathematics, a countable set is a set with the same cardinality as some subset of the set of natural numbers. A set that is not countable is called uncountable. The term was originated by Georg Cantor... discrete Discrete mathematics Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying "smoothly", the objects studied in discrete mathematics – such as integers, graphs, and statements in logic – do not... structures Mathematical structure In mathematics, a structure on a set, or more generally a type, consists of additional mathematical objects that in some manner attach to the set, making it easier to visualize or work with, or endowing the collection with meaning or significance.... . Aspects of combinatorics include counting the structures of a given kind and size ( enumerative combinatorics Enumerative combinatorics Enumerative combinatorics or Enumeration is an area of Combinatorics on the number of ways that certain patterns can be formed. Two examples of this type of problem are counting combinations and counting permutations...

55. European Graduate Program ``Combinatorics, Geometry, And Computation'', Berlin - A European graduate programme. http://www.cgc.ethz.ch/

56. ScienceDirect - European Journal Of Combinatorics, Volume 32, Issue 1, Pages 1-1 The online version of European Journal of combinatorics on ScienceDirect, the world s leading platform for high quality peerreviewed full-text publications http://www.sciencedirect.com/science/journal/01956698

Hub ScienceDirect Scopus Register ... Go to SciVal Suite Username: Password: Remember me Not Registered? Forgotten your username or password? Go to Athens / Institution login Home ... Help All fields Author Advanced search Journal/Book title Volume Issue Page Search tips European Journal of Combinatorics Sample Issue Online About this Journal Submit your Article Shortcut link to this Title ... New Article Feed Signed up for new Volumes / Issues [ remove Alert me about new Volumes / Issues Your selection(s) could not be saved due to an internal error. Please try again. Added to Favorites [ remove Add to Favorites No next vol/iss Font Size: Add to my Quick Links Volume 32, Issue 1, Pages 1-154 (January 2011) = Full-text available = Abstract only Volume 32 (2011) Volume 32, Issue 1 - selected pp. 1-154 (January 2011) Volume 31 (2010) Volume 30 (2009) Volume 29 (2008) Volume 28 (2007) ... Volume 13 (1992) Open all previews articles Editorial Board Page IFC Show preview PDF (51 K) Related articles Related reference work articles Maximal independent sets in bipartite graphs obtained from Boolean lattices Original Research Article Pages 1-9 Show preview PDF (241 K) Related articles Related reference work articles On the unimodality of independence polynomials of some graphs Original Research Article Pages 10-20 Yi Wang, Bao-Xuan Zhu

57. Combinatorics - Mathematics combinatorics is an area of discrete mathematics that studies collections of distinct objects and the ways that they can be counted or ordered, or used to satisfy some optimality http://math.wikia.com/wiki/Combinatorics

Wikia Skip to Content Skip to Wiki Navigation Skip to Site Navigation Wikia Navigation Start a wiki Entertainment Fall TV Glee ... Mathematics Mathematics Navigation Browse content Category list Mathematics Project pages ... Geometry Random Page Wiki Activity Watchlist Recent changes Talk Combinatorics Edit Read more: Mathematics Combinatorics Edited by A Wikia contributor View full history See also the Wikipedia article: Combinatorics Combinatorics is an area of discrete mathematics that studies collections of distinct objects and the ways that they can be counted or ordered , or used to satisfy some optimality criterion. The most basic ideas in combinatorics include: factorials The number of possible arrangements of n distinct items is n -factorial , written , which equals Example: Three items, A, B, and C, can be arranged in different ways: ABC, ACB, BAC, BCA, CAB, and CBA. permutations The number of arrangements that are possible when a subset of r items is taken from a set of n distinct items is a " permutation of n objects taken r at a time ", which can be written as

58. Cambridge Journals Online - Combinatorics, Probability And Computing Now published bimonthly, devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical http://journals.cambridge.org/action/displayJournal?jid=CPC

59. Lectures In Combinatorics An introduction to partially ordered sets, Dilworth s theorem, lattices and combinatorial geometries. http://www.freewebs.com/desargues/combinatorics.htm

1. Partially Ordered Sets Elementary Definitions. A poset partially ordered set ) is a set P a b c P a a if a b and b c then a c if a b and b a then a b If a b and a b we write a b . We say that b covers a if a b and there does not exist c such that a c b . A subset C of P is called a chain if for any a b C , either a b or b a . A subset A of P is called an antichain if for any two distinct a b A , neither a b nor b a Examples. P Z P is a set of divisors of a given natural number n P is a set of subsets of a given set S It is often convenient to draw a poset diagram with dots representing the elements of P and a decending line connecting b with a whenever b covers a Fig 1. Dilworth's Theorem. Consider the poset P P C C C where: C C C There are other ways of decomposing P into disjoint chains, but a quick inspection shows that you cannot do it with less than 3 disjoint chains. On the other hand, there is an antichain in P with 3 elements, namely: A There are other antichains in P but a quick inspection shows that you cannot find an antichain with more than 3 elements. So the minimum number of chains that partition P is equal to the size of a maximal antichain in P Fig 2.

60. Open Problems In Combinatorics Features links to newsletters, workshops, and papers. http://www.combinatorics.net/problems/

Open Problems in Combinatorics Combinatorial Problems I Like , by Josh Cooper Open Problems - Graph Theory and Combinatorics , by Douglas B. West Open problems in combinatorics (pdf file) , by Alexander Postnikov Positivity Problems and Conjectures in Algebraic Combinatorics , by Richard Stanley Ten Problems in Combinatorics, Lecture given by Gian-Carlo Rota at the Conference on Combinatorics and Physics (CAP'98), held at the Los Alamos National Laboratory, August 10-12, 1998. To be announced. Open Problems from the SIAM Activity Group Newsletter in Discrete Mathematics Problems on the Enumeration of Matchings (ps file) , by James Propp Unsolved Combinatorial Problems, by Zsolt Tuza Open Problems on Perfect Graphs , by Problems in Signed, Gain, and Biased Graphs , compiled by Thomas Zaslavsky Unsolved Problems in Graph Theory , compiled by Stephen C. Locke , by Fan R. K. Chung A list of problems on permutation groups , by Peter J. Cameron A problem on transitive permutation groups , by Peter J. Cameron Some Problems in Matroid Theory , compiled by Thomas Zaslavsky Unsolved Mathematics Problems , compiled by Steven Finch.

Page 3     41-60 of 135    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | Next 20