1
Partition of  a set
Partition of a set
DATE: 2009/09/15::
2
Find the number of ways to partition a set of 2 elements.
Find the number of ways to partition a set of 2 elements.
DATE: 2013/04/20::
3
How to Partition, Format External Hard Drive on Mac for Mac and Windows, How to Set Up Time Machine
How to Partition, Format External Hard Drive on Mac for Mac and Windows, How to Set Up Time Machine
DATE: 2012/06/25::
4
Windows 8 Bootable Recovery Partition
Windows 8 Bootable Recovery Partition
DATE: 2014/09/10::
5
Bootmgr is Missing Set Active Partition
Bootmgr is Missing Set Active Partition
DATE: 2013/09/26::
6
Set Partition as primary or logical partition | MiniTool Partition Wizard Official Video Guide
Set Partition as primary or logical partition | MiniTool Partition Wizard Official Video Guide
DATE: 2014/07/23::
7
Equivalence Classes Partition a Set Proof
Equivalence Classes Partition a Set Proof
DATE: 2014/11/30::
8
How to Install and Partition Windows 7
How to Install and Partition Windows 7
DATE: 2011/01/21::
9
How to set password for your each windows 7 partition
How to set password for your each windows 7 partition
DATE: 2013/01/28::
10
Beyoncé - Partition (Explicit Video)
Beyoncé - Partition (Explicit Video)
DATE: 2014/02/25::
11
How to create a new partition in Windows 8
How to create a new partition in Windows 8
DATE: 2012/11/11::
12
Programming Interview: Balanced Partition of Array (Dynamic Programming)
Programming Interview: Balanced Partition of Array (Dynamic Programming)
DATE: 2012/08/03::
13
Create Partition in Windows 8 | Easily Create Separate Partition in Hard Drive using Windows 8
Create Partition in Windows 8 | Easily Create Separate Partition in Hard Drive using Windows 8
DATE: 2012/11/20::
14
Solution: Setup was unable to create a new system partition or locate a existing system partition.
Solution: Setup was unable to create a new system partition or locate a existing system partition.
DATE: 2014/01/03::
15
move app to system partition and set rw-r-r permission using root explorer app
move app to system partition and set rw-r-r permission using root explorer app
DATE: 2013/04/24::
16
How to Make a Partition on Windows 7
How to Make a Partition on Windows 7
DATE: 2010/03/17::
17
Set Partition Label - MiniTool Partition Wizard official Video Guide
Set Partition Label - MiniTool Partition Wizard official Video Guide
DATE: 2014/07/04::
18
How to Partition Hard Disk in Windows 8.1
How to Partition Hard Disk in Windows 8.1
DATE: 2013/10/11::
19
Create Partition Using Disk Management (Windows 7)
Create Partition Using Disk Management (Windows 7)
DATE: 2013/06/14::
20
Pakistan And India Partition 1947 - The Day India Burned  - by roothmens
Pakistan And India Partition 1947 - The Day India Burned - by roothmens
DATE: 2012/12/23::
21
How to Set a Primary Partition as Active Partition (No Audio)
How to Set a Primary Partition as Active Partition (No Audio)
DATE: 2013/03/09::
22
Oracle Essbase Setting up a Transparent Partition from BSO to ASO: Performance Architects How To
Oracle Essbase Setting up a Transparent Partition from BSO to ASO: Performance Architects How To
DATE: 2011/05/16::
23
How to Partition Android SD card For Link2sd.
How to Partition Android SD card For Link2sd.
DATE: 2013/12/17::
24
How to set Hackintosh partition active
How to set Hackintosh partition active
DATE: 2013/11/09::
25
Beyoncé - Partition (Clean Video)
Beyoncé - Partition (Clean Video)
DATE: 2014/02/25::
26
How To Make A Partition In Windows 7
How To Make A Partition In Windows 7
DATE: 2010/09/24::
27
Set Partition Refinement Lattice
Set Partition Refinement Lattice
DATE: 2013/10/10::
28
Manually Setup A Ubuntu-Windows 7 Dual Boot
Manually Setup A Ubuntu-Windows 7 Dual Boot
DATE: 2012/02/15::
29
How to fix "Setup was unable to create a new system partition" error installing Windows server
How to fix "Setup was unable to create a new system partition" error installing Windows server
DATE: 2014/07/01::
30
How To Create a new Partition/Drive on Windows XP/Vista/7  [HD]
How To Create a new Partition/Drive on Windows XP/Vista/7 [HD]
DATE: 2012/09/13::
31
Unbrick Galaxy Y Error Re-Partition Failed Fixed
Unbrick Galaxy Y Error Re-Partition Failed Fixed
DATE: 2013/03/19::
32
Mac Monday: Erase & Partition with Disk Utility
Mac Monday: Erase & Partition with Disk Utility
DATE: 2012/12/10::
33
Creating a Windows 7 Setup Recovery Partition with clean install
Creating a Windows 7 Setup Recovery Partition with clean install
DATE: 2012/03/08::
34
How to properly configure the SSD as boot drive and HDD as storage drive
How to properly configure the SSD as boot drive and HDD as storage drive
DATE: 2013/05/08::
35
How To set Active Partition On a Mac/Hackintosh All Versions SL, M, ML, M
How To set Active Partition On a Mac/Hackintosh All Versions SL, M, ML, M
DATE: 2014/04/17::
36
Set Partition Statistics moment formulas and normality Part 1
Set Partition Statistics moment formulas and normality Part 1
DATE: 2014/12/06::
37
Setup was unable to create a new system partition or locate an existing system partition
Setup was unable to create a new system partition or locate an existing system partition
DATE: 2012/01/14::
38
dual boot kali linux windows 8 1 creation new partition and install kali  englich tutorial
dual boot kali linux windows 8 1 creation new partition and install kali englich tutorial
DATE: 2014/03/18::
39
Create F11 Rescue Partition with Acronis True Image
Create F11 Rescue Partition with Acronis True Image
DATE: 2013/09/23::
40
How To Set Up New Partition For Mac OS X Beta Without Erasing File Data
How To Set Up New Partition For Mac OS X Beta Without Erasing File Data
DATE: 2014/06/03::
41
How to Remove System Reserved Partition on Windows
How to Remove System Reserved Partition on Windows
DATE: 2014/09/09::
42
How to Partition Your Hard Drive
How to Partition Your Hard Drive
DATE: 2008/02/11::
43
How to Create a Hard Disk Partition in Windows 7
How to Create a Hard Disk Partition in Windows 7
DATE: 2011/09/30::
44
Windows 7 - How to create a Primary Partition
Windows 7 - How to create a Primary Partition
DATE: 2010/04/05::
45
Partition of a Set - bury P
Partition of a Set - bury P
DATE: 2011/07/27::
46
Moving apps to your SD card in android phones using Link2SD card HD
Moving apps to your SD card in android phones using Link2SD card HD
DATE: 2015/01/17::
47
How To Partition Drives Set The File System To NTFS or Fat32 and Format The New File System
How To Partition Drives Set The File System To NTFS or Fat32 and Format The New File System
DATE: 2013/05/22::
48
quick partition-----PartitionGuru
quick partition-----PartitionGuru
DATE: 2013/03/13::
49
How to Install windows 7 or 8 on a Mac via bootcamp using a CD or USB
How to Install windows 7 or 8 on a Mac via bootcamp using a CD or USB
DATE: 2013/01/05::
50
How to set up a Windows partition on Mac
How to set up a Windows partition on Mac
DATE: 2010/09/17::
NEXT >>
RESULTS [51 .. 101]
From Wikipedia, the free encyclopedia
Jump to: navigation, search
For the partition calculus of sets, see infinitary combinatorics.
A set of stamps partitioned into bundles: No stamp is in two bundles, and no bundle is empty.
The 52 partitions of a set with 5 elements
The traditional Japanese symbols for the chapters of the Tale of Genji are based on the 52 ways of partitioning five elements.

In mathematics, a partition of a set is a grouping of the set's elements into non-empty subsets, in such a way that every element is included in one and only one of the subsets.

Definition[edit]

A partition of a set X is a set of nonempty subsets of X such that every element x in X is in exactly one of these subsets[1] (i.e., X is a disjoint union of the subsets).

Equivalently, a family of sets P is a partition of X if and only if all of the following conditions hold:[2]

  1. P does not contain the empty set.
  2. The union of the sets in P is equal to X. (The sets in P are said to cover X.)
  3. The intersection of any two distinct sets in P is empty. (We say the elements of P are pairwise disjoint.)

In mathematical notation, these conditions can be represented as

  1. \emptyset \notin P
  2. \bigcup_{A\in P} A = X
  3. if A,B \in P and A\neq B then A \cap B = \emptyset,

where \emptyset is the empty set.

The sets in P are called the blocks, parts or cells of the partition.[3]

The rank of P is |X| − |P|, if X is finite.

Examples[edit]

  • Every singleton set {x} has exactly one partition, namely { {x} }.
  • For any nonempty set X, P = {X} is a partition of X, called the trivial partition.
  • For any non-empty proper subset A of a set U, the set A together with its complement form a partition of U, namely, {A, UA}.
  • The set { 1, 2, 3 } has these five partitions:
    • { {1}, {2}, {3} }, sometimes written 1|2|3.
    • { {1, 2}, {3} }, or 12|3.
    • { {1, 3}, {2} }, or 13|2.
    • { {1}, {2, 3} }, or 1|23.
    • { {1, 2, 3} }, or 123 (in contexts where there will be no confusion with the number).
  • The following are not partitions of { 1, 2, 3 }:
    • { {}, {1, 3}, {2} } is not a partition (of any set) because one of its elements is the empty set.
    • { {1, 2}, {2, 3} } is not a partition (of any set) because the element 2 is contained in more than one block.
    • { {1}, {2} } is not a partition of {1, 2, 3} because none of its blocks contains 3; however, it is a partition of {1, 2}.

Partitions and equivalence relations[edit]

For any equivalence relation on a set X, the set of its equivalence classes is a partition of X. Conversely, from any partition P of X, we can define an equivalence relation on X by setting x ~ y precisely when x and y are in the same part in P. Thus the notions of equivalence relation and partition are essentially equivalent.[4]

The axiom of choice guarantees for any partition of a set X the existence of a subset of X containing exactly one element from each part of the partition. This implies that given an equivalence relation on a set one can select a canonical representative element from every equivalence class.

Refinement of partitions[edit]

Partitions of a 4-set ordered by refinement

A partition α of a set X is a refinement of a partition ρ of X—and we say that α is finer than ρ and that ρ is coarser than α—if every element of α is a subset of some element of ρ. Informally, this means that α is a further fragmentation of ρ. In that case, it is written that αρ.

This finer-than relation on the set of partitions of X is a partial order (so the notation "≤" is appropriate). Each set of elements has a least upper bound and a greatest lower bound, so that it forms a lattice, and more specifically (for partitions of a finite set) it is a geometric lattice.[5] The partition lattice of a 4-element set has 15 elements and is depicted in the Hasse diagram on the left.

Based on the cryptomorphism between geometric lattices and matroids, this lattice of partitions of a finite set corresponds to a matroid in which the base set of the matroid consists of the atoms of the lattice, the partitions with n-2 singleton sets and one two-element set. These atomic partitions correspond one-for-one with the edges of a complete graph. The matroid closure of a set of atomic partitions is the finest common coarsening of them all; in graph-theoretic terms, it is the partition of the vertices of the complete graph into the connected components of the subgraph formed by the given set of edges. In this way, the lattice of partitions corresponds to the graphic matroid of the complete graph.

Another example illustrates the refining of partitions from the perspective of equivalence relations. If D is the set of cards in a standard 52-card deck, the same-color-as relation on D – which can be denoted ~C – has two equivalence classes: the sets {red cards} and {black cards}. The 2-part partition corresponding to ~C has a refinement that yields the same-suit-as relation ~S, which has the four equivalence classes {spades}, {diamonds}, {hearts}, and {clubs}.

Noncrossing partitions[edit]

A partition of the set N = {1, 2, ..., n} with corresponding equivalence relation ~ is noncrossing provided that for any two 'cells' C1 and C2, either all the elements in C1 are < than all the elements in C2 or they are all > than all the elements in C2. In other words: given distinct numbers a, b, c in N, with a < b < c, if a ~ c (they both are in a cell called C), it follows that also a ~ b and b ~ c, that is b is also in C. The lattice of noncrossing partitions of a finite set has recently taken on importance because of its role in free probability theory. These form a subset of the lattice of all partitions, but not a sublattice, since the join operations of the two lattices do not agree.

Counting partitions[edit]

The total number of partitions of an n-element set is the Bell number Bn. The first several Bell numbers are B0 = 1, B1 = 1, B2 = 2, B3 = 5, B4 = 15, B5 = 52, and B6 = 203 (sequence A000110 in OEIS). Bell numbers satisfy the recursion B_{n+1}=\sum_{k=0}^n {n\choose k}B_k

and have the exponential generating function

\sum_{n=0}^\infty\frac{B_n}{n!}z^n=e^{e^z-1}.
Construction of the Bell triangle

The Bell numbers may also be computed using the Bell triangle in which the first value in each row is copied from the end of the previous row, and subsequent values are computed by adding the two numbers to the left and above left of each position. The Bell numbers are repeated along both sides of this triangle. The numbers within the triangle count partitions in which a given element is the largest singleton.

The number of partitions of an n-element set into exactly k nonempty parts is the Stirling number of the second kind S(n, k).

The number of noncrossing partitions of an n-element set is the Catalan number Cn, given by

C_n={1 \over n+1}{2n \choose n}.

See also[edit]

Notes[edit]

  1. ^ Naive Set Theory (1960). Halmos, Paul R. Springer. p. 28. ISBN 9780387900926. 
  2. ^ Lucas, John F. (1990). Introduction to Abstract Mathematics. Rowman & Littlefield. p. 187. ISBN 9780912675732. 
  3. ^ Brualdi, pp. 44–45
  4. ^ Schechter, p. 54
  5. ^ Birkhoff, Garrett (1995), Lattice Theory, Colloquium Publications 25 (3rd ed.), American Mathematical Society, p. 95, ISBN 9780821810255 .

References[edit]

  • Brualdi, Richard A. (2004). Introductory Combinatorics (4th edition ed.). Pearson Prentice Hall. ISBN 0-13-100119-1. 
  • Schechter, Eric (1997). Handbook of Analysis and Its Foundations. Academic Press. ISBN 0-12-622760-8. 
Wikipedia content is licensed under the GFDL License
Powered by YouTube
MASHPEDIA
LEGAL
  • Mashpedia © 2015