English
Related papers

Related papers: The typical Turing degree

200 papers

The supremum of reduction numbers of ideals having principal reductions is expressed in terms of the integral degree, a new invariant of the ring, which is finite provided the ring has finite integral closure. As a consequence, one obtains…

Commutative Algebra · Mathematics 2007-06-25 José M. Giral , Francesc Planas-Vilanova

We examine several notions of randomness for elements in a given $\Pi^0_1$ class $\mathcal{P}$. Such an effectively closed subset $\mathcal{P}$ of $2^\omega$ may be viewed as the set of infinite paths through the tree $T_{\mathcal{P}}$ of…

Logic · Mathematics 2016-11-18 Douglas Cenzer , Christopher P. Porter

The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal…

Number Theory · Mathematics 2020-10-01 Daqing Wan , Hang Yin

To study the set of torsion classes of a finite dimensional basic algebra, we use a decomposition, called sign-decomposition, parametrized by elements of $\{\pm1\}^n$ where $n$ is the number of simple modules. If $A$ is an algebra with…

Representation Theory · Mathematics 2019-09-16 Toshitaka Aoki

A linear relation, i.e., a multivalued operator $T$ from a Hilbert space ${\mathfrak H}$ to a Hilbert space ${\mathfrak K}$ has Lebesgue type decompositions $T=T_{1}+T_{2}$, where $T_{1}$ is a closable operator and $T_{2}$ is an operator or…

Functional Analysis · Mathematics 2018-01-08 Seppo Hassi , Zoltán Sebestyén , Henk de Snoo

This paper concerns algorithms that give correct answers with (asymptotic) density $1$. A dense description of a function $g : \omega \to \omega$ is a partial function $f$ on $\omega$ such that $\left\{n : f(n) = g(n)\right\}$ has density…

Logic · Mathematics 2018-11-20 Eric P. Astor , Denis R. Hirschfeldt , Carl G. Jockusch

We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift.…

Combinatorics · Mathematics 2020-05-19 Sara C. Billey , Matjaž Konvalinka , Joshua P. Swanson

The basic properties of the Temperley-Lieb algebra $TL_n$ with parameter $\beta = q + q^{-1}$, for $q$ any non-zero complex number, are reviewed in a pedagogical way. The link and standard (cell) modules that appear in numerous physical…

Mathematical Physics · Physics 2014-07-09 David Ridout , Yvan Saint-Aubin

The halting probability of a Turing machine is the probability that the machine will halt if it starts with a random stream written on its one-way input tape. When the machine is universal, this probability is referred to as Chaitin's omega…

Computational Complexity · Computer Science 2016-10-04 George Barmpalias , Andrew Lewis-Pye

A Turing degree d bounds a principle P of reverse mathematics if every computable instance of P has a d-computable solution. P admits a universal instance if there exists a computable instance such that every solution bounds P. We prove…

Logic · Mathematics 2014-11-07 Ludovic Patey

The smooth development of large parts of mathematics hinges on the idea that some sets are `small' or `negligible' and can therefore be ignored for a given purpose. The perhaps most famous smallness notion, namely `measure zero', originated…

Logic · Mathematics 2026-02-11 Sam Sanders

This paper proposes a new notion of typical sequences on a wide class of abstract alphabets (so-called standard Borel spaces), which is based on approximations of memoryless sources by empirical distributions uniformly over a class of…

Information Theory · Computer Science 2016-11-17 Maxim Raginsky

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$…

Computational Complexity · Computer Science 2012-06-04 Emmanuel Jeandel , Pascal Vanier

Several classes of DNR functions are characterized in terms of Kolmogorov complexity. In particular, a set of natural numbers A can wtt-compute a DNR function iff there is a nontrivial recursive lower bound on the Kolmogorov complexity of…

Logic · Mathematics 2014-08-12 Bjørn Kjos-Hanssen , Wolfgang Merkle , Frank Stephan

We study the rate of convergence to a normal random variable of the real and imaginary parts of Tr(AU), where U is an N x N random unitary matrix and A is a deterministic complex matrix. We show that the rate of convergence is O(N^{-2 +…

Mathematical Physics · Physics 2012-07-02 J. P. Keating , F. Mezzadri , B. Singphu

Measures of tree balance play an important role in various research areas, for example in phylogenetics. There they are for instance used to test whether an observed phylogenetic tree differs significantly from a tree generated by the Yule…

Combinatorics · Mathematics 2019-07-23 Mareike Fischer , Lina Herbst , Kristina Wicke

We develop a correspondence between the structure of Turing machines and the structure of singularities of real analytic functions, based on connecting the Ehrhard-Regnier derivative from linear logic with the role of geometry in Watanabe's…

Logic in Computer Science · Computer Science 2025-04-14 Daniel Murfet , Will Troiani

Classes with bounded expansion, which generalise classes that exclude a topological minor, have recently been introduced by Ne\v{s}et\v{r}il and Ossona de Mendez. These classes are defined by the fact that the maximum average degree of a…

Combinatorics · Mathematics 2012-05-21 Jaroslav Nešetřil , Patrice Ossona de Mendez , David R. Wood

Given a measure on the Thurston boundary of Teichmueller space, one can pick a geodesic ray joining some basepoint to a randomly chosen point on the boundary. Different choices of measures may yield typical geodesics with different…

Geometric Topology · Mathematics 2014-10-21 Vaibhav Gadre , Joseph Maher , Giulio Tiozzo

We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…

Logic in Computer Science · Computer Science 2020-10-05 Keng Meng Ng , Nazanin R. Tavana , Yue Yang
‹ Prev 1 4 5 6 7 8 10 Next ›