Related papers: Obtainable Sizes of Topologies on Finite Sets

In this paper we study the number of finite topologies on an $n$-element set subject to various restrictions.

The concept of typed topological space is introduced, for which open sets in a topology on a finite set will be assigned types (from lattice). The neighborhood system of a point, the closure and the connectedness can be defined according to…

A continuous map from R^m to R^N or from C^m to C^N is called k-regular if the images of any $k$ points are linearly independent. Given integers m and k a problem going back to Chebyshev and Borsuk is to determine the minimal value of N for…

Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…

We consider the maximal number of arbitrary points in a special fibre that can be simultaneously approached by points in one sequence of general fibres. Several results about this topological invariant and their applications describe the…

Topologies can be expanded with the help of ideals, using the local function, an operator resembling the closure of a set. The aim of this paper is to define the ideals which enable us to create this topology $\tau^{*}$ on $X$…

We consider a connected undirected graph $G(n,m)$ with $n$ nodes and $m$ edges. A $k$-dominating set $D$ in $G$ is a set of nodes having the property that every node in $G$ is at most $k$ edges away from at least one node in $D$. Finding a…

An $(n_k)$-configuration is a set of $n$ points and $n$ lines in the projective plane such that their point-line incidence graph is $k$-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are…

We study the topology of metric spaces which are definable in o-minimal expansions of ordered fields. We show that a definable metric space either contains an infinite definable discrete set or is definably homeomorphic to a definable set…

We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…

We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be ``liftable'' under finite morphisms, paving…

Topological sorting is an important technique in numerous practical applications, such as information retrieval, recommender systems, optimization, etc. In this paper, we introduce a problem of generalized topological sorting with…

We construct finite sets of real numbers that have a small difference set and strong local properties. In particular, we construct a set $A$ of $n$ real numbers such that $|A-A|=n^{\log_2 3}$ and that every subset $A'\subseteq A$ of size…

A discrete subset $S$ of a topological group $G$ is called a {\it suitable set} for $G$ if $S\cup \{e\}$ is closed in $G$ and the subgroup generated by $S$ is dense in $G$, where $e$ is the identity element of $G$. In this paper, the…

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

To facilitate widespread adoption of automated engineering design techniques, existing methods must become more efficient and generalizable. In the field of topology optimization, this requires the coupling of modern optimization methods…

We consider (closed neighbourhood) packings and their generalization in graphs called limited packings. A vertex set X in a graph G is a k-limited packing if for any vertex $v\in V(G)$, $\left|N[v] \cap X\right| \le k$, where $N[v]$ is the…

We find the bounds of the size of the union of n sets satisfying the condition that the intersection of any k sets is empty. We show that any number between the upper and lower bounds can be realised, and in the measure version, the…

The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…

We characterize the largest point sets in the plane which define at most 1, 2, and 3 angles. For $P(k)$ the largest size of a point set admitting at most $k$ angles, we prove $P(2)=5$ and $P(3)=5$. We also provide the general bounds of $k+2…