20 research outputs found

    Chiral Rings, Vacua and Gaugino Condensation of Supersymmetric Gauge Theories

    Full text link
    We find the complete chiral ring relations of the supersymmetric U(N) gauge theories with matter in adjoint representation. We demonstrate exact correspondence between the solutions of the chiral ring and the supersymmetric vacua of the gauge theory. The chiral ring determines the expectation values of chiral operators and the low energy gauge group. All the vacua have nonzero gaugino condensation. We study the chiral ring relations obeyed by the gaugino condensate. These relations are generalizations of the formula SN=Λ3NS^N=\Lambda^{3N} of the pure N=1{\cal N} =1 gauge theory.Comment: 38 page

    Categorification of persistent homology

    Full text link
    We redevelop persistent homology (topological persistence) from a categorical point of view. The main objects of study are diagrams, indexed by the poset of real numbers, in some target category. The set of such diagrams has an interleaving distance, which we show generalizes the previously-studied bottleneck distance. To illustrate the utility of this approach, we greatly generalize previous stability results for persistence, extended persistence, and kernel, image and cokernel persistence. We give a natural construction of a category of interleavings of these diagrams, and show that if the target category is abelian, so is this category of interleavings.Comment: 27 pages, v3: minor changes, to appear in Discrete & Computational Geometr

    On Haagerup's list of potential principal graphs of subfactors

    Full text link
    We show that any graph, in the sequence given by Haagerup in 1991 as that of candidates of principal graphs of subfactors, is not realized as a principal graph except for the smallest two. This settles the remaining case of a previous work of the first author.Comment: 19 page

    REPORT OF EXPLOSION AND FIRE IN HYDROGEN LIQUEFIER APPARATUS

    No full text

    Abelian Groups and Character Sums

    No full text

    The Zero Divisor Graph of 2 × 2 Matrices Over a Field

    No full text

    Factoring Groups Efficiently

    No full text

    A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory

    No full text
    Abstract. We prove a unique decomposition theorem for a class of ordered commutative monoids. Then, we use our theorem to establish that every weakly normed process definable in ACP ε with bounded communication can be expressed as the parallel composition of a multiset of weakly normed parallel prime processes in exactly one way.
    corecore