Search Results for ""

The finite difference is the discrete analog of the derivative. The finite forward difference of a function f_p is defined as Deltaf_p=f_(p+1)-f_p, (1) and the finite ...

A finite field is a field with a finite field order (i.e., number of elements), also called a Galois field. The order of a finite field is always a prime or a power of a ...

A Gray code is an encoding of numbers so that adjacent numbers have a single digit differing by 1. The term Gray code is often used to refer to a "reflected" code, or more ...

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

A hash function H projects a value from a set with many (or even an infinite number of) members to a value from a set with a fixed number of (fewer) members. Hash functions ...

A hyperbolic knot is a knot that has a complement that can be given a metric of constant curvature -1. All hyperbolic knots are prime knots (Hoste et al. 1998). A prime knot ...

There are a number of algebraic equations known as the icosahedral equation, all of which derive from the projective geometry of the icosahedron. Consider an icosahedron ...

The incenter I is the center of the incircle for a polygon or insphere for a polyhedron (when they exist). The corresponding radius of the incircle or insphere is known as ...

To predict the result of a measurement requires (1) a model of the system under investigation, and (2) a physical theory linking the parameters of the model to the parameters ...

The n-dimensional Keller graph, sometimes denoted G_n (e.g., Debroni et al. 2011), can be defined on a vertex set of 4^n elements (m_1,...,m_n) where each m_i is 0, 1, 2, or ...