Search Results for ""

A graphoid consists of a set M of elements together with two collections C and D of nonempty subsets of M, called circuits and cocircuits respectively, such that 1. For any C ...

The Grassmann graph J_q(n,k) is defined such that the vertices are the k-dimensional subspaces of an n-dimensional finite field of order q and edges correspond to pairs of ...

There are two different statements, each separately known as the greatest common divisor theorem. 1. Given positive integers m and n, it is possible to choose integers x and ...

Let S be a nonempty set of real numbers that has a lower bound. A number c is the called the greatest lower bound (or the infimum, denoted infS) for S iff it satisfies the ...

For any positive integer k, there exists a prime arithmetic progression of length k. The proof is an extension of Szemerédi's theorem.

The inhomogeneous Helmholtz differential equation is del ^2psi(r)+k^2psi(r)=rho(r), (1) where the Helmholtz operator is defined as L^~=del ^2+k^2. The Green's function is ...

Poisson's equation is del ^2phi=4pirho, (1) where phi is often called a potential function and rho a density function, so the differential operator in this case is L^~=del ...

Green's identities are a set of three vector derivative/integral identities which can be derived starting with the vector derivative identities del ·(psidel phi)=psidel ...

Gregory's formula is a formula that allows a definite integral of a function to be expressed by its sum and differences, or its sum by its integral and difference (Jordan ...

Grelling's paradox, also known as the Grelling-Nelson paradox or heterological paradox, is a semantic paradox that arises by defining "heterological" to mean "a word which ...