Search Results for ""

Let p and q be partitions of a positive integer, then there exists a (0,1)-matrix A such that c(A)=p, r(A)=q iff q is dominated by p^*.

A number given by the generating function (2t)/(e^t+1)=sum_(n=1)^inftyG_n(t^n)/(n!). (1) It satisfies G_1=1, G_3=G_5=G_7=...=0, and even coefficients are given by G_(2n) = ...

Let A_(k,i)(n) denote the number of partitions into n parts not congruent to 0, i, or -i (mod 2k+1). Let B_(k,i)(n) denote the number of partitions of n wherein 1. 1 appears ...

The coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...

The grid shading problem is the problem of proving the unimodality of the sequence {a_1,a_2,...,a_(mn)}, where for fixed m and n, a_i is the number of partitions of i with at ...

A presentation of a group is a description of a set I and a subset R of the free group F(I) generated by I, written <(x_i)_(i in I)|(r)_(r in R)>, where r=1 (the identity ...

Hackenbush is a game in combinatorial game theory in which player Left can delete any bLue edge, player Right can delete any Red edge, and either player can delete Green ...

The longest increasing scattered subsequence is the longest subsequence of increasing terms, where intervening nonincreasing terms may be dropped. Finding the largest ...

Low-dimensional topology usually deals with objects that are two-, three-, or four-dimensional in nature. Properly speaking, low-dimensional topology should be part of ...

The matrix tree theorem, also called Kirchhoff's matrix-tree theorem (Buekenhout and Parker 1998), states that the number of nonidentical spanning trees of a graph G is equal ...