Related papers: Combinatorial Conditions for Directed Collapsing
Recent progress towards unraveling the hidden geometric organization of real multiplexes revealed significant correlations across the hyperbolic node coordinates in different network layers, which facilitated applications like trans-layer…
We study the effect of edge contractions on simplicial homology because these contractions have turned to be useful in various applications involving topology. It was observed previously that contracting edges that satisfy the so called…
This paper gives a complete classification of linear repetitivity (LR) for a natural class of aperiodic Euclidean cut and project schemes with convex polytopal windows. Our results cover those cut and project schemes for which the lattice…
The lack of studying the complex organization of directed network usually limits to the understanding of underlying relationship between network structures and functions. Structural controllability and structural predictability, two…
We study percolation problems of overlapping objects where the underlying geometry is such that in D-dimensions, a subset of the directions has a lattice structure, while the remaining directions have a continuum structure. The resulting…
The main idea for interpreting concurrent processes as labelled precubical sets is that a given set of n actions running concurrently must be assembled to a labelled n-cube, in exactly one way. The main ingredient is the non-functorial…
This short note introduces a notion of directed homotopy equivalence and of "directed" topological complexity (which elaborates on the notion that can be found in e.g. Farber's book) which have a number of desirable joint properties. In…
Admissible rules are shown to be conservatively preserved by the meet-combination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics. Structural completeness and decidability of…
We modify the Pearce-Kelly algorithm that maintains a topological ordering for a directed acyclic graph in order to allow cycles to be tolerated. Cycles make topological orderings moot, of course, however tolerating them is useful in…
We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…
A construction is given for the recovery of a disjoint union of strictly convex smooth planar obstacles from travelling-time information. The obstacles are required to be such that no Euclidean line meets more than two of them.
Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into euclidean space is "as convex as possible". It can thus be understood as a generalization of…
This paper presents conditions for establishing topological controllability in undirected networks of diffusively coupled agents. Specifically, controllability is considered based on the signs of the edges (negative, positive or zero). Our…
Our goal is to identify curvature conditions that distinguish Euclidean space in the case of open, contractible manifolds and the disk in the case of compact, contractible manifolds with boundary. First, we show that an open manifold that…
We study a topology on a space of functions, called sticking topology, with the property to be the weakest among the topologies preserving continuity. In suitable frameworks, this topology preserves borelianity, local integrability, right…
A new method for constructing self-referential tilings of Euclidean space from a graph directed iterated function system, based on a combinatorial structure we call a pre-tree, is introduced. In the special case that we refer to as…
A bounded curvature path is a continuously differentiable piecewise $C^2$ path with bounded absolute curvature that connects two points in the tangent bundle of a surface. In this note we give necessary and sufficient conditions for two…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…
Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…
Hybrid systems are characterized by having an interaction between continuous dynamics and discrete events. The contribution of this paper is to provide hybrid systems with a novel geometric formulation so that controls can be added. Using…