Search Results for ""

A method for constructing magic squares of odd order, also called de la Loubere's method.

A Skolem sequence of order n is a sequence S={s_1,s_2,...,s_(2n)} of 2n integers such that 1. For every k in {1,2,...,n}, there exist exactly two elements s_i,s_j in S such ...

The second-order ordinary differential equation y^('')-[(M^2-1/4+K^2-2MKcosx)/(sin^2x)+(sigma+K^2+1/4)]y=0.

The order n T-polyomino consists of a vertical line of n-3 squares capped by a horizontal line of three squares centered on the line.

Young's lattice Y_p is the partial order of partitions contained within a partition p ordered by containment (Stanton and White 1986; Skiena 1990, p. 77).

A k-factor of a graph is a k-regular subgraph of order n. k-factors are a generalization of complete matchings. A perfect matching is a 1-factor (Skiena 1990, p. 244).

A general reciprocity theorem for all orders which covered all other known reciprocity theorems when proved by E. Artin in 1927. If R is a number field and R^' a finite ...

A binary operation f(x,y) is an operation that applies to two quantities or expressions x and y. A binary operation on a nonempty set A is a map f:A×A->A such that 1. f is ...

In a cochain complex of modules ...->C^(i-1)->^(d^(i-1))C^i->^(d^i)C^(i+1)->..., the module B^i of i-coboundaries is the image of d^(i-1). It is a submodule of C^i and is ...

A typesetting symbol which has several distinct meanings in mathematics. It is used for a number of purposes. 1. To denote Boundaries between elements in a list, as in ...