Related papers: Branch-Continuous Tree Algebras
Recent developments of Baxter algebras have lead to applications to combinatorics, number theory and mathematical physics. We relate Baxter algebras to Stirling numbers of the first kind and the second kind, partitions and multinomial…
The well-behaved representations of the coordinate algebra of a 2-dimensional quantum complex plane are classified and a C*-algebra is defined which can be viewed as the algebra of continuous functions on the 2-dimensional quantum complex…
We define nodal finite dimensional algebras and describe their structure over an algebraically closed field. For a special class of such algebras (type A) we find a criterion of tameness.
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions…
We interpret tensors on a smooth manifold M as differential forms over a graded commutative algebra called the algebra of iterated differential forms over M. This allows us to put standard tensor calculus in a new differentially closed…
We introduce the notion of extended affine Lie superalgebras and investigate the properties of their root systems. Extended affine Lie algebras, invariant affine reflection algebras, finite dimensional basic classical simple Lie…
Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values in XML documents. We introduce active learning methods for…
We use machine learning to classify examples of braids (or flat braids) as trivial or non-trivial. Our ML takes form of supervised learning using neural networks (multilayer perceptrons). When they achieve good results in classification, we…
We classify, up to isomorphism and up to equivalence, division gradings (by abelian groups) on finite-dimensional simple real algebras. Gradings on finite-dimensional simple algebras are determined by division gradings, so our results give…
We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindstr\"om quantifiers. An important instance of our result concerns first-order definable tree languages. Our characterization…
We classify real or complex finite-dimensional $C^*$-algebras and their underlying fields from the properties of Birkhoff-James orthogonality. Application to strong Birkhoff-James orthogonality preservers is also given.
We introduce "synchronous algebras", an algebraic structure tailored to recognize automatic relations (aka. synchronous relations, or regular relations). They are the equivalent of monoids for regular languages, however they conceptually…
We define varieties of algebras for an arbitrary endofunctor on a cocomplete category using pairs of natural transformations. This approach is proved to be equivalent to the one of equational classes defined by equation arrows. Free…
A characterization is given for directed graphs that yield graph $C^*$-algebras with continuous trace. This is established for row-finite graphs with no sources first using a groupoid approach, and extended to the general case via the…
In modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations…
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…
Matrices are very popular and widely used in mathematics and other fields of science. Every mathematician has known the properties of finite-sized matrices since the time of study. In this paper, we consider the basic theory of infnite…
In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…
We employ techniques of machine-learning, exemplified by support vector machines and neural classifiers, to initiate the study of whether AI can "learn" algebraic structures. Using finite groups and finite rings as a concrete playground, we…
We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…