A Program for Computing the Cohomology of Lie Superalgebras of Vector Fields

The cohomology of Lie (super)algebras has many important applications in mathematics and physics. At present, since the required algebraic computations are very tedious, the cohomology is explicitly computed only in a few cases for different classes of Lie (super)algebras. That is why application of computer algebra methods is important for this problem. We describe an algorithm (and its C implementation) for computing the cohomology of Lie algebras and superalgebras. In elaborating the algorithm, we focused mainly on the cohomology with coefficients in trivial, adjoint, and coadjoint modules for Lie (super)algebras of the formal vector fields. These algebras have many applications to modern supersymmetric models of theoretical and mathematical physics. As an example, we consider the cohomology of the Poisson algebra Po(2) with coefficients in the trivial module and present 3- and 5-cocycles found by a computer. Bibliography: 6 titles.     

Exact Cumulant Calculations for Pearson X2 and Zelterman Statistics for r-Way Contingency Tables

Abstract

We present a computer algebra procedure that calculates exact cumulants for Pearson X ² and Zelterman statistics for r-way contingency tables. The algorithm is an example of how an overwhelming algebraic problem can be solved neatly through computer implementation by emulating tactics that one uses by hand. For inference purposes the cumulants may be used to assess chi-square approximations or to improve this approximation via Edgeworth expansions. Edgeworth approximations are compared to the computerintensive techniques of Mehta and Patel that provide exact and arbitrarily close results. Comparisons to approximations that utilize the gamma distribution (Mielke and Berry) are also made.     

Finitely Deep Matrices

In the algebraic study of deep matrices ? _X () on a finite set of indices over a field, Christopher Kennedy has recently shown that there is a unique proper ideal  whose quotient is a central simple algebra. He showed that this ideal, which doesn't appear for infinite index sets, is itself a central simple algebra. In this article we extend the result to deep matrices with a finite set of 2 or more indices over an arbitrary coordinate algebra A, showing that when the coordinates are simple there is again such a unique proper ideal, and in general that the lattice of ideals of ? _X (A)/ and  are isomorphic to the lattice of ideals of the coordinate algebra A.     

Free Skew Boolean Intersection Algebras and Set Partitions

We show that atoms of the n-generated free left-handed skew Boolean intersection algebra are in a bijective correspondence with pointed partitions of non-empty subsets of \(\{1,2,\dots , n\}\). Furthermore, under the canonical inclusion into the k-generated free algebra, where k≥n, an atom of the n-generated free algebra decomposes into an orthogonal join of atoms of the k-generated free algebra in an agreement with the containment order on the respective partitions. As a consequence of these results, we describe the structure of finite free left-handed skew Boolean intersection algebras and express several their combinatorial characteristics in terms of Bell numbers and Stirling numbers of the second kind. We also look at the infinite case. For countably many generators, our constructions lead to the ‘partition analogue’ of the Cantor tree whose boundary is the ‘partition variant’ of the Cantor set.     

The exterior algebra for Wiemann manifolds

We discuss the theory of infinite-dimensional manifolds from the point of view of establishing a widely applicable framework for generalization of the finite-dimensional Hodge theory. The principal result is the development of an exterior algebra based on a weakened definition of differentiation, so that “C^∞” partitions of unity are available for paracompact manifolds modelled on arbitrary real separable Banach spaces. We prove a Poincaré lemma for our new notion of exterior differentiation, and go on to discuss the relationship of the exterior derivative with current research efforts toward the definition of an infinite-dimensional Laplace-Beltrami operator.     

Burnside Orders,Burnside Algebras and Partition Lattices

The permutation representation theory of groups has been extended, through quasigroups, to one-sided left (or right) quasigroups. The current paper establishes a link with the theory of ordered sets, introducing the concept of a Burnside order that generalizes the poset of conjugacy classes of subgroups of a finite group. Use of the Burnside order leads to a simplification in the proof of key properties of the Burnside algebra of a left quasigroup. The Burnside order for a projection left quasigroup structure on a finite set is defined by the lattice of set partitions of that set, and it is shown that the general direct and restricted tensor product operations for permutation representations of the projection left quasigroup structure both coincide with the operation of intersection on partitions. In particular, the mark matrix of the Burnside algebra of a projection left quasigroup, a permutation-theoretic concept, emerges as dual to the zeta function of a partition lattice, an order-theoretic concept.     

Generating primitive positive clones

Suppose is a set of operations on a finite set A. Define PPC() to be the smallest primitive positive clone on A containing . For any finite algebra A, let PPC#(A) be the smallest number n for which PPC(CloA) = PPC(Clo _n A). S. Burris and R. Willard [2] conjectured that PPC#(A) ≤|A| when CloA is a primitive positive clone and |A| > 2. In this paper, we look at how large PPC#(A) can be when special conditions are placed on the finite algebra A. We show that PPC#(A) ≤|A| holds when the variety generated by A is congruence distributive, Abelian, or decidable. We also show that PPC#(A) ≤|A| + 2 if A generates a congruence permutable variety and every subalgebra of A is the product of a congruence neutral algebra and an Abelian algebra. Furthermore, we give an example in which PPC#(A) ≥|A| - 1)² so that these results are not vacuous. Received August 30, 1999; accepted in final form April 4, 2000.     

Eine Symmetrieeigenschaft von Solomons Algebra und der höheren Lie-Charaktere

Zusammenfassung  We prove here three results in chain: the result of Section 2 is a symmetry property of the higher Lie characters ofS _n (which are indexed by partitions) : their character table is essentially symmetric, up to well-known factors. This is established using plethystic methods in the algebra of symmetric functions. In Section 3, we show that for any elements ϕ,ωof the Solomon descent algebra ofS _n , one hasc( ϕ)(ω) =c(ω ϕ), wherec is the Solomon mapping from this algebra to the space of central functions onS _n (implicitly extended to its group algebra). We address also the question whether this is true for each finite Coxeter group. Then in the last section, we deduce a new proof of a result of Gessel and the second author that gives the number of permutations with given cycle type and descent set as scalar product of two special characters.     

Characters of Fundamental Representations of Quantum Affine Algebras

We give closed formulae for the q-characters of the fundamental representations of the quantum loop algebra of a classical Lie algebra, in terms of a family of partitions satisfying some simple properties. We also give the multiplicities of the eigenvalues of the imaginary subalgebra in terms of these partitions.     

On Description of Leibniz Algebras Corresponding to sl 2

In this paper we describe finite-dimensional complex Leibniz algebras whose quotient algebra with respect to the ideal I generated by squares is isomorphic to the simple Lie algebra sl ₂. It is shown that the number of isomorphism classes such of Leibniz algebras coincides with the number of partitions of dim I.     

THE SHORTEST NOTE ON THE SMALLEST COREFLECTIVE SUBCATEGORIES OF TOP

Abstract

Using the notion of a spectral set introduced by von-Neumann, we give some characterizations of C⁺ -algebras. Two conditions, each of which is necessary and sufficient for a Banach algebra to be uniform, are also obtained.     

SECOND-ORDER BOOLEAN ALGEBRAS

Opgedra aan Prof. Hennie Schutte by geleentheid van sy sestigste verjaarsdag.

Abstract

A Boolean algebra is the algebraic version of a field of sets. The complex algebra C(B) of a Boolean algebra B is defined over the power set of B; it is a field of sets with extra operations. The notion of a second-order Boolean algebra is intended to be the algebraic version of the complex algebra of a Boolean algebra. To this end a representation theorem is proved.     

A few pedagogical designs in linear algebra with Cabri and Maple

Since the 90’s, with the creation of new electronic environments for learning and teaching, several research groups in Mathematics Education have been emerging and developing. This article elaborates few pedagogical designs in Linear Algebra supported by both the geometrical micro-world Cabri and the computer algebra system Maple. Stumbling blocks in the learning of Linear Algebra are examined, more exactly linear transformations, eigenvectors, quadratic forms, conics with changes of bases and finally singular values. Encountering a special group of students very eager to explore the world of linear algebra, we initiated a classification of linear transformations of the Euclidean plane R² via ellipses.     

Gray Codes,Loopless Algorithm and Partitions

The generation of efficient Gray codes and combinatorial algorithms that list all the members of a combinatorial object has received a lot of attention in the last few years. Knuth gave a code for the set of all partitions of [n] = {1,2,...,n}. Ruskey presented a modified version of Knuth’s algorithm with distance 2. Ehrlich introduced a looplees algorithm for the set of the partitions of [n]; Ruskey and Savage generalized Ehrlich’s results and introduced two Gray codes for the set of partitions of [n]. In this paper, we give another combinatorial Gray code for the set of the partitions of [n] which differs from the aforementioned Gray codes. Also, we construct a different loopless algorithm for generating the set of all partitions of [n] which gives a constant time between successive partitions in the construction process.      

Multilinear function series and transforms in free probability theory

The algebra Mul?B? of formal multilinear function series over an algebra B and its quotient SymMul?B? are introduced, as well as corresponding operations of formal composition. In the setting of Mul?B?, the unsymmetrized R- and T-transforms of random variables in B-valued noncommutative probability spaces are introduced. These satisfy properties analogous to the usual R- and T-transforms (the latter being just the reciprocal of the S-transform), but describe all moments of a random variable, not only the symmetric moments. The partially ordered set of noncrossing linked partitions is introduced and is used to prove properties of the unsymmetrized T-transform.     

Free quasi-symmetric functions and descent algebras for wreath products, and noncommutative multi-symmetric functions

We introduce analogs of the Hopf algebra of Free quasi-symmetric functions with bases labeled by colored permutations. When the color set is a semigroup, an internal product can be introduced. This leads to the construction of generalized descent algebras associated with wreath products Γ?S_n and to the corresponding generalizations of quasi-symmetric functions. The associated Hopf algebras appear as natural analogs of McMahon’s multisymmetric functions. As a consequence, we obtain an internal product on ordinary multi-symmetric functions. We extend these constructions to Hopf algebras of colored parking functions, colored non-crossing partitions and parking functions of type B.     

A self paired Hopf algebra on double posets and a Littlewood-Richardson rule

Let D be the set of isomorphism types of finite double partially ordered sets, that is sets endowed with two partial orders. On ZD we define a product and a coproduct, together with an internal product, that is, degree-preserving. With these operations ZD is a Hopf algebra. We define a symmetric bilinear form on this Hopf algebra: it counts the number of pictures (in the sense of Zelevinsky) between two double posets. This form is a Hopf pairing, which means that product and coproduct are adjoint each to another. The product and coproduct correspond respectively to disjoint union of posets and to a natural decomposition of a poset into order ideals. Restricting to special double posets (meaning that the second order is total), we obtain a notion equivalent to Stanley's labelled posets, and a Hopf subalgebra already considered by Blessenohl and Schocker. The mapping which maps each double poset onto the sum of the linear extensions of its first order, identified via its second (total) order with permutations, is a Hopf algebra homomorphism, which is isometric and preserves the internal product, onto the Hopf algebra of permutations, previously considered by the two authors. Finally, the scalar product between any special double poset and double posets naturally associated to integer partitions is described by an extension of the Littlewood-Richardson rule.     

Tied monoids

We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids indicate that they should give origin to new knot algebras; indeed, our tied monoids include the tied braid monoid and the tied singular braid monoid, which were used, respectively, to construct new polynomial invariants for classical links and singular links. Consequently, we provide a mechanism to attach an algebra to each tied monoid; this mechanism not only captures known generalizations of the bt-algebra, but also produces possible new knot algebras. To build the tied monoids it is necessary to have presentations of set partition monoids of types A, B and D, among others. For type A we use a presentation due to FitzGerald and for the other type it was necessary to built them.

     

Supertraces on the algebras of observables of the rational calogero models related to classical root systems

We define a complete set of supertraces on the algebra H_W(R)(v), the algebra of observables of the rational Calogero model with a harmonic interaction based on the B_N, C_N, and D_N types of the classical root systems R. These results extend those known for the case A_N−1. It is shown that H_W(R)(v) admits q(R) independent supertraces, where q(B_N)=q(C_N) is the number of partitions of N into a sum of positive integers and q(D_N) is the number of partitions of N into a sum of positive integers with an even number of even integers. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 111, No. 2, pp. 252–262, May, 1997.     

New Identities for Hall-Littlewood Polynomials and Applications

Starting from Macdonald's summation formula of Hall-Littlewood polynomials over bounded partitions and its even partition analogue, Stembridge (Trans. Amer. Math. Soc., 319(2), (1990) 469–498) derived sixteen multiple q-identities of Rogers–Ramanujan type. Inspired by our recent results on Schur functions (Adv. Appl. Math., 27, (2001) 493–509) and based on computer experiments we obtain two further such summation formulae of Hall-Littlewood polynomials over bounded partitions and derive six new multiple q-identities of Rogers–Ramanujan type. 2000 Mathematics Subject Classification: Primary–05A19; Secondary–05A17, 05A30