Related papers: Complexity reduction for path categories
We prove the uniqueness, the functoriality and the naturality of cylinder objects and path objects in closed simplicial model categories.
We give simple upper bounds for rational sectional category and use them to compute invariants of the type of Farber's topological complexity of rational spaces. In particular we show that the sectional category of formal morphisms reaches…
The path integral formulation of constrained systems leads to obtain the equations of motion as total differential equations in many variables. If these equations are integrable then one can constuct a valid and a canonical phase space…
Integration-by-parts reductions play a central role in perturbative QFT calculations. They allow the set of Feynman integrals contributing to a given observable to be reduced to a small set of basis integrals, and they moreover facilitate…
A systematic classification of Feynman path integrals in quantum mechanics is presented and a table of solvable path integrals is given which reflects the progress made during the last ten years or so, including, of course, the main…
Much of the homotopical and homological structure of the categories of chain complexes and topological spaces can be deduced from the existence and properties of the 'simple' functors Tot : {double chain complexes} -> {chain complexes} and…
This paper offers an algorithmic solution to the problem of obtaining "economical" formulae for some maps in Simplicial Topology, having, in principle, a high computational cost in their evaluation. In particular, maps of this kind are used…
We present a complexity reduction algorithm for a family of parameter-dependent linear systems when the system parameters belong to a compact semi-algebraic set. This algorithm potentially describes the underlying dynamical system with…
In this paper, we describe an algorithm that efficiently collect relations in class groups of number fields defined by a small defining polynomial. This conditional improvement consists in testing directly the smoothness of principal ideals…
We give a simple and effective two stage algorithm for approximating a point cloud $\mathcal{S}\subset\mathbb{R}^m$ by a simplicial complex $K$. The first stage is an iterative fitting procedure that generalizes k-means clustering, while…
Methods of parabolic geometries have been recently used to construct a class of elliptic complexes on quaternionic manifolds, the Salamon's complex being the simplest case. The purpose of this paper is to describe an algorithm how to…
Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we study the problem of finding k-Dissimilar Paths with Minimum…
A new categorical setting is defined in order to characterize the subrecursive classes belonging to complexity hierarchies. This is achieved by means of coercion functors over a symmetric monoidal category endowed with certain recursion…
In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…
The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[n]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [n]$ of $[n]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…
We discuss the interpretation of path integral optimization as a uniformization problem in even dimensions. This perspective allows for a systematical construction of the higher-dimensional path integral complexity in holographic conformal…
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…
We develop a Fourier approach to rough path integration, based on the series decomposition of continuous functions in terms of Schauder functions. Our approach is rather elementary, the main ingredient being a simple commutator estimate,…
Enormous activity in the Quantum Computing area has resulted in considering them to solve different difficult problems, including those of applied nature, together with classical computers. An attempt is made in this work to nail down a…
We study the computational complexity of sequences of projective varieties. We define analogues of the complexity classes P and NP for these and prove the NP-completeness of a sequence called the universal circuit resultant. This is the…