Related papers: Generalized low solution of $\mathsf{RT}_k^1$ prob…
Recently Bravyi, Gosset and K\"onig (Science 2018) proved an unconditional separation between the computational powers of small-depth quantum and classical circuits for a relation. In this paper we show a similar separation in the…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
Here we investigate 3-dimensional Navier-Stokes Equations in the incompressible case with use of different approach and we prove the uniqueness of the weak solutions for the data from the space, which is dense in usual space of data.…
The arrival of AI techniques in computations, with the potential for hallucinations and non-robustness, has made trustworthiness of algorithms a focal point. However, trustworthiness of the many classical approaches are not well understood.…
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
The strong recurrence is equivalent to the Riemann hypothesis. On the other hand, the generalized strong recurrence holds for any irrational number. In this paper, we show the generalized strong recurrence for all non-zero rational numbers.…
We answer a question posed by Hirschfeldt and Jockusch by showing that whenever $k > \ell$, Ramsey's theorem for singletons and $k$-colorings, $\mathsf{RT}^1_k$, is not strongly computably reducible to the stable Ramsey's theorem for…
We establish a result which states that regularizing an inverse problem with the gauge of a convex set $C$ yields solutions which are linear combinations of a few extreme points or elements of the extreme rays of $C$. These can be…
In arXiv:2204.03190, we proposed a universal method to reduce one-loop integrals with both tensor structure and higher-power propagators. But the method is quite redundant as it does not utilize the results of lower rank cases when…
This paper provides primarily an analytical ad hoc -solution for 3-dimensional, incompressible Navier-Stokes equations with a suitable external force field. The solution turns out to be smooth and integrable on the whole space. There is…
The radical solution of polynomials with rational coefficients is a famous solved problem. This paper found that it is a $\mathbb{NP}$ problem. Furthermore, this paper found that arbitrary $ \mathscr{P} \in \mathbb{P}$ shall have a one-way…
We prove that every weak solution $u$ to the 3D Navier-Stokes equation that belongs to the class $L^3L^{9/2}$ and $\n u$ belongs to $L^3L^{9/5}$ localy away from a 1/2-H\"{o}lder continuous curve in time satisfies the generalized energy…
All global solutions of arbitrary topology of the most general 1+1 dimensional dilaton gravity models are obtained. We show that for a generic model there are globally smooth solutions on any non-compact 2-surface. The solution space is…
We demonstrate that techniques of Weihrauch complexity can be used to get easy and elegant proofs of known and new results on initial value problems. Our main result is that solving continuous initial value problems is Weihrauch equivalent…
Let $K$ be a number field and let $G$ be a finitely generated subgroup of $K^\times$. For all but finitely many primes $\mathfrak p$ of $K$, the reduction $(G \bmod \mathfrak p)$ generates a well-defined subgroup of the multiplicative group…
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f:A->B, additional structural information about the input x in A (that is any kind of promise that x belongs to a certain subset A'…
This paper deals with the Weak Inverse Galois Problem which, for a given field $k$, states that, for every finite group $G$, there exists a finite separable extension $L/k$ such that ${\rm{Aut}}(L/k)=G$. One of its goals is to explain how…
In this paper we present a very simple proof of the existence of at least one non trivial solution for a Kirchhoff type equation on $\RN$, for $N\ge 3$. In particular, in the first part of the paper we are interested in studying the…
In this paper we consider the uniformly resolvable decompositions of the complete graph $2K_v$ into subgraphs where each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the cases…
Given a general channel, we first formulate the idetification capacity problem as well as the resolvability problem with input cost constraint in as the general form as possible, along with relevant fundamental theorems. Next, we establish…