Jonathan David Farley

Orcid: 0000-0003-3247-6014

According to our database1, Jonathan David Farley authored at least 12 papers between 1996 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Poset Exponentiation and a Counterexample Birkhoff Said in 1942 He Did Not Have.
Order, 2022

2011
Evolutionary dynamics of revolution: Opinion modeling in society based on graphs and rules.
Proceedings of the IEEE 6th International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, 2011

2009
Distributive lattices of small width, II: A problem from Stanley's 1986 text Enumerative Combinatorics.
J. Comb. Theory A, 2009

2007
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).
Discret. Math., 2007

2005
Chain Polynomials of Distributive Lattices are 75% Unimodal.
Electron. J. Comb., 2005

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

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

2001
Strictly Order-Preserving Maps into Z, II. A 1979 Problem of Erné.
Order, 2001

2000
Posets That Locally Resemble Distributive Lattices: An Extension of Stanley's Theorem (with Connections to Buildings and Diagram Geometries).
J. Comb. Theory A, 2000

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

1997
Perfect sequences of chain-complete posets.
Discret. Math., 1997

1996
Chain decomposition theorems for ordered sets and other musings.
Proceedings of the African Americans in Mathematics, 1996


  Loading...