Direct and elementary approach to enumerate topologies on a finite set
From MaRDI portal
Publication:3428617
zbMATH Open1113.05007MaRDI QIDQ3428617FDOQ3428617
Authors: Messaoud Kolli 
Publication date: 28 March 2007
Full work available at URL: https://eudml.org/doc/53116
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- The number of topologies on a finite set
- scientific article; zbMATH DE number 5688335
- On the number of topologies on a finite set
- On the cardinality of the \(T_0\)-topologies on a finite set
- Topologies on the \(n\)-element set consistent with topologies close to discrete on an \((n -1)\)-element set
Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07)
Cited In (13)
- Finite fuzzy topological spaces
- Obtainable sizes of topologies on finite sets
- Chains in lattices of mappings and finite fuzzy topological spaces
- Topologies on the \(n\)-element set consistent with topologies close to discrete on an \((n -1)\)-element set
- Properties of 2-CNF mutually dual and self-dual T_0 -topologies on a finite set and calculation of T_0-topologies of a certain weight
- The listing of topologies close to the discrete one on finite sets
- Generalized topologies on finite sets
- On some formulas in the problem of enumeration of finite labeled topologies
- Enumerations of finite topologies associated with a finite simple graph
- The number of topologies on a finite set
- On recursion relations in the problem of enumeration of posets
- On the cardinality of the \(T_0\)-topologies on a finite set
- A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets
Uses Software
This page was built for publication: Direct and elementary approach to enumerate topologies on a finite set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3428617)
