Alas, Ofelia T.; Wilson, Richard G.(Universitat Politècnica de València, 2011-04-01)
[EN] We study the subposet E3(X) of the lattice L1(X) of all T1-topologies on a set X, being the collections of all T3 topologies on X, with a view to deciding which elements of this partially ordered set have and which ...
Pajoohesh, H.(Universitat Politècnica de València, 2008-04-01)
[EN] Binary trees are very useful tools in computer science for estimating the running time of so-called comparison based algorithms, algorithms in which every action is ultimately based on a prior comparison between two ...
Alas, Ofelia T.; Wilson, Richard G.(Universitat Politècnica de València, 2004-10-01)
[EN] We give a new characterization of those topologies which have an immediate successor or cover in the lattice of T1-topologies on a set and show that certain classes of compact and countably compact topologies do not ...