One may topologise an incidence structure by imposing that the operations of joining points and intersecting lines are continuous. This project investigates two different approaches to this. We first show that with respect to the canonical topology of the real affine and projective planes, these operations are continuous. Then, without a canonical topology at hand, we construct a topology on the line set of the Moulton planes so that these operations are continuous. Furthermore, we show that this topology is essentially unique
A pair (X,Y) of topological spaces X and Y is said to have the graph intersection property provided ...
It is well known that not every combinatorial configuration admits a geo-metric realization with poi...
While the boundary 3-manifold of a line arrangement in the complex plane depends only on the inciden...
The intersection graph of a set system S is a graph on the vertex set S, in which two vertices are c...
In this paper we describe the complement of a complexified real line arrangement in the complex plan...
In the setting of constructive pointfree topology, we introduce a notion of continuous operation bet...
AbstractMotivated by a problem in computer graphic we develop discrete models of continuous n-dimens...
AbstractLet G be an n-dimensional geometric lattice with a topology. Assume that each level set Gj o...
Abstract. In this paper, we firstly describe two topological configurations that are not considered ...
A topological graph is a graph drawn in the plane so that its vertices are represented by points, an...
The object of this monograph is to establish a point system on a line that is continuous. This requi...
The goal of this course is to introduce you to the fundamental examples, problems, and machinery of ...
We revoke the problem of drawing graphs in the plane so that only certain specified pairs of edges a...
In this paper we have established that a uniform topology induced by a uniform structure on a set is...
AbstractUnderstanding and in some cases, solution of problems involving topology in computer science...
A pair (X,Y) of topological spaces X and Y is said to have the graph intersection property provided ...
It is well known that not every combinatorial configuration admits a geo-metric realization with poi...
While the boundary 3-manifold of a line arrangement in the complex plane depends only on the inciden...
The intersection graph of a set system S is a graph on the vertex set S, in which two vertices are c...
In this paper we describe the complement of a complexified real line arrangement in the complex plan...
In the setting of constructive pointfree topology, we introduce a notion of continuous operation bet...
AbstractMotivated by a problem in computer graphic we develop discrete models of continuous n-dimens...
AbstractLet G be an n-dimensional geometric lattice with a topology. Assume that each level set Gj o...
Abstract. In this paper, we firstly describe two topological configurations that are not considered ...
A topological graph is a graph drawn in the plane so that its vertices are represented by points, an...
The object of this monograph is to establish a point system on a line that is continuous. This requi...
The goal of this course is to introduce you to the fundamental examples, problems, and machinery of ...
We revoke the problem of drawing graphs in the plane so that only certain specified pairs of edges a...
In this paper we have established that a uniform topology induced by a uniform structure on a set is...
AbstractUnderstanding and in some cases, solution of problems involving topology in computer science...
A pair (X,Y) of topological spaces X and Y is said to have the graph intersection property provided ...
It is well known that not every combinatorial configuration admits a geo-metric realization with poi...
While the boundary 3-manifold of a line arrangement in the complex plane depends only on the inciden...