Chain decomposition theorems for ordered sets and other musings. - Jonathan David Farley (African Americans in Mathematics, 1996)

Perfect sequences of chain-complete posets. - Jonathan David Farley (Discret. Math., 1997)

Quasi-Differential Posets and Cover Functions of Distributive Lattices: I. A Conjecture of Stanley. - Jonathan David Farley (J. Comb. Theory A, 2000)

Posets That Locally Resemble Distributive Lattices: An Extension of Stanley's Theorem (with Connections to Buildings and Diagram Geometries). - Jonathan David Farley; Stefan E. Schmidt (J. Comb. Theory A, 2000)

Strictly Order-Preserving Maps into Z, II. A 1979 Problem of Erné. - Jonathan David Farley; Bernd S. W. Schröder (Order, 2001)

Quasi-Differential Posets and Cover Functions of Distributive Lattices II: A Problem in Stanley's Enumerative Combinatorics. - Jonathan David Farley (Graphs Comb., 2003)

Linear extensions of ranked posets, enumerated by descents. A problem of Stanley from the 1981 Banff Conference on Ordered Sets. - Jonathan David Farley (Adv. Appl. Math., 2005)

Chain Polynomials of Distributive Lattices are 75% Unimodal. - Anders Björner; Jonathan David Farley (Electron. J. Comb., 2005)

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). - Jonathan David Farley (Discret. Math., 2007)

Distributive lattices of small width, II: A problem from Stanley's 1986 text Enumerative Combinatorics. - Jonathan David Farley; Ryan Klippenstine (J. Comb. Theory A, 2009)

Evolutionary dynamics of revolution: Opinion modeling in society based on graphs and rules. - Jonathan David Farley; George Markowsky (IDAACS (2), 2011)

Poset Exponentiation and a Counterexample Birkhoff Said in 1942 He Did Not Have. - Jonathan David Farley (Order, 2022)