On chains in HH-closed topological pospaces

We study chains in an $H$-closed topological partially ordered space. We give sufficient conditions for a maximal chain $L$ in an $H$-closed topological partially ordered space such that $L$ contains a maximal (minimal) element. Also we give sufficient conditions for a linearly ordered topological partially ordered space to be $H$-closed. We prove that any $H$-closed topological semilattice contains a zero. We show that a linearly ordered $H$-closed topological semilattice is an $H$-closed topological pospace and show that in the general case this is not true. We construct an example an $H$-closed topological pospace with a non-$H$-closed maximal chain and give sufficient conditions that a maximal chain of an $H$-closed topological pospace is an $H$-closed topological pospace.Comment: We have rewritten and substantially expanded the manuscrip

Chain Homotopies for Object Topological Representations

This paper presents a set of tools to compute topological information of simplicial complexes, tools that are applicable to extract topological information from digital pictures. A simplicial complex is encoded in a (non-unique) algebraic-topological format called AM-model. An AM-model for a given object K is determined by a concrete chain homotopy and it provides, in particular, integer (co)homology generators of K and representative (co)cycles of these generators. An algorithm for computing an AM-model and the cohomological invariant HB1 (derived from the rank of the cohomology ring) with integer coefficients for a finite simplicial complex in any dimension is designed here. A concept of generators which are "nicely" representative cycles is also presented. Moreover, we extend the definition of AM-models to 3D binary digital images and we design algorithms to update the AM-model information after voxel set operations (union, intersection, difference and inverse)

Tensor Constructions of Open String Theories I: Foundations

The possible tensor constructions of open string theories are analyzed from first principles. To this end the algebraic framework of open string field theory is clarified, including the role of the homotopy associative A_\infty algebra, the odd symplectic structure, cyclicity, star conjugation, and twist. It is also shown that two string theories are off-shell equivalent if the corresponding homotopy associative algebras are homotopy equivalent in a strict sense. It is demonstrated that a homotopy associative star algebra with a compatible even bilinear form can be attached to an open string theory. If this algebra does not have a spacetime interpretation, positivity and the existence of a conserved ghost number require that its cohomology is at degree zero, and that it has the structure of a direct sum of full matrix algebras. The resulting string theory is shown to be physically equivalent to a string theory with a familiar open string gauge group.Comment: 62 pages, LaTe

On the equivalence between hierarchical segmentations and ultrametric watersheds

We study hierarchical segmentation in the framework of edge-weighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that there exists a bijection between the set of ultrametric watersheds and the set of hierarchical segmentations. We end this paper by showing how to use the proposed framework in practice in the example of constrained connectivity; in particular it allows to compute such a hierarchy following a classical watershed-based morphological scheme, which provides an efficient algorithm to compute the whole hierarchy.Comment: 19 pages, double-colum

Reusing integer homology information of binary digital images

In this paper, algorithms for computing integer (co)homology of a simplicial complex of any dimension are designed, extending the work done in [1,2,3]. For doing this, the homology of the object is encoded in an algebraic-topological format (that we call AM-model). Moreover, in the case of 3D binary digital images, having as input AM-models for the images I and J, we design fast algorithms for computing the integer homology of I ∪J, I ∩J and I ∖J

On extending actions of groups

Problems of dense and closed extension of actions of compact transformation groups are solved. The method developed in the paper is applied to problems of extension of equivariant maps and of construction of equivariant compactifications

A Class of Topological Actions

We review definitions of generalized parallel transports in terms of Cheeger-Simons differential characters. Integration formulae are given in terms of Deligne-Beilinson cohomology classes. These representations of parallel transport can be extended to situations involving distributions as is appropriate in the context of quantized fields.Comment: 41 pages, no figure

(Quantum) Space-Time as a Statistical Geometry of Lumps in Random Networks

In the following we undertake to describe how macroscopic space-time (or rather, a microscopic protoform of it) is supposed to emerge as a superstructure of a web of lumps in a stochastic discrete network structure. As in preceding work (mentioned below), our analysis is based on the working philosophy that both physics and the corresponding mathematics have to be genuinely discrete on the primordial (Planck scale) level. This strategy is concretely implemented in the form of \tit{cellular networks} and \tit{random graphs}. One of our main themes is the development of the concept of \tit{physical (proto)points} or \tit{lumps} as densely entangled subcomplexes of the network and their respective web, establishing something like \tit{(proto)causality}. It may perhaps be said that certain parts of our programme are realisations of some early ideas of Menger and more recent ones sketched by Smolin a couple of years ago. We briefly indicate how this \tit{two-story-concept} of \tit{quantum} space-time can be used to encode the (at least in our view) existing non-local aspects of quantum theory without violating macroscopic space-time causality.Comment: 35 pages, Latex, under consideration by CQ