Hq(4) symmetry: the linear q-harmonic oscillator based on generalized irreps of the q-deformed Heisenberg algebra

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

On linear order and computation : The expressiveness of interactive computations on linear orders and computations indexed by ordinals

We solve the Dynamic Ehrenfeucht-Fra\"iss\'e Game on linear orders for both players, yielding a normal form for quantifier-rank equivalence classes of linear orders in first-order logic, infinitary logic, and generalized-infinitary logics with linearly ordered clocks. We show that Scott Sentences can be manipulated quickly, classified into local information, and consistency can be decided effectively in the length of the Scott Sentence. We describe a finite set of linked automata moving continuously on a linear order. Running them on ordinals, we compute the ordinal truth predicate and compute truth in the constructible universe of set-theory. Among the corollaries are a study of semi-models as efficient database of both model-theoretic and formulaic information, and a new proof of the atomicity of the Boolean algebra of sentences consistent with the theory of linear order -- i.e., that the finitely axiomatized theories of linear order are dense.

On Computation of Minimum Distance of Linear Block Codes Above 1/2 Rate Coding

The minimum distance of linear block codes is one of the important parameter that indicates the error performance of the code. When the code rate is less than 1/2, efficient algorithms are available for finding minimum distance using the concept of information sets. When the code rate is greater than 1/2, only one information set is available and efficiency suffers. In this paper, we investigate and propose a novel algorithm to find the minimum distance of linear block codes with the code rate greater than 1/2. We propose to reverse the roles of information set and parity set to get virtually another information set to improve the efficiency. This method is 67.7 times faster than the minimum distance algorithm implemented in MAGMA Computational Algebra System for a (80, 45) linear block code.

The algebra and geometry of SU(3) matrices

We give an elementary treatment of the defining representation and Lie algebra of the three-dimensional unitary unimodular group SU(3). The geometrical properties of the Lie algebra, which is an eight dimensional real Linear vector space, are developed in an SU(3) covariant manner. The f and d symbols of SU(3) lead to two ways of 'multiplying' two vectors to produce a third, and several useful geometric and algebraic identities are derived. The axis-angle parametrization of SU(3) is developed as a generalization of that for SU(2), and the specifically new features are brought out. Application to the dynamics of three-level systems is outlined.

Distributed Function Computation over Fields and Rings via Linear Compression of Sources

The setting considered in this paper is one of distributed function computation. More specifically, there is a collection of N sources possessing correlated information and a destination that would like to acquire a specific linear combination of the N sources. We address both the case when the common alphabet of the sources is a finite field and the case when it is a finite, commutative principal ideal ring with identity. The goal is to minimize the total amount of information needed to be transmitted by the N sources while enabling reliable recovery at the destination of the linear combination sought. One means of achieving this goal is for each of the sources to compress all the information it possesses and transmit this to the receiver. The Slepian-Wolf theorem of information theory governs the minimum rate at which each source must transmit while enabling all data to be reliably recovered at the receiver. However, recovering all the data at the destination is often wasteful of resources since the destination is only interested in computing a specific linear combination. An alternative explored here is one in which each source is compressed using a common linear mapping and then transmitted to the destination which then proceeds to use linearity to directly recover the needed linear combination. The article is part review and presents in part, new results. The portion of the paper that deals with finite fields is previously known material, while that dealing with rings is mostly new.Attempting to find the best linear map that will enable function computation forces us to consider the linear compression of source. While in the finite field case, it is known that a source can be linearly compressed down to its entropy, it turns out that the same does not hold in the case of rings. An explanation for this curious interplay between algebra and information theory is also provided in this paper.

Some generalizations of commutativity for linear transformations on a finite dimensional vector space

Let L be the algebra of all linear transformations on an n-dimensional vector space V over a field F and let A, B, ƐL. Let A_i+1 = A_iB - BA_i, i = 0, 1, 2,…, with A = A_o. Let f_k (A, B; σ) = A_2K+1 - ^σ1^A2K-1 ^{+ σ}2^A2K-3 -… +(-1)^Kσ_KA₁ where σ = (σ₁, σ₂,…, σ_K), σ_i belong to F and K = k(k-1)/2. Taussky and Wielandt [Proc. Amer. Math. Soc., 13(1962), 732-735] showed that f_n(A, B; σ) = 0 if σ_i is the i^th elementary symmetric function of (β₄- β_s)², 1 ≤ r ˂ s ≤ n, i = 1, 2, …, N, with N = n(n-1)/2, where β₄ are the characteristic roots of B. In this thesis we discuss relations involving f_k(X, Y; σ) where X, Y Ɛ L and 1 ≤ k ˂ n. We show: 1. If F is infinite and if for each X Ɛ L there exists σ so that f_k(A, X; σ) = 0 where 1 ≤ k ˂ n, then A is a scalar transformation. 2. If F is algebraically closed, a necessary and sufficient condition that there exists a basis of V with respect to which the matrices of A and B are both in block upper triangular form, where the blocks on the diagonals are either one- or two-dimensional, is that certain products X₁, X₂…X_r belong to the radical of the algebra generated by A and B over F, where X_i has the form f₂(A, P(A,B); σ), for all polynomials P(x, y). We partially generalize this to the case where the blocks have dimensions ≤ k. 3. If A and B generate L, if the characteristic of F does not divide n and if there exists σ so that f_k(A, B; σ) = 0, for some k with 1 ≤ k ˂ n, then the characteristic roots of B belong to the splitting field of g_k(w; σ) = w^2K+1 - σ₁w^2K-1 + σ₂w^2K-3 - …. +(-1)^K σ_Kw over F. We use this result to prove a theorem involving a generalized form of property L [cf. Motzkin and Taussky, Trans. Amer. Math. Soc., 73(1952), 108-114]. 4. Also we give mild generalizations of results of McCoy [Amer. Math. Soc. Bull., 42(1936), 592-600] and Drazin [Proc. London Math. Soc., 1(1951), 222-231].

The Riesz space structure of an Abelian W*-algebra

Let M be an Abelian W*-algebra of operators on a Hilbert space H. Let M₀ be the set of all linear, closed, densely defined transformations in H which commute with every unitary operator in the commutant M’ of M. A well known result of R. Pallu de Barriere states that if ɸ is a normal positive linear functional on M, then ɸ is of the form T → (Tx, x) for some x in H, where T is in M. An elementary proof of this result is given, using only those properties which are consequences of the fact that ReM is a Dedekind complete Riesz space with plenty of normal integrals. The techniques used lead to a natural construction of the class M₀, and an elementary proof is given of the fact that a positive self-adjoint transformation in M₀ has a unique positive square root in M₀. It is then shown that when the algebraic operations are suitably defined, then M₀ becomes a commutative algebra. If ReM₀ denotes the set of all self-adjoint elements of M₀, then it is proved that ReM₀ is Dedekind complete, universally complete Riesz spaces which contains ReM as an order dense ideal. A generalization of the result of R. Pallu de la Barriere is obtained for the Riesz space ReM₀ which characterizes the normal integrals on the order dense ideals of ReM₀. It is then shown that ReM₀ may be identified with the extended order dual of ReM, and that ReM₀ is perfect in the extended sense.

Some secondary questions related to the Riesz space ReM are also studied. In particular it is shown that ReM is a perfect Riesz space, and that every integral is normal under the assumption that every decomposition of the identity operator has non-measurable cardinal. The presence of atoms in ReM is examined briefly, and it is shown that ReM is finite dimensional if and only if every order bounded linear functional on ReM is a normal integral.

Holographic dual of linear dilaton black hole in Einstein-Maxwell-dilaton-axion gravity

Motivated by the recently proposed Kerr/CFT correspondence, we investigate the holographic dual of the extremal and non-extremal rotating linear dilaton black hole in Einstein-Maxwell-Dilaton-Axion Gravity. For the case of extremal black hole, by imposing the appropriate boundary condition at spatial infinity of the near horizon extremal geometry, the Virasoro algebra of conserved charges associated with the asymptotic symmetry group is obtained. It is shown that the microscopic entropy of the dual conformal field given by Cardy formula exactly agrees with Bekenstein-Hawking entropy of extremal black hole. Then, by rewriting the wave equation of massless scalar field with sufficient low energy as the SLL(2, R) x SLR(2, R) Casimir operator, we find the hidden conformal symmetry of the non-extremal linear dilaton black hole, which implies that the non-extremal rotating linear dilaton black hole is holographically dual to a two dimensional conformal field theory with the non-zero left and right temperatures. Furthermore, it is shown that the entropy of non-extremal black hole can be reproduced by using Cardy formula.

Structure of spectra of linear operators in Banach spaces

Descriptive characterizations of the point, the continuous, and the residual spectra of operators in Banach spaces are put forward. In particular, necessary and sufficient conditions for three disjoint subsets of the complex plane to be the point spectrum, the continuous spectrum, and the residual spectrum of a linear continuous operator in a separable Banach space are obtained.

Spin spaces and positive decomposition of linear maps on ordered Banach spaces

Spin factors and generalizations are used to revisit positive generation of B(E, F), where E and F are ordered Banach spaces. Interior points of B(E, F)+ are discussed and in many cases it is seen that positive generation of B(E, F) is controlled by spin structure in F when F is a JBW-algebra.

The symmetry group of Z(q)(n) in the Lee space and the Z(qn)-linear codes

The Z(4)-linearity is a construction technique of good binary codes. Motivated by this property, we address the problem of extending the Z(4)-linearity to Z(q)n-linearity. In this direction, we consider the n-dimensional Lee space of order q, that is, (Z(q)(n), d(L)), as one of the most interesting spaces for coding applications. We establish the symmetry group of Z(q)(n) for any n and q by determining its isometries. We also show that there is no cyclic subgroup of order q(n) in Gamma(Z(q)(n)) acting transitively in Z(q)(n). Therefore, there exists no Z(q)n-linear code with respect to the cyclic subgroup.

THE ALGEBRA OF NONLOCAL CHARGES IN NONLINEAR SIGMA-MODELS

We obtain the exact classical algebra obeyed by the conserved non-local charges in bosonic non-linear sigma models. Part of the computation is specialized for a symmetry group O(N). As it turns out the algebra corresponds to a cubic deformation of the Kac-Moody algebra. We generalize the results for the presence of a Wess-Zumino term. The algebra is very similar to the previous one, now containing a calculable correction of order one unit lower. The relation with Yangians and the role of the results in the context of Lie-Poisson algebras are also discussed.

VAr planning using genetic algorithm and linear programming

A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating subproblem, which is a nonlinear, ill-conditioned and nonconvex problem, consists of determining the voltage control and the adjustment of reactive sources. The planning subproblem consists of obtaining the optimal reactive source expansion considering operational, economical and physical characteristics of the system. SLP solves the optimal reactive dispatch problem related to real variables, while SGA is used to determine the necessary adjustments of both the binary and discrete variables existing in the modelling problem. Once the set of candidate busbars has been defined, the program implemented gives the location and size of the reactive sources needed, if any, to maintain the operating and security constraints.