default search action
Gregory S. Warrington
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Nicholas A. Loehr, Gregory S. Warrington
:
A rooted variant of Stanley's chromatic symmetric function. Discret. Math. 347(3): 113805 (2024) - 2021
- [j16]Nicholas A. Loehr, Gregory S. Warrington:
Abacus-histories and the combinatorics of creation operators. J. Comb. Theory A 177: 105330 (2021)
2010 – 2019
- 2019
- [j15]Nicholas A. Loehr, Gregory S. Warrington
Quasisymmetric and Schur expansions of cycle index polynomials. Discret. Math. 342(1): 113-127 (2019) - [i1]Bridget Eileen Tenner, Gregory S. Warrington:
Accumulation charts for instant-runoff elections. CoRR abs/1903.06095 (2019) - 2016
- [j14]Andrew Crites, Greta Panova, Gregory S. Warrington:
Shape and pattern containment of separable permutations. Ars Comb. 128: 103-116 (2016) - 2014
- [j13]Alec S. Cooper, Oleg Pikhurko, John R. Schmitt, Gregory S. Warrington
Martin Gardner's Minimum No-3-in-a-Line Problem. Am. Math. Mon. 121(3): 213-221 (2014) - 2013
- [j12]Jeffrey H. Dinitz, Esther R. Lamken, Gregory S. Warrington
On the existence of three dimensional Room frames and Howell cubes. Discret. Math. 313(11): 1368-1384 (2013) - [j11]Nicholas A. Loehr, Luis G. Serrano, Gregory S. Warrington
Transition matrices for symmetric and quasisymmetric Hall-Littlewood polynomials. J. Comb. Theory A 120(8): 1996-2019 (2013) - [j10]Daniel J. Velleman, Gregory S. Warrington
What to Expect in a Game of Memory. Am. Math. Mon. 120(9): 787-805 (2013) - 2011
- [j9]Gregory S. Warrington
Equivalence Classes for the μ-Coefficient of Kazhdan-Lusztig Polynomials in Sn . Exp. Math. 20(4): 457-466 (2011) - 2010
- [j8]Gregory S. Warrington
A combinatorial version of Sylvester's four-point problem. Adv. Appl. Math. 45(3): 390-394 (2010) - [j7]Jeffrey H. Dinitz, Gregory S. Warrington:
The Spectra of Certain Classes of Room Frames: The Last Cases. Electron. J. Comb. 17(1) (2010) - [j6]Eric S. Egge, Nicholas A. Loehr, Gregory S. Warrington
From quasisymmetric expansions to Schur expansions via a modified inverse Kostka matrix. Eur. J. Comb. 31(8): 2014-2027 (2010)
2000 – 2009
- 2009
- [j5]Nicholas A. Loehr, Gregory S. Warrington
A continuous family of partition statistics equidistributed with length. J. Comb. Theory A 116(2): 379-403 (2009) - 2008
- [j4]Nicholas A. Loehr, Bruce E. Sagan, Gregory S. Warrington:
A human proof for a generalization of Shalosh B. Ekhad's 10n Lattice Paths Theorem. Ars Comb. 89 (2008) - [j3]Edward E. Allen, Miranda C. Marion, Gregory S. Warrington
Bitableau bases for Garsia-Haiman modules of hollow type. J. Comb. Theory A 115(7): 1127-1155 (2008) - 2005
- [j2]Gregory S. Warrington:
Juggling Probabilities. Am. Math. Mon. 112(2): 105-118 (2005) - 2003
- [j1]Gregory S. Warrington
A formula for certain inverse Kazhdan-Lusztig polynomials in Sn. J. Comb. Theory A 104(2): 301-316 (2003)
Coauthor Index
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:20 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: