Search Results for ""

A polyomino-like object made by attaching squares joined either at sides or corners. Because neighboring squares can be in relation to one another as kings may move on a ...

A graph with projective plane crossing number equal to 0 may be said to be projective planar. Examples of projective planar graphs with graph crossing number >=2 include the ...

A generalization of simple majority voting in which a list of quotas {q_0,...,q_n} specifies, according to the number of votes, how many votes an alternative needs to win ...

The number of ways N(m,n) of finding a subrectangle with an m×n rectangle can be computed by counting the number of ways in which the upper right-hand corner can be selected ...

An extended rooted binary tree satisfying the following conditions: 1. Every node has two children, each colored either red or black. 2. Every tree leaf node is colored ...

The regulator of a number field K is a positive number associated with K. The regulator of an imaginary quadratic field is 1 and that of a real quadratic, imaginary cubic, or ...

A formula for the permanent of a matrix perm(a_(ij))=(-1)^nsum_(s subset= {1,...,n})(-1)^(|s|)product_(i=1)^nsum_(j in s)a_(ij), where the sum is over all subsets of ...

Schur's partition theorem lets A(n) denote the number of partitions of n into parts congruent to +/-1 (mod 6), B(n) denote the number of partitions of n into distinct parts ...

In combinatorial mathematics, the series-parallel networks problem asks for the number of networks that can be formed using a given number of edges. The edges can be ...

Dissect a triangle into smaller triangles, such that all have full edge contact with their neighbors. Label the corners 1, 2, and 3. Label all vertices with 1, 2, or 3, with ...