Search Results for ""

Rule 126 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

A septic graph is a regular graph of degree seven. The numbers of (not necessarily connected) simple septic graphs on n=8, 10, 12, ... vertices are 1, 5, 1547, 21609301, ...

The silver constant is the algebraic number given by S = (x^3-5x^2+6x-1)_3 (1) = 2+2cos(2/7pi) (2) = 3.246979603... (3) (OEIS A116425), where (P(x))_n denotes a polynomial ...

A determinant used to determine in which coordinate systems the Helmholtz differential equation is separable (Morse and Feshbach 1953). A determinant S=|Phi_(mn)|=|Phi_(11) ...

The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...

Given 2n-1 numbers a_k, where k=-n+1, ..., -1, 0, 1, ..., n-1, a Toeplitz matrix is a matrix which has constant values along negative-sloping diagonals, i.e., a matrix of the ...

A graph H is called a topological minor, also known as a homeomorphic subgraph, of a graph G if a graph subdivision of H is isomorphic to a subgraph of G. Every topological ...

The validity of a logical argument refers to whether or not the conclusion follows logically from the premises, i.e., whether it is possible to deduce the conclusion from the ...

Spinor fields describing particles of zero rest mass satisfy the so-called zero rest mass equations. Examples of zero rest mass particles include the neutrino (a fermion) and ...

A k-coloring of a graph G is a vertex coloring that is an assignment of one of k possible colors to each vertex of G (i.e., a vertex coloring) such that no two adjacent ...