Related papers: Various interplays between relation and cylindric …
This paper surveys the representation theory of rational Cherednik algebras. We also discuss the representations of the spherical subalgebras. We describe in particular the results on category O. For type A, we explain relations with the…
We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…
For any Lie algebra of classical type or type $G_2$ we define a $K$-theoretic analog of Dunkl's elements, the so-called truncated {\it Ruijsenaars-Schneider-Macdonald elements}, $RSM$-elements for short, in the corresponding {\it…
For finite-dimensional algebras over algebraically closed fields, we consider two fundamental classes of modules and their geometric counterparts: bricks and $\tau$-rigid modules, as well as brick components and $\tau$-regular components.…
We describe a presentation for the descent algebra of the symmetric group $\sym{n}$ as a quiver with relations. This presentation arises from a new construction of the descent algebra as a homomorphic image of an algebra of forests of…
We examine the degree structure $\mathbf{ER}$ of equivalence relations on $\omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not…
We demonstrate that pure C*-algebras form a robust class by proving that pureness follows from very weak comparison and divisibility properties. Using this, we show that every simple, non-elementary C*-algebra with a unique quasitrace and…
A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…
In [14] we introduced a new class of algebras, which we named \textit{quantum generalized Heisenberg algebras} and which depend on a parameter $q$ and two polynomials $f,g$. We have shown that this class includes all generalized Heisenberg…
In this paper all of the classical constructions of A. Young are generalized to affine Hecke algebras of type A. It is proved that the calibrated irreducible representations of the affine Hecke algebra are indexed by placed skew shapes and…
I give an overview of recent developments in the structure and classification theory of separable, simple, nuclear C*-algebras. I will in particular focus on the role of quasidiagonality and amenability for classification, and on the…
This paper gives a classification of parabolic subalgebras of simple Lie algebras over $\CC$ that are complexifications of parabolic subalgebras of real forms for which Lynch's vanishing theorem for generalized Whittaker modules is…
We introduce quantum monadic and quantum cylindric algebras. These are adaptations to the quantum setting of the monadic algebras of Halmos, and cylindric algebras of Henkin, Monk and Tarski, that are used in algebraic treatments 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…
A real Lie algebra with a compatible Hilbert space structure (in the sense that the scalar product is invariant) is called a Hilbert-Lie algebra. Such Lie algebras are natural infinite-dimensional analogues of the compact Lie algebras; in…
A way to construct and classify the three dimensional polynomially deformed algebras is given and the irreducible representations is presented. for the quadratic algebras 4 different algebras are obtained and for cubic algebras 12 different…
Relation algebra and its reducts provide us with a strong tool for reasoning about nondeterministic programs and their partial correctness. Demonic calculus, introduced to model the behaviour of a machine where the demon is in control of…
An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…
This is the second in a series of papers which give an explicit description of the reconstruction algebra as a quiver with relations; these algebras arise naturally as geometric generalizations of preprojective algebras of extended Dynkin…
Complexity rank for $C^*$-algebras was introduced by the second author and Yu for applications towards the UCT: very roughly, this rank is at most $n$ if you can repeatedly cut the $C^*$-algebra in half at most $n$ times, and end up with…