Related papers: Rectifiability and finite variation
In this article we will prove that if the continuous closed curve $\gamma : [0, 1] \rightarrow \mathbb{R}^2$ has finite $p$-variation with $p < 2$, then $(\iint\limits_{\mathbb{R}^2}|\eta(\gamma, (x, y))|^q \,dx \,dy)^{1/q} \le…
A detour in a graph is a longest path. This thesis is mainly about connected, non-traceable graphs with the property that each vertex is the start (or end) vertex of a detour. There are also related results on claw-free, 2-connected,…
For $d\geq 2$, we construct a doubling measure $\nu$ on $\R^d$ and a rectifiable curve $\Gamma$ such that $\nu(\Gamma)>0$.
A path system in a graph $G$ is a collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We show that the number of consistent path systems on $n$…
The aim of this very short note is to relate the directed paths in ${\stackrel{\rm \longrightarrow}{\rm \mathbb{R}^n}}$ to the irreversible paths in ${\stackrel{\rm ir}{\rm \mathbb{R}^n}}$. We first show that there is a directed path from…
In program semantics and verification, reasoning about loops is complicated by the need to produce two separate mathematical arguments: an invariant, for functional properties (ignoring termination); and a variant, for termination (ignoring…
We construct a combinatorial function F which computes the number of oriented Hamiltonian paths of any given type, in a transitive tournament. We also study many properties of F that arise, and reach some observations.
We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.
A useful result is that if a bounded complex-valued path is Riemann-integrable, then its modulus is also Riemann-integrable. The extension of this last result to bounded paths taking values in a normed space is affirmed, as being true, in…
Let $G=(V,E)$ be a locally finite graph. Firstly, using calculus of variations, including a direct method of variation and the mountain-pass theory, we get sequences of solutions to several local equations on $G$ (the Schr\"odinger…
The calculus of variation and the construction of path integrals is revisited within the framework of non-linear generalized functions. This allows us to make a rigorous analysis of the variation of an action that takes into account the…
We show that the number of maximal paths in directed last-passage percolation on the hypercubic lattice ${\mathbb Z}^d$ $(d\geq2)$ in which weights take finitely many values is typically exponentially large.
We prove that there exist infinitely many asymptotics of drift for random walks on finitely generated groups.
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
A graph on $2k$ vertices is path-pairable if for any pairing of the vertices the pairs can be joined by edge-disjoint paths. The so far known families of path-pairable graphs have diameter of length at most 3. In this paper we present an…
We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result extends well known enumerative formulae concerning lattice paths, and its derivation involves a classical…
We consider a path-planning scenario for a mobile robot traveling in a configuration space with obstacles under the presence of stochastic disturbances. A novel path length metric is proposed on the uncertain configuration space and then…
We propose a simple, geometrically-motivated construction of smooth random paths in the plane. The construction is such that, with probability one, the paths have finite curvature everywhere (and the realizations are visually pleasing when…
We consider a constrained version of the shortest path problem on the complete graphs whose edges have independent random lengths and costs. We establish the asymptotic value of the minimum length as a function of the cost-budget within a…
In this note, we define the numbers of level crossings by a c{\`a}dl{\`a}g (RCLL) real function $x: [0,+\infty) \rightarrow R$ and, in analogy to the work of Bertoin and Yor [BY14] we prove that for $x$ with locally finite total variation…