Eigenvalues of Casimir invariants for unitary irreps of Uq(gl(m vertical bar n))

A fully explicit formula for the eigenvalues of Casimir invariants for U-q(gl(m/n)) is given which applies to all unitary irreps. This is achieved by making some interesting observations on atypicality indices for irreps occurring in the tensor product of unitary irreps of the same type. These results have applications in the determination of link polynomials arising from unitary irreps of U-q(gl(m/n)).

Casimir invariants and characteristic identities for gl(infinity)

A full set of (higher-order) Casimir invariants for the Lie algebra gl(infinity) is constructed and shown to be well defined in the category O-FS generated by the highest weight (unitarizable) irreducible representations with only a finite number of nonzero weight components. Moreover, the eigenvalues of these Casimir invariants are determined explicitly in terms of the highest weight. Characteristic identities satisfied by certain (infinite) matrices with entries from gl(infinity) are also determined and generalize those previously obtained for gl(n) by Bracken and Green [A. J. Bracken and H. S. Green, J. Math. Phys. 12, 2099 (1971); H. S. Green, ibid. 12, 2106 (1971)]. (C) 1997 American Institute of Physics.

Link invariants associated with gauge equivalent solutions of the Yang-Baxter equation: The one-parameter family of minimal typical representations of Uq[gl(2|1)]

In this paper we investigate the construction of state models for link invariants using representations of the braid group obtained from various gauge choices for a solution of the trigonometric Yang-Baxter equation. Our results show that it is possible to obtain invariants of regular isotopy (as defined by Kauffman) which may not be ambient isotopic. We illustrate our results with explicit computations using solutions of the trigonometric Yang-Baxter equation associated with the one-parameter family of minimal typical representations of the quantum superalgebra U-q,[gl(2/1)]. We have implemented MATHEMATICA code to evaluate the invariants for all prime knots up to 10 crossings.

Eigenvalues of Casimir invariants for Uq[osp(m|n)]

For each quantum superalgebra U-q[osp(m parallel to n)] with m > 2, an infinite family of Casimir invariants is constructed. This is achieved by using an explicit form for the Lax operator. The eigenvalue of each Casimir invariant on an arbitrary irreducible highest weight module is also calculated. (c) 2005 American Institute of Physics.

Eigenvalues of Casimir operators for gl(m/infinity)

A full set of Casimir operators for the Lie superalgebra gl(m/infinity) is constructed and shown to be well defined in the category O-FS generated by the highest-weight irreducible representations with only a finite number of non-zero weight components. The eigenvalues of these Casimir operators are determined explicitly in terms of the highest weight. Characteristic identities satisfied by certain (infinite) matrices with entries from gl(m/infinity) are also determined.

Refining specifications to logic programs

The refinement calculus provides a framework for the stepwise development of imperative programs from specifications. In this paper we study a refinement calculus for deriving logic programs. Dealing with logic programs rather than imperative programs has the dual advantages that, due to the expressive power of logic programs, the final program is closer to the original specification, and each refinement step can achieve more. Together these reduce the overall number of derivation steps. We present a logic programming language extended with specification constructs (including general predicates, assertions, and types and invariants) to form a wide-spectrum language. General predicates allow non-executable properties to be included in specifications. Assertions, types and invariants make assumptions about the intended inputs of a procedure explicit, and can be used during refinement to optimize the constructed logic program. We provide a semantics for the extended logic programming language and derive a set of refinement laws. Finally we apply these to an example derivation.

A formal object-oriented approach to defining consistency constraints for UML models

We discuss how integrity consistency constraints between different UML models can be precisely defined at a language level. In doing so, we introduce a formal object-oriented metamodeling approach. In the approach, integrity consistency constraints between UML models are defined in terms of invariants of the UML model elements used to define the models at the language-level. Adopting a formal approach, constraints are formally defined using Object-Z. We demonstrate how integrity consistency constraints for UML models can be precisely defined at the language-level and once completed, the formal description of the consistency constraints will be a precise reference of checking consistency of UML models as well as for tool development.