Search Results for ""

A planted plane tree (V,E,v,alpha) is defined as a vertex set V, edges set E, root v, and order relation alpha on V which satisfies 1. For x,y in V if rho(x)<rho(y), then ...

Proper covers are defined as covers of a set X which do not contain the entire set X itself as a subset (Macula 1994). Of the five covers of {1,2}, namely {{1},{2}}, {{1,2}}, ...

A quasi-qunitic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...

A random permutation is a permutation containing a fixed number n of a random selection from a given set of elements. There are two main algorithms for constructing random ...

The Schwarz triangles are spherical triangles which, by repeated reflection in their indices, lead to a set of congruent spherical triangles covering the sphere a finite ...

A siteswap is a sequence encountered in juggling in which each term is a positive integer, encoded in binary. The transition rule from one term to the next consists of ...

Solid partitions are generalizations of plane partitions. MacMahon (1960) conjectured the generating function for the number of solid partitions was ...

Sorting is the rearrangement of numbers (or other orderable objects) in a list into their correct lexographic order. Alphabetization is therefore a form of sorting. Because ...

A matrix for which horizontal and vertical dimensions are the same (i.e., an n×n matrix). A matrix m may be tested to determine if it is square in Wolfram Language using ...

The distribution of a variable is a description of the relative numbers of times each possible outcome will occur in a number of trials. The function describing the ...