The clique numbers of regular graphs of matrix algebras are finite

Let F be a field, char(F)≠2, and SGL_n(F), where n is a positive integer. In this paper we show that if for every distinct elements x,yS, x+y is singular, then S is finite. We conjecture that this result is true if one replaces field with a division ring.     

One more simple proof of the Craig–Sakamoto theorem

We give one more elementary proof of the Craig-Sakamoto’s theorem: given such that ; then AB=0.     

Commutativity of the centralizer of a subalgebra in a universal enveloping algebra

Let G be a reductive algebraic group over an algebraically closed field of characteristic zero, and let \(\mathfrak{h}\) be an algebraic subalgebra of the tangent Lie algebra \(\mathfrak{g}\) of G. We find all subalgebras \(\mathfrak{h}\) that have no nontrivial characters and whose centralizers \(\mathfrak{U}(\mathfrak{g})^\mathfrak{h} \) and \(P(\mathfrak{g})^\mathfrak{h} \) in the universal enveloping algebra \(\mathfrak{U}(\mathfrak{g})\) and in the associated graded algebra \(P(\mathfrak{g})\), respectively, are commutative. For all these subalgebras, we prove that \(\mathfrak{U}(\mathfrak{g})^\mathfrak{h} = \mathfrak{U}(\mathfrak{h})^\mathfrak{h} \otimes \mathfrak{U}(\mathfrak{g})^\mathfrak{g} \) and \(P(\mathfrak{g})^\mathfrak{h} = P(\mathfrak{h})^\mathfrak{h} \otimes P(\mathfrak{g})^\mathfrak{g} \). Furthermore, we obtain a criterion for the commutativity of \(\mathfrak{U}(\mathfrak{g})^\mathfrak{h} \) in terms of representation theory.     

Continuity and generators of dynamical semigroups for infinite Bose systems

For a class of quasifree quantum dynamical semigroups on the algebra of the canonical commutation relations (CCR) we give sufficient conditions for these semigroups to extend to ultraweakly continuous semigroups of normal operators on the von Neumann algebra associated with a representation of the CCR. Then the explicit form of the generators of the extended semigroups is calculated.     

Sufficient conditions for the projective freeness of Banach algebras

Let R be a unital semi-simple commutative complex Banach algebra, and let M(R) denote its maximal ideal space, equipped with the Gelfand topology. Sufficient topological conditions are given on M(R) for R to be a projective free ring, that is, a ring in which every finitely generated projective R-module is free. Several examples are included, notably the Hardy algebra H^∞(X) of bounded holomorphic functions on a Riemann surface of finite type, and also some algebras of stable transfer functions arising in control theory.     

The universal modality, the center of a Heyting algebra, and the Blok–Esakia theorem

We introduce the bimodal logic , which is the extension of Bennett’s bimodal logic by Grzegorczyk’s axiom □(□(p→□p)→p)→p and show that the lattice of normal extensions of the intuitionistic modal logic WS5 is isomorphic to the lattice of normal extensions of , thus generalizing the Blok–Esakia theorem. We also introduce the intuitionistic modal logic WS5.C, which is the extension of WS5 by the axiom (p¬p)→(p→p), and the bimodal logic , which is the extension of Shehtman’s bimodal logic by Grzegorczyk’s axiom, and show that the lattice of normal extensions of WS5.C is isomorphic to the lattice of normal extensions of .     

Weak Quantum Enveloping Algebras of Borcherds Superalgebras

In present paper we define a new kind of weak quantized enveloping algebra of Borcherds superalgebras . It is a noncommutative and noncocommutative weak graded Hopf algebra. Using localizing with some Ore set, we obtain a different kind of quantized enveloping algebras of Borcherds superalgebras . It has a homomorphic image which is isomorphic to the usual quantum enveloping algebra of . Moreover, is isomorphic to a direct sum of and an other algebra as algebras. The author is sponsored by ZJNSF No. Y607136.     

Integral modular data and congruences

We compute all fusion algebras with symmetric rational S-matrix up to dimension 12. Only two of them may be used as S-matrices in a modular datum: the S-matrices of the quantum doubles of ℤ/2ℤ and S ₃. Almost all of them satisfy a certain congruence which has some interesting implications, for example for their degrees. We also give explicitly an infinite sequence of modular data with rational S- and T-matrices which are neither tensor products of smaller modular data nor S-matrices of quantum doubles of finite groups. For some sequences of finite groups (certain subdirect products of S ₃,D ₄,Q ₈,S ₄), we prove the rationality of the S-matrices of their quantum doubles.     

Finiteness conditions and distributive laws for Boolean algebras

We compare diverse degrees of compactness and finiteness in Boolean algebras with each other and investigate the influence of weak choice principles. Our arguments rely on a discussion of infinitary distributive laws and generalized prime elements in Boolean algebras. In ZF set theory without choice, a Boolean algebra is Dedekind finite if and only if it satisfies the ascending chain condition. The Denumerable Subset Axiom (DS) implies finiteness of Boolean algebras with compact top, whereas the converse fails in ZF. Moreover, we derive from DS the atomicity of continuous Boolean algebras. Some of the results extend to more general structures like pseudocomplemented semilattices (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On proper secrets, (<Emphasis Type="Italic">t</Emphasis>, <Emphasis Type="Italic">k</Emphasis>)-bases and linear codes

This paper contains three parts where each part triggered and motivated the subsequent one. In the first part (Proper Secrets) we study the Shamir’s “k-out-of-n” threshold secret sharing scheme. In that scheme, the dealer generates a random polynomial of degree k−1 whose free coefficient is the secret and the private shares are point values of that polynomial. We show that the secret may, equivalently, be chosen as any other point value of the polynomial (including the point at infinity), but, on the other hand, setting the secret to be any other linear combination of the polynomial coefficients may result in an imperfect scheme. In the second part ((t, k)-bases) we define, for every pair of integers t and k such that 1 ≤ t ≤ k−1, the concepts of (t, k)-spanning sets, (t, k)-independent sets and (t, k)-bases as generalizations of the usual concepts of spanning sets, independent sets and bases in a finite-dimensional vector space. We study the relations between those notions and derive upper and lower bounds for the size of such sets. In the third part (Linear Codes) we show the relations between those notions and linear codes. Our main notion of a (t, k)-base bridges between two well-known structures: (1, k)-bases are just projective geometries, while (k−1, k)-bases correspond to maximal MDS-codes. We show how the properties of (t, k)-independence and (t, k)-spanning relate to the notions of minimum distance and covering radius of linear codes and how our results regarding the size of such sets relate to known bounds in coding theory. We conclude by comparing between the notions that we introduce here and some well known objects from projective geometry.