Related papers: Regular Tree Algebras
We present an extremely elementary construction of the simple Lie algebras over the complex numbers in all of their minuscule representations, using the vertices of various polytopes. The construction itself requires no complicated…
In this paper we define a new algebraic object: the disguised-groups. We show the main properties of the disguised-groups and, as a consequence, we will see that disguised-groups coincide with regular semigroups. We prove many of the…
Plonka sums consist of an algebraic construction similar, in some sense to direct limits, which allows to represent classes of algebras defined by means of regular identities (namely those equations where the same set of variables appears…
We study tree languages that can be defined in \Delta_2 . These are tree languages definable by a first-order formula whose quantifier prefix is forall exists, and simultaneously by a first-order formula whose quantifier prefix is . For the…
The graded Lie algebra associated with the Nottingham group over a field of prime characteristic serves as a fundamental example of Nottingham algebras, a class of infinite-dimensional, positively graded thin algebras. This paper completes…
We define a class of algebras describing links of binary isolating formulas on a set of realizations for a family of 1-types of a complete theory. We prove that a set of labels for binary isolating formulas on a set of realizations for a…
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.
The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…
We study the portraits of isometries of rooted trees - the labelling of the tree, at each vertex, by the permutation of its descendants - in terms of languages. We characterize regularly branched self-similar groups in terms of…
We study the correspondence between equivalence classes of pairs consisting of real semisimple Lie algebras and their Cartan subalgebras and involutions of the corresponding root system. This can be graphically described by introducing…
In this paper, we introduce a novel generalization of the classical property of algebras known as "being alternative," which we term "partially alternative." This new concept broadens the scope of alternative algebras, offering a fresh…
With the recent advancements in deep learning, neural solvers have gained promising results in solving math word problems. However, these SOTA solvers only generate binary expression trees that contain basic arithmetic operators and do not…
A network-theoretic approach for determining the complexity of a graph is proposed. This approach is based on the relationship between the linear algebra (theory of determinants) and the graph theory. In this paper we contribute a new…
Let $\mathcal{P}(\Sigma^*)$ be the semiring of languages, and consider its subset $\mathcal{P}(\Sigma)$. In this paper we define the language recognized by a weighted automaton over $\mathcal{P}(\Sigma)$ and a one-letter alphabet.…
We develop the theory of ``branch algebras'', which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting…
The derivation trees of a tree adjoining grammar provide a first insight into the sentence semantics, and are thus prime targets for generation systems. We define a formalism, feature-based regular tree grammars, and a translation from…
In this work, we introduce multi-Novikov algebras, a generalisation of Novikov algebras with several binary operations indexed by a given set, and show that the multi-indices recently introduced in the context of singular stochastic partial…
We define a decidable class of TAGs that is strongly equivalent to CFGs and is cubic-time parsable. This class serves to lexicalize CFGs in the same manner as the LCFGs of Schabes and Waters but with considerably less restriction on the…
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanised reasoning with useful principles such as structural…
We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…