Search Results for ""

A canonical labeling, also called a canonical form, of a graph G is a graph G^' which is isomorphic to G and which represents the whole isomorphism class of G (Piperno 2011). ...

Let S be a collection of subsets of a set X, mu:S->[0,infty] a set function, and mu^* the outer measure induced by mu. The measure mu^_ that is the restriction of mu^* to the ...

Assume that f is a nonnegative real function on [0,infty) and that the two integrals int_0^inftyx^(p-1-lambda)[f(x)]^pdx (1) int_0^inftyx^(q-1+mu)[f(x)]^qdx (2) exist and are ...

For F_n the nth Fibonacci number, F_(n-1)F_(n+1)-F_n^2=(-1)^n. This identity was also discovered by Simson (Coxeter and Greitzer 1967, p. 41; Coxeter 1969, pp. 165-168; Wells ...

Approximations to Catalan's constant include K approx (9/(10))^(5/6) (1) approx ln(ln892)-1 (2) approx (1/(96))^(1/52) (3) approx (4/(51))^(1/29) (4) approx ...

Catalan's triangle is the number triangle 1 ; 1 1 ; 1 2 2 ; 1 3 5 5 ; 1 4 9 14 14 ; 1 5 14 28 42 42 ; 1 6 20 48 90 132 132 (1) (OEIS A009766) with entries given by ...

A game in which no draw is possible. Steinhaus (1999, p. 16) stated that all categorical games are unfair, but this is incorrect. For example, the game "Odds or Evens" pits ...

A multiway system that generates causal networks which are all isomorphic as acyclic digraphs is said to exhibit causal invariance, and the causal network itself is also said ...

A causal network is an acyclic digraph arising from an evolution of a substitution system, and representing its history. The illustration above shows a causal network ...

A Cayley tree is a tree in which each non-leaf graph vertex has a constant number of branches n is called an n-Cayley tree. 2-Cayley trees are path graphs. The unique ...