38 research outputs found
Box Graphs and Singular Fibers
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
Given a binary word relation onto and a finite language
, a -Gray cycle over consists in a permutation
of such that each word
is an image under of the previous word . We define the
complexity measure , equal to the largest cardinality of a
language having words of length at most , and s.t. some -Gray
cycle over exists. The present paper is concerned with , the
so-called -character substitution, s.t. holds if, and
only if, the Hamming distance of and is . 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
We consider the skew Howe duality for the action of certain dual pairs of Lie
groups on the exterior algebra 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 , ,
, and 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 -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
-analogs that we show equals the -dimension of a -representation (up
to an overall factor of ), giving a refined version of the combinatorial
skew Howe duality. Using these product formulas (at ), 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
Recommended from our members
Representation Theory of Quivers and Finite Dimensional Algebras
Methods and results from the representation theory of quivers and finite dimensional algebras have led to many interactions with other areas of mathematics. Such areas include the theory of Lie algebras and
quantum groups, commutative algebra, algebraic geometry and topology, and in particular the new theory of cluster algebras. The aim of this workshop was to further develop such interactions and to stimulate progress in the representation theory of algebras