Pavel Galashin
Massachusetts Institute of Technology
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Pavel Galashin.
Proceedings of The London Mathematical Society | 2018
Pavel Galashin
We say that two sets
Journal of Combinatorial Theory | 2017
Pavel Galashin
S,T\subset\{1,2,\dots,n\}
Journal of Knot Theory and Its Ramifications | 2016
Pavel Galashin; Gaiane Panina
are chord separated if there does not exist a cyclically ordered quadruple
Selecta Mathematica-new Series | 2018
Miriam Farber; Pavel Galashin
a,b,c,d
Electronic Research Announcements in Mathematical Sciences | 2016
Pavel Galashin; Vladimir Zolotov
of integers satisfying
arXiv: Probability | 2013
Pavel Galashin
a,c\in S-T
arXiv: Combinatorics | 2018
Pavel Galashin; Thomas Lam
and
arXiv: Combinatorics | 2016
Pavel Galashin; Pavlo Pylyavskyy
b,d\in T-S
Archive | 2017
Pavel Galashin; Alexander Postnikov
. This is a weaker version of Leclerc and Zelevinskys weak separation. We show that every maximal by inclusion collection of pairwise chord separated sets is also maximal by size. Moreover, we prove that such collections are precisely vertex label collections of fine zonotopal tilings of the three-dimensional cyclic zonotope. In our construction, plabic graphs and square moves appear naturally as horizontal sections of zonotopal tilings and their mutations respectively.
Mathematische Zeitschrift | 2018
Pavel Galashin; Sam Hopkins; Thomas McConville; Alexander Postnikov
Abstract For a given skew shape, we build a crystal graph on the set of all reverse plane partitions that have this shape. As a consequence, we get a simple extension of the Littlewood–Richardson rule for the expansion of the corresponding dual stable Grothendieck polynomial in terms of Schur polynomials.