1,137 research outputs found

    The second cohomology of sl(m|1) with coefficients in its enveloping algebra is trivial

    Full text link
    Using techniques developed in a recent article by the authors, it is proved that the 2-cohomology of the Lie superalgebra sl(m|1); m > 1, with coefficients in its enveloping algebra is trivial. The obstacles in solving the analogous problem for sl(3|2) are also discussed.Comment: 15 pages, Latex, no figure

    Das Vitamin-C-Problem

    Get PDF

    Coherent State Construction of Representations of osp(2|2) and Primary Fields of osp(2|2) Conformal Field Theory

    Full text link
    Representations of the superalgebra osp(22)osp(2|2) and current superalgebra osp(22)k(1)osp(2|2)^{(1)}_k in the standard basis are investigated. All finite-dimensional typical and atypical representations of osp(22)osp(2|2) are constructed by the vector coherent state method. Primary fields of the non-unitary conformal field theory associated with osp(22)k(1)osp(2|2)^{(1)}_k in the standard basis are constructed for arbitrary level kk.Comment: 12 pages, cosmetic changes, to appear in Phys. Lett.

    Weak Secrecy in the Multi-Way Untrusted Relay Channel with Compute-and-Forward

    Full text link
    We investigate the problem of secure communications in a Gaussian multi-way relay channel applying the compute-and-forward scheme using nested lattice codes. All nodes employ half-duplex operation and can exchange confidential messages only via an untrusted relay. The relay is assumed to be honest but curious, i.e., an eavesdropper that conforms to the system rules and applies the intended relaying scheme. We start with the general case of the single-input multiple-output (SIMO) L-user multi-way relay channel and provide an achievable secrecy rate region under a weak secrecy criterion. We show that the securely achievable sum rate is equivalent to the difference between the computation rate and the multiple access channel (MAC) capacity. Particularly, we show that all nodes must encode their messages such that the common computation rate tuple falls outside the MAC capacity region of the relay. We provide results for the single-input single-output (SISO) and the multiple-input single-input (MISO) L-user multi-way relay channel as well as the two-way relay channel. We discuss these results and show the dependency between channel realization and achievable secrecy rate. We further compare our result to available results in the literature for different schemes and show that the proposed scheme operates close to the compute-and-forward rate without secrecy.Comment: submitted to JSAC Special Issue on Fundamental Approaches to Network Coding in Wireless Communication System

    The Fuzzy Supersphere

    Full text link
    We introduce the fuzzy supersphere as sequence of finite-dimensional, noncommutative Z2Z_{2}-graded algebras tending in a suitable limit to a dense subalgebra of the Z2Z_{2}-graded algebra of H{\cal H}^{\infty}-functions on the (22)(2| 2)-dimensional supersphere. Noncommutative analogues of the body map (to the (fuzzy) sphere) and the super-deRham complex are introduced. In particular we reproduce the equality of the super-deRham cohomology of the supersphere and the ordinary deRham cohomology of its body on the "fuzzy level".Comment: 33 pages, LaTeX, some typos correcte
    corecore