Related papers: Computing Path Signature Varieties in Macaulay2
In this article we introduce the insertion method for reconstructing the path from its signature, i.e. inverting the signature of a path. For this purpose, we prove that a converging upper bound exists for the difference between the…
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…
The signature of a $p$-weakly geometric rough path summarises a path up to a generalised notion of reparameterisation. The quotient space of equivalence classes on which the signature is constant yields unparameterised path space. The study…
We introduce the DeterminantalRepresentations package for Macaulay2, which computes definite symmetric determinantal representations of real polynomials. We focus on quadrics and plane curves of low degree (i.e. cubics and quartics). Our…
We describe the package "IncidenceCorrespondenceCohomology" for the computer algebra system Macaulay2. The main feature concerns the computation of characters and dimensions for the cohomology groups of line bundles on the incidence…
We introduce the \verb|Macaulay2| package \verb|RepHomology| for the computations of representation homology of certain spaces. The main methods implement computing the representation homology of surfaces (with group coefficients, and…
The Macaulay2 package CharacteristicClasses provides commands for the computation of the topological Euler characteristic, the degrees of the Chern classes and the degrees of the Segre classes of a closed subscheme of complex projective…
Path signatures embed trajectories into tensor algebra and constitute a universal, non-parametric representation of paths; however, in the standard form, they collapse temporal structure into a single global object, which limits their…
We prove that a continuous path with finite length in a real Banach space cannot have infinitely many zero components in its signature unless it is tree-like. In particular, this allows us to strengthen a limit theorem for signature…
The expected signature kernel arises in statistical learning tasks as a similarity measure of probability measures on path space. Computing this kernel for known classes of stochastic processes is an important problem that, in particular,…
The main objective of this work is to study mathematical properties of computational paths. Originally proposed by de Queiroz \& Gabbay (1994) as `sequences or rewrites', computational paths are taken to be terms of the identity type of…
We propose a topological approach to the problem of determining a curve from its iterated integrals. In particular, we prove that a family of terms in the signature series of a two dimensional closed curve with finite p variation, 1\leq…
This paper establishes a comprehensive concentration theory for truncated signatures of Gaussian rough paths. The signature of a path, defined as the collection of all iterated integrals, provides a complete description of its geometric…
Numerical Algebraic Geometry uses numerical data to describe algebraic varieties. It is based on the methods of numerical polynomial homotopy continuation, an alternative to the classical symbolic approaches of computational algebraic…
Multipath cohomology is a cohomology theory for directed graphs, which is defined using the path poset. The aim of this paper is to investigate combinatorial properties of path posets, and to provide computational tools for multipath…
We introduce the AdditiveToricVarieties package for Macaulay2, a software system for algebraic geometry and commutative algebra, with methods for working with additive group actions on complete toric varieties. More precisely, we implement…
In this paper, we propose a novel set of features for offline writer identification based on the path signature approach, which provides a principled way to express information contained in a path. By extracting local pathlets from…
This article introduces the package MatchingFields for Macaulay2 and highlights some open problems. A matching field is a combinatorial object whose data encodes a candidate toric degeneration of a Grassmannian or partial flag variety of…
The signature of a path \gamma is a sequence whose n-th term is the order-n iterated integrals of \gamma. It arises from solving multidimensional linear differential equations driven by \gamma. We are interested in relating the path…
We introduce the notion of property signatures, a representation for programs and program specifications meant for consumption by machine learning algorithms. Given a function with input type $\tau_{in}$ and output type $\tau_{out}$, a…