Combinatorics is a branch of pure mathematics concerning the study of discrete (and usually finite) objects. It is related to many other areas of mathematics, such as algebra, probability theory, ergodic theory and geometry, as well as to applied subjects in computer science and statistical physics. Aspects of combinatorics include "counting" the objects satisfying certain criteria (enumerative combinatorics), deciding when the criteria can be met, and constructing and analyzing objects meeting the criteria, finding "largest", "smallest", or "optimal" objects (as in combinatorial designs, extremal combinatorics and combinatorial optimization), and finding algebraic structures these objects may have (algebraic combinatorics).

The 8 atoms in Acetic acid can be described using the multiset . These letters can be arranged to create 420 "words". Shown is the one that most resembles the commonly used form:

"There is no problem in all mathematics that cannot be solved by direct counting."-Ernst Mach

Developed resources edit

Undeveloped resources edit

The following resources are undeveloped; some are little more than stubs:

  1. Combinatorics/About this resource is currently a stub that contains comments that compare the various wikis.
  2. Combinatorics/Graph & Ramsey Theory
  3. Combinatorics/Structural Algebra (truly a stub)