Direct and elementary approach to enumerate topologies on a finite set.
Journal of Integer Sequences [electronic only] (2007)
- Volume: 10, Issue: 3, page Article 07.3.1, 11 p., electronic only-Article 07.3.1, 11 p., electronic only
- ISSN: 1530-7638
Access Full Article
top
How to cite
topKolli, Messaoud. "Direct and elementary approach to enumerate topologies on a finite set.." Journal of Integer Sequences [electronic only] 10.3 (2007): Article 07.3.1, 11 p., electronic only-Article 07.3.1, 11 p., electronic only. <http://eudml.org/doc/53116>.
@article{Kolli2007,
author = {Kolli, Messaoud},
journal = {Journal of Integer Sequences [electronic only]},
keywords = {binary relation; enumeration; finite topology; partial order; poset},
language = {eng},
number = {3},
pages = {Article 07.3.1, 11 p., electronic only-Article 07.3.1, 11 p., electronic only},
publisher = {School of Computer Science, University of Waterloo, Waterloo},
title = {Direct and elementary approach to enumerate topologies on a finite set.},
url = {http://eudml.org/doc/53116},
volume = {10},
year = {2007},
}
TY - JOUR
AU - Kolli, Messaoud
TI - Direct and elementary approach to enumerate topologies on a finite set.
JO - Journal of Integer Sequences [electronic only]
PY - 2007
PB - School of Computer Science, University of Waterloo, Waterloo
VL - 10
IS - 3
SP - Article 07.3.1, 11 p., electronic only
EP - Article 07.3.1, 11 p., electronic only
LA - eng
KW - binary relation; enumeration; finite topology; partial order; poset
UR - http://eudml.org/doc/53116
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.