Search Results for ""

An exchange of two elements of an ordered list with all others staying the same. A transposition is therefore a permutation of two elements. For example, the swapping of 2 ...

A permutation group in which the permutations are limited to transpositions.

An ordering of permutations in which each two adjacent permutations differ by the transposition of two elements. For the permutations of {1,2,3} there are two listings which ...

A set of n cells in an n×n square such that no two come from the same row and no two come from the same column. The number of transversals of an n×n square is n! (n ...

A transversal design TD_lambda(k,n) of order n, block size k, and index lambda is a triple (V, G, B) such that 1. V is a set of kn elements, 2. G is a partition of V into k ...

A function f:{0,1}^(l(n))×{0,1}^n->{0,1}^(m(n)) is a trapdoor one-way hash function if f is a trapdoor one-way function and is also a one-way hash function, i.e., if, ...

The set of all centroid points in a weighted tree (Harary 1994, p. 36).

The height of a tree g is defined as the vertex height of its root vertex, where the vertex height of a vertex v in a tree g is the number of edges on the longest downward ...

A tree having an infinite number of branches and whose nodes are sequences generated by a set of rules.

A 30-sided polygon. The regular triacontagon with side length 1 has inradius r, circumradius R, and area A given by r = 1/4(sqrt(15)+3sqrt(3)+sqrt(2)sqrt(25+11sqrt(5))) (1) R ...