Related papers: A canonical parameterization of paths in $\mathbb{…
Let $G$ be a fixed graph. Two paths of length $n-1$ on $n$ vertices (Hamiltonian paths) are $G$-different if there is a subgraph isomorphic to $G$ in their union. In this paper we prove that the maximal number of pairwise triangle-different…
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$…
Two graph parameters are said to be coarsely equivalent if they are within constant factors from each other for every graph $G$. Recently, several graph parameters were shown to be coarsely equivalent to tree-length. Recall that the length…
The paths on the {\bf R$^3$} real Euclidean manifold are defined as 2-dimensional simplicial strips; points are replaced by 2-simplexes and the orbits of the action of a one discrete-parameter group on the base manifold becomes a convex…
We give two novel proofs that the path integral and stochastic quantizations of generic scalar Euclidean quantum field theories are equivalent. Our proofs rely on Taylor interpolations indexed by forests, in the fashion of constructive…
We extend the classical length function to an ordinal-valued invariant on the class of all finite-dimensional Noetherian modules. We show how to calculate this combinatorial invariant by means of the fundamental cycle of the module, thus…
Recent work argued that the scaling of a dimensionless quantity $Q_D$ with path length is a better proxy for quantifying the scaling of the computational cost of maintaining adiabaticity than the timescale. It also conjectured that…
Most datasets encountered in computer vision and medical applications present symmetries that should be taken into account in classification tasks. A typical example is the symmetry by rotation and/or scaling in object detection. A common…
We characterize geodesic paths in the $n$-dimensional unit sphere under sup norm. A geodesic path between two points is a shortest curve joining the two points.
The inevitable noise in real measurements motivates the problem to continuously quantify the similarity between rigid objects such as periodic time series and proteins given by ordered points and considered up to isometry maintaining…
An isometry is a geometric transformation that preserves distances between pairs of points. We present methods to classify isometries in the Euclidean plane, and extend these methods to spherical, single elliptical, and hyperbolic geometry.…
We describe a general probabilistic framework to address a variety of Frechet-distance optimization problems. Specifically, we are interested in finding minimal bottleneck-paths in $d$-dimensional Euclidean space between given start and…
This paper is a generalization of previous work on the use of classical canonical transformations to evaluate Hamiltonian path integrals for quantum mechanical systems. Relevant aspects of the Hamiltonian path integral and its measure are…
Numerical computation of shortest paths or geodesics on curved domains, as well as the associated geodesic distance, arises in a broad range of applications across digital geometry processing, scientific computing, computer graphics, and…
We consider an infinite graph with the vertex set $\mathbb{Z}^2$ and edges connecting the vertices iff the Euclidean distance between the respective points is an integer, and the points do not lie on the same horizontal or vertical.…
The Straightness is a measure designed to characterize a pair of vertices in a spatial graph. It is defined as the ratio of the Euclidean distance to the graph distance between these vertices. It is often used as an average, for instance to…
Multiparameter persistence module can capture more topological differences across data instances compared to using a single parameter, where the well-studied matching distance investigates the distance along a straight line in the…
In the present paper, we study surfaces in the four-dimensional Euclidean space $\mathbb{R}^4$. We define special principal parameters, which we call canonical, on each surface without minimal points, and prove that the surface admits (at…
The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. L. Shapiro [9] found the Chung-Feller properties for the Motzkin paths.…
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.