Search Results for ""

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 ...

When a measure lambda is absolutely continuous with respect to a positive measure mu, then it can be written as lambda(E)=int_Efdmu. By analogy with the first fundamental ...

int_(-infty)^infty(J_(mu+xi)(x))/(x^(mu+xi))(J_(nu-xi)(y))/(y^(nu-xi))e^(itxi)dxi =[(2cos(1/2t))/(x^2e^(-it/2)+y^2e^(it/2))]^((mu+nu)/2) ...

A random closed set (RACS) in R^d is a measurable function from a probability space (Omega,A,P) into (F,Sigma) where F is the collection of all closed subsets of R^d and ...

If f:D->Y is a map (a.k.a. function, transformation, etc.) over a domain D, then the range of f, also called the image of D under f, is defined as the set of all values that ...

The rank polynomial R(x,y) of a general graph G is the function defined by R(x,y)=sum_(S subset= E(G))x^(r(S))y^(s(S)), (1) where the sum is taken over all subgraphs (i.e., ...

Pick two real numbers x and y at random in (0,1) with a uniform distribution. What is the probability P_(even) that [x/y], where [r] denotes the nearest integer function, is ...

The rectifiable sets include the image of any Lipschitz function f from planar domains into R^3. The full set is obtained by allowing arbitrary measurable subsets of ...

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...

Determination of whether predicate P(x_1,...,x_n) is true or false for any given values of x_1, ..., x_n is called its decision problem. The decision problem for predicate ...