Search Results for ""

Let G=(V,E) be a finite graph, let Omega be the set Omega={0,1}^E whose members are vectors omega=(omega(e):e in E), and let F be the sigma-algebra of all subsets of Omega. A ...

If there exists a rational integer x such that, when n, p, and q are positive integers, x^n=q (mod p), then q is the n-adic residue of p, i.e., q is an n-adic residue of p ...

The rectangle function Pi(x) is a function that is 0 outside the interval [-1/2,1/2] and unity inside it. It is also called the gate function, pulse function, or window ...

A recursive process is one in which objects are defined in terms of other objects of the same type. Using some sort of recurrence relation, the entire class of objects can ...

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

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

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

There are four fully supported stellations of the rhombic dodecahedron including as usual the original solid in the count (Wells 1991; Webb). The three nontrivial ones ...

In his famous paper of 1859, Riemann stated that the number N(T) of Riemann zeta function zeros sigma+it with 0<t<=T is asymptotically given by ...