default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIan P. Goulden
Person information
- affiliation: University of Waterloo, Department of Mathematics, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j36]I. P. Goulden, Pavel Shuldiner:
Characterizing the number of coloured m-ary partitions modulo m, with and without gaps. Discret. Math. 341(5): 1210-1214 (2018)- 2013
- [j35]Valentin Féray
, I. P. Goulden:
A multivariate hook formula for labelled trees. J. Comb. Theory A 120(4): 944-959 (2013) - 2010
- [j34]I. P. Goulden, William Slofstra:
Annular embeddings of permutations for arbitrary genus. J. Comb. Theory A 117(3): 272-288 (2010) - 2006
- [j33]John Dollhopf, Ian P. Goulden, Curtis Greene:
Words Avoiding a Reflexive Acyclic Relation. Electron. J. Comb. 11(2) (2006) - 2005
- [j32]Ian P. Goulden, Jin Ho Kwak, Jaeun Lee:
Enumerating branched orientable surface coverings over a non-orientable surface. Discret. Math. 303(1-3): 42-55 (2005) - [j31]Ian P. Goulden, Alexandru Nica:
A direct bijection for the Harer-Zagier formula. J. Comb. Theory A 111(2): 224-238 (2005) - 2004
- [j30]Ian P. Goulden, Jin Ho Kwak, Jaeun Lee:
Distributions of regular branched surface coverings. Eur. J. Comb. 25(3): 437-455 (2004) - 2003
- [j29]Ian P. Goulden, Luis G. Serrano:
Maintaining the spirit of the reflection principle when the boundary has arbitrary integer slope. J. Comb. Theory A 104(2): 317-326 (2003) - 2002
- [j28]Ian P. Goulden, Alexander Yong:
Dyck paths and a bijection for multisets of hook numbers. Discret. Math. 254(1-3): 153-164 (2002) - [j27]Ian P. Goulden, Alexander Yong:
Tree-like Properties of Cycle Factorizations. J. Comb. Theory A 98(1): 106-117 (2002) - 2000
- [j26]Nantel Bergeron, Ian P. Goulden, Frank Sottile:
Preface. Discret. Math. 225(1-3): 1- (2000) - [j25]Ian P. Goulden, David M. Jackson:
Transitive Factorizations in the Symmetric Group, and Combinatorial Aspects of Singularity Theory. Eur. J. Comb. 21(8): 1001-1016 (2000) - 1999
- [j24]Ian P. Goulden, David M. Jackson:
A Proof of a Conjecture for the Number of Ramified Coverings of the Sphere by the Torus. J. Comb. Theory A 88(2): 246-258 (1999) - [j23]Ian P. Goulden, David M. Jackson:
The Number of Ramified Coverings of the Sphere by the Double Torus, and a General Form for Higher Genera. J. Comb. Theory A 88(2): 259-275 (1999) - 1997
- [j22]Ian P. Goulden, D. M. Kulkarni:
Multivariable Lagrange Inversion, Gessel-Viennot Cancellation, and the Matrix Tree Theorem. J. Comb. Theory A 80(2): 295-340 (1997) - 1996
- [j21]Ian P. Goulden, David M. Jackson, C. M. Springer:
An umbral relation between pattern and commutation in strings. Discret. Math. 158(1-3): 77-85 (1996) - [j20]Ian P. Goulden, David M. Jackson:
Further Determinants with the Averaging Property of Andrews-Burge. J. Comb. Theory A 73(2): 368-375 (1996) - [j19]Ian P. Goulden, Julian West:
Raney Paths and a Combinatorial Relationship between Rooted Nonseparable Planar Maps and Two-Stack-Sortable Permutations. J. Comb. Theory A 75(2): 220-242 (1996) - 1995
- [j18]Angèle M. Hamel, Ian P. Goulden:
Planar decompositions of tableaux and Schur function determinants. Eur. J. Comb. 16(5): 461-477 (1995) - [j17]I. P. Goulden, Angèle M. Hamel:
Shift Operators and Factorial Symmetric Functions. J. Comb. Theory A 69(1): 51-60 (1995) - 1993
- [j16]I. P. Goulden, S. Pepper:
Labelled trees and factorizations of a cycle into transpositions. Discret. Math. 113(1-3): 263-268 (1993) - 1992
- [j15]I. P. Goulden:
A linear operator for symmetric functions and tableaux in a strip with given trace. Discret. Math. 99(1-3): 69-77 (1992) - [j14]Ian P. Goulden, David M. Jackson:
The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group. Eur. J. Comb. 13(5): 357-365 (1992) - 1991
- [j13]I. P. Goulden:
The Number of Involutions with r Fixed Points and a Long Increasing Subsequence. Eur. J. Comb. 12(2): 109-113 (1991) - 1990
- [j12]Ian P. Goulden, David M. Jackson:
A combinatorial construction for products of linear transformations over a finite field. J. Comb. Theory A 53(1): 157-160 (1990) - 1988
- [j11]Ian P. Goulden:
Quadratic Forms of Skew Schur Functions. Eur. J. Comb. 9(2): 161-168 (1988) - 1987
- [j10]I. P. Goulden, David M. Jackson:
Labelled graphs with vertices of degree at least three. J. Graph Theory 11(2): 177-189 (1987) - 1986
- [j9]Ian P. Goulden, David M. Jackson:
Path generating functions and continued fractions. J. Comb. Theory A 41(1): 1-10 (1986) - [j8]Ian P. Goulden, David M. Jackson:
Distributions, continued fractions, and the Ehrenfest Urn model. J. Comb. Theory A 41(1): 21-31 (1986) - [j7]George E. Andrews, Ian P. Goulden, David M. Jackson:
Shanks' convergence acceleration transform, Padé approximants and partitions. J. Comb. Theory A 43(1): 70-84 (1986) - 1985
- [j6]I. P. Goulden:
A bijective proof of the q-Saalschütz theorem. Discret. Math. 57(1-2): 39-44 (1985) - [j5]Ian P. Goulden, David M. Jackson:
Ballot Sequences and a Determinant of Good's. J. Comb. Theory A 40(1): 55-61 (1985) - 1983
- [j4]Ian P. Goulden, David M. Jackson:
An Inversion Model for q-Identities. Eur. J. Comb. 4(3): 225-230 (1983) - 1981
- [j3]C. B. Collins, I. P. Goulden, David M. Jackson, Oscar Nierstrasz:
A combinatorial application of matrix Riccati equations and their q-analogue. Discret. Math. 36(2): 139-153 (1981) - [j2]Ian P. Goulden, David M. Jackson:
The Enumeration of Directed Closed Euler Trails and Directed Hamiltonian Circuits by Lagrangian Methods. Eur. J. Comb. 2(2): 131-135 (1981) - 1978
- [j1]I. P. Goulden, David M. Jackson:
The enumeration of generalised alternating subsets with congruences. Discret. Math. 22(2): 99-104 (1978)
Informal and Other Publications
- 2017
- [i1]I. P. Goulden, L. Bruce Richmond, Jeffrey O. Shallit:
Disjoint covering systems and the reversion of the Möbius series. CoRR abs/1711.04109 (2017)
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:21 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:
