Search Results for ""

A random-connection model (RCM) is a graph-theoretic model of continuum percolation theory characterized by the existence of a stationary point process X and a non-increasing ...

A random matrix is a matrix of given type and size whose entries consist of random numbers from some specified distribution. Random matrix theory is cited as one of the ...

A recurrence equation (also called a difference equation) is the discrete analog of a differential equation. A difference equation involves an integer function f(n) in a form ...

Two integers are relatively prime if they share no common positive factors (divisors) except 1. Using the notation (m,n) to denote the greatest common divisor, two integers m ...

A repunit is a number consisting of copies of the single digit 1. The term "repunit" was coined by Beiler (1966), who also gave the first tabulation of known factors. In ...

The rhombic dodecahedral graph is the Archimedean dual graph which is the skeleton of the rhombic dodecahedron (as well as the Bilinski dodecahedron). It is the Levi graph of ...

The rhombicosahedral graph, illustrated above, is the skeleton of the icosidodecadodecahedron, rhombicosahedron and rhombidodecadodecahedron. It will be implemented in a ...

A positive integer n is called a base-b Rhonda number if the product of the base-b digits of n is equal to b times the sum of n's prime factors. These numbers were named by ...

A riffle shuffle, also called the Faro shuffle, is a shuffle in which a deck of 2n cards is divided into two halves. The top half of the deck is placed in the left hand, and ...

If Li_2(x) denotes the usual dilogarithm, then there are two variants that are normalized slightly differently, both called the Rogers L-function (Rogers 1907). Bytsko (1999) ...