Search Results for ""

On a three-dimensional lattice, a random walk has less than unity probability of reaching any point (including the starting point) as the number of steps approaches infinity. ...

If the rank polynomial R(x,y) of a graph G is given by sumrho_(rs)x^ry^s, then rho_(rs) is the number of subgraphs of G with rank r and co-rank s, and the matrix (rho_(rs)) ...

If alpha is any number and m and n are integers, then there is a rational number m/n for which |alpha-m/n|<=1/n. (1) If alpha is irrational and k is any whole number, there ...

It is possible to find six points in the plane, no three on a line and no four on a circle (i.e., none of which are collinear or concyclic), such that all the mutual ...

A K-rational point is a point (X,Y) on an algebraic curve f(X,Y)=0, where X and Y are in a field K. For example, rational point in the field Q of ordinary rational numbers is ...

Rational numbers are countable, so an order can be placed on them just like the natural numbers. Although such an ordering is not obvious (nor unique), one such ordering can ...

Somos defines a rational triangle as a triangle such that all three sides measured relative to each other are rational. Koblitz (1993) defined a congruent number as an ...

The distribution with probability density function and distribution function P(r) = (re^(-r^2/(2s^2)))/(s^2) (1) D(r) = 1-e^(-r^2/(2s^2)) (2) for r in [0,infty) and parameter ...

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

The term "real line" has a number of different meanings in mathematics. Most commonly, "real line" is used to mean real axis, i.e., a line with a fixed scale so that every ...