An official website of the United States government
Webs give a diagrammatic calculus for spaces of $$U_{q}(\mathfrak{sl}_{r})$$-tensor invariants, but intrinsic characterizations of web bases are only known in certain cases. Recently, we introduced hourglass plabic graphs to give the first such $$U_{q}(\mathfrak{sl}_{4})$$-web bases. Separately, Fraser introduced a web basis for PlĆ¼cker degree two representations of arbitrary $$U_{q}(\mathfrak{sl}_{r})$$. Here, we show that Fraserās basis agrees with that predicted by the hourglass plabic graph framework and give an intrinsic characterization of the resulting webs. A further compelling feature with many applications is that our bases exhibit rotation-invariance. Together with the results of our earlier paper, this implies that hourglass plabic graphs give a uniform description of all known rotation-invariant $$U_{q}(\mathfrak{sl}_{r})$$-web bases. Moreover, this provides a single combinatorial model simultaneously generalizing the Tamari lattice, the alternating sign matrix lattice, and the lattice of plane partitions. As a part of our argument, we develop properties of square faces in arbitrary hourglass plabic graphs, a key step in our program towards general $$U_{q}(\mathfrak{sl}_{r})$$-web bases.
more »
« less
The Transition Matrix Between the Specht and š°š©3 Web Bases is Unitriangular With Respect to Shadow Containment
Abstract Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $$\mathfrak{sl}_k$$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link diagrams in terms of webs, producing quantum invariants like the well-known Jones polynomial. One important question in representation theory is to identify the relationships between different bases; coefficients in the change-of-basis matrix often describe combinatorial, algebraic, or geometric quantities (e.g., KazhdanāLusztig polynomials). By āflatteningā the braiding maps, webs can also be viewed as the basis elements of a symmetric group representation. In this paper, we define two new combinatorial structures for webs: band diagrams and their one-dimensional projections, shadows, which measure depths of regions inside the web. As an application, we resolve an open conjecture that the change of basis between the so-called Specht basis and web basis of this symmetric group representation is unitriangular for $$\mathfrak{sl}_3$$-webs ([ 33] and [ 29].) We do this using band diagrams and shadows to construct a new partial order on webs that is a refinement of the usual partial order. In fact, we prove that for $$\mathfrak{sl}_2$$-webs, our new partial order coincides with the tableau partial order on webs studied by the authors and others [ 12, 17, 29, 33]. We also prove that though the new partial order for $$\mathfrak{sl}_3$$-webs is a refinement of the previously studied tableau order, the two partial orders do not agree for $$\mathfrak{sl}_3$$.
more »
« less
- Award ID(s):
- 1800773
- PAR ID:
- 10366179
- Date Published:
- Journal Name:
- International Mathematics Research Notices
- Volume:
- 2022
- Issue:
- 5
- ISSN:
- 1073-7928
- Page Range / eLocation ID:
- 3371 to 3416
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
In this short note we construct an embedding of the planar algebra for $$\overline{\Rep(U_q(\mathfrak{sl}_3))}$$ at $$q = e^{2\pi i \frac{1}{24}}$$ into the graph planar algebra of di Francesco and Zuber's candidate graph $$\mathcal{E}_4^{12}$$. Via the graph planar algebra embedding theorem we thus construct a rank 11 module category over $$\overline{\Rep(U_q(\mathfrak{sl}_3))}$$ whose graph for action by the vector representation is $$\mathcal{E}_4^{12}$$. This fills a small gap in the literature on the construction of $$\overline{\Rep(U_q(\mathfrak{sl}_3))}$$ module categories. As a consequence of our construction, we obtain the principal graphs of subfactors constructed abstractly by Evans and Pugh.more » « less
-
We introduce a topological intersection number for an ordered pair of -webs on a decorated surface. Using this intersection pairing between reduced -webs and a collection of -webs associated with the FockāGoncharov cluster coordinates, we provide a natural combinatorial interpretation of the bijection from the set of reduced -webs to the tropical set , as established by Douglas and Sun in [Forum Math. Sigma 12 (2024), p. e5, 55]. We provide a new proof of the flip equivariance of the above bijection, which is crucial for proving the FockāGoncharov duality conjecture of higher TeichmĆ¼ller spaces for .more » « less
-
We present a quantum compilation algorithm that maps Clifford encoders, an equivalence class of quantum circuits that arise universally in quantum error correction, into a representation in the ZX calculus. In particular, we develop a canonical form in the ZX calculus and prove canonicity as well as efficient reducibility of any Clifford encoder into the canonical form. The diagrams produced by our compiler explicitly visualize information propagation and entanglement structure of the encoder, revealing properties that may be obscured in the circuit or stabilizer-tableau representationmore » « less
-
Abstract Kreweras words are words consisting of n $$\mathrm {A}$$ A ās, n $$\mathrm {B}$$ B ās, and n $$\mathrm {C}$$ C ās in which every prefix has at least as many $$\mathrm {A}$$ A ās as $$\mathrm {B}$$ B ās and at least as many $$\mathrm {A}$$ A ās as $$\mathrm {C}$$ C ās. Equivalently, a Kreweras word is a linear extension of the poset $$\mathsf{V}\times [n]$$ V Ć [ n ] . Kreweras words were introduced in 1965 by Kreweras, who gave a remarkable product formula for their enumeration. Subsequently they became a fundamental example in the theory of lattice walks in the quarter plane. We study SchĆ¼tzenbergerās promotion operator on the set of Kreweras words. In particular, we show that 3 n applications of promotion on a Kreweras word merely swaps the $$\mathrm {B}$$ B ās and $$\mathrm {C}$$ C ās. Doing so, we provide the first answer to a question of Stanley from 2009, asking for posets with āgoodā behavior under promotion, other than the four families of shapes classified by Haiman in 1992. We also uncover a strikingly simple description of Kreweras words in terms of Kuperbergās $$\mathfrak {sl}_3$$ sl 3 -webs, and Postnikovās trip permutation associated with any plabic graph. In this description, SchĆ¼tzenbergerās promotion corresponds to rotation of the web.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1093/imrn/rnaa290
