Search Results for ""

A pseudotree is a connected pseudoforest, i.e., an undirected connected graph that contains at most one graph cycle. Connected acyclic graphs (i.e., trees), are therefore ...

A system in which words (expressions) of a formal language can be transformed according to a finite set of rewrite rules is called a reduction system. While reduction systems ...

Let A be an involutive algebra over the field C of complex numbers with involution xi|->xi^♭. Then A is a right Hilbert algebra if A has an inner product <·,·> satisfying: 1. ...

The Schur decomposition of a complex square matrix A is a matrix decomposition of the form Q^(H)AQ=T=D+N, (1) where Q is a unitary matrix, Q^(H) is its conjugate transpose, ...

Wolfram's iteration is an algorithm for computing the square root of a rational number 1<=r<4 using properties of the binary representation of r. The algorithm begins with ...

A Fibonacci prime is a Fibonacci number F_n that is also a prime number. Every F_n that is prime must have a prime index n, with the exception of F_4=3. However, the converse ...

The Bailey mod 9 identities are a set of three Rogers-Ramanujan-like identities appearing as equations (1.6), (1.8), and (1.7) on p. 422 of Bailey (1947) given by A(q) = ...

A tag system in which a list of n tag rules (each of a special form) is applied to a system in sequential order and then starting again from the first rule. In a cyclic tag ...

A differential-algebraic equation (DAE) is a type of differential equation in which the derivatives are not (in general) expressed explicitly, and typically derivatives of ...

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...