Related papers: Branch-Continuous Tree Algebras
In this paper, we study classes of structures and individual structures for which programs implementing functions defined everywhere are equivalent to finite tree-programs. The programs under consideration may have cycles and at most…
We develop a theory of k-partitions of the set of infinite words recognizable by classes of finite automata. The theory enables to complete proofs of existing results about topological classifications of the (aperiodic) omega-regular…
We classify, up to equivalence, all finite-dimensional simple graded division algebras over the field of real numbers. The grading group is any finite abelian group.
Formal languages are sets of strings of symbols described by a set of rules specific to them. In this note, we discuss a certain class of formal languages, called regular languages, and put forward some elementary results. The properties of…
In this note we study a family of algebras with one parameter defined by generators and relations. The set of generators contains the generators of the usual braids algebra, and another set of generators which is interpreted as ties between…
Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees. We give an explicit formula…
Matrix Graph Grammars (MGG) is a novel approach to the study of graph dynamics ([15]). In the present contribution we look at MGG as a formal grammar and as a model of computation, which is a necessary step in the more ambitious program of…
In this paper we define a degree for ends of infinite digraphs. The well-definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices…
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 reasoning frameworks for path expressions where node…
We formulate the notion of continuous evolution algebra in terms of differentiable matrix-valued functions, to then study those such algebras arising as solutions of ODE problems. Given their dependence on natural bases, matrix Lie groups…
The genus gen(D) of a finite-dimensional central division algebra D over a field F is defined as the collection of classes [D'] in the Brauer group Br(F), where D' is a central division F-algebra having the same maximal subfields as D. For…
We study endomorphisms and derivations of infinite dimensional cyclic Leibniz algebra.
We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…
We arrange the orders in an algebraic number field in a tree. This tree can be used to enumerate all orders of bounded index in the maximal order as well as the orders over some given order.
We discuss the noncommutative generalizations of polynomial algebras which after appropriate completions can be used as coordinate algebras in various noncommutative settings, (noncommutative differential geometry, noncommutative algebraic…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term equations, obtaining what we call almost free algebras. One of…
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…
There are several researches on Lie algebras and Lie superalgebras graded by finite root systems. In this paper, we study Leibniz algebras graded by finite root systems and obtain some results in simply-laced cases.
We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…