14,159 research outputs found

    Contractions, Hopf algebra extensions and cov. differential calculus

    Full text link
    We re-examine all the contractions related with the Uq(su(2)){\cal U}_q(su(2)) deformed algebra and study the consequences that the contraction process has for their structure. We also show using Uq(su(2))×U(u(1)){\cal U}_q(su(2))\times{\cal U}(u(1)) as an example that, as in the undeformed case, the contraction may generate Hopf algebra cohomology. We shall show that most of the different Hopf algebra deformations obtained have a bicrossproduct or a cocycle bicrossproduct structure, for which we shall also give their dual `group' versions. The bicovariant differential calculi on the deformed spaces associated with the contracted algebras and the requirements for their existence are examined as well.Comment: TeX file, 25 pages. Macros are include

    Effective actions, relative cohomology and Chern Simons forms

    Full text link
    The explicit expression of all the WZW effective actions for a simple group G broken down to a subgroup H is established in a simple and direct way, and the formal similarity of these actions to the Chern-Simons forms is explained. Applications are also discussed.Comment: 11 pages. Latex2e file. Published versio

    Towards Parameterized Regular Type Inference Using Set Constraints

    Full text link
    We propose a method for inferring \emph{parameterized regular types} for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint systems). Such parameterized regular types generalize \emph{parametric} regular types by extending the scope of the parameters in the type definitions so that such parameters can relate the types of different predicates. We propose a number of enhancements to the procedure for solving the constraint systems that improve the precision of the type descriptions inferred. The resulting algorithm, together with a procedure to establish a set constraint system from a logic program, yields a program analysis that infers tighter safe approximations of the success types of the program than previous comparable work, offering a new and useful efficiency vs. precision trade-off. This is supported by experimental results, which show the feasibility of our analysis
    corecore