Search the dblp DataBase

Publications of Author

1. Jonathan David Farley
   A structure theorem for posets admitting a "strong" chain partition: : A generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities). [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:2, pp:191-198 [Journal]
   
2. Jonathan David Farley
   Quasi-Differential Posets and Cover Functions of Distributive Lattices II: A Problem in Stanley's Enumerative Combinatorics. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2003, v:19, n:4, pp:475-491 [Journal]
   
3. Jonathan David Farley
   Quasi-Differential Posets and Cover Functions of Distributive Lattices: I. A Conjecture of Stanley. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 2000, v:90, n:1, pp:123-147 [Journal]
   
4. Jonathan David Farley, Stefan E. Schmidt
   Posets That Locally Resemble Distributive Lattices: An Extension of Stanley's Theorem (with Connections to Buildings and Diagram Geometries). [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 2000, v:92, n:2, pp:119-137 [Journal]
   
5. Jonathan David Farley, Bernd S. W. Schröder
   Strictly Order-Preserving Maps into Z, II. A 1979 Problem of Erné. [Citation Graph (0, 0)][DBLP]
   Order, 2001, v:18, n:4, pp:381-385 [Journal]
   
6. Jonathan David Farley
   Perfect sequences of chain-complete posets. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1997, v:167, n:, pp:271-296 [Journal]
   
7. 
   Chain Polynomials of Distributive Lattices are 75% Unimodal. [Citation Graph (, )][DBLP]