- Aug 03 Tue 2010 01:19
開始了新生活
- Jul 19 Mon 2010 00:11
結束?
瞬間 不見了兩個月
好像也沒有成長甚麼
一堆事情結束
也一堆事情開始
等到這些結束
是否也有其他開始
加一點點油
往前進
好像也沒有成長甚麼
一堆事情結束
也一堆事情開始
等到這些結束
是否也有其他開始
加一點點油
往前進
- May 11 Tue 2010 00:46
倦 眷
想找個地方去
流浪到那邊去
找不到
流浪到那邊去
找不到
- Apr 17 Sat 2010 00:43
離散數學
其實很有趣
不光光只是組合的部分
我認為離散教我學會一件事情
不要只用一個角度看世界
很多的方向都有不同的觀點
卻可以導向同一個結果
一邊很曲折 另一邊卻是捷徑
而且
真正用到的數學式子少之又少
用到很多很多很多的腦袋
有可能想破頭
結果只是卡在一個小地方
有趣
大家一起學離散數學吧!!
不光光只是組合的部分
我認為離散教我學會一件事情
不要只用一個角度看世界
很多的方向都有不同的觀點
卻可以導向同一個結果
一邊很曲折 另一邊卻是捷徑
而且
真正用到的數學式子少之又少
用到很多很多很多的腦袋
有可能想破頭
結果只是卡在一個小地方
有趣
大家一起學離散數學吧!!
- Apr 16 Fri 2010 00:40
Dilworth's Theorem
A partial order on a set X is a reflexive, antisymmetric, and transitive relation R.
A set X on which a partial order <= is defined is sometimes referred to as a
"partially ordered set"(or sometimes simply as a "poset") and denoted by (X, <=)
In a "chain" every of any elements is comparable.
In an "antichain" every pair of elements is incomparable.
Let (X, <=) be a finite partially ordered set, and let r be the largest size of a chain.
Then X can be partitioned into r but no fewer antichains.
The dual theorem is generally known as Dilworth's Theorem.
Let (X, <=) be a finite partially ordered set, and let m be the largest size of an antichain.
Then X can be partitioned into m but no fewer chains.
A set X on which a partial order <= is defined is sometimes referred to as a
"partially ordered set"(or sometimes simply as a "poset") and denoted by (X, <=)
In a "chain" every of any elements is comparable.
In an "antichain" every pair of elements is incomparable.
Let (X, <=) be a finite partially ordered set, and let r be the largest size of a chain.
Then X can be partitioned into r but no fewer antichains.
The dual theorem is generally known as Dilworth's Theorem.
Let (X, <=) be a finite partially ordered set, and let m be the largest size of an antichain.
Then X can be partitioned into m but no fewer chains.
- Apr 15 Thu 2010 22:25
nonsingular
We call a linear transformation T non-singular if Tx=0 implies x=0.
Let T be a linear transformation form V into W.
Then T is non-singular
if and only if
T carries each linearly independent subset of V
onto a linearly independent subset of W.
Let T be a linear transformation form V into W.
Then T is non-singular
if and only if
T carries each linearly independent subset of V
onto a linearly independent subset of W.
- Mar 15 Mon 2010 16:22
Ramsey number