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-symmetric graph is a vertex-transitive cubic graph whose edges are partitioned into three orbits by its automorphism group. The figures above show some small ...

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. ...

An s-route of a graph G is a sequence of vertices (v_0,v_1,...,v_s) of G such that v_iv_(i+1) in E(G) for i=0, 1, ..., s-1 (where E(G) is the edge set of G) and ...

A function is said to be modular (or "elliptic modular") if it satisfies: 1. f is meromorphic in the upper half-plane H, 2. f(Atau)=f(tau) for every matrix A in the modular ...

Let M^n be a compact n-dimensional oriented Riemannian manifold without boundary, let O be a group representation of pi_1(M) by orthogonal matrices, and let E(O) be the ...

The modular group Gamma is the set of all transformations w of the form w(t)=(at+b)/(ct+d), where a, b, c, and d are integers and ad-bc=1. A Gamma-modular function is then ...

The word "order" is used in a number of different ways in mathematics. Most commonly, it refers to the number of elements in (e.g., conjugacy class order, graph order, group ...