38 research outputs found

    Box Graphs and Singular Fibers

    Get PDF
    We determine the higher codimension fibers of elliptically fibered Calabi-Yau fourfolds with section by studying the three-dimensional N=2 supersymmetric gauge theory with matter which describes the low energy effective theory of M-theory compactified on the associated Weierstrass model, a singular model of the fourfold. Each phase of the Coulomb branch of this theory corresponds to a particular resolution of the Weierstrass model, and we show that these have a concise description in terms of decorated box graphs based on the representation graph of the matter multiplets, or alternatively by a class of convex paths on said graph. Transitions between phases have a simple interpretation as `flopping' of the path, and in the geometry correspond to actual flop transitions. This description of the phases enables us to enumerate and determine the entire network between them, with various matter representations for all reductive Lie groups. Furthermore, we observe that each network of phases carries the structure of a (quasi-)minuscule representation of a specific Lie algebra. Interpreted from a geometric point of view, this analysis determines the generators of the cone of effective curves as well as the network of flop transitions between crepant resolutions of singular elliptic Calabi-Yau fourfolds. From the box graphs we determine all fiber types in codimensions two and three, and we find new, non-Kodaira, fiber types for E_6, E_7 and E_8.Comment: 107 pages, 44 figures, v2: added case of E7 monodromy-reduced fiber

    Loopless Algorithms to Generate Maximum Length Gray Cycles wrt. k-Character Substitution

    Full text link
    Given a binary word relation τ\tau onto AA^* and a finite language XAX\subseteq A^*, a τ\tau-Gray cycle over XX consists in a permutation (w[i])0iX1\left(w_{[i]}\right)_{0\le i\le |X|-1} of XX such that each word w[i]w_{[i]} is an image under τ\tau of the previous word w[i1]w_{{[i-1]}}. We define the complexity measure λA,τ(n)\lambda_{A,\tau}(n), equal to the largest cardinality of a language XX having words of length at most nn, and s.t. some τ\tau-Gray cycle over XX exists. The present paper is concerned with τ=σk\tau=\sigma_k, the so-called kk-character substitution, s.t. (u,v)σk(u,v)\in\sigma_k holds if, and only if, the Hamming distance of uu and vv is kk. We present loopless (resp., constant amortized time) algorithms for computing specific maximum length \sigma_k$-Gray cycles.Comment: arXiv admin note: text overlap with arXiv:2108.1365

    Skew Howe duality and limit shapes of Young diagrams

    Full text link
    We consider the skew Howe duality for the action of certain dual pairs of Lie groups (G1,G2)(G_1, G_2) on the exterior algebra (CnCk)\bigwedge(\mathbb{C}^{n} \otimes \mathbb{C}^{k}) as a probability measure on Young diagrams by the decomposition into the sum of irreducible representations. We prove a combinatorial version of this skew Howe for the pairs (GLn,GLk)(\mathrm{GL}_{n}, \mathrm{GL}_{k}), (SO2n+1,Pin2k)(\mathrm{SO}_{2n+1}, \mathrm{Pin}_{2k}), (Sp2n,Sp2k)(\mathrm{Sp}_{2n}, \mathrm{Sp}_{2k}), and (Or2n,SOk)(\mathrm{Or}_{2n}, \mathrm{SO}_{k}) using crystal bases, which allows us to interpret the skew Howe duality as a natural consequence of lattice paths on lozenge tilings of certain partial hexagonal domains. The G1G_1-representation multiplicity is given as a determinant formula using the Lindstr\"om-Gessel-Viennot lemma and as a product formula using Dodgson condensation. These admit natural qq-analogs that we show equals the qq-dimension of a G2G_2-representation (up to an overall factor of qq), giving a refined version of the combinatorial skew Howe duality. Using these product formulas (at q=1q =1), we take the infinite rank limit and prove the diagrams converge uniformly to the limit shape.Comment: 54 pages, 12 figures, 2 tables; v2 fixed typos in Theorem 4.10, 4.14, shorter proof of Theorem 4.6 (thanks to C. Krattenthaler), proved of Conjecture 4.17 in v
    corecore