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.

Twisted sl(3, C)(k)((2)) current algebra: free field representation and screening currents

Motivated by application of twisted current algebra in description of the entropy of Ads(3) black hole, we investigate the simplest twisted current algebra sl(3, c)(k)((2)). Free field representation of the twisted algebra, and the corresponding twisted Sugawara energy-momentum tensor are obtained by using three (beta, gamma) pairs and two scalar fields. Primary fields and two screening currents of the first kind are presented. (C) 2001 Published by Elsevier Science B.V.

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.

Free field and parafermionic realizations of twisted su(3)(k)((2)) current algebra

Free field and twisted parafermionic representations of twisted su(3)(k)((2)) current algebra are obtained. The corresponding twisted Sugawara energy-momentum tensor is given in terms of three (beta, gamma) pairs and two scalar fields and also in terms of twisted parafermionic currents and one scalar field. Two screening currents of the first kind are presented in terms of the free fields.

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.

Alguns desafios de Clifford Pickover : dos números vampiros aos quadrados mágicos

Clifford Alan Pickover nasceu a 15 de agosto de 1957. Este americano é um reconhecido divulgador da Ciência e da Matemática, tendo publicado até ao momento mais de quarenta livros em mais de uma dúzia de línguas. (...) O principal interesse de Pickover está em encontrar novas maneiras de expandir a criatividade, estabelecendo conexões entre áreas aparentemente díspares do esforço humano, como a Arte, a Ciência e a Matemática. (...) Em 1994, Pickover introduziu uma nova classe de números, de certa forma peculiar: os números vampiros. (...) Um número vampiro é um número natural, v, com um número par de algarismos (n), que pode ser escrito como um produto de dois números naturais, x e y, cada um com metade do número de algarismos (n/2) e de forma a que os algarismos utilizados sejam os mesmos (eventualmente escritos por ordem diferente). (...) Na fatorização de um número vampiro, apenas um dos fatores pode ser múltiplo de 10 (ou seja, apenas um dos fatores pode ter o 0 como algarismo das unidades). Assim, 1260 é um número vampiro uma vez que 1260 = 21x60, mas 126 000 já não é um número vampiro apesar de 126 000 = 210x600. Isto porque, no segundo caso, ambos os fatores são múltiplos de 10. (...) Pickover também é adepto de quadrados mágicos. (...)

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

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.

K-invariantes en el algebra universal de un grupo de Lie semisimple

Tarea (A):(...) Trataremos de extender a Sp(n,1) los resultados conseguidos sobre la imagen del homomorfismo de Lepowsky cuando G es SO(n,1) ó SU(n,1). (...) Tarea (B): (...) Para todo grupo de Lie de rango uno, con rango (G) = rango (K), los elementos del álgebra B son W-invariantes y que este resultado ya ha sido establecido para los grupos SO(2n,1) y SU(n,1); durante el período correspondiente a este subsidio esperamos extender este resultado a todo grupo de Lie de rango uno con rango (G) = rango (K). Tarea (C): Durante este período esperamos también avanzar en la determinación del dual unitario del grupo Spin (2n,C).