Twisted quantum affine superalgebra U-q[sl(2/2)((2))], U-q[osp(2/2)] invariant R-matrices and a new integrable electronic model

We describe the twisted affine superalgebra sl(2\2)((2)) and its quantized version U-q[sl(2\2)((2))]. We investigate the tensor product representation of the four-dimensional grade star representation for the fixed-point sub superalgebra U-q[osp(2\2)]. We work out the tensor product decomposition explicitly and find that the decomposition is not completely reducible. Associated with this four-dimensional grade star representation we derive two U-q[osp(2\2)] invariant R-matrices: one of them corresponds to U-q [sl(2\2)(2)] and the other to U-q [osp(2\2)((1))]. Using the R-matrix for U-q[sl(2\2)((2))], we construct a new U-q[osp(2\2)] invariant strongly correlated electronic model, which is integrable in one dimension. Interestingly this model reduces in the q = 1 limit, to the one proposed by Essler et al which has a larger sl(2\2) symmetry.

Comments on the Drinfeld realization of the quantum affine superalgebra U-q[gl(m backslash n)(1)] and its Hopf algebra structure

By generalizing the Reshetikhin and Semenov-Tian-Shansky construction to supersymmetric cases, we obtain the Drinfeld current realization for the quantum affine superalgebra U-q[gl(m\n)((1))]. We find a simple coproduct for the quantum current generators and establish the Hopf algebra structure of this super current algebra.

Decay chain differential equations: Solution through matrix algebra

A matricial method to solve the decay chain differential equations system is presented. The quantity of each nuclide in the chain at a time t may be evaluated by analytical expressions obtained in a simple way using recurrence relations. This method may be applied to problems of radioactive buildup and decay and can be easily implemented computationally. (C) 2009 Elsevier B.V. All rights reserved.

Izergin-Korepin model with a boundary

The Izergin-Korepin model on a semi-infinite lattice is diagonalized by using the level-one vertex operators of the twisted quantum affine algebra U-q[((2))(2)]. We give the bosonization of the vacuum state with zero particle content. Excitation states are given by the action of the vertex operators on the vacuum state. We derive the boundary S-matrix. We give an integral expression of the correlation functions of the boundary model, and derive the difference equations which they satisfy. (C) 2001 Elsevier Science B.V. All rights reserved.

MapScript: A map algebra programming language incorporating neighborhood analysis

Map algebra is a data model and simple functional notation to study the distribution and patterns of spatial phenomena. It uses a uniform representation of space as discrete grids, which are organized into layers. This paper discusses extensions to map algebra to handle neighborhood operations with a new data type called a template. Templates provide general windowing operations on grids to enable spatial models for cellular automata, mathematical morphology, and local spatial statistics. A programming language for map algebra that incorporates templates and special processing constructs is described. The programming language is called MapScript. Example program scripts are presented to perform diverse and interesting neighborhood analysis for descriptive, model-based and processed-based analysis.

Integrability and exact solution for coupled BCS systems associated with the su(4) Lie algebra

We introduce an integrable model for two coupled BCS systems through a solution of the Yang-Baxter equation associated with the Lie algebra su(4). By employing the algebraic Bethe ansatz, we determine the exact solution for the energy spectrum. An asymptotic analysis is conducted to determine the leading terms in the ground state energy, the gap and some one point correlation functions at zero temperature. (C) 2002 Published by Elsevier Science B.V.

R-matrices and the tensor product graph method

A systematic method for constructing trigonometric R-matrices corresponding to the (multiplicity-free) tensor product of any two affinizable representations of a quantum algebra or superalgebra has been developed by the Brisbane group and its collaborators. This method has been referred to as the Tensor Product Graph Method. Here we describe applications of this method to untwisted and twisted quantum affine superalgebras.

Linear algebra: selected problems

Linear Algebra—Selected Problems is a unique book for senior undergraduate and graduate students to fast review basic materials in Linear Algebra. Vector spaces are presented first, and linear transformations are reviewed secondly. Matrices and Linear systems are presented. Determinants and Basic geometry are presented in the last two chapters. The solutions for proposed excises are listed for readers to references.

Deciding Kleene Algebra Terms Equivalence in Coq

This paper presents a mechanically verified implementation of an algorithm for deciding the equivalence of Kleene algebra terms within the Coq proof assistant. The algorithm decides equivalence of two given regular expressions through an iterated process of testing the equivalence of their partial derivatives and does not require the construction of the corresponding automata. Recent theoretical and experimental research provides evidence that this method is, on average, more efficient than the classical methods based on automata. We present some performance tests, comparisons with similar approaches, and also introduce a generalization of the algorithm to decide the equivalence of terms of Kleene algebra with tests. The motivation for the work presented in this paper is that of using the libraries developed as trusted frameworks for carrying out certified program verification.

Using relational algebra on the specification of real world ETL processes

Modeling Extract-Transform-Load (ETL) processes of a Data Warehousing System has always been a challenge. The heterogeneity of the sources, the quality of the data obtained and the conciliation process are some of the issues that must be addressed in the design phase of this critical component. Commercial ETL tools often provide proprietary diagrammatic components and modeling languages that are not standard, thus not providing the ideal separation between a modeling platform and an execution platform. This separation in conjunction with the use of standard notations and languages is critical in a system that tends to evolve through time and which cannot be undermined by a normally expensive tool that becomes an unsatisfactory component. In this paper we demonstrate the application of Relational Algebra as a modeling language of an ETL system as an effort to standardize operations and provide a basis for uncommon ETL execution platforms.

A relational algebra approach to ETL modeling

The MAP-i Doctoral Programme in Informatics, of the Universities of Minho, Aveiro and Porto

Recurrence relations for Clifford algebra-valued orthogonal polynomials

The theory of orthogonal polynomials of one real or complex variable is well established as well as its generalization for the multidimensional case. Hypercomplex function theory (or Clifford analysis) provides an alternative approach to deal with higher dimensions. In this context, we study systems of orthogonal polynomials of a hypercomplex variable with values in a Clifford algebra and prove some of their properties.

A linear algebra approach to OLAP

Inspired by the relational algebra of data processing, this paper addresses the foundations of data analytical processing from a linear algebra perspective. The paper investigates, in particular, how aggregation operations such as cross tabulations and data cubes essential to quantitative analysis of data can be expressed solely in terms of matrix multiplication, transposition and the Khatri–Rao variant of the Kronecker product. The approach offers a basis for deriving an algebraic theory of data consolidation, handling the quantitative as well as qualitative sides of data science in a natural, elegant and typed way. It also shows potential for parallel analytical processing, as the parallelization theory of such matrix operations is well acknowledged.