Related papers: Directed and irreversible path in Euclidean spaces

We introduce the space of rough paths with Sobolev regularity and the corresponding concept of controlled Sobolev paths. Based on these notions, we study rough path integration and rough differential equations. As main result, we prove that…

Suppose that $A$ and $B$ are closed subsets of a Euclidean space such that $A\cap B\neq\varnothing$, and we aim to find a point in this intersection with the help of the sequences $(a_n)_\nnn$ and $(b_n)_\nnn$ generated by the \emph{method…

This paper proposes direct and inverse results for the Dirichlet and Dirichlet to Neumann problems for complex curves with nodal type singularities. As an application, we give a method to reconstruct the conformal structure of a compact…

Motivated by problems arising in the relative trace formula and arithmetic invariant theory we prove the existence of rational points on orbits arising from certain infinitesimal symmetric spaces. As an application, we prove analogous…

Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…

A graph drawing is $\textit{greedy}$ if, for every ordered pair of vertices $(x,y)$, there is a path from $x$ to $y$ such that the Euclidean distance to $y$ decreases monotonically at every vertex of the path. Greedy drawings support a…

In this work we present a version of the so called Chen and Chv\'atal's conjecture for directed graphs. A line of a directed graph D is defined by an ordered pair (u, v), with u and v two distinct vertices of D, as the set of all vertices w…

We introduce an equivalence relation on the set of Dyck paths and some operations on them. We determine a formula for the cardinality of those equivalence classes and use this information to obtain a combinatorial formula for the number of…

We show that the length of a path in $ \mathbf{R}^2 $ can be computed if and only if its variation in every direction can.

The paper is split in two parts: in the first part, we construct the exact likelihood for a discretely observed rough differential equation, driven by a piecewise linear path. In the second part, we use this likelihood in order to construct…

We prove that the moduli space of complete Riemannian metrics of bounded geometry and uniformly positive scalar curvature on an orientable 3-manifold is path-connected. This generalizes the main result of the fourth author [Mar12] in the…

We study a class of Riemannian manifolds with respect to the covariant derivative of their curvature tensors. We introduce geometrically the class of directed Riemannian manifolds of pointwise constant relative sectional curvature and give…

We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decomposition of a directed graph $D$ in terms of its degree…

We to define a Path Integral in Lorentzian time by restricting the relevant domain of integration on $C([0,1],M)$ over a Riemannian configuration manifold $(M,g)$ and considering the dynamics of a particle evolving between to fixed…

It is shown that in dimension at least three a local diffeomorphism of Euclidean n-space into itself is injective provided that the pull-back of every plane is a Riemannian submanifold which is conformal to a plane. Using a similar…

We introduce the Unsplittable Transshipment Problem in directed graphs with multiple sources and sinks. An unsplittable transshipment routes given supplies and demands using at most one path for each source-sink pair. Although they are a…

A $k$-ranking of a directed graph $G$ is a labeling of the vertex set of $G$ with $k$ positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between. The rank…

A class of countable infinite graphs with unbounded vertex degree is considered. In these graphs, the vertices of large degree `repel' each other, which means that the path distance between two such vertices cannot be smaller than a certain…

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…

A family of lines through the origin in Euclidean space is called equiangular if any pair of lines defines the same angle. The problem of estimating the maximum cardinality of such a family in $\mathbb{R}^n$ was extensively studied for the…