相关论文: HTP-complete rings of rational numbers

In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…

Let $\lambda$ be a complex number in the closed unit disc $\overline{\Bbb D}$, and $\cal H$ be a separable Hilbert space with the orthonormal basis, say, ${\cal E}=\{e_n:n=0,1,2,\cdots\}$. A bounded operator $T$ on $\cal H$ is called a…

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

It is known that Hilbert's Tenth Problem over the Gaussian ring $\mathbb Z[i]=\{a+bi:\ a,b\in\mathbb Z\}$ is undecidable. In this paper we obtain the following further result: There is no algorithm to decide whether an arbitrarily given…

The algebraic form of Hilbert's 13th Problem asks for the resolvent degree $\text{rd}(n)$ of the general polynomial $f(x) = x^n + a_1 x^{n-1} + \ldots + a_n$ of degree $n$, where $a_1, \ldots, a_n$ are independent variables. The resolvent…

Let $\eps >0$. We prove that there exists an operator $T_\eps:\ell_2\to\ell_2$, such that for any polynomial $P$ we have $\|{P(T)}\| \leq(1+\eps)\|{P}\|_\infty$, but which is not similar to a contraction, {\it i.e.} there does not exist an…

Using an iterated Horner schema for evaluation of diophantine polynomials, we define a partial $\mu$-recursive "decision" algorithm decis as a "race" for a first nullstelle versus a first (internal) proof of non-nullity for such a…

It is well known that the spectral radius $\rho(T)$ of a tree $T$ with at least $3$ vertices has the property that $\frac 14\rho(T)^2+1<\Delta(T)\le \rho(T)^2$, where $\Delta(T)$ is the maximum degree of $T$. Let $\mathbb{P}$ denote the set…

The central conjecture of parameterized complexity states that FPT is not equal to W[1], and is generally regarded as the parameterized counterpart to P != NP. We revisit the issue of the plausibility of FPT != W[1], focusing on two…

The paper considers the Hilbert space $\hat{H}_r$ of real functions summable with the square $L^2(a,b)_r$ on any interval $\{(a,b)_r\}_{r=1}^{\infty}\in \mathbb{R}$. It is shown on the basis of the theorem on zeros of real orthogonal…

Consider a complex Hilbert space $\left(\mathcal{H}, \langle \cdot, \cdot \rangle\right)$ equipped with a positive bounded linear operator $A$ on $\mathcal{H}$. This induces a semi-norm $\|\cdot\|_A$ through the semi-inner product $\langle…

We prove that the existential theory of any function field $K$ of characteristic $p> 0$ is undecidable in the language of rings provided that the constant field does not contain the algebraic closure of a finite field. We also extend the…

The concept of NP-completeness has been proposed for half a century, and it is conjectured that there are no subexponential-time algorithms for NP-hard problems, which is known as the Exponential Time Hypothesis (ETH). As a pivotal…

Let $(R,\mathfrak m)$ be an analytically unramified local ring of positive prime characteristic $p.$ For an ideal $I$, let $I^*$ denote its tight closure. We introduce the tight Hilbert function $H^*_I(n)=\ell(R/(I^n)^*)$ and the…

It is shown that if T is a ternary ring of operators (TRO), X is a nondegenerate sub-TRO of T and there exists a contractive idempotent surjective map P:T-->X, then P has a unique, explicitly described extension to a conditional expectation…

Let $T\colon H\to H$ be a bounded operator on Hilbert space. We say that $T$ has a polygonal type if there exists an open convex polygon $\Delta\subset {\mathbb D}$, with $\overline{\Delta}\cap{\mathbb T}\neq\emptyset$, such that the…

Let $A$ be an $(m \times n)$ integral matrix, and let $P=\{ x : A x \leq b\}$ be an $n$-dimensional polytope. The width of $P$ is defined as $ w(P)=min\{ x\in \mathbb{Z}^n\setminus\{0\} :\: max_{x \in P} x^\top u - min_{x \in P} x^\top v…

The NP-complete Permutation Pattern Matching problem asks whether a permutation P (the pattern) can be matched into a permutation T (the text). A matching is an order-preserving embedding of P into T. In the Generalized Permutation Pattern…

We prove elementary recursive bounds in the degrees for Positivstellensatz and Hilbert 17-th problem, which is the expression of a nonnegative polynomial as a sum of squares of rational functions. We obtain a tower of five exponentials. A…

We show that several sets of interest arising from the study of partition regularity and density Ramsey theory of polynomial equations over integral domains are undecidable. In particular, we show that the set of homogeneous polynomials $p…