首页
社区
课程
招聘
[求助]n个元素集合的拓朴数真的没公式吗?
发表于: 2011-12-19 15:07 5016

[求助]n个元素集合的拓朴数真的没公式吗?

2011-12-19 15:07
5016
看书上说的。。。。。。

http://oeis.org/search?q=1%2C4%2C29&sort=&language=chinese

1, 1, 4, 29, 355, 6942, 209527, 9535241, 642779354, 63260289423, 8977053873043, 1816846038736192, 519355571065774021, 207881393656668953041, 115617051977054267807460, 88736269118586244492485121, 93411113411710039565210494095, 134137950093337880672321868725846, 261492535743634374805066126901117203

[课程]Android-CTF解题方法汇总!

收藏
免费 0
支持
分享
最新回复 (2)
雪    币: 433
活跃值: (45)
能力值: ( LV4,RANK:50 )
在线值:
发帖
回帖
粉丝
2
http://www.jstor.org/stable/2313548
http://www.cs.uwaterloo.ca/journals/JIS/VOL9/Benoumhani/benoumhani11.pdf

http://pdf.tj1.cnki.net/cjfdsearch/pdfdownloadnew.asp?encode=gb&nettype=cnet&zt=&filename=TdSpFN1ZmT3lVa4A3KDBHbysCURpUZXpUVYFWW3RXRa50Kz9EcPlESyh0Z1AnWx80L6NFUahXVGZHR=0TVDR2bCFkM0E2arIUOlJHODdWUvtWMohmds9WM2QGd5EGNstESzckWMp1ZkZ3cCVUdzU0M0JUR1Z&doi=CNKI:SUN:ZSXZ.0.2006-03-003&m=ysCURpUZXpUVYFWW3RXRa50Kz9EcPlESyh0Z1AnWx80L6NFUahXVGZHR9kFezYHaYN3VwMUOIxWTRZjM2cTWZhTS1ZTdSpFN1ZmT3lVa4A3KDBHb&filetitle=%d3%d0%cf%de%bc%af%c9%cf%c1%bd%bc%ab%cd%d8%c6%cb%b8%f6%ca%fd%b5%c4%cc%bd%cc%d6&p=CJFQ&cflag=&pager=21-24

http://www.mathchina.com/Cgi-bin/view.cgi?forum=5&topic=8250

3点集 {a,b,c}

(1) {{a},{b},{c}},
(2) {{a},{b,c}},{{b},{c,a}},{{c},{a,b}}
(3) {{a},{b},{b,c}},{{a},{c},{b,c}},{{b},{c},{a,c}},{{b},{a},{a,c}},{{c},{b},{a,b}},{{c},{a},{a,b}}
(4) {{a},{a,b},{c,a}},{{b},{b,c},{a,b}},{{c},{c,a},{b,c}}
(5) {{a},{a,b},{a,b,c}},{{a},{a,c},{a,b,c}},{{b},{b,c},{a,b,c}}, {{b},{a,b},{a,b,c}},{{c},{b,c},{a,b,c}},{{c},{a,c},{a,b,c}}
(6) {{a},{a,b,c}},{{b},{a,b,c}},{{c},{a,b,c}}
(7) {a,{b},{c}},{{a}.b.{c}}.{{a}.{b},c}
(8) {{a,b},{a,b,c}},{{b,c},{a,b,c}},{{c,a},{a,b,c}}
(9) {{a,b,c}}

除了同构,就9种了
上传的附件:
2011-12-24 16:39
0
雪    币: 433
活跃值: (45)
能力值: ( LV4,RANK:50 )
在线值:
发帖
回帖
粉丝
3
The answer is 29.
How to get this answer?
There turn out to be 9 different topologies on a three point set {1,2,3} (for definiteness' sake),
and then some more topologies can be obtained from permuting the points.

1. The discrete topology; all sets are open. There is of course only 1.
2. The indiscrete topology; no sets are open except the empty set and the whole set.
In the following I will not include these sets any more...
There is of course only 1.
3. A topology with no isolated points (=open singletons) and 1 (non-trivial)
open set consisting of a doubleton. So {{0,1}} + the trivial ones, eg.
If these there are 3: "3 choose 2" ways of chosing the doubleton.
4. A topology with one isolated point, and no more open sets.
There are 3 ways of chosing the isolated point. So that makes 3 more.
5. A topology with one isolated point, and the two other points also
form an open set. Of this there are 3 as well.
6. A topology with one isolated point, and the other two
points are in its closure, but not in each other's closure, so
eg. {1}, {1,2}, {1,3} as non-trivial open sets. This topology is determined by
the choice of the isolated point, so there are 3 of them.
7. A topology with one isolated point, another point is in the closure of it,
but not in the closure of the third, while the third is in the closure of both the others.
eg.: {1}, {1,2} as non-trivial open sets. All three points have different
"roles" here, so there are 6 = 3! of these. (3 ways of picking the isolated point,
and then 2 to pick the point "inbetween".)
8. A topology with 2 isolated points as only non-trivial open sets.
So eg {1},{2}. There are 3 ways of picking the non-isolated point,
which fixes the type, so there are 3 of these.
9. A topology with 2 isolated points, and the third one is in the closure
of one of them. Eg.: {1},{2},{2,3} as non-trivial open sets.
There are 3 ways of fixing the non-isolated point, and then 2 to
fix the point in whose closure it is. So 6 of these in all.

That's all. Eg if there are 2 open sets of 2 points, their intersection
will be an isolated point, etc. A bit of thought shows that these
are all the types.
This gives: 2*1 + 5*3 + 2*6 = 12 + 15 + 2 = 29 topologies, divided
over 9 types.
上传的附件:
2011-12-24 16:40
0
游客
登录 | 注册 方可回帖
返回
//