Related papers: Unambiguous Computation: Boolean Hierarchies and S…
A family of algebras, which we call topological conjugacy algebras, is associated with each proper continuous map on a locally compact Hausdorff space. Assume that $\eta_i:\X_i\to \X_i$ is a continuous proper map on a locally compact…
We investigate the sequential topology $\tau_s$ on a complete Boolean algebra $B$ determined by algebraically convergent sequences in $B$. We show the role of weak distributivity of $B$ in separation axioms for the sequential topology. The…
The $\textbf{P}$ vs. $\textbf{NP}$ problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for $\textbf{P}$ vs.…
We prove that path puzzles with complete row and column information--or equivalently, 2D orthogonal discrete tomography with Hamiltonicity constraint--are strongly NP-complete, ASP-complete, and #P-complete. Along the way, we newly…
We investigate the existence of a fundamental computation-information gap for the problem of clustering a mixture of isotropic Gaussian in the high-dimensional regime, where the ambient dimension $p$ is larger than the number $n$ of points.…
In this paper the weak topology on a normed space is studied from the viewpoint of infinite-dimensional topology. Besides the weak topology on a normed space $X$ (coinciding with the topology of uniform convergence on finite subsets of the…
A Boolean constraint satisfaction instance is a conjunction of constraint applications, where the allowed constraints are drawn from a fixed set B of Boolean functions. We consider the problem of determining whether two given constraint…
We introduce the entangled quantum polynomial hierarchy $\mathsf{QEPH}$ as the class of problems that are efficiently verifiable given alternating quantum proofs that may be entangled with each other. We prove $\mathsf{QEPH}$ collapses to…
For any time bound f, let H(f) denote the hierarchy conjecture which means that the restriction of the numbers of work tapes of deterministic Turing machines to some b generates an infinite hierarchy of proper subclasses DTIME_b(f) \subset…
A variety V is said to be coherent if any finitely generated subalgebra of a finitely presented member of V is finitely presented. It is shown here that V is coherent if and only if it satisfies a restricted form of uniform deductive…
We introduce and examine order convergence and the interval topology on partially ordered sets in general. Problem 76 of Birkhoff's "Lattice Theory" asks whether for complete Boolean algebras the order topology and the interval topology…
A PCSP is a combination of two CSPs defined by two similar templates; the computational question is to distinguish a YES instance of the first one from a NO instance of the second. The computational complexity of many PCSPs remains unknown.…
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by means of shadows (projections) and by finitely many forbidden…
The halting problem for Turing machines is decidable on a set of asymptotic probability one. Specifically, there is a set B of Turing machine programs such that (i) B has asymptotic probability one, so that as the number of states n…
It is known that $Q$-conditional symmetries of the classical Burgers' equation express in terms of three functions satisfying a coupled system of Burgers-like equations. The search of conditional symmetries of this system leads to a system…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…
Turing machines define polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model…
The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type…
In 1975, Ladner showed that under the hypothesis that P is not equal to NP, there exists a language which is neither in P, nor NP-complete. This result was latter generalized by Schoning and several authors to various polynomial-time…
Let $E \subseteq R^n$ be a closed set of Hausdorff dimension $\alpha$. For $m \geq n$, let $\{B_1,\ldots,B_k\}$ be $n \times (m-n)$ matrices. We prove that if the system of matrices $B_j$ is non-degenerate in a suitable sense, $\alpha$ is…