Related papers: Rectifiability and finite variation
We extend path analysis by giving sufficient conditions for computing the partial covariance of two random variables from their covariance. This is specifically done by correcting the covariance with the product of some partial variance…
We consider the functional of total variation of maps from an interval into a Riemannian submanifold of $\mathbb R^N$. We define a notion of strong solution to the system of equations corresponding to the $L^2$-gradient flow of this…
Given a set $A$ of real numbers consider the complete graph on the elements of $A$. We prove that if $A$ is an arithmetic progression then for every vertex $a\in A$ there exists an hamiltonian path such that the absolute differences of…
A curve $\theta$: $I\to E$ in a metric space $E$ equipped with the distance $d$, where $I\subset \R$ is a (possibly unbounded) interval, is called self-contracted, if for any triple of instances of time $\{t_i\}_{i=1}^3\subset I$ with…
We give a randomized algorithm that determines if a given graph has a simple path of length at least k in O(2^k poly(n,k)) time.
The signature transform, defined by the formal tensor series of global iterated path integrals, is a homomorphism between the path space and the tensor algebra that has been studied in geometry, control theory, number theory as well as…
We study a path-planning problem amid a set $\mathcal{O}$ of obstacles in $\mathbb{R}^2$, in which we wish to compute a short path between two points while also maintaining a high clearance from $\mathcal{O}$; the clearance of a point is…
The computation of short paths in graphs with arc lengths is a pillar of graph algorithmics and network science. In a more diverse world, however, not every short path is equally valuable. For the setting where each vertex is assigned to a…
In this paper we consider the mass transport problem in the case of a relativistic cost; we can establish the continuity of the total cost, together with a general estimate about the directions in which the mass can actually move, under…
In this paper, we determine the $r$-colour size Ramsey number of the path $P_k$, up to constants. In particular, for every fixed $r \geq 2$ and $k \geq 100\log r$, we have \[ \widehat{R}_r(P_k)=\Theta((r^2 \log r) \, k).\] Perhaps…
A reformulation of the path length of binary search trees is given in terms of permutations, allowing to extend the definition to the instance of words, where the letters are obtained by independent geometric random variables (with…
It is shown that a simple closed curve in $\mathbb C^n$ that is a uniform limit of rectifiable simple closed curves each of which has nontrivial polynomial hull has itself nontrivial polynomial hull. In case the limit curve is rectifiable,…
We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it.…
The main result given in Theorem~1.1 is a condition for a map $X$, defined on the complement of a disk $D$ in R^2 with values in R^2, to be extended to a topological embedding of R^2, not necessarily surjective. The map $X$ is supposed to…
We point out that the total number of trails and the total number of paths of given length, between two vertices of a simple undirected graph, are obtained as expectation values of specifically engineered quantum mechanical observables.…
We consider a directed graph on the 2-dimensional integer lattice, placing a directed edge from vertex $(i_1,i_2)$ to $(j_1,j_2)$, whenever $i_1 \le j_1$, $i_2 \le j_2$, with probability $p$, independently for each such pair of vertices.…
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 exhibit a polynomial time computable plane curve GAMMA that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. For every computable parametrization f of GAMMA and every…
We prove that in finite time a trajectory of a Lipschitz vector field in $\hbox{\bbbb R}^{\hbox{\tmm n}}$ can not have infinite rotation around a given point. This result extends to the mutual rotation of two trajectories of a field in…
We study the concept of quadratic variation of a continuous path along a sequence of partitions and its dependence with respect to the choice of the partition sequence. We define the concept of quadratic roughness of a path along a…