English
Related papers

Related papers: On the existence of a strong minimal pair

200 papers

We include here some material that did not make its way into the published version (Bull. Symb. Log 18-2, June 2012, pp. 161-229, arXiv:1007.2376), in particular a proof of Theorem K to the effect that there is an initial segment of the…

Logic · Mathematics 2012-11-13 Peter Hinman

Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…

Combinatorics · Mathematics 2012-04-30 Hadi Afzali , Nathan Bowler

The degree spectrum of a countable structure is the set of all Turing degrees of presentations of that structure. We show that every nonlow Turing degree lies in the spectrum of some differentially closed field (of characteristic 0, with a…

Logic · Mathematics 2018-02-12 David Marker , Russell Miller

We prove a kind of bilateral semi-terminating series related to Ramanujan-like series for negative powers of $\pi$, and conjecture a type of supercongruences associated to them. We support this conjecture by checking all the cases for many…

Number Theory · Mathematics 2019-08-15 Jesús Guillera

We analyze the notion of reproducing pair of weakly measurable functions, which generalizes that of continuous frame. We show, in particular, that each reproducing pair generates two Hilbert spaces, conjugate dual to each other. Several…

Functional Analysis · Mathematics 2016-03-09 Jean-Pierre Antoine , Michael Speckbacher , Camillo Trapani

The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…

Logic · Mathematics 2018-11-06 Rumen Dimitrov , Valentina Harizanov , Andrey Morozov

This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…

Logic · Mathematics 2025-10-07 Yong Cheng

We find a necessary and sufficient condition for the existence of the tensor product of modules over a Lie conformal algebra. We provide two algebraic constructions of the tensor product. We show the relation between tensor product and…

Quantum Algebra · Mathematics 2022-12-19 Jose I. Liberati

In this article, we compare the cohomology between the categories of modules of the diagram algebras and the categories of modules of its input algebras. Our main result establishes a sufficient condition for exact split pairs between these…

Representation Theory · Mathematics 2025-02-20 Sulakhana Chowdhury , Geetha Thangavelu

We prove that for $r\in \mathbb{N}$ with $r\geq 2$ and $\mu>0$, there exist $\alpha>0$ and $n_{0}$ such that for every $n\geq n_{0}$, every $n$-vertex graph $G$ with $\delta(G)\geq \left(1-\frac{1}{r}+\mu\right)n$ and $\alpha(G)\leq \alpha…

Combinatorics · Mathematics 2023-05-30 Ming Chen , Jie Han , Yantao Tang , Donglei Yang

We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table…

Logic in Computer Science · Computer Science 2015-07-01 Mingzhong Cai , Rodney G Downey , Rachel Epstein , Steffen Lempp , Joseph Miller

A matching prior at level $1-\alpha$ is a prior such that an associated $1-\alpha$ credible set is also a $1-\alpha$ confidence set. We study the existence of matching priors for general families of credible regions. Our main result gives…

Statistics Theory · Mathematics 2022-10-10 Haosui Duanmu , Daniel M. Roy , Aaron Smith

In this paper we investigate some strong convergence theorems for partial sums with respect to Vilenkin system.

Classical Analysis and ODEs · Mathematics 2019-03-20 Giorgi Tutberidze

Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…

Logic · Mathematics 2017-01-31 Peter Cholak , Charlie McCoy

We show that the ample degree of a stable theory with trivial forking is preserved when we consider the corresponding theory of belles paires, if it exists. This result also applies to the theory of $H$-structures of a trivial theory of…

Logic · Mathematics 2019-09-18 Enrique Casanovas , Amador Martin-Pizarro , Daniel Palacin

We prove that, for every theory $T$ which is given by an ${\mathcal L}_{\omega_1,\omega}$ sentence, $T$ has less than $2^{\aleph_0}$ many countable models if and only if we have that, for every $X\in 2^\omega$ on a cone of Turing degrees,…

Logic · Mathematics 2013-06-07 Antonio Montalban

We obtain a complete classification of minimal simple unitary $W$-algebras.

Representation Theory · Mathematics 2024-08-05 Victor G. Kac , Pierluigi Möseneder Frajria , Paolo Papi

We prove the Extended Church-Turing Thesis: Every effective algorithm can be efficiently simulated by a Turing machine. This is accomplished by emulating an effective algorithm via an abstract state machine, and simulating such an abstract…

Logic in Computer Science · Computer Science 2012-08-01 Nachum Dershowitz , Evgenia Falkovich

A couple of complex projective plane curves are said to make a Zariski pair if they have the same degree and the same type of singularities, but their embeddings in the projective plane are topologically different. In this paper, we present…

alg-geom · Mathematics 2008-02-03 Ichiro Shimada

In this paper we give an elementary proof of the Fundamental Theorem of Algebra for polynomials over the rational tropical semi-ring. We prove that, tropically, the rational numbers are algebraically closed. We provide a simple algorithm…

Combinatorics · Mathematics 2007-07-18 Nathan Grigg , Nathan Manwaring