Related papers: Saturating directed spaces
The chase is a widely implemented approach to reason with tuple-generating dependencies (tgds), used in data exchange, data integration, and ontology-based query answering. However, it is merely a semi-decision procedure, which may fail to…
The notions of compactness and Hausdorff separation for generalized enriched categories allow us, as classically done for the category $\mathsf{Top}$ of topological spaces and continuous functions, to study $\textit{compactly generated…
In the vector-field guided path-following problem, a sufficiently smooth vector field is designed such that its integral curves converge to and move along a one-dimensional geometric desired path. The existence of singular points where the…
Randomized saturation designs are a family of designs which assign a possibly different treatment proportion to each cluster of a population at random. As a result, they generalize the well-known (stratified) completely randomized designs…
This paper addresses the challenge of obtaining strong optimality guarantees in constrained nonsmooth nonconvex optimization under mild regularity conditions, namely local Lipschitz continuity and existence and continuity of directional…
Saturating sets are combinatorial objects in projective spaces over finite fields that have been intensively investigated in the last three decades. They are related to the so-called covering problem of codes in the Hamming metric. In this…
A bounded curvature path is a continuously differentiable piece-wise $C^2$ path with bounded absolute curvature connecting two points in the tangent bundle of a surface. These paths have been widely considered in computer science and…
We study the replacement paths problem in the $\mathsf{CONGEST}$ model of distributed computing. Given an $s$-$t$ shortest path $P$, the goal is to compute, for every edge $e$ in $P$, the shortest-path distance from $s$ to $t$ avoiding $e$.…
A variant of the classical optimal transportation problem is: among all joint measures with fixed marginals and which are dominated by a given density, find the optimal one. Existence and uniqueness of solutions to this variant were…
We present a novel set of rigorous and computationally efficient topology-based complexity notions that exhibit a strong correlation with the generalization gap in modern deep neural networks (DNNs). DNNs show remarkable generalization…
In a previous paper [22] the author studied the directed weak covering homotopy property (dWCHP)and directed weak fibrations in the category dTop of directed spaces in the sense of M. Grandis [12], [13], [14]. This type of maps extend to…
This article belongs to a subject, Directed Algebraic Topology, whose general aim is including non-reversible processes in the range of topology and algebraic topology. Here, as a further step, we also want to cover "critical processes",…
We extend the Stone duality between topological spaces and locales to include order: there is an adjunction between the category of preordered topological spaces satisfying the so-called open cone condition, and the newly defined category…
In this paper, we introduce a new higher-order directional derivative and higher-order subdifferential of Hadamard type of a given proper extended real function. This derivative is harmonized with the classical higher-order Fr\'echet…
Two-stage methods addressing continuous shortest path problems start local minimization from discrete shortest paths in a spatial graph. The convergence of such hybrid methods to global minimizers hinges on the discretization error induced…
In this thesis we define the notion of a locally stratified space. Locally stratified spaces are particular kinds of streams and d-spaces which are locally modelled on stratified spaces. We construct a locally presentable and cartesian…
We generalize the constructions and results of Chapter 10 in Baldwin's "Categoricity" to coherent accessible categories with concrete directed colimits and concrete monomorphisms. In particular, we prove that if any category of this form is…
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…
Flows are a topological model of concurrency which enables to encode the notion of refinement of observation and to understand the homological properties of branchings and mergings of execution paths. Roughly speaking, they are Grandis'…
This paper addresses the problem of a boundary control design for traffic evolving in a large-scale urban network. The traffic state is described on a macroscopic scale and corresponds to the vehicle density, whose dynamics are governed by…