Related papers: HTP-complete rings of rational numbers
In the total matching problem, one is given a graph $G$ with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incident union of a stable set and a matching. We consider the…
In this article we mainly consider the positively Z-graded polynomial ring R=F[X,Y] over an arbitrary field F and Hilbert series of finitely generated graded R-modules. The central result is an arithmetic criterion for such a series to be…
The Invariant Subspace Problem (ISP) for Hilbert spaces asks if every bounded linear operator has a non-trivial closed invariant subspace. Due to the existence of universal operators (in the sense of Rota), the ISP may be solved by…
The Hidden Subgroup Problem (HSP) is a computational problem which includes as special cases integer factorization, the discrete logarithm problem, graph isomorphism, and the shortest vector problem. The celebrated polynomial-time quantum…
Given a sound first-order p-time theory $T$ capable of formalizing syntax of first-order logic we define a p-time function $g_T$ that stretches all inputs by one bit and we use its properties to show that $T$ must be incomplete. We leave it…
We consider the problem of separability: decide whether a Hermitian operator on a finite dimensional Hilbert tensor product is separable or entangled. We show that the tensor convolution defined for certain mappings on an almost arbitrary…
A (control) network over a finite ring is proposed. Using semi-tensor product (STP) of matrices, a set of algebraic equations are provided to verify whether a finite set with two binary operators is a ring. It is then shown that the…
Given a graph G and an integer k, the objective of the $\Pi$-Contraction problem is to check whether there exists at most k edges in G such that contracting them in G results in a graph satisfying the property $\Pi$. We investigate the…
In a nutshell, we show that polynomials and nested polytopes are topological, algebraic and algorithmically equivalent. Given two polytops $A\subseteq B$ and a number $k$, the Nested Polytope Problem (NPP) asks, if there exists a polytope…
We present new upper and lower bounds for the numerical radius of a bounded linear operator defined on a complex Hilbert space, which improve on the existing bounds. Among many other inequalities proved in this article, we show that for a…
Hermitian tensors are generalizations of Hermitian matrices, but they have very different properties. Every complex Hermitian tensor is a sum of complex Hermitian rank-1 tensors. However, this is not true for the real case. We study basic…
We investigate the connection between bijective, not necessarily finite, set-theoretic solutions of the pentagon equation and Hopf algebras. Firstly, we prove that finite solutions correspond to Hopf algebras with the positive basis…
The paper deals with the {\it infinitesimal Hilbert 16th problem}: to find an upper estimate of the number of zeros of an Abelian integral regarded as a function of a parameter. In more details, consider a real polynomial $ H$ of degree $…
Given Hilbert space operators $P,T\in B(\H), P\geq 0$ invertible, $T$ is $(m,P)-$ expansive (resp., $(m,P)-$ isometric) for some positive integer $m$ if…
In this paper, we continue our study of the tensor product structure of category $\mathcal W$ of weight modules over the Hopf-Ore extensions $kG(\chi^{-1}, a, 0)$ of group algebras $kG$, where $k$ is an algebraically closed field of…
Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…
Let $T$ be a bounded linear operator on a complex separable infinite dimensional Hilbert space $\mathcal{H}$. $T$ is called intransitive if it leaves invariant spaces other than 0 or the whole space $\mathcal{H}$; otherwise it is…
The classical Hilbert specialization property is a field-theoretic tool ensuring that polynomial irreducibility over a field is preserved under specialization of some of the variables. We develop an integral counterpart by introducing the…
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…
In the Travelling Salesman Problem (TSP), we are given a complete graph $K_n$ together with an integer weighting $w$ on the edges of $K_n$, and we are asked to find a Hamilton cycle of $K_n$ of minimum weight. Let $h(w)$ denote the average…