Slice: Difference between revisions

From Polymath Wiki
Jump to navigationJump to search
New page: A '''slice''' of the cube <math>[3]^n</math> is a set of the form <math>\Gamma_{a,b,c}</math> for some (a,b,c) in the triangular grid :<math>\Delta_n := \{ (a,b,c) \in {\Bbb Z}_+^3: a+b+c...
 
No edit summary
Line 13: Line 13:
The [[equal-slices measure]] gives each slice a total measure of 1.
The [[equal-slices measure]] gives each slice a total measure of 1.


The k=2 analogue of a slice is sometimes known as a ''layer''.
The k=2 analogue of a slice is sometimes known as a ''layer'', and plays a role in the proof of [[Sperner's theorem]].

Revision as of 14:08, 15 February 2009

A slice of the cube [math]\displaystyle{ [3]^n }[/math] is a set of the form [math]\displaystyle{ \Gamma_{a,b,c} }[/math] for some (a,b,c) in the triangular grid

[math]\displaystyle{ \Delta_n := \{ (a,b,c) \in {\Bbb Z}_+^3: a+b+c = n \}, }[/math]

where [math]\displaystyle{ \Gamma_{a,b,c} }[/math] is the set of all strings with a 1s, b 2s, and c 3s. Thus for instance

[math]\displaystyle{ \Gamma_{1,2,0} = \{ 011, 101, 101 \}. }[/math]

The cube [math]\displaystyle{ [3]^n }[/math] has [math]\displaystyle{ \frac{(n+1)(n+2)}{2} }[/math] slices, and each slice [math]\displaystyle{ \Gamma_{a,b,c} }[/math] has cardinality [math]\displaystyle{ \frac{n!}{a!b!c!} }[/math].

Each slice [math]\displaystyle{ \Gamma_{a,b,c} }[/math] is incident to [math]\displaystyle{ 2^a+2^b+2^c-3 }[/math] combinatorial lines.

The equal-slices measure gives each slice a total measure of 1.

The k=2 analogue of a slice is sometimes known as a layer, and plays a role in the proof of Sperner's theorem.