A note on Möbius inversion over power set lattices
In this paper, we establish a theorem on Möbius inversion over power set lattices which strongly generalizes an early result of Whitney on graph colouring.
A note on naturally embedded ternary trees.
A note on palindromic delta-vectors for certain rational polytopes.
A note on permutations without runs of given length.
A note on rational succession rules.
A note on some Mahonian statistics.
A note on symmetric powers of the standard representation of .
A note on the distribution of the three types of nodes in uniform binary trees.
A note on the number of associative triples in finite commutative Moufang loops
A note on the number of derangements.
A note on the -Genocchi numbers and polynomials.
A partition identity with certain applications
A partition of the Catalan numbers and enumeration of genealogical trees
A special relational structure, called genealogical tree, is introduced; its social interpretation and geometrical realizations are discussed. The numbers of all abstract genealogical trees with exactly n+1 nodes and k leaves is found by means of enumeration of code words. For each n, the form a partition of the n-th Catalan numer Cₙ, that means .
A permutations representation that knows what “Eulerian” means.
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
A -analogue of Faulhaber's formula for sums of powers.
A reciprocity theorem for domino tilings.
A recurrence relation for the “inv" analogue of -Eulerian polynomials.
A recursive relation for weighted Motzkin sequences.
A refinement of Cayley's formula for trees.