4d N = 3 $$ \mathcal{N}=3 $$ indices via discrete gauging
نویسندگان
چکیده
منابع مشابه
Gauging N =4 Supersymmetric Mechanics
We argue that off-shell dualities between d=1 supermultiplets with different sets of physical bosonic components and the same number of fermionic ones are related to gauging some symmetries in the actions of the supermultiplets with maximal sets of physical bosons. Our gauging procedure uses off-shell superfields and so is manifestly supersym-metric. We focus on N =4 supersymmetric mechanics an...
متن کاملGauging the Shadow Sector with SO(3)
We examine the phenomenology of a low-energy extension of the Standard Model, based on the gauge group SU(3) ⊗ SU(2) ⊗ U(1) ⊗ SO(3), with SO(3) operating in the shadow sector. This model offers νe → νs and νμ → ντ oscillations as the solution of the solar and atmospheric neutrino problems. Moreover, it provides a neutral heavy shadow lepton X that could play the role of a cold dark matter parti...
متن کامل2 3 Ju n 19 94 GRAPHICAL MAJOR INDICES
A generalization of the classical statistics “maj” and “inv” (the major index and number of inversions) on words is introduced, parameterized by arbitrary graphs on the underlying alphabet. The question of characterizing those graphs that lead to equi-distributed “inv” and “maj” is posed and answered. Résumé: On introduit une généralisation des statistiques classiques que sont “maj” et “inv” (l...
متن کاملGauging Similarity with n-Grams: Language-Independent Categorization of Text.
A language-independent means of gauging topical similarity in unrestricted text is described. The method combines information derived from n-grams (consecutive sequences of n characters) with a simple vector-space technique that makes sorting, categorization, and retrieval feasible in a large multilingual collection of documents. No prior information about document content or language is requir...
متن کاملComputing a Discrete Logarithm in O(n^3)
This paper presents a means with time complexity of at worst O(n) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduction of the problem to that of finding the concurrent zeros of two periodic functions in the real numbers. The problem is treated as an analog to a form of analog rotor code computed cipher. The computation of a Discret...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2018
ISSN: 1029-8479
DOI: 10.1007/jhep10(2018)131