Related papers: Regular Tree Algebras
In the present paper we obtain the list of algebras, up to isomorphism, such that closure of any complex finite-dimensional algebra contains one of the algebra of the given list.
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain…
Recently, a geometrical characterization of vector spaces served to generalize them into a new class of algebras. Instead of the algebraic properties of the underlying fields, we generalized the recently discovered property of such spaces…
We introduce a method to derive theorems from Elementary Number Theory by means of relationships among formal languages. Using $\sigma$-algebras, we define what a proof of a number-theoretical statement by Language Theory means. We prove…
We define a class of associative algebras generalizing 'clannish algebras', as introduced by the second author, but also incorporating semilinear structure, like a skew polynomial ring. Clannish algebras generalize the well known 'string…
Traditionally, formal languages are defined as sets of words. More recently, the alternative coalgebraic or coinductive representation as infinite tries, i.e., prefix trees branching over the alphabet, has been used to obtain compact and…
In this expository article, we describe the classification of the subalgebras of the rank 2 semisimple Lie algebras. Their semisimple subalgebras are well-known, and in a recent series of papers, we completed the classification of the…
Recent work on the problem of latent tree learning has made it possible to train neural networks that learn to both parse a sentence and use the resulting parse to interpret the sentence, all without exposure to ground-truth parse trees at…
A variety is a category of ordered (finitary) algebras presented by inequations between terms. We characterize categories enriched over the category of posets which are equivalent to a variety. This is quite analogous to Lawvere's classical…
We classify regular subalgebras of affine Kac-Moody algebras in terms of their root systems. In the process, we establish that a root system of a subalgebra is always an intersection of the root system of the algebra with a sublattice of…
Automata admitting at most one accepting run per structure, known as unambiguous automata, find applications in verification of reactive systems as they extend the class of deterministic automata whilst maintaining some of their desirable…
The overlap graphs of subtrees in a tree (SOGs) generalise many other graphs classes with set representation characterisations. The complexity of recognising SOGs in open. The complexities of recognising many subclasses of SOGs are known.…
Right-linear (or left-linear) grammars are a well-known class of context-free grammars computing just the regular languages. They may naturally be written as expressions with (least) fixed points but with products restricted to letters as…
We consider the problem of classifying (possibly noncommutative) R-algebras of low rank over an arbitrary base ring R. We first classify algebras by their degree, and we relate the class of algebras of degree 2 to algebras with a standard…
For simply-laced quivers, we consider the fixed-point subalgebra of the quiver Hecke algebra under the homogeneous sign map. This leads to a new family of algebras we call alternating quiver Hecke algebras. We give a basis theorem and a…
We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…
For each natural number $n$, we define a category whose objects are discriminant algebras in rank $n$, i.e. functorial means of attaching to each rank-$n$ algebra a quadratic algebra with the same discriminant. We show that the discriminant…
In this paper we generalize cellular algebras by allowing different partial orderings relative to fixed idempotents. For these relative cellular algebras we classify and construct simple modules, and we obtain other characterizations in…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
In this paper, we give new characterizations of algebraic regularity by using differential forms and difference quotients.