Search Results for ""

Combinatorial topology is a subset of algebraic topology that uses combinatorial methods. For example, simplicial homology is a combinatorial construction in algebraic ...

Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...

Combinatorial game theory is the theory of two-player games of perfect knowledge such as go, chess, or checkers.

Combinatorial matrix theory is a rich branch of mathematics that combines combinatorics, graph theory, and linear algebra. It includes the theory of matrices with prescribed ...

Let m(G) be the cycle rank of a graph G, m^*(G) be the cocycle rank, and the relative complement G-H of a subgraph H of G be defined as that subgraph obtained by deleting the ...

Combinatorics is the branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations that characterize their ...

The use of techniques from algebra, topology, and geometry in the solution of combinatorial problems, or the use of combinatorial methods to attack problems in these areas ...

An arrangement of overlapping circles which cover the entire plane. A lower bound for a covering using equivalent circles is 2pi/sqrt(27) (Williams 1979, p. 51).

If F is a family of more than n bounded closed convex sets in Euclidean n-space R^n, and if every H_n (where H_n is the Helly number) members of F have at least one point in ...

Let A_n be the set of all sequences that contain all sequences {a_k}_(k=0)^n where a_0=1 and all other a_i=+/-1, and define c_k=sum_(j=0)^(n-k)a_ja_(j+k). Then the merit ...