Search Results for ""

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

An extended rooted binary tree satisfying the following conditions: 1. Every node has two children, each colored either red or black. 2. Every tree leaf node is colored ...

Given the closed interval [0,x] with x>1, let one-dimensional "cars" of unit length be parked randomly on the interval. The mean number M(x) of cars which can fit (without ...

The Riemann-Siegel formula is a formula discovered (but not published) by Riemann for computing an asymptotic formula for the Riemann-Siegel function theta(t). The formula ...

For a real positive t, the Riemann-Siegel Z function is defined by Z(t)=e^(itheta(t))zeta(1/2+it). (1) This function is sometimes also called the Hardy function or Hardy ...

The Riemann tensor (Schutz 1985) R^alpha_(betagammadelta), also known the Riemann-Christoffel curvature tensor (Weinberg 1972, p. 133; Arfken 1985, p. 123) or Riemann ...

The rook is a chess piece that may move any number of spaces either horizontally or vertically per move. The maximum number of nonattacking rooks that may be placed on an n×n ...

A rose curve, also called Grandi's rose or the multifolium, is a curve which has the shape of a petalled flower. This curve was named rhodonea by the Italian mathematician ...

Roundoff error is the difference between an approximation of a number used in computation and its exact (correct) value. In certain types of computation, roundoff error can ...

Rule 102 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...