Related papers: Rectifiability and finite variation

In this short note we prove that every tournament contains the $k$-th power of a directed path of linear length. This improves upon recent results of Yuster and of Gir\~ao. We also give a complete solution for this problem when $k=2$,…

We consider a length functional for $C^1$ curves of fixed degree in graded manifolds equipped with a Riemannian metric. The first variation of this length functional can be computed only if the curve can be deformed in a suitable sense, and…

For finite graphs, path-width is an interesting and useful concept, but if we extend it to infinite graphs in the most obvious way (by making the indexing path infinite), it does not work nicely. The simplest extension that works nicely is…

For 0<n<d integers and r>2, we prove that an n-dimensional Ahlfors-David regular measure M in R^d is uniformly n-rectifiable if and only if the r-variation for the Riesz transform with respect to M is a bounded operator in L^2(M). This…

We show that weighted path orders are special instances of a variant of semantic path orders. Exploiting this fact, we introduce a generalization of weighted path orders that goes beyond the realm of simple termination. Experimental data…

A measure is 1-rectifiable if there is a countable union of finite length curves whose complement has zero measure. We characterize 1-rectifiable Radon measures $\mu$ in $n$-dimensional Euclidean space for all $n\geq 2$ in terms of…

We consider two orientation problems in a graph, namely the minimization of the sum of all the shortest path lengths and the minimization of the diameter. We show that it is NP-complete to decide whether a graph has an orientation such that…

In this note we show that the space of all metrics of positive Ricci curvature on a spin manifold of dimension 4k-1 for k at least 2 has infinitely many path components provided that the manifold admits a very particular kind of metric.

Consider the following variational problem: among all curves in $\mathbb{R}^n$ of fixed length with prescribed end points and prescribed tangents at the end points, minimise the $L^\infty$-norm of the curvature. We show that the solutions…

It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.

We prove an extension to the classical continuity theorem in rough paths. We show that two $p$-rough paths are close in all levels of iterated integrals provided the first $\lfl p \rfl$ terms are close in a uniform sense. Applications…

We study effective randomness-preserving transformations of path-incompressible trees. Some path-incompressible trees with infinitely many paths do not compute perfect path-random trees with computable oracle-use. Sparse perfect…

Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…

A digraph $D$ is called \emph{path extendable} if for every nonhamiltonian (directed) path $P$ in $D$, there exists another path $P^\prime$ with the same initial and terminal vertices as $P$, and $V(P^\prime) = V (P)\cup \{w\}$ for a vertex…

We determine the most probable length of paths at finite temperatures, with a preassigned end-to-end distance and a unit of energy assigned to every step on a $D$-dimensional hypercubic lattice. The asymptotic form of the most probable…

If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…

We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…

We resolve a long-standing open problem posed by Federer concerning the rectifiability of the integral geometric measure with exponent p >1, thereby settling a question that has persisted since its formulation. While the main theorem is…

A sequence of rational points on an algebraic planar curve is said to form an $r$-geometric progression sequence if either the abscissae or the ordinates of these points form a geometric progression sequence with ratio $r$. In this work, we…

An articulated probe is modeled in the plane as two line segments, $ab$ and $bc$, joined at $b$, with $ab$ being very long, and $bc$ of some small length $r$. We investigate a trajectory planning problem involving the articulated…