scientific article; zbMATH DE number 3199765
From MaRDI portal
Publication:5736143
zbMath0123.24201MaRDI QIDQ5736143
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
Talmudic lattice path counting ⋮ Asymptotics for the late arrivals problem ⋮ (1, 2)-DOUBLE DOMINATION IN GRAPHS ⋮ Lexicographic generation of ordered trees ⋮ Some sieves for partition theory ⋮ Random cyclations ⋮ Relation-algebraic modeling and solution of chessboard independence and domination problems ⋮ PIE-sums: A combinatorial tool for partition theory ⋮ Riesz bounds of Wilson bases generated by \(B\)-splines ⋮ Combinatorial Properties of One-Dimensional Arrangements ⋮ Linear congruence equations for the solutions of the \(N\)-queens problem ⋮ Algorithms for Radon partitions with tolerance ⋮ Queens, attack! ⋮ A short proof of an identity of Touchard's concerning Catalan numbers ⋮ Similarity relations on finite ordered sets ⋮ Ascending sequences in permutations ⋮ A survey of known results and research areas for \(n\)-queens ⋮ Pascal triangles, Catalan numbers and renewal arrays ⋮ Domination in Chessboards ⋮ The cycle lemma and some applications ⋮ Dissections of a tetrahedron ⋮ The problem of pawns ⋮ Unnamed Item ⋮ Sieve equivalence in generalized partition theory ⋮ A combinatorial interpretation of the inverse \(t\)-Kostka matrix. ⋮ Polygon dissections and Euler, Fuss, Kirkman, and Cayley numbers ⋮ Enumeration of ladder graphs
This page was built for publication:
