TOPICS
Search

Search Results for ""


21 - 30 of 13135 for Combinatorial MathematicsSearch Results
The Andrews-Gordon identity (Andrews 1974) is the analytic counterpart of Gordon's combinatorial generalization of the Rogers-Ramanujan identities (Gordon 1961). It has a ...
A rook polynomial is a polynomial R_(m,n)(x)=sum_(k=0)^(min(m,n))r_kx^k (1) whose number of ways k nonattacking rooks can be arranged on an m×n chessboard. The rook ...
Given a planar graph G, its geometric dual G^* is constructed by placing a vertex in each region of G (including the exterior region) and, if two regions have an edge x in ...
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 ...
A family gamma of nonempty subsets of X whose union contains the given set X (and which contains no duplicated subsets) is called a cover (or covering) of X. For example, ...
Fano's geometry is a finite geometry attributed to Fano from around the year 1892. This geometry comes with five axioms, namely: 1. There exists at least one line. 2. Every ...
Five point geometry is a finite geometry subject to the following three axioms: 1. there exist exactly five points, 2. each two distinct points have exactly one line on both ...
Four line geometry is a finite geometry subject to the following three axioms: 1. there exist exactly four lines, 2. any two distinct lines have exactly one point of on both ...
The Franel numbers are the numbers Fr_n=sum_(k=0)^n(n; k)^3, (1) where (n; k) is a binomial coefficient. The first few values for n=0, 1, ... are 1, 2, 10, 56, 346, ... (OEIS ...
Let (a)_i be a sequence of complex numbers and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as f_(nk)=(product_(j=k)^(n-1)(a_j+k))/((n-k)!) and ...
1|2|3|4|5|6 ... 1314 Previous Next

...