Search Results for ""

A group G is a finite or infinite set of elements together with a binary operation (called the group operation) that together satisfy the four fundamental properties of ...

The Kneser graphs are a class of graph introduced by Lovász (1978) to prove Kneser's conjecture. Given two positive integers n and k, the Kneser graph K(n,k), often denoted ...

A manifold is a topological space that is locally Euclidean (i.e., around every point, there is a neighborhood that is topologically the same as the open unit ball in R^n). ...

A periodic continued fraction is a continued fraction (generally a regular continued fraction) whose terms eventually repeat from some point onwards. The minimal number of ...

A set is a finite or infinite collection of objects in which order has no significance, and multiplicity is generally also ignored (unlike a list or multiset). Members of a ...

A square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, ...

Square triangle picking is the selection of triples of points (corresponding to endpoints of a triangle) randomly placed inside a square. n random triangles can be picked in ...

The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...

A universal cellular automaton is a cellular automaton which, like a Turing machine, exhibits universality. von Neumann proved that an automaton consisting of cells with four ...

The Wigner 6j-symbols (Messiah 1962, p. 1062), commonly simply called the 6j-symbols, are a generalization of Clebsch-Gordan coefficients and Wigner 3j-symbol that arise in ...