Partition Identities I: Sandwich Theorems and Logical 0-1 Laws

The Sandwich Theorems proved in this paper give a new method to show that the partition function a(n) of a partition identity A(x) := n=0 a(n)xn = n=1 (1 - xn )-p(n) satisfies the condition RT1 lim n a(n - 1) a(n) = 1 . This leads to numerous examples of naturally occuring classes of relational structures whose finite members enjoy a logical 0

• Type: Journal
• Year: 2004
• Where: COMBINATORICS
• Authors: Jason P. Bell, Stanley Burris
• Keywords: COMBINATORICS 2004, Condition Rt1 Lim, Partition Identity, Sandwich Theorems