Related papers: Mutual algebraicity and cellularity
We adapt the classical notion of learning from text to computable structure theory. Our main result is a model-theoretic characterization of the learnability from text for classes of structures. We show that a family of structures is…
Let $A$ be a bi-Koszul algebra, we describe all possible $A_\infty$-algebra structures on the Ext-algebra $E(A)$, and prove that $E(A)$ must be $[m_2, m_3]$-finitely generated. An equivalent description for a connected graded algebra to be…
We define a new notion of an algebraic model structure, in which the cofibrations and fibrations are retracts of coalgebras for comonads and algebras for monads, and prove "algebraic" analogs of classical results. Using a modified version…
We prove that for any superatomic Boolean Algebra of cardinality >beth_omega there is an automorphism moving uncountably many atoms. Similarly for larger cardinals. Any of those results are essentially best possible.
If $A$ is an algebra and \bgt is a tolerance on $A$, then $A/\bgt$ is a multi-algebra in a natural way. We give an example to show that not every multi-algebra arises in this manner. We slightly generalize the construction of $A/\bgt$ and…
The best-known version of Shelah's celebrated singular cardinal compactness theorem states that if the cardinality of an abelian group is singular, and all its subgroups of lesser cardinality are free, then the group itself is free. The…
We prove that if a separable II$_1$ factor $M$ is existentially closed, then every $M$-bimodule is weakly contained in the trivial $M$-bimodule, $\text{L}^2(M)$, and, equivalently, every normal completely positive map on $M$ is a pointwise…
Let U be the quantised enveloping algebra associated to a Cartan matrix of finite type. Let W be the tensor product of a finite list of highest weight representations of U. Then the centraliser algebra of W has a basis called the dual…
An atom structure is neat if there an algebra based on this atom structure in Nr_nCA_{\omega}. We show that this class is not elementary
We present module theory and linear maps as a powerful generalised and computationally efficient framework for the relational data model, which underpins today's relational database systems. Based on universal constructions of modules we…
We show that there are uncountably many countable lattices. We give a discussion of which such lattices can be modular or distributive. The method applies to show that certain other classes of structures also have uncountably many…
We prove that a countable dimensional associative algebra (resp. a countable semigroup) of locally subexponential growth is $M_\infty$-embeddable as a left ideal in a finitely generated algebra (resp. semigroup) of subexponential growth.…
A countable group is C*-simple if its reduced C*-algebra is simple. It is well known that C*-simplicity implies that the amenable radical of the group must be trivial. We show that the converse does not hold by constructing explicit…
In this paper, we investigate semisimplicity of cellular algebras over positive characteristic fields. Our main result shows that the Frame number of cellular algebras characterizes semisimplicity of it. In a sense, this is a generalization…
Binary multirelations can model alternating nondeterminism, for instance, in games or nondeterministically evolving systems interacting with an environment. Such systems can show partial or total functional behaviour at both levels of…
For any finite dimensional basic associative algebra, we study the presentation spaces and their relation with the representation spaces. We prove two propositions about a general presentation, one on its subrepresentations and the other on…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…
An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For…
For an associative algebra $A$ with a simple module $M$ with trivial endomorphisms and trivial annihilator we verify the countable separation property (CSP), i.e. we prove that there exists a list of nonzero elements $a_1, a_2,\ldots$ of…
We prove decidability of univariate real algebra extended with predicates for rational and integer powers, i.e., $(x^n \in \mathbb{Q})$ and $(x^n \in \mathbb{Z})$. Our decision procedure combines computation over real algebraic cells with…