✦ LIBER ✦

A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree

✍ Scribed by Cai, Mingzhong

Book ID: 124069799
Publisher: University of Notre Dame
Year: 2010
Tongue: English
Weight: 228 KB
Volume: 51
Category: Article
ISSN: 0029-4527
DOI: 10.1215/00294527-2010-028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Properly Σ2 minimal degrees and 0″ compl

Properly Σ2 minimal degrees and 0″ complementation

✍ S. Barry Cooper; Andrew E. M. Lewis; Yue Yang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 96 KB

We show that there exists a properly Σ2 minimal (Turing) degree b, and moreover that b can be chosen to join with 0 to 0 -so that b is a 0 complement for every degree a such that 0 ≤ a < 0 .

An algorithm for computing a Padé approx

An algorithm for computing a Padé approximant with minimal degree denominator

✍ O.L. Ibryaeva; V.M. Adukov 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 262 KB

An algorithm for minimal degree linear C

An algorithm for minimal degree linear Chebyshev approximation on a discrete set

✍ F. D. K. Roberts 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 779 KB

## Abstract An algorithm for computing a linear Chebyshev approximation to a function defined on a finite set of points is presented. The method requires the accuracy of the approximation to be specified, and determines the least degree approximation which achieves this accuracy. The algorithm is b

A minimal pair joining to a plus cupping

A minimal pair joining to a plus cupping Turing degree

✍ Dengfeng Li; Angsheng Li 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

## Abstract A computably enumerable (c.e.) degree a is called nonbounding, if it bounds no minimal pair, and plus cupping, if every nonzero c.e. degree __x__ below __a__ is cuppable. Let **NB** and **PC** be the sets of all nonbounding and plus cupping c.e. degrees, respectively. Both **NB** and **

The longest cycle of a graph with a larg

The longest cycle of a graph with a large minimal degree

✍ Noga Alon 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB 👁 1 views

We show that every graph G on n vertices with minimal degree at least n / k contains a cycle of length at least [ n / ( k -111. This verifies a conjecture of Katchalski. When k = 2 our result reduces t o the classical theorem of Dirac that asserts that if all degrees are at least i n then G is Hamil

An application of the Roberts' minimal d

An application of the Roberts' minimal degree algorithm to initial value problems

✍ Jackson N. Henry; Myron S. Henry; Donald C. Taylor 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 496 KB