Related papers: Polytime reductions of AF-algebraic problems
We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…
Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…
We prove a complexity dichotomy for a class of counting problems expressible as bipartite 3-regular Holant problems. For every problem of the form $\operatorname{Holant}\left(f\mid =_3 \right)$, where $f$ is any integer-valued ternary…
Admissible point transformations of classes of $r$th order linear ordinary differential equations (in particular, the whole class of such equations and its subclasses of equations in the rational form, the Laguerre-Forsyth form, the first…
We define counting classes #P_R and #P_C in the Blum-Shub-Smale setting of computations over the real or complex numbers, respectively. The problems of counting the number of solutions of systems of polynomial inequalities over R, or of…
In this article we present first an algorithm for calculating the determining equations associated with so-called ``nonclassical method'' of symmetry reductions (a la Bluman and Cole) for systems of partial differentail equations. This…
We reexamine different examples of reduction chains $\mathfrak{g} \supset \mathfrak{g}'$ of Lie algebras in order to show how the polynomials determining the commutant with respect to the subalgebra $\mathfrak{g}'$ leads to polynomial…
We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…
We prove new necessary and sufficient conditions to carry out a compact linearization approach for a general class of binary quadratic problems subject to assignment constraints as it has been proposed by Liberti in 2007. The new conditions…
The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…
Linearity and ramification constraints have been widely used to weaken higher-order (primitive) recursion in such a way that the class of representable functions equals the class of polytime functions. We show that fine-tuning these two…
Motivated by the Hankel determinant evaluation of moment sequences, we study a kind of Pfaffian analogue evaluation. We prove an LU-decomposition analogue for skew-symmetric matrices, called Pfaffian decomposition. We then apply this…
We announce some new results regarding the classification problem for separable von Neumann algebras. Our results are obtained by applying the notion of Borel reducibility and Hjorth's theory of turbulence to the isomorphism relation for…
We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the product $\times$, and the finite…
It is shown that the problem of calculating form factors in ADE affine Toda field theories can be reduced to the nonperturbative recursive calculation of polynomials symmetric in each sort of variables. We determine these recursion…
On the long-established classification problems in general relativity we take a novel perspective by adopting fruitful techniques from machine learning and modern data-science. In particular, we model Petrov's classification of spacetimes,…
A ${\mathbb Z}_2\times{\mathbb Z}_2$-graded Lie algebra $\mathfrak g$ is a ${\mathbb Z}_2\times{\mathbb Z}_2$-graded algebra $\mathfrak g$ with a bracket $[|. , . |]$ that satisfies certain graded versions of the symmetry and Jacobi…
The linearization of a quadratic form gives rise to a Clifford algebra structure, as seen in Dirac's factorization of the d'Alembert operator. A similar structure known as a generalized Clifford algebra arises from the continuation of this…
In this article, we study the computational complexity of counting weighted Eulerian orientations, denoted as \#\textsf{EO}. This problem is considered a pivotal scenario in the complexity classification for \textsf{Holant}, a counting…
The equations for the critical points of the action functional defined by a Lagrangian depending on higher-order derivatives of admissible curves on a Lie algebroid are found. The relation with Euler-Poincar\'e and Lagrange Poincar\'e type…