Symbol alphabets from plabic graphs III: n = 9

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.

A New Algorithm for Identifying and Quantifying of Latent Classes

Processing large amounts of data can be greatly simplified if this data is divided into approximately homogeneous groups. Splitting into such groups is the task of cluster analysis. However, the question of constructing an objective, natural partition into clusters remains open. The paper considers a modern approach to the search for such an objective cluster structure by highlighting the indicator of a common essential part from the set of characteristics that define objects (we call them the forming ones). When this indicator is fixed, the remains of the forming characteristics become independent or close to such. The resulting independent residuals are interpreted as a kind of information noise, and the latent cluster variable, the common fixed part that provides such a transformation, can be a reason for the objective integration of objects into clusters. A new algorithm for the formation of a cluster partition based on the proximity or coincidence of the values of a latent cluster variable with the simultaneous quantification of its values is proposed. The algorithm is based on the targeted search of partitions, the transition from the start one to the partition, more close to the objective. The algorithm proposed in the paper can be easily modified to the case of non-numeric categorized characteristics.

Laurent phenomenon and simple modules of quiver Hecke algebras

In this paper we study consequences of the results of Kang et al. [Monoidal categorification of cluster algebras, J. Amer. Math. Soc. 31 (2018), 349–426] on a monoidal categorification of the unipotent quantum coordinate ring $A_{q}(\mathfrak{n}(w))$ together with the Laurent phenomenon of cluster algebras. We show that if a simple module $S$ in the category ${\mathcal{C}}_{w}$ strongly commutes with all the cluster variables in a cluster $[\mathscr{C}]$, then $[S]$ is a cluster monomial in $[\mathscr{C}]$. If $S$ strongly commutes with cluster variables except for exactly one cluster variable $[M_{k}]$, then $[S]$ is either a cluster monomial in $[\mathscr{C}]$ or a cluster monomial in $\unicode[STIX]{x1D707}_{k}([\mathscr{C}])$. We give a new proof of the fact that the upper global basis is a common triangular basis (in the sense of Qin [Triangular bases in quantum cluster algebras and monoidal categorification conjectures, Duke Math. 166 (2017), 2337–2442]) of the localization $\widetilde{A}_{q}(\mathfrak{n}(w))$ of $A_{q}(\mathfrak{n}(w))$ at the frozen variables. A characterization on the commutativity of a simple module $S$ with cluster variables in a cluster $[\mathscr{C}]$ is given in terms of the denominator vector of $[S]$ with respect to the cluster $[\mathscr{C}]$.

Toric Mutations in the dP$_2$ Quiver and Subgraphs of the dP$_2$ Brane Tiling

Brane tilings are infinite, bipartite, periodic, planar graphs that are dual to quivers. In this paper, we study the del Pezzo 2 (dP$_2$) quiver and its associated brane tiling which arise in theoretical physics. Specifically, we prove explicit formulas for all cluster variables generated by toric mutation sequences of the dP$_2$ quiver. Moreover, we associate a subgraph of the dP$_2$ brane tiling to each toric cluster variable such that the sum of weighted perfect matchings of the subgraph equals the Laurent polynomial of the cluster variable.

Newton Polytopes of Cluster Variables of Type $A_n$

International audience We study Newton polytopes of cluster variables in type $A_n$ cluster algebras, whose cluster and coefficient variables are indexed by the diagonals and boundary segments of a polygon. Our main results include an explicit description of the affine hull and facets of the Newton polytope of the Laurent expansion of any cluster variable, with respect to any cluster. In particular, we show that every Laurent monomial in a Laurent expansion of a type $A$ cluster variable corresponds to a vertex of the Newton polytope. We also describe the face lattice of each Newton polytope via an isomorphism with the lattice of elementary subgraphs of the associated snake graph. Nous étudions polytopes de Newton des variables amassées dans les algèbres amassées de type A, dont les variables sont indexés par les diagonales et les côtés d’un polygone. Nos principaux résultats comprennent une description explicite de l’enveloppe affine et facettes du polytope de Newton du développement de Laurent de toutes variables amassées. En particulier, nous montrons que tout monôme Laurent dans un développement de Laurent de variable amassée de type A correspond à un sommet du polytope de Newton. Nous décrivons aussi le treillis des facesde chaque polytope de Newton via un isomorphisme avec le treillis des sous-graphes élémentaires du “snake graph” qui est associé.

A Cluster Expansion Formula ($A_n$ case)

We consider the Ptolemy cluster algebras, which are cluster algebras of finite type $A$ (with non-trivial coefficients) that have been described by Fomin and Zelevinsky using triangulations of a regular polygon. Given any seed $\Sigma$ in a Ptolemy cluster algebra, we present a formula for the expansion of an arbitrary cluster variable in terms of the cluster variables of the seed $\Sigma$. Our formula is given in a combinatorial way, using paths on a triangulation of the polygon that corresponds to the seed $\Sigma$.