Related papers: The typical countable algebra
In this paper we consider, from a computational point of view, the problem of classifying logics within the Leibniz and Frege hierarchies typical of abstract algebraic logic. The main result states that, for logics presented syntactically,…
Let L be a finite dimensional simple Lie algebra over an algebraically closed field of characteristic p>3. We prove in this paper that if all tori of maximal dimansion in the semisimple p-envelope of L are standard, the L is up to…
We show that every Lie algebra or superLie algebra has a canonical braiding on it, and that in terms of this its enveloping algebra appears as a flat space with braided-commuting coordinate functions. This also gives a new point of view…
To an $r$-dimensional subshift of finite type satisfying certain special properties we associate a $C^*$-algebra $\cA$. This algebra is a higher rank version of a Cuntz-Krieger algebra. In particular, it is simple, purely infinite and…
For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite…
In this expository paper, we first review the classification of the restricted simple Lie algebras in characteristic different from 2 and 3 and then we describe their infinitesimal deformations. We conclude by indicating some possible…
Universal continuous calculi are defined and it is shown that for every finite tuple of pairwise commuting Hermitian elements of a Su*-algebra (an ordered *-algebra that is symmetric, i.e. "strictly" positive elements are invertible, and…
Let G be a reductive connected linear algebraic group over an algebraically closed field of positive characteristic and let g be its Lie algebra. First we extend a well-known result about the Picard group of a semisimple group to reductive…
A description is given of those sequences ${\Bbb S}= (S(0),S(1),\dots,S(l))$ of simple modules over a finite dimensional algebra for which there are only finitely many uniserial modules with consecutive composition factors…
Certain operator algebras A on a Hilbert space have the property that every densely defined linear transformation commuting with A is closable. Such algebras are said to have the closability property. They are important in the study of the…
This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…
A lattice L is called opc if every monotone function f : L^n -> L is induced by a polynomial. We show here: If L is a lattice with the interpolation property whose cardinality is a strong limit cardinal of uncountable cofinality, then some…
We apply a categorical lens to the study of betweenness relations by capturing them within a topological category, fibred in lattices, and study several subcategories of it. In particular, we show that its full subcategory of finite objects…
We find a class of algebras A satisfying the following property: for every nontrivial noncommutative polynomial, the linear span of all its values in A equals A. This class includes the algebras of all bounded and all compact operators on…
We prove that every finite lattice L can be embedded in a three-generated finite lattice K. We also prove that every algebraic lattice with accessible cardinality is a complete sublattice of an appropriate algebraic lattice K such that K is…
Given a lattice $\mathbb{L}$ and a class $K$ of algebraic structures, we say that $\mathbb{L}$ \emph{forces nilpotency} in $K$ if every algebra $\mathbf{A} \in K$ whose congruence lattice $\mathrm{Con} (\mathbf{A})$ is isomorphic to…
In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…
This paper studies Frobenius subalgebra posets in abelian monoidal categories and shows that, under general conditions--satisfied in all semisimple tensor categories over the complex field--they collapse to lattices through a rigidity…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
The class of minimal non-elementary Lie algebras over a field F are studied. These are classified when F is algebraically closed and of characteristic different from 2,3. The solvable algebras in this class are also characterised over any…