scholarly journals Plabic graphs and zonotopal tilings

2018 ◽  
Vol 117 (4) ◽  
pp. 661-681 ◽  
Author(s):  
Pavel Galashin
Keyword(s):  
Plabic Graphs

scholarly journals Symbol alphabets from plabic graphs

2020 ◽  
Vol 2020 (10) ◽  
Author(s):  
Jorge Mago ◽  
Anders Schreiber ◽  
Marcus Spradlin ◽  
Anastasia Volovich
Keyword(s):  
Matrix Equations ◽  
Algebraic Functions ◽  
Yang Mills ◽  
Plabic Graphs ◽  
Super Yang Mills Theory

Abstract Symbol alphabets of n-particle amplitudes in $$ \mathcal{N} $$ N = 4 super-Yang-Mills theory are known to contain certain cluster variables of Gr(4, n) as well as certain algebraic functions of cluster variables. In this paper we suggest an algorithm for computing these symbol alphabets from plabic graphs by solving matrix equations of the form C ∙ Z = 0 to associate functions on Gr(m, n) to parameterizations of certain cells of Gr(k, n) indexed by plabic graphs. For m = 4 and n = 8 we show that this association precisely reproduces the 18 algebraic symbol letters of the two-loop NMHV eight-particle amplitude from four plabic graphs.

scholarly journals Flip cycles in plabic graphs

2020 ◽  
Vol 26 (1) ◽  
Author(s):  
Alexey Balitskiy ◽  
Julian Wellman
Keyword(s):  
Plabic Graphs

scholarly journals Symbol alphabets from plabic graphs II: rational letters

2021 ◽  
Vol 2021 (4) ◽  
Author(s):  
J. Mago ◽  
A. Schreiber ◽  
M. Spradlin ◽  
A. Yelleshpur Srikant ◽  
A. Volovich
Keyword(s):  
Matrix Equations ◽  
Algebraic Functions ◽  
Yang Mills ◽  
Plabic Graphs ◽  
Super Yang Mills Theory

Abstract Symbol alphabets of n-particle amplitudes in $$ \mathcal{N} $$ N = 4 super-Yang-Mills theory are known to contain certain cluster variables of G(4, n) as well as certain algebraic functions of cluster variables. The first paper arXiv:2007.00646 in this series focused on n = 8 algebraic letters. In this paper we show that it is possible to obtain all rational symbol letters (in fact all cluster variables) by solving matrix equations of the form C Z = 0 if one allows C to be an arbitrary cluster parameterization of the top cell of G+(n−4, n).

scholarly journals Symbol alphabets from plabic graphs III: n = 9

2021 ◽  
Vol 2021 (9) ◽  
Author(s):  
J. Mago ◽  
A. Schreiber ◽  
M. Spradlin ◽  
A. Yelleshpur Srikant ◽  
A. Volovich
Keyword(s):  
Matrix Equations ◽  
Algebraic Functions ◽  
Yang Mills ◽  
Cluster Variable ◽  
Plabic Graphs ◽  
Combining Methods ◽  
Super Yang Mills Theory

Abstract Symbol alphabets of n-particle amplitudes in $$ \mathcal{N} $$ N = 4 super-Yang-Mills theory are known to contain certain cluster variables of G(4, n) as well as certain algebraic functions of cluster variables. In this paper we solve the C Z = 0 matrix equations associated to several cells of the totally non-negative Grassmannian, combining methods of arXiv:2012.15812 for rational letters and arXiv:2007.00646 for algebraic letters. We identify sets of parameterizations of the top cell of G+(5, 9) for which the solutions produce all of (and only) the cluster variable letters of the 2-loop nine-particle NMHV amplitude, and identify plabic graphs from which all of its algebraic letters originate.

scholarly journals Links in the complex of weakly separated collections

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Suho Oh ◽  
David Speyer
Keyword(s):  
Short Note ◽  
Cluster Algebras ◽  
Combinatorial Objects ◽  
The Face ◽  
International Audience ◽  
Plabic Graphs ◽  
Positive Integers ◽  
Do So

International audience Plabic graphs are combinatorial objects used to study the totally nonnegative Grassmannian. Faces of plabic graphs are labeled by k-element sets of positive integers, and a collection of such k-element sets are the face labels of a plabic graph if that collection forms a maximal weakly separated collection. There are moves that one can apply to plabic graphs, and thus to maximal weakly separated collections, analogous to mutations of seeds in cluster algebras. In this short note, we show if two maximal weakly separated collections can be mutated from one to another, then one can do so while freezing the face labels they have in common. In particular, this provides a new, and we think simpler, proof of Postnikov's result that any two reduced plabic graphs with the same decorated permutations can be mutated to each other.

scholarly journals Weak separation and plabic graphs

2015 ◽  
Vol 110 (3) ◽  
pp. 721-754 ◽  
Author(s):  
Suho Oh ◽  
Alexander Postnikov ◽  
David E. Speyer
Keyword(s):  
Plabic Graphs ◽  
Weak Separation

scholarly journals Toric Degenerations of Gr(2, n) and Gr(3, 6) via Plabic Graphs

2018 ◽  
Vol 22 (3) ◽  
pp. 491-512 ◽  
Author(s):  
L. Bossinger ◽  
X. Fang ◽  
G. Fourier ◽  
M. Hering ◽  
M. Lanini
Keyword(s):  
Toric Degenerations ◽  
Plabic Graphs

scholarly journals Full-Rank Valuations and Toric Initial Ideals

2020 ◽  
Author(s):  
Lara Bossinger
Keyword(s):  
Projective Variety ◽  
Full Rank ◽  
Projective Spaces ◽  
Weight Vector ◽  
Flag Variety ◽  
Coordinate Ring ◽  
Semi Group ◽  
Initial Ideal ◽  
Initial Ideals ◽  
Plabic Graphs

Abstract Let $V(I)$ be a polarized projective variety or a subvariety of a product of projective spaces, and let $A$ be its (multi-)homogeneous coordinate ring. To a full-rank valuation ${\mathfrak{v}}$ on $A$ we associate a weight vector $w_{\mathfrak{v}}$. Our main result is that the value semi-group of ${\mathfrak{v}}$ is generated by the images of the generators of $A$ if and only if the initial ideal of $I$ with respect to $w_{\mathfrak{v}}$ is prime. As application, we prove a conjecture by [ 7] connecting the Minkowski property of string polytopes to the tropical flag variety. For Rietsch-Williams’ valuation for Grassmannians, we identify a class of plabic graphs with non-integral associated Newton–Okounkov polytope (for ${\operatorname *{Gr}}_k(\mathbb C^n)$ with $n\ge 6$ and $k\ge 3$).

scholarly journals Combinatorics of symmetric plabic graphs

2018 ◽  
Vol 9 (2) ◽  
pp. 259-278
Author(s):  
Rachel Karpman ◽  
Yi Su
Keyword(s):  
Plabic Graphs

scholarly journals The twist for positroids

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Greg Muller ◽  
David E. Speyer
Keyword(s):  
Planar Graphs ◽  
Cluster Structure ◽  
The Other ◽  
Twist Map ◽  
Boundary Measurement ◽  
Bruhat Cells ◽  
International Audience ◽  
Initial Seed ◽  
Plabic Graphs

International audience There are two reasonable ways to put a cluster structure on a positroid variety. In one, the initial seed is a set of Plu ̈cker coordinates. In the other, the initial seed consists of certain monomials in the edge weights of a plabic graph. We will describe an automorphism of the positroid variety, the twist, which takes one to the other. For the big positroid cell, this was already done by Marsh and Scott; we generalize their results to all positroid varieties. This also provides an inversion of the boundary measurement map which is more general than Talaska's, in that it works for all reduced plabic graphs rather than just Le-diagrams. This is the analogue for positroid varieties of the twist map of Berenstein, Fomin and Zelevinsky for double Bruhat cells. Our construction involved the combinatorics of dimer configurations on bipartite planar graphs.

Sign in / Sign up

Export Citation Format

Share Document