Related papers: Complexity reduction for path categories
This paper suggests a new way to compute the path integral for simple quantum mechanical systems. The new algorithm originated from previous research in string theory. However, its essential simplicity is best illustrated in the case of a…
This paper presents a method to certify the computational complexity of a standard Branch and Bound method for solving Mixed-Integer Quadratic Programming (MIQP) problems defined as instances of a multi-parametric MIQP. Beyond previous…
We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…
Using the generalized coherent states we argue that the path integral formulae for $SU(2)$ and $SU(1,1)$ (in the discrete series) are WKB exact,if the starting point is expressed as the trace of $e^{-iT\hat H}$ with $\hat H$ being given by…
We define the path coalgebra and Gabriel quiver constructions as functors between the category of $k$-quivers and the category of pointed $k$-coalgebras, for $k$ a field. We define a congruence relation on the coalgebra side, show that the…
Dyck paths are one of the most important objects in enumerative combinatorics, and there are many papers devoted to counting selected families of Dyck paths. Here we present two approaches for the automatic counting of many such families,…
A simplified model of tachyon matter in classical and quantum mechanics is constructed. p-Adic path integral quantization of the model is considered. Recent results in using p-adic analysis, as well as perspectives of an adelic…
The cubical barycentric subdivision sd_c(K) of a cubical complex K is introduced as an analogue of the barycentric subdivision of a simplicial complex. Explicit formulas for the short and long cubical h-vector of sd_c(K) are given, in terms…
Compact closed categories provide a foundational formalism for a variety of important domains, including quantum computation. These categories have a natural visualisation as a form of graphs. We present a formalism for equational reasoning…
The phase-integral method (PIM) is an asymptotic method of the geometrical optics or semi-classical type for solving approximately, but in many cases very accurately, a wide class of differential equations in physics. Unlike the related…
The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…
This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes of weak equivalences, special cases of classical weak equivalences, appropriate for the…
We describe Universal Coefficient Theorems for the equivariant Kasparov theory for C*-algebras with an action of the group of integers or over a unique path space, using KK-valued invariants. We compare the resulting classification up to…
In this paper, we examine the general algorithm for class group computations, when we do not have a small defining polynomial for the number field. Based on a result of Biasse and Fieker, we simplify their algorithm, improve the complexity…
Path integral method in quantum mechanics provides a new thinking for barrier option pricing. For proportional step options, the option price changing process is similar to the one dimensional trapezoid potential barrier scattering problem…
Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…
In many CAD-based applications, complex geometries are defined by a high number of design parameters. This leads to high-dimensional design spaces that are challenging for downstream engineering processes like simulations, optimization, and…
We show that the category of simplicial sets is a co-reflective subcategory of the category of cubical sets with connections, with the inclusion given by a version of the straightening functor. We show that using the co-reflector, one can…
The complex-step derivative approximation is a numerical differentiation technique that can achieve analytical accuracy, to machine precision, with a single function evaluation. In this letter, the complex-step derivative approximation is…
This article aims to provide a novel formalization of the concept of computational irreducibility in terms of the exactness of functorial correspondence between a category of data structures and elementary computations and a corresponding…