Search Results for ""

The study of the meaning and relationships of statements used to represent precise mathematical ideas. Symbolic logic is also called formal logic.

A symmetric design is a block design (v, k, lambda, r, b) with the same number of blocks as points, so b=v (or, equivalently, r=k). An example of a symmetric block design is ...

A relation R on a set S is symmetric provided that for every x and y in S we have xRy iff yRx. The symmetric relations on n nodes are isomorphic with the rooted graphs on n ...

A conjecture which relates the minimal elliptic discriminant of an elliptic curve to the j-conductor. If true, it would imply Fermat's last theorem for sufficiently large ...

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.

A 3-coloring of graph edges so that no two edges of the same color meet at a graph vertex (Ball and Coxeter 1987, pp. 265-266).

A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball ...

An (n,k)-talisman hexagon is an arrangement of nested hexagons containing the integers 1, 2, ..., H_n=3n(n-1)+1, where H_n is the nth hex number, such that the difference ...

An n×n array of the integers from 1 to n^2 such that the difference between any one integer and its neighbor (horizontally, vertically, or diagonally, without wrapping ...

A system in which a strange loop appears.