Low basis theorem

Known as: Basis theorem

The low basis theorem in computability theory states that every nonempty class in (see arithmetical hierarchy) contains a set of low degree (Soare…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2009

F. S. Macaulay has found a purely combinatorial theorem (see §2), with which he has been able to more simply derive the Hilbert…

2007

We study semistar Noetherian domains, that is, domains having the ascending chain condition on "quasi semistar ideals''.We…

2005

While the computation of Grobner bases is known to be an expspace-complete problem, the generic behaviour of algorithms for their…

2002

Abstract. For varieties of algebras, we present the property of having "definable principal subcongruences" (DPSC), generalizing…

2002

Constructive Mathematics might be regarded as a fragment of classical mathematics in which any proof of an existence theorem is…

2001

The extension E of degree n over the Galois field F={\text GF}(q)} is called regular over F, if {\text ord}_r(q) and n have…

1997

The (semi)standard Young tableau have been known since Hodge and Littlewood to naturally index a basis for the multihomogeneous…

1987

This fact was discovered by Lasker, Macaulay [Lasker 1905, Macaulay t916], and in the special case of zero dimensional ideals…

1975

Consider a catalogue S which lists one to infinitely many shapes of rectangular bricks with positive integer dimensions. Using as…

1970

It is shown that, if U is a subvariety of the join of a nilpotent variety and a metabelian variety and if V is a variety with a…