Search Results for ""

A real-valued function g defined on a convex subset C subset R^n is said to be quasi-convex if for all real alpha in R, the set {x in C:g(x)<alpha} is convex. This is ...

A groupoid S such that for all a,b in S, there exist unique x,y in S such that ax = b (1) ya = b. (2) No other restrictions are applied; thus a quasigroup need not have an ...

Qubic is a generalization of tic-tac-toe in which players alternately place pieces to get four in a row (rows, columns, pillars, face diagonals, or space diagonals) on a ...

A qubit (or quantum bit) is the analog of a bit for quantum computation. Unlike an ordinary bit, which may only assume two possible values (usually called 0 and 1), a qubit ...

The algorithm of constructing and interpreting a quotient-difference table which allows interconversion of continued fractions, power series, and rational functions ...

A RAT-free ("right angle triangle-free") set is a set of points, no three of which determine a right triangle. Let f(n) be the largest integer such that a RAT-free subset of ...

For any constructible function f, there exists a function P_f such that for all functions t, the following two statements are equivalent: 1. There exists an algorithm A such ...

A power series sum^(infty)c_kx^k will converge only for certain values of x. For instance, sum_(k=0)^(infty)x^k converges for -1<x<1. In general, there is always an interval ...

The nth Ramanujan prime is the smallest number R_n such that pi(x)-pi(x/2)>=n for all x>=R_n, where pi(x) is the prime counting function. In other words, there are at least n ...

A random permutation is a permutation containing a fixed number n of a random selection from a given set of elements. There are two main algorithms for constructing random ...