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.

2015

We first give a direct proof of a basis theorem for the cyclotomic Yokonuma-Hecke algebra $Y_{r,n}^{d}(q).$ Our approach follows…

2007

An alternative definition of the concept is given of functional dependence among the attributes of the relational schema in the…

2005

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

2002

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

1999

Specht modules for an Ariki-Koike algebra have been investigated recently in the context of cellular algebras. Thus, these…

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…

1986

1975

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

1973

Let S denote a set of k-dimensional boxes each having integral sides. Let $\Gamma$(S) denote the set of all boxes which can be…