Related papers: Computing Path Signature Varieties in Macaulay2
Numerical algebraic geometry is the field of computational mathematics concerning the numerical solution of polynomial systems of equations. Bertini, a popular software package for computational applications of this field, includes…
We analyze the signature type of a cascade of periodic orbits associated to period doubling renormalizable maps of the two dimensional disk. The signature is a sequence of rational numbers which describes how periodic orbits turn each other…
We use path integrals to calculate perturbative corrections to the correlation function of a particle under the action of nonlinear optical tweezers, both in the overdamped and underdamped regimes. In both cases, it is found that to leading…
In the algebraic view, the solution to a network coding problem is seen as a variety specified by a system of polynomial equations typically derived by using edge-to-edge gains as variables. The output from each sink is equated to its…
The expected signature of a family of paths need not be a signature of a path itself. Motivated by this, we consider the notion of a Lie group barycenter introduced by Buser and Karcher to propose a barycenter on path signatures. We show…
The essence of the path integral method in quantum physics can be expressed in terms of two relations between unitary propagators, describing perturbations of the underlying system. They inherit the causal structure of the theory and its…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
We construct a collection of numerical invariants for approximately transitive (AT) actions (of $\Z$). We use them (sometimes supplemented by other invariants to show that members of various one-parameter families of AT actions are mutually…
We offer a digital signature scheme using Boolean automorphisms of a multivariate polynomial algebra over integers. Verification part of this scheme is based on the approximation of the number of zeros of a multivariate Boolean function.
The Gaussian polynomial in variable $q$ is defined as the $q$-analog of the binomial coefficient. In addition to remarkable implications of these polynomials to abstract algebra, matrix theory and quantum computing, there is also a…
Computational paths treat propositional equality as explicit paths built from labelled deduction steps and rewrite rules. This view originates in work by de Queiroz and collaborators [1] and yields a weak groupoid structure for equality,…
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$…
We give here a covariant definition of the path integral formalism for the Lagrangian, which leaves a freedom to choose anyone of many possible quantum systems that correspond to the same classical limit without adding new potential terms…
We propose a robust classification algorithm for curves in 2D and 3D, under the special and full groups of affine transformations. To each plane or spatial curve we assign a plane signature curve. Curves, equivalent under an affine…
A key overall goal of biomolecular simulations is the characterization of "mechanism" -- the pathways through configuration space of processes such as conformational transitions and binding. Some amount of heterogeneity is intrinsic to the…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
Given a feature set for the shape of a closed loop, it is natural to ask which features in that set do not change when the starting point of the path is moved. For example, in two dimensions, the area enclosed by the path does not depend on…
We introduce a Macaulay2 package for working with jet schemes. The main method constructs jets of ideals, polynomial rings and their quotients, ring homomorphisms, affine varieties, and (hyper)graphs. The package also includes additional…
Path integrals are a central tool when it comes to describing quantum or thermal fluctuations of particles or fields. Their success dates back to Feynman who showed how to use them within the framework of quantum mechanics. Since then, path…
This is the Hadamard package for Macaulay2 which computes the Hadamard product of projective subvarieties.