Search Results for ""

A random walk is a sequence of discrete steps in which each step is randomly taken subject to some set of restrictions in allowed directions and step lengths. Random walks ...

Let N steps of equal length be taken along a line. Let p be the probability of taking a step to the right, q the probability of taking a step to the left, n_1 the number of ...

The rectilinear crossing number of a graph G is the minimum number of crossings in a straight line embedding of G in a plane. It is variously denoted rcr(G), cr^_(G) ...

The operation of exchanging all points of a mathematical object with their mirror images (i.e., reflections in a mirror). Objects that do not change handedness under ...

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-Siegel integral formula is the following representation of the xi-function xi(s) found in Riemann's Nachlass by Bessel-Hagen in 1926 (Siegel 1932; Edwards 2001, ...

First published in Riemann's groundbreaking 1859 paper (Riemann 1859), the Riemann hypothesis is a deep mathematical conjecture which states that the nontrivial Riemann zeta ...

The study of manifolds having a complete Riemannian metric. Riemannian geometry is a general space based on the line element ds=F(x^1,...,x^n;dx^1,...,dx^n), with F(x,y)>0 ...

The m×n rook graph (confusingly called the m×n grid by Brouwer et al. 1989, p. 440) and also sometimes known as a lattice graph (e.g., Brouwer) is the graph Cartesian product ...

The salinon is the figure illustrated above formed from four connected semicircles. The word salinon is Greek for "salt cellar," which the figure resembles. If the radius of ...