Search Results for ""

The number of representations of n by k squares, allowing zeros and distinguishing signs and order, is denoted r_k(n). The special case k=2 corresponding to two squares is ...

A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...

A biquadratic number is a fourth power, n^4. The first few biquadratic numbers are 1, 16, 81, 256, 625, ... (OEIS A000583). The minimum number of biquadratic numbers needed ...

Checkers is a two-player game with the most common variant played on an 8×8 checkerboard with each player starts with twelve pieces of a fixed color on opposite sites of the ...

For every positive integer n, there exists a circle which contains exactly n lattice points in its interior. H. Steinhaus proved that for every positive integer n, there ...

Clean tile is a game investigated by Buffon (1777) in which players bet on the number of different tiles a thrown coin will partially cover on a floor that is regularly ...

A commutative diagram is a collection of maps A_i-->^(phi_i)B_i in which all map compositions starting from the same set A and ending with the same set B give the same ...

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...

The convex hull of a set of points S in n dimensions is the intersection of all convex sets containing S. For N points p_1, ..., p_N, the convex hull C is then given by the ...

Let A be an edge cut of a connected graph G. Then the cyclic edge connectivity lambda_c(G) is the size of a smallest cyclic edge cut, i.e., a smallest edge cut A such that ...