![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Adriano M. Garsia
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j30]Adriano M. Garsia, Guoce Xin:
On the sweep map for fuss rational Dyck paths. Adv. Appl. Math. 116: 101998 (2020)
2010 – 2019
- 2019
- [j29]Adriano M. Garsia, Anton Mellit
:
Five-term relation and Macdonald polynomials. J. Comb. Theory A 163: 182-194 (2019) - 2017
- [j28]Adriano M. Garsia, Guoce Xin:
Dinv and Area. Electron. J. Comb. 24(1): 1 (2017) - [j27]Adriano M. Garsia, Emily Sergel Leven, Nolan Wallach, Guoce Xin:
A new plethystic symmetric function operator and the rational compositional shuffle conjecture at t = 1/q. J. Comb. Theory A 145: 57-100 (2017) - 2015
- [j26]Jean-Christophe Aval, François Bergeron
, Adriano M. Garsia:
Combinatorics of labelled parallelogram polyominoes. J. Comb. Theory A 132: 32-57 (2015) - 2014
- [j25]Adriano M. Garsia, Guoce Xin, Mike Zabrocki
:
A three shuffle case of the compositional parking function conjecture. J. Comb. Theory A 123(1): 202-238 (2014) - 2013
- [j24]Michele D'Adderio
, Adriano M. Garsia:
Explicit formulas for a sequence of binary tree polynomials. Theor. Comput. Sci. 502: 217-226 (2013) - 2012
- [j23]Adriano M. Garsia, Nolan Wallach, Guoce Xin, Mike Zabrocki
:
Kronecker coefficients via Symmetric Functions and Constant Term Identities. Int. J. Algebra Comput. 22(3) (2012)
2000 – 2009
- 2009
- [j22]Adriano M. Garsia, Gregg Musiker, Nolan Wallach, Guoce Xin:
Invariants, Kronecker products, and combinatorics of some remarkable Diophantine systems. Adv. Appl. Math. 42(3): 392-421 (2009) - [j21]Adriano M. Garsia, A. Goupil:
Character Polynomials, their q-Analogs and the Kronecker Product. Electron. J. Comb. 16(2) (2009) - [j20]Adriano M. Garsia, Nolan Wallach, Guoce Xin, Mike Zabrocki
:
Hilbert series of invariants, constant terms and Kostka-Foulkes polynomials. Discret. Math. 309(16): 5206-5230 (2009) - 2007
- [j19]Adriano M. Garsia, Nolan Wallach:
r-Qsym is free over Sym. J. Comb. Theory A 114(4): 704-732 (2007) - 2006
- [j18]Adriano M. Garsia, Nolan Wallach:
The non-degeneracy of the bilinear form of m-Quasi-Invariants. Adv. Appl. Math. 37(3): 309-359 (2006) - 2005
- [j17]J. Bell, Adriano M. Garsia, Nolan Wallach:
Some New Methods in the Theory of m-Quasi-Invariants. Electron. J. Comb. 11(2) (2005) - 2004
- [j16]Adriano M. Garsia, Nolan Wallach:
Combinatorial aspects of the Baker-Akhiezer functions for S2. Eur. J. Comb. 25(8): 1231-1262 (2004) - 2003
- [j15]Adriano M. Garsia, Nolan Wallach:
Qsym over Sym is free. J. Comb. Theory A 104(2): 217-263 (2003) - 2002
- [j14]Adriano M. Garsia, James Haglund:
A proof of the q, t-Catalan positivity conjecture. Discret. Math. 256(3): 677-717 (2002) - 2000
- [j13]François Bergeron
, Adriano M. Garsia, Glenn Tesler:
Multiple Left Regular Representations Generated by Alternants. J. Comb. Theory A 91(1-2): 49-83 (2000)
1990 – 1999
- 1998
- [j12]Adriano M. Garsia, Mark D. Haiman:
A Randomq, t-Hook Walk and a Sum of Pieri Coefficients. J. Comb. Theory A 82(1): 74-111 (1998) - 1996
- [j11]Adriano M. Garsia, Mark D. Haiman:
Some natural bigraded S_n-modules. Electron. J. Comb. 3(2) (1996) - 1995
- [j10]Adriano M. Garsia, Mark D. Haiman:
Factorizations of Pieri rules for Macdonald polynomials. Discret. Math. 139(1-3): 219-256 (1995) - 1992
- [j9]Nantel Bergeron
, Adriano M. Garsia:
Zonal polynomials and domino tableaux. Discret. Math. 99(1-3): 3-15 (1992) - [j8]Adriano M. Garsia:
Orthogonality of Milne's polynomials and raising operators. Discret. Math. 99(1-3): 247-264 (1992)
1980 – 1989
- 1989
- [j7]Adriano M. Garsia, Michelle L. Wachs:
Combinatorial aspects of skew representations of the symmetric group. J. Comb. Theory A 50(1): 47-81 (1989) - 1986
- [j6]Adriano M. Garsia, Jeffrey B. Remmel:
Q-counting rook configurations and a formula of frobenius. J. Comb. Theory A 41(2): 246-275 (1986) - 1985
- [j5]Adriano M. Garsia, Jeffrey B. Remmel:
A Combinatorial View of Andrews' Proof of the L-M-W Conjectures. Eur. J. Comb. 6(4): 335-352 (1985) - [j4]Adriano M. Garsia, Jeffrey B. Remmel:
Shuffles of permutations and the Kronecker product. Graphs Comb. 1(1): 217-263 (1985) - 1981
- [j3]Adriano M. Garsia, Stephen C. Milne:
A Rogers-Ramanujan Bijection. J. Comb. Theory A 31(3): 289-339 (1981) - 1980
- [j2]Adriano M. Garsia, Jeffrey B. Remmel:
A Combinatorial Interpretation of q-Derangement and q-Laguerre Numbers. Eur. J. Comb. 1(1): 47-59 (1980)
1970 – 1979
- 1977
- [j1]Adriano M. Garsia, Michelle L. Wachs:
A New Algorithm for Minimum Cost Binary Trees. SIAM J. Comput. 6(4): 622-642 (1977)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint