default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan David Farley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j10]Jonathan David Farley
:
Poset Exponentiation and a Counterexample Birkhoff Said in 1942 He Did Not Have. Order 39(2): 243-250 (2022)
2010 – 2019
- 2011
- [c2]Jonathan David Farley, George Markowsky:
Evolutionary dynamics of revolution: Opinion modeling in society based on graphs and rules. IDAACS (2) 2011: 780-784
2000 – 2009
- 2009
- [j9]Jonathan David Farley, Ryan Klippenstine:
Distributive lattices of small width, II: A problem from Stanley's 1986 text Enumerative Combinatorics. J. Comb. Theory A 116(6): 1097-1119 (2009) - 2007
- [j8]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). Discret. Math. 307(2): 191-198 (2007) - 2005
- [j7]Jonathan David Farley:
Linear extensions of ranked posets, enumerated by descents. A problem of Stanley from the 1981 Banff Conference on Ordered Sets. Adv. Appl. Math. 34(2): 295-312 (2005) - [j6]Anders Björner, Jonathan David Farley:
Chain Polynomials of Distributive Lattices are 75% Unimodal. Electron. J. Comb. 12 (2005) - 2003
- [j5]Jonathan David Farley:
Quasi-Differential Posets and Cover Functions of Distributive Lattices II: A Problem in Stanley's Enumerative Combinatorics. Graphs Comb. 19(4): 475-491 (2003) - 2001
- [j4]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
- [j3]Jonathan David Farley:
Quasi-Differential Posets and Cover Functions of Distributive Lattices: I. A Conjecture of Stanley. J. Comb. Theory A 90(1): 123-147 (2000) - [j2]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 A 92(2): 119-137 (2000)
1990 – 1999
- 1997
- [j1]Jonathan David Farley:
Perfect sequences of chain-complete posets. Discret. Math. 167-168: 271-296 (1997) - 1996
- [c1]Jonathan David Farley:
Chain decomposition theorems for ordered sets and other musings. African Americans in Mathematics 1996: 3-13
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
