Related papers: Directed and irreversible path in Euclidean spaces

A recurrence equation is a discrete integrable equation whose solutions are all periodic and the period is fixed. We show that infinitely many recurrence equations can be derived from the information about invariant varieties of periodic…

Let $A$ and $B$ be disjoint sets, of size $2^k$, of vertices of $Q_n$, the $n$-dimensional hypercube. In 1997, Bollob\'as and Leader proved that there must be $(n-k)2^k$ edge-disjoint paths between such $A$ and $B$. They conjectured that…

This article shows a very elementary and straightforward proof of the Implicit Function Theorem for differentiable maps $F(x,y)$ defined on a finite-dimensional Euclidean space. There are no hypothesis on the continuity of the partial…

Let $S$ be a complete flat surface, such as the Euclidean plane. We obtain direct characterizations of the connected components of the space of all curves on $S$ which start and end at given points in given directions, and whose curvatures…

Two $a{-}b$ paths in a graph $G$ are order-compatible if their common vertices occur in the same order when travelling from $a$ to $b$. Suppose a graph contains an infinite number $\delta$ of edge-disjoint $a{-}b$ paths. G.A. Dirac asked…

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…

Using the E-algebraic systems, various graded irreducible representations of a Leavitt path algebra L of a graph E over a field K are constructed. The concept of a Laurent vertex is introduced and it is shown that the minimal graded left…

We prove some results, which are used in arXiv:1406.7871, about weakly geometric rough paths that are well-known in finite dimensions, but need proof in the infinite dimensional setting.

There is strong evidence coming from Lorentzian dynamical triangulations that the unboundedness of the gravitational action is no obstacle to the construction of a well-defined non-perturbative path integral. In a continuum approach, a…

We prove a version of Bass' finitistic dimension conjecture for path algebras over arbitrary directed graphs. It is known that the path algebra of a finite directed graph is hereditary, hence it has finite finitistic dimension, when the…

We provide a unified analytic approach to study stationary states of controlled differential equations driven by rough paths, using the framework of random dynamical systems and random attractors. Part I deals with driving paths of finite…

The commonly accepted definition of paths starts from a random field but ignores the problem of setting joint distributions of infinitely many random variables for defining paths properly afterwards. This paper provides a turnaround that…

In this paper we study variations of an old result by M\"{u}ller, Reiterman, and the last author stating that a countable graph has a subgraph with infinite degrees if and only if in any labeling of the vertices (or edges) of this graph by…

The purpose of this paper is to prove that every finite set of points that can be constructed in the Euclidean plane by using a compass and a ruler can also be constructed by using unitary match-sticks in a non-simultaneous way and…

A positive path in the linear symplectic group $\Sp(2n)$ is a smooth path which is everywhere tangent to the positive cone. These paths are generated by negative definite (time-dependent) quadratic Hamiltonian functions on Euclidean space.…

We consider the billiard in the exterior of a piecewise smooth body in two-dimensional Euclidean space and show that the maximum number of directions of invisibility in such billiard is at most finite.

Choose two points in the tangent bundle of the Euclidean plane $(x,X),(y,Y)\in T{ \mathbb R}^2$. In this work we characterise the immersed length minimising paths with a prescribed bound on the curvature starting at $x$, tangent to $X$;…

In this paper we consider convex subsets of locally-convex topological vector spaces. Given a fixed point in such a convex subset, we show that there exists a curve completely contained in the convex subset and leaving the point in a given…

In this series we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects like undirected graphs, directed graphs, bidirected graphs, hypergraphs or finitary matroids. In…

We consider the problem of enumerating d-irreducible maps, i.e. planar maps whose all cycles have length at least d, and such that any cycle of length d is the boundary of a face of degree d. We develop two approaches in parallel: the…