Related papers: Polytime reductions of AF-algebraic problems
We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential…
Generalizing von Neumann's result on type II$_1$ von Neumann algebras, we characterize lattice isomorphisms between projection lattices of arbitrary von Neumann algebras by means of ring isomorphisms between the algebras of locally…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
This paper studies self-injective algebras of polynomial growth. We prove that the derived equivalence classification of weakly symmetric algebras of domestic type coincides with the classification up to stable equivalences (of Morita…
We perform enhanced Lie symmetry analysis of generalized fifth-order Korteweg-de Vries equations with time-dependent coefficients. The corresponding similarity reductions are classified and some exact solutions are constructed.
We investigate graded retracts of polytopal algebras (essentially the homogeneous rings of affine cones over projective toric varieties) as polytopal analogues of vector spaces. In many cases we show that these retracts are again polytopal…
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…
There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…
We present the finite first-order theory (FFOT) machine, which provides an atemporal description of computation. We then develop a concept of complexity for the FFOT machine, and prove that the class of problems decidable by a FFOT machine…
Let $X$ be a finite set in $Z^d$. We consider the problem of optimizing linear function $f(x) = c^T x$ on $X$, where $c\in Z^d$ is an input vector. We call it a problem $X$. A problem $X$ is related with linear program $\max\limits_{x \in…
In this paper we study three aspects of (P(M)/~), the set of Murray-von Neumann equivalence classes of projections in a von Neumann algebra M. First we determine the topological structure that (P(M)/~) inherits from the operator topologies…
I discuss algorithms for the evaluation of Feynman integrals. These algorithms are based on Hopf algebras and evaluate the Feynman integral to (multiple) polylogarithms.
There exist initial segments of both the Dyment lattice and the Dyment-Muchnik lattice that yield Brouwer algebras modeling exactly the intuitionistic propositional calculus. For the Dyment-Muchnik lattice, this result is obtained by…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
In the realm of complexity, it is argued that adequate modeling of TeV-physics demands an approach based on fractal operators and fractional calculus (FC). Non-local theories and memory effects are connected to complexity and the FC. The…
We explore order reduction techniques for solving the algebraic Riccati equation (ARE), and investigating the numerical solution of the linear-quadratic regulator problem (LQR). A classical approach is to build a surrogate low dimensional…
A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, Mod6-SAT,…
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For…
We present a systematic study of symmetries, invariants and moduli spaces of classes of coframes. We introduce a classifying Lie algebroid to give a complete description of the solution to Cartan's realization problem that applies to both…
We consider several algorithmic problems concerning geodesics in finitely generated groups. We show that the three geodesic problems considered by Miasnikov et al [arXiv:0807.1032] are polynomial-time reducible to each other. We study two…