Search Results for ""

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

A well-formed formula B is said to be true for the interpretation M (written |=_MB) iff every sequence in Sigma (the set of all denumerable sequences of elements of the ...

There are two kinds of power sums commonly considered. The first is the sum of pth powers of a set of n variables x_k, S_p(x_1,...,x_n)=sum_(k=1)^nx_k^p, (1) and the second ...

A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...

An order-n Costas array is a permutation on {1,...,n} such that the distances in each row of the triangular difference table are distinct. For example, the permutation ...

Adams' method is a numerical method for solving linear first-order ordinary differential equations of the form (dy)/(dx)=f(x,y). (1) Let h=x_(n+1)-x_n (2) be the step ...

Propositional calculus, first-order logic, and other theories in mathematical logic are defined by their axioms (or axiom schemata, plural: axiom schemata) and inference ...

A metatheorem in mathematical logic also known under the name "conditional proof." It states that if the sentential formula B can be derived from the set of sentential ...

The volume of a polyhedron composed of N triangular faces with vertices (a_i,b_i,c_i) can be computed using the curl theorem as V=1/6sum_(i=1)^Na_i·n_i, where the normal n_i ...

The chromatic polynomial pi_G(z) of an undirected graph G, also denoted C(G;z) (Biggs 1973, p. 106) and P(G,x) (Godsil and Royle 2001, p. 358), is a polynomial which encodes ...