Search Results for ""

The tetranacci constant is ratio to which adjacent tetranacci numbers tend, and is given by T = (x^4-x^3-x^2-x-1)_2 (1) = 1.92756... (2) (OEIS A086088), where (P(x))_n ...

A Thue equation is a Diophantine equation of the form A_nx^n+A_(n-1)x^(n-1)y+A_(n-2)x^(n-2)y^2+...+A_0y^n=M in terms of an irreducible polynomial of degree n>=3 having ...

A tree decomposition is a mapping of a graph into a related tree with desirable properties that allow it to be used to efficiently compute certain properties (e.g., ...

A triangle-replaced graph T(G) is a cubic graph in which each vertex is replaced by a triangle graph such that each vertex of the triangle is connected to one of the ...

The above two figures are rearrangements of each other, with the corresponding triangles and polyominoes having the same areas. Nevertheless, the bottom figure has an area ...

A module having only one element: the singleton set {*}. It is a module over any ring R with respect to the multiplication defined by a*=* (1) for every a in R, and the ...

A square matrix A is said to be unipotent if A-I, where I is an identity matrix is a nilpotent matrix (defined by the property that A^n is the zero matrix for some positive ...

In predicate calculus, a universal formula is a prenex normal form formula (i.e., a formula written as a string of quantifiers and bound variables followed by a ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

The (m,q)-Ustimenko graph is the distance-1 or distance-2 graph of the dual polar graph on [C_m(q)] (Brouwer et al. 1989, p. 279). The Ustimenko graph with parameters m and q ...