Related papers: A new method for compactification with the help of…
Organising the relevant literature and by letting statistical convergence play the main role in the theory of compactness, a variant of compactness called statistical compactness has been achieved. As in case of sequential compactness, one…
In this paper we introduce a metrics on the space of idempotent probability measures on a given compactum, which extends the metrics on the compactum. It is proven the introduced metrics generates the pointwise convergence topology on the…
In a recent paper \cite{T} the fact that a class of locally compact metric spaces $X$, among which are Euclidean spaces, are not homemorphic to their punctured version $X\men\{p\}$, was given an interesting new proof which does not use…
For the set C(X) of real-valued continuous functions on a Tychonoff space X, the compact-open topology on C(X) is a "set-open topology". This paper studies the separation and countability properties of the space C(X) having the topology…
We introduce a variant of horocompactification which takes "directions" into account. As an application, we construct a compactification of the Teichm\"uller spaces via the renormalized volume of quasi-Fuchsian manifolds. Although we…
For complete affine manifolds we introduce a definition of compactification based on the projective differential geometry (i.e.\ geodesic path data) of the given connection. The definition of projective compactness involves a real parameter…
The notion of topological entropy can be conceptualized in terms of the number of forward trajectories that are distinguishable at resolution $\varepsilon$ within $T$ time units. It can then be formally defined as a limit of a limit…
We define a natural topology on the collection of (equivalence classes up to scaling of) locally finite measures on a homogeneous space and prove that in this topology, pushforwards of certain infinite volume orbits equidistribute in the…
The aim of this paper is to introduce a new weak separation axiom that generalizes the separation properties between $T_1$ and completely Hausdorff. We call a topological space $(X,\tau)$ a $T_{\kappa,\xi}$-space if every compact subset of…
We define a class of spaces on which one may generalise the notion of compactness following motivating examples from higher-dimensional number theory. We establish analogues of several well-known topological results (such as Tychonoff's…
We give a general method on the way of approximating equilibrium states for a dynamical system of a compact metric space.
We define a compactification of symmetric spaces of noncompact type, seen as spaces of isometry classes of marked lattices, analogous to the Thurston compactification of the Teichm\"uller space, and we show that it is equivariantly…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
While compactness is an essential assumption for many results in dynamical systems theory, for many applications the state space is only locally compact. Here we provide a general theory for compactifying such systems, i.e. embedding them…
In the present paper, we examine in detail the method of "graph compactifications" of topological groups. The graph and Ellis methods of constructing proper compactifications of topological groups are applied for the investigation of…
This paper presents a unified approach for localizing some relevant graph topological indices via majorization techniques. Through this method, old and new bounds are derived and numerical examples are provided, showing how former results…
In these notes, uniform convergence on compacta is studied on the space of functions taking values in the set of finite Borel measures. Related limit theorems, including L\'evy's continuity theorem and functional limit theorems for…
This paper is devoted to a study of infinite horizon optimal control problems with time discounting and time averaging criteria in discrete time. It is known that these problems are related to certain infinite-dimensional linear programming…
First order shape optimization methods, in general, require a large number of iterations until they reach a locally optimal design. While higher order methods can significantly reduce the number of iterations, they exhibit only local…
In this paper, we consider the problem of partitioning a polygon into a set of connected disjoint sub-polygons, each of which covers an area of a specific size. The work is motivated by terrain covering applications in robotics, where the…