Related papers: On the existence of a strong minimal pair

We prove that, in both real and complex cases, there exists a pair of matrices that generates a dense subsemigroup of the set of $n\times n$ matrices.

We investigate issues surrounding an old question of Yates' as to the existence of a minimal Turing degree with no strong minimal cover, specifically with respect to the hyperimmune-free degrees.

For earlier considered our sequence A166944 in [4] we prove three statements of its connection with twin primes. We also give a sufficient condition for the infinity of twin primes and pose several new conjectures; among them we propose a…

While the twin prime conjecture is still famously open, it holds true in the setting of finite fields: There are infinitely many pairs of monic irreducible polynomials over $\mathbb{F}_q$ that differ by a fixed constant, for each $q \geq…

We investigate the complexity of isomorphisms of computable structures on cones in the Turing degrees. We show that, on a cone, every structure has a strong degree of categoricity, and that degree of categoricity is $\bf{0^{(\alpha)}}$ for…

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.

An extension (K(X)|K, v) of valued fields is said to be valuation transcendental if we have equality in the Abhyankar inequality. Minimal pairs of definition are fundamental objects in the investigation of valuation transcendental…

We show that there is a special bijection between the indecomposable summands of the two modules which form a basic support $\tau$--tilting pair and the indecomposable summands of the two modules which form another basic support…

Motivated by the notion of strong computable type for sets in computable analysis, we define the notion of strong computable type for $G$-shifts, where $G$ is a finitely generated group with decidable word problem. A $G$-shift has strong…

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

We prove a new sufficient pair degree condition for tight Hamiltonian cycles in $3$-uniform hypergraphs that (asymptotically) improves the best known pair degree condition due to R\"odl, Ruci\'nski, and Szemer\'edi. For graphs, Chv\'atal…

In this paper, we prove a fine condensation theorem. This is quite similar to condensation theorems for pure extender mice in the literature, except that condensation for iteration strategies has been added to the mix.

We provide requirements on effectively enumerable topological spaces which guarantee that the Rice-Shapiro theorem holds for the computable elements of these spaces. We show that the relaxation of these requirements leads to the classes of…

We show that in the setting of fair-coin measure on the power set of the natural numbers, each sufficiently random set has an infinite subset that computes no random set. That is, there is an almost sure event $\mathcal A$ such that if…

We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $\mathbf 0''$. They are precisely the \emph{treeable} degrees -- the least degrees of paths through computable trees -- that…

In this paper, we provide a negative solution to Problem 3 formulated by P.~Odifreddi in his survey articles \textit{``Strong Reducibilities''} (1981) and \textit{``Reducibilities''} (1999). The problem asks whether every computably…

In this paper, we analyze the problem of finding the minimum dimension $n$ such that a closed-form analytic map/ordinary differential equation can simulate a Turing machine over $\mathbb{R}^{n}$ in a way that is robust to perturbations. We…

We solve the covering problem for Demuth randomness, showing that a computably enumerable set is computable from a Demuth random set if and only if it is strongly jump-traceable. We show that on the other hand, the class of sets which form…

We define a canonical quadratic pair on the Clifford algebra of an algebra with quadratic pair over a field. This allows us to extend to the characteristic 2 case the notion of trialitarian triples, from which we derive a characterization…

We show that minimal models of $\mathbb{Q}$-factorial NQC log canonical generalised pairs exist, assuming the existence of minimal models of smooth varieties. More generally, we prove that on a $\mathbb{Q}$-factorial NQC log canonical…