Search Results for ""

A sequence of n-tuples that fills n-space more uniformly than uncorrelated random points, sometimes also called a low-discrepancy sequence. Although the ordinary uniform ...

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

A random graph is a graph in which properties such as the number of graph vertices, graph edges, and connections between them are determined in some random way. The graphs ...

The term "recursive function" is often used informally to describe any function that is defined with recursion. There are several formal counterparts to this informal ...

A recursive sequence {f(n)}_n, also known as a recurrence sequence, is a sequence of numbers f(n) indexed by an integer n and generated by solving a recurrence equation. The ...

A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...

The reversal of a positive integer abc...z is z...cba. The reversal of a positive integer n is implemented in the Wolfram Language as IntegerReverse[n]. A positive integer ...

The term "rhombicuboctahedron" is most commonly used (e.g., Wenninger 1989, p. 27; Maeder 1997) to refer to the 26-faced Archimedean solid with faces 8{3}+18{4}. Cundy and ...

There are a number of functions in various branches of mathematics known as Riemann functions. Examples include the Riemann P-series, Riemann-Siegel functions, Riemann theta ...

The Riemann integral is the definite integral normally encountered in calculus texts and used by physicists and engineers. Other types of integrals exist (e.g., the Lebesgue ...