Search Results for ""

Consider h_+(d) proper equivalence classes of forms with discriminant d equal to the field discriminant, then they can be subdivided equally into 2^(r-1) genera of ...

Let n be an integer such that n>=lambda_1, where lambda=(lambda_1,lambda_2,...) is a partition of n=|lambda| if lambda_1>=lambda_2>=...>=0, where lambda_i are a sequence of ...

Let S(T) be the group of symmetries which map a monohedral tiling T onto itself. The transitivity class of a given tile T is then the collection of all tiles to which T can ...

A zero matrix is an m×n matrix consisting of all 0s (MacDuffee 1943, p. 27), denoted 0. Zero matrices are sometimes also known as null matrices (Akivis and Goldberg 1972, p. ...

In the usual diagram of inclusion homomorphisms, if the upper two maps are injective, then so are the other two. More formally, consider a space X which is expressible as the ...

The eight Gell-Mann matrices lambda_i, i=1,...,8, are an example of the set of generators of the Lie algebra associated to the special unitary group SU(3). Explicitly, these ...

An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...

Coding theory, sometimes called algebraic coding theory, deals with the design of error-correcting codes for the reliable transmission of information across noisy channels. ...

The number of partitions of n in which no parts are multiples of k is sometimes denoted b_k(n) (Gordon and Ono 1997). b_k(n) is also the number of partitions of n into at ...

A rooted graph is a graph in which one node is labeled in a special way so as to distinguish it from other nodes. The special node is called the root of the graph. The rooted ...