2007 |
7 | EE | 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).
Discrete Mathematics 307(2): 191-198 (2007) |
2005 |
6 | EE | Anders Björner,
Jonathan David Farley:
Chain Polynomials of Distributive Lattices are 75% Unimodal.
Electr. J. Comb. 12: (2005) |
2003 |
5 | EE | Jonathan David Farley:
Quasi-Differential Posets and Cover Functions of Distributive Lattices II: A Problem in Stanley's Enumerative Combinatorics.
Graphs and Combinatorics 19(4): 475-491 (2003) |
2001 |
4 | EE | Jonathan David Farley,
Bernd S. W. Schröder:
Strictly Order-Preserving Maps into Z, II. A 1979 Problem of Erné.
Order 18(4): 381-385 (2001) |
2000 |
3 | EE | Jonathan David Farley:
Quasi-Differential Posets and Cover Functions of Distributive Lattices: I. A Conjecture of Stanley.
J. Comb. Theory, Ser. A 90(1): 123-147 (2000) |
2 | EE | 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).
J. Comb. Theory, Ser. A 92(2): 119-137 (2000) |
1997 |
1 | EE | Jonathan David Farley:
Perfect sequences of chain-complete posets.
Discrete Mathematics 167-168: 271-296 (1997) |