Related papers: On the existence of a strong minimal pair
This paper is aimed to prove the strong duality theorem for continuous-time linear programming problems in which the coefficients are assumed to be piecewise continuous functions. The previous paper proved the strong duality theorem for the…
We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree…
We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…
Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We solve this question in the negative, already within the class of computably enumerable many-one degrees. Positive answers…
We produce a new, shorter construction of a minor-universal planar graph.
In this paper we are interested in computability aspects of subshifts and in particular Turing degrees of 2-dimensional SFTs (i.e. tilings). To be more precise, we prove that given any \pizu subset $P$ of $\{0,1\}^\NN$ there is a SFT $X$…
For many common height functions, it is notoriously hard to compute the essential minimum. Nevertheless there are two classical methods, one giving lower bounds and the other giving upper bounds. In this paper, we show that the two methods…
We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…
I review the proposal of Berenstein-Douglas for a completely general definition of Seiberg duality. To give evidence for their conjecture I present the first example of a physical dual pair and explicitly check that it satisfies the…
We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.
We present entangling and discording power of a gate that is made on strong contender for the basic element of a quantum computer. We present the effect gate on an experimental scheme of a two-qubit tomography. We propose a sufficient and…
We generalize some results on semicomputability by Jockusch \cite{jockusch1968semirecursive} to the setting of $\alpha$-Computability Theory. We define an $\alpha$-Kalimullin pair and show that it is definable in the $\alpha$-enumeration…
Effectively inseparable pairs and their properties play an important role in the meta-mathematics of arithmetic and incompleteness. Different notions are introduced and shown in the literature to be equivalent to effective inseparability.…
This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP does not have measure 0 in EXP, then there exist disjoint pairs…
We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same result for the structure comprised of the dark ceers and the…
A pair of plane curves with the same combinatorics is said to be (a) a Zariski pair if the plane curves have different embedded topology, and (b) a strong Ziegler pair if their Milnor algebra are not isomorphic. We show that some examples…
We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…
Given a weakly o-minimal structure $\mathcal M$ and its o-minimal completion $\bar {\mathcal M}$, we first associate to $\bar {\mathcal M}$ a canonical language and then prove that $Th(\mathcal M)$ determines $Th(\bar {\mathcal M})$. We…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
We prove that one can run the log minimal model program for log canonical $3$-fold pairs in characteristic $p>5$. In particular we prove the Cone Theorem, Contraction Theorem, the existence of flips and the existence of log minimal models…