default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGreta Panova
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j22]Alejandro H. Morales, Greta Panova, Gayee Park
:
Minimal skew semistandard tableaux and the Hillman-Grassl correspondence. Adv. Appl. Math. 163: 102792 (2025)- 2023
- [j21]Swee Hong Chan, Igor Pak, Greta Panova:
Extensions of the Kahn-Saks inequality for posets of width two. Comb. Theory 3(1) (2023) - [j20]Laura Colmenarejo, Alejandro H. Morales, Greta Panova:
Chromatic symmetric functions of Dyck paths and q-rook theory. Eur. J. Comb. 107: 103595 (2023) - [j19]Swee Hong Chan, Igor Pak, Greta Panova:
Effective Poset Inequalities. SIAM J. Discret. Math. 37(3): 1842-1880 (2023) - [c4]Christian Ikenmeyer, Igor Pak, Greta Panova:
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. SODA 2023: 3573-3586 - [i10]Greta Panova:
Complexity and asymptotics of structure constants. CoRR abs/2305.02553 (2023) - [i9]Christian Ikenmeyer, Greta Panova:
All Kronecker coefficients are reduced Kronecker coefficients. CoRR abs/2305.03003 (2023) - [i8]Greta Panova:
Computational Complexity in Algebraic Combinatorics. CoRR abs/2306.17511 (2023) - 2022
- [j18]Swee Hong Chan, Igor Pak, Greta Panova:
Log-Concavity in Planar Random Walks. Comb. 42(6): 1011-1026 (2022) - [i7]Swee Hong Chan, Igor Pak, Greta Panova:
Effective poset inequalities. CoRR abs/2205.02798 (2022) - [i6]Christian Ikenmeyer, Igor Pak, Greta Panova:
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. CoRR abs/2207.05423 (2022) - 2021
- [j17]Swee Hong Chan, Igor Pak, Greta Panova:
Sorting probability of Catalan posets. Adv. Appl. Math. 129: 102221 (2021) - 2020
- [j16]Julian Dörfler, Christian Ikenmeyer, Greta Panova:
On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions. SIAM J. Appl. Algebra Geom. 4(2): 354-376 (2020) - [j15]Stephen Melczer, Greta Panova, Robin Pemantle:
Counting Partitions inside a Rectangle. SIAM J. Discret. Math. 34(4): 2388-2410 (2020)
2010 – 2019
- 2019
- [j14]Igor Pak, Greta Panova, Damir Yeliussizov:
On the largest Kronecker and Littlewood-Richardson coefficients. J. Comb. Theory A 165: 44-77 (2019) - [c3]Julian Dörfler, Christian Ikenmeyer, Greta Panova:
On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions. ICALP 2019: 51:1-51:14 - [i5]Julian Dörfler, Christian Ikenmeyer, Greta Panova:
On geometric complexity theory: Multiplicity obstructions are stronger than occurrence obstructions. CoRR abs/1901.04576 (2019) - 2018
- [j13]Georgia Benkart, Laura Colmenarejo, Pamela E. Harris, Rosa C. Orellana, Greta Panova, Anne Schilling, Martha Yip:
A minimaj-preserving crystal on ordered multiset partitions. Adv. Appl. Math. 95: 96-115 (2018) - [j12]Per Alexandersson, Greta Panova:
LLT polynomials, chromatic quasisymmetric functions and graphs with cycles. Discret. Math. 341(12): 3453-3482 (2018) - [j11]Alejandro H. Morales, Igor Pak, Greta Panova:
Asymptotics of the number of standard Young tableaux of skew shape. Eur. J. Comb. 70: 26-49 (2018) - [j10]Alejandro H. Morales, Igor Pak, Greta Panova:
Hook formulas for skew shapes I. q-analogues and bijections. J. Comb. Theory A 154: 350-405 (2018) - [j9]Alejandro H. Morales, Igor Pak, Greta Panova:
Why Is Pi Less Than Twice Phi? Am. Math. Mon. 125(8): 715-723 (2018) - 2017
- [j8]Igor Pak, Greta Panova:
On the complexity of computing Kronecker coefficients. Comput. Complex. 26(1): 1-36 (2017) - [j7]Greta Panova, David Bruce Wilson:
Pfaffian Formulas for Spanning Tree Probabilities. Comb. Probab. Comput. 26(1): 118-137 (2017) - [j6]Igor Pak, Greta Panova:
Bounds on certain classes of Kronecker and q-binomial coefficients. J. Comb. Theory A 147: 1-17 (2017) - [j5]Alejandro H. Morales, Igor Pak, Greta Panova:
Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications. SIAM J. Discret. Math. 31(3): 1953-1989 (2017) - 2016
- [j4]Andrew Crites, Greta Panova, Gregory S. Warrington:
Shape and pattern containment of separable permutations. Ars Comb. 128: 103-116 (2016) - [c2]Peter Bürgisser, Christian Ikenmeyer, Greta Panova:
No Occurrence Obstructions in Geometric Complexity Theory. FOCS 2016: 386-395 - [c1]Christian Ikenmeyer, Greta Panova:
Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity Theory. FOCS 2016: 396-405 - [i4]Peter Bürgisser, Christian Ikenmeyer, Greta Panova:
No occurrence obstructions in geometric complexity theory. CoRR abs/1604.06431 (2016) - [i3]Fulvio Gesmundo, Christian Ikenmeyer, Greta Panova:
Geometric complexity theory and matrix powering. CoRR abs/1611.00827 (2016) - 2015
- [i2]Christian Ikenmeyer, Greta Panova:
Rectangular Kronecker coefficients and plethysms in geometric complexity theory. CoRR abs/1512.03798 (2015) - 2014
- [j3]Karola Mészáros, Greta Panova, Alexander Postnikov:
Schur Times Schubert via the Fomin-Kirillov Algebra. Electron. J. Comb. 21(1): 1 (2014) - [j2]Jang Soo Kim, Karola Mészáros, Greta Panova, David B. Wilson:
Dyck tilings, increasing trees, descents, and inversions. J. Comb. Theory A 122: 9-27 (2014) - [i1]Igor Pak, Greta Panova:
On the complexity of computing Kronecker coefficients. CoRR abs/1404.0653 (2014) - 2012
- [j1]Greta Panova:
Tableaux and plane partitions of truncated shapes. Adv. Appl. Math. 49(Issues): 196-217 (2012)
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-12-10 20:49 CET 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:
