default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIra M. Gessel
Person information
- affiliation: Brandeis University, Department of Mathematics, Waltham, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j52]Ira M. Gessel
:
Counting tanglegrams with species. J. Comb. Theory A 184: 105498 (2021)- 2020
- [j51]Kassie Archer, Ira M. Gessel, Christina Graves, Xuming Liang:
Counting acyclic and strong digraphs by descents. Discret. Math. 343(11): 112041 (2020) - 2019
- [j50]Ira M. Gessel:
Reciprocals of exponential polynomials and permutation enumeration. Australas. J Comb. 74: 364-370 (2019) - [j49]Ira M. Gessel:
On the Schur Function Expansion of a Symmetric Quasi-symmetric Function. Electron. J. Comb. 26(4): 4 (2019) - 2016
- [j48]Ira M. Gessel:
Lagrange inversion. J. Comb. Theory A 144: 212-249 (2016) - 2014
- [j47]Andrew Gainer-Dewar, Ira M. Gessel:
Enumeration of Bipartite Graphs and Bipartite Blocks. Electron. J. Comb. 21(2): 2 (2014) - [j46]Ira M. Gessel, Yan Zhuang:
Counting Permutations by Alternating Descents. Electron. J. Comb. 21(4): 4 (2014) - [j45]Andrew Gainer-Dewar, Ira M. Gessel:
Counting unlabeled k-trees. J. Comb. Theory A 126: 177-193 (2014) - 2012
- [j44]Ira M. Gessel, Antonio Restivo, Christophe Reutenauer:
A bijection between words and multisets of necklaces. Eur. J. Comb. 33(7): 1537-1546 (2012) - [j43]Ira M. Gessel, Zhicong Lin, Jiang Zeng:
Jacobi-Stirling polynomials and P-partitions. Eur. J. Comb. 33(8): 1987-2000 (2012) - 2011
- [j42]Ira M. Gessel, Ji Li:
Enumeration of point-determining graphs. J. Comb. Theory A 118(2): 591-612 (2011) - 2010
- [j41]Ira M. Gessel, Jang Soo Kim:
A note on 2-distant noncrossing partitions and weighted Motzkin paths. Discret. Math. 310(23): 3421-3425 (2010) - 2008
- [j40]William Y. C. Chen, Ira M. Gessel, Catherine H. Yan, Arthur L. B. Yang:
A major index for matchings and set partitions. J. Comb. Theory A 115(6): 1069-1076 (2008) - [j39]Ira M. Gessel, Lun Lv, Guoce Xin, Yue Zhou:
A unified elementary approach to the Dyson, Morris, Aomoto, and Forrester constant term identities. J. Comb. Theory A 115(8): 1417-1435 (2008) - 2007
- [j38]Chak-On Chow, Ira M. Gessel:
On the descent numbers and major indices for the hyperoctahedral group. Adv. Appl. Math. 38(3): 275-301 (2007) - 2006
- [j37]Ira M. Gessel, Seunghyun Seo:
A Refinement of Cayley's Formula for Trees. Electron. J. Comb. 11(2) (2006) - [j36]Ira M. Gessel, Guoce Xin:
The Generating Function of Ternary Trees and Continued Fractions. Electron. J. Comb. 13(1) (2006) - [j35]Ira M. Gessel:
A q-analog of the exponential formula. Discret. Math. 306(10-11): 1022-1031 (2006) - 2005
- [j34]Ira M. Gessel, Pallavi Jayawant:
A Triple Lacunary Generating Function for Hermite Polynomials. Electron. J. Comb. 12 (2005) - [j33]Ron M. Adin, Ira M. Gessel, Yuval Roichman:
Signed Mahonians. J. Comb. Theory A 109(1): 25-43 (2005) - [j32]Ira M. Gessel, Louis H. Kalikow:
Hypergraphs and a functional equation of Bouwkamp and de Bruijn. J. Comb. Theory A 110(2): 275-289 (2005) - 2002
- [j31]Tom Fowler, Ira M. Gessel, Gilbert Labelle, Pierre Leroux:
The Specification of 2-trees. Adv. Appl. Math. 28(2): 145-168 (2002) - 2001
- [j30]Matthias Beck, Ira M. Gessel, Takao Komatsu:
The Polynomial Part of a Restricted Partition Function Related to the Frobenius Problem. Electron. J. Comb. 8(1) (2001) - [j29]Ira M. Gessel:
Acyclic orientations and chromatic generating functions. Discret. Math. 232(1-3): 119-130 (2001) - [j28]Ira M. Gessel:
The Smith College Diploma Problem. Am. Math. Mon. 108(1): 55-57 (2001) - 2000
- [j27]Emeric Deutsch, Ira M. Gessel, David Callan:
Permutation Parameters with the Same Distribution: 10634. Am. Math. Mon. 107(6): 567-568 (2000) - 1999
- [j26]Harald Helfgott, Ira M. Gessel:
Tilings of Diamonds and Hexagons with Defects. Electron. J. Comb. 6 (1999) - [j25]Ira M. Gessel, Louis W. Shapiro, Douglas G. Rogers:
Preface. Discret. Math. 204(1-3): 1-3 (1999) - 1998
- [j24]Ira M. Gessel, Jonathan Weinstein, Herbert S. Wilf:
Lattice Walks in Zd and Permutations with No Long Ascending Subsequences. Electron. J. Comb. 5 (1998) - 1997
- [j23]Ira M. Gessel:
Generating functions and generalized Dedekind sums. Electron. J. Comb. 4(2) (1997) - 1996
- [j22]Ira M. Gessel:
Counting forests by descents and leaves. Electron. J. Comb. 3(2) (1996) - [j21]Ira M. Gessel, Bruce E. Sagan:
The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions. Electron. J. Comb. 3(2) (1996) - [j20]Ira M. Gessel:
Counting acyclic digraphs by sources and sinks. Discret. Math. 160(1-3): 253-258 (1996) - [j19]Ira M. Gessel, Wayne Goddard, Walter Shur, Herbert S. Wilf, Lily Yen:
Counting Pairs of Lattice Paths by Intersections. J. Comb. Theory A 74(2): 173-187 (1996) - [j18]Ira M. Gessel, Walter Shur:
Even and Odd Pairs of Lattice Paths with Multiple Intersections. J. Comb. Theory A 75(2): 243-253 (1996) - 1995
- [j17]Ira M. Gessel:
Enumerative applications of a decomposition for graphs and digraphs. Discret. Math. 139(1-3): 257-271 (1995) - [j16]Ira M. Gessel, Gilbert Labelle:
Lagrange Inversion for Species. J. Comb. Theory A 72(1): 95-117 (1995) - [j15]Ira M. Gessel, Bruce E. Sagan, Yeong-Nan Yeh:
Enumeration of trees by inversions. J. Graph Theory 19(4): 435-459 (1995) - [j14]Ira M. Gessel:
Finding Identities with the WZ Method. J. Symb. Comput. 20(5/6): 537-566 (1995) - 1994
- [j13]Jane Friedman, Ira M. Gessel, Doron Zeilberger:
Talmudic Lattice Path Counting. J. Comb. Theory A 68(1): 215-217 (1994) - 1993
- [j12]Ira M. Gessel, Christophe Reutenauer:
Counting Permutations with Given Cycle Structure and Descent Set. J. Comb. Theory A 64(2): 189-215 (1993) - 1992
- [j11]Ira M. Gessel:
Introduction. Discret. Math. 99(1-3): 1 (1992) - [j10]Ira M. Gessel:
Super Ballot Numbers. J. Symb. Comput. 14(2/3): 179-194 (1992) - 1990
- [j9]Ira M. Gessel:
Symmetric functions and P-recursiveness. J. Comb. Theory A 53(2): 257-285 (1990) - 1987
- [j8]Ira M. Gessel:
A combinatorial proof of the multivariable lagrange inversion formula. J. Comb. Theory A 45(2): 178-195 (1987) - 1985
- [j7]Ira M. Gessel, Dennis Stanton:
Short Proofs of Saalschütz's and Dixon's Theorems. J. Comb. Theory A 38(1): 87-90 (1985) - 1984
- [j6]Ira M. Gessel:
Some generalized Durfee square identities. Discret. Math. 49(1): 41-44 (1984) - 1982
- [j5]Ira M. Gessel:
A q-analog of the exponential formula. Discret. Math. 40(1): 69-80 (1982) - 1980
- [j4]Ira M. Gessel:
A Factorization for Formal Laurent Series and Lattice Path Enumeration. J. Comb. Theory A 28(3): 321-337 (1980) - 1979
- [j3]Ira M. Gessel, Da-Lun Wang:
Depth-First Search as a Combinatorial Correspondence. J. Comb. Theory A 26(3): 308-313 (1979) - [j2]Ira M. Gessel:
Tournaments and Vandermond's determinant. J. Graph Theory 3(3): 305-307 (1979) - 1978
- [j1]Ira M. Gessel, Richard P. Stanley:
Stirling Polynomials. J. Comb. Theory A 24(1): 24-33 (1978)
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:
