### 目前日期文章：200406 (11)

• Jun 28 Mon 2004 09:21
• ## To change or not to change

• Jun 25 Fri 2004 09:28
• ## [hypercube] Even partition of hypercubes--we develop a simple too

A problem of even partition is a interesting problem. Since we almost can not imaginate its structure when the dimension of a hypercube is over 6. We have to develop some simple tool for more understanding it. The following is a flowchart of our simple tool.

• Jun 22 Tue 2004 09:29
• ## 咖啡館@三芝海邊--洋溢海島風情的好地方

• Jun 20 Sun 2004 09:32
• ## 「我們要結婚了」系列(一)--挑婚紗篇

• Jun 18 Fri 2004 05:07
• ## [hypercubes] Weekly meeting

Meeting notes

• Jun 15 Tue 2004 05:08

• Jun 14 Mon 2004 05:10
• ## 四分溪小生態--中研院區裡的小溪流

• Jun 10 Thu 2004 05:13
• ## [hypercube] Find all neighbors with a given distance

it's a problem similar to determine all possible combinations
One reason of why hypercube still interests computer science or applied mathematic people is its perfect correspondence between the binary system. For example, how many nodes in a d-dimensional hypercube? the answer is quite simple that 2 to the power of d.

• Jun 06 Sun 2004 05:19
• ## 易經與人生--世界上最古老的"二進位"概念

• Jun 04 Fri 2004 05:24
• ## [hypercube] Minimum boundary edges b(x)

it is a beautiful curve.

To deal with nodes and edges of hypercubes is my recent work. We usaully use "aggegrate" A to denote a set of connected nodes, and the size of it |A| means the number of nodes included the set. Given a size, |A| = x of an aggregate, there could be many possible different forms. Here, we want to know the number of minimum boundary edges, b(x) for all possible forms. In previous researches, Leader (1991) proposed a formula that can exactly calculate the value of b(x).

• Jun 03 Thu 2004 05:26