46 search results - page 1 / 10 » Obtainable sizes of topologies on finite sets |
JCT
2010
13 years 9 months ago
2010
We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ...
JCT
2006
13 years 11 months ago
2006
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We study a dissimilarity measure between shapes, expressed by the natural pseudodistance between size pairs, where a shape is viewed as a topological space endowed with a real-val...
TCAD
2008
13 years 11 months ago
2008
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
JMIV
1998
13 years 10 months ago
1998
The main task of digital image processing is to recognize properties of real objects based on their digital images. These images are obtained by some sampling device, like a CCD c...