An official website of the United States government
We describe the implementation of queer supercrystals. Our code is docu- mented with test suites and has been integrated into SageMath. Through computer explorations using this implementation, we provide a counterexample to Assaf’s and Oguz’ conjecture that their local queer axioms uniquely characterize the queer super- crystal.
more »
« less
Combinatorial Characterization of Queer Supercrystals (Survey)
We provide a characterization of the crystal bases for the quantum queer superalgebra recently introduced by Grantcharov et al. This characterization is a combination of local queer axioms generalizing Stembridge’s local axioms for crystal bases for simply-laced root systems, which were recently introduced by Assaf and Oguz, with further axioms and a new graph G characterizing the relations of the type A components of the queer crystal. We provide a counterexample to Assaf’s and Oguz’ conjecture that the local queer axioms uniquely characterize the queer supercrystal. We obtain a combinatorial description of the graph G on the type A components by providing explicit combinatorial rules for the odd queer operators on certain highest weight elements.
more »
« less
- PAR ID:
- 10287087
- Date Published:
- Journal Name:
- Advances in mathematical sciences
- Volume:
- 21
- ISSN:
- 2664-598X
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
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
-
We define a combinatorial model for $$F$$-polynomials and $$g$$-vectors for type $$D_n$$ cluster algebras where the associated quiver is acyclic. Our model utilizes a combination of dimer configurations and double dimer configurations which we refer to as mixed dimer configurations. In particular, we give a graph theoretic recipe that describes which monomials appear in such $$F$$-polynomials, as well as a graph theoretic way to determine the coefficients of each of these monomials. In addition, we prove that a weighting on our mixed dimer configuration model yields the associated $$g$$-vector. To prove this formula, we use a combinatorial formula due to Thao Tran (arXiv:0911.4462, 2009) and provide explicit bijections between her combinatorial model and our own.more » « less
-
Bringmann, Karl; Grohe, Martin; Puppis, Gabriele; Svensson, Ola (Ed.)Graph classes of bounded tree rank were introduced recently in the context of the model checking problem for first-order logic of graphs. These graph classes are a common generalization of graph classes of bounded degree and bounded treedepth, and they are a special case of graph classes of bounded expansion. We introduce a notion of decomposition for these classes and show that these decompositions can be efficiently computed. Also, a natural extension of our decomposition leads to a new characterization and decomposition for graph classes of bounded expansion (and an efficient algorithm computing this decomposition). We then focus on interpretations of graph classes of bounded tree rank. We give a characterization of graph classes interpretable in graph classes of tree rank 2. Importantly, our characterization leads to an efficient sparsification procedure: For any graph class 𝒞 interpretable in a graph class of tree rank at most 2, there is a polynomial time algorithm that to any G ∈ 𝒞 computes a (sparse) graph H from a fixed graph class of tree rank at most 2 such that G = I(H) for a fixed interpretation I. To the best of our knowledge, this is the first efficient "interpretation reversal" result that generalizes the result of Gajarský et al. [LICS 2016], who showed an analogous result for graph classes interpretable in classes of graphs of bounded degree.more » « less
-
Etessami, Kousha; Feige, Uriel; Puppis, Gabriele (Ed.)A class of graphs C is monadically stable if for every unary expansion Ĉ of C, one cannot encode - using first-order transductions - arbitrarily long linear orders in graphs from C. It is known that nowhere dense graph classes are monadically stable; these include classes of bounded maximum degree and classes that exclude a fixed topological minor. On the other hand, monadic stability is a property expressed in purely model-theoretic terms that is also suited for capturing structure in dense graphs. In this work we provide a characterization of monadic stability in terms of the Flipper game: a game on a graph played by Flipper, who in each round can complement the edge relation between any pair of vertex subsets, and Localizer, who in each round is forced to restrict the game to a ball of bounded radius. This is an analog of the Splitter game, which characterizes nowhere dense classes of graphs (Grohe, Kreutzer, and Siebertz, J. ACM '17). We give two different proofs of our main result. The first proof is based on tools borrowed from model theory, and it exposes an additional property of monadically stable graph classes that is close in spirit to definability of types. Also, as a byproduct, we show that monadic stability for graph classes coincides with monadic stability of existential formulas with two free variables, and we provide another combinatorial characterization of monadic stability via forbidden patterns. The second proof relies on the recently introduced notion of flip-flatness (Dreier, Mählmann, Siebertz, and Toruńczyk, arXiv 2206.13765) and provides an efficient algorithm to compute Flipper’s moves in a winning strategy.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1007/978-3-030-42687-3_4
