Related papers: Complexity reduction for path categories
The simplest (3+1)D Regge calculus model (with three-dimensional discrete space and continuous time) is considered which describes evolution of the simplest closed two-tetrahedron piecewise flat manifold in the continuous time. The measure…
We develop the structure theory for transformations of weakly geometric rough paths of bounded $1 < p$-variation and their controlled paths. Our approach differs from existing approaches as it does not rely on smooth approximations. We…
Dyck paths are among the most heavily studied Catalan families. We work with peaks and valleys to uniquely decompose Dyck paths into the simplest objects - prime fragments with a single peak. Each Dyck path is uniquely characterized by a…
We classify all solutions (p,q) to the equation p(u)q(u)=p(u+b)q(u+a) where p and q are complex polynomials in one indeterminate u, and a and b are fixed but arbitrary complex numbers. This equation is a special case of a system of…
We give a pedagogical review of the application of field theoretic and path integral methods to calculate moments of the probability density function of stochastic differential equations perturbatively.
This article surveys quantum computational complexity, with a focus on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems. Properties of…
We frame the issue of pedestrian dynamics modeling in terms of path-integrals, a formalism originally introduced in quantum mechanics to account for the behavior of quantum particles, later extended to quantum field theories and to…
In this paper, we introduce a new type of $ pq $-calculus. The $ pq $-derivative and $ pq $-integration are investigated and various properties of these concepts are given. The fundamental theorem of $ pq $-calculus and formulas of $ pq…
Motzkin paths are simple yet important combinatorial objects. In this paper, we consider families of Motzkin paths with restrictions on peak heights, valley heights, upward-run lengths, downward-run lengths, and flat-run lengths. This paper…
A fundamental pursuit in complexity theory concerns reducing worst-case problems to average-case problems. There exist complexity classes such as PSPACE that admit worst-case to average-case reductions. However, for many other classes such…
In this paper we take up again the deformation theory for $K$-linear pseudofunctors initiated in a previous work (Adv. Math. 182 (2004) 204-277). We start by introducing a notion of a 2-cosemisimplicial object in an arbitrary 2-category and…
We give a general technique for constructing a functorial choice of very good paths objects, which can be used to implement identity types in models of type theories in direct manner with little reliance on general coherence results. We…
Using a homological invariant together with an obstruction class in a certain Ext^2-group, we may classify objects in triangulated categories that have projective resolutions of length two. This invariant gives strong classification results…
In this note, we provide a unifying framework to investigate the computational complexity of classical spin models and give the full classification on spin models in terms of system dimensions, randomness, external magnetic fields and types…
We consider closed simplicial and cubical $n$-complexes in terms of link of their $(n-2)$-faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every $(n-2)$-face is contained in 3 or 4 $n$-faces. Such simplicial…
Splitting methods for the numerical integration of differential equations of order greater than two involve necessarily negative coefficients. This order barrier can be overcome by considering complex coefficients with positive real part.…
We introduce higher simplicial complexity of a simplicial complex $K$ and higher combinatorial complexity of a finite space $P$ (i.e. $P$ is a finite poset). We relate higher simplicial complexity with higher topological complexity of $|K|$…
In this paper we develop the formalism of rational complex Bezier curves. This framework is a simple extension of the CAD paradigm, since it describes arc of curves in terms of control polygons and weights, which are extended to complex…
The path optimization has been proposed to weaken the sign problem which appears in some field theories such as finite density QCD. In this method, we optimize the integration path in complex plain to enhance the average phase factor. In…
We introduce a new cubical model for homotopy types. More precisely, we'll define a category Qs with the following features: Qs is a PROP containing the classical box category as a subcategory, the category Qs-Set of presheaves of sets on…