Related papers: A Lie-algebraic perspective on Tree-Adjoining Gram…
Many tasks in natural language processing require the extraction of relationship information for a given condition, such as event argument extraction, relation extraction, and task-oriented semantic parsing. Recent works usually propose…
A Bialgebra is a module over a ring that is both an associative algebra and a co-associative coalgebra with the product and coproduct additionally satisfying an appropriate commutative relationship. One application of Bialgebras is in the…
The overall aim of this paper is to define a structure of graph operads, thus generalizing the celebrated pre-Lie operad on rooted trees. More precisely, we define two operads on multigraphs, and exhibit a non trivial link between them and…
We study post-Lie algebra structures on pairs of Lie algebras $(\mathfrak{g},\mathfrak{n})$, motivated by nil-affine actions of Lie groups. We prove existence results for such structures depending on the interplay of the algebraic…
We study varieties that contain unranked tree languages over all alphabets. Trees are labeled with symbols from two alphabets, an unranked operator alphabet and an alphabet used for leaves only. Syntactic algebras of unranked tree languages…
It is shown that any Lie affgebra, that is an algebraic system consisting of an affine space together with a bi-affine bracket satisfying affine versions of the antisymmetry and Jacobi identity, is isomorphic to a Lie algebra together with…
Two Lie algebroids are presented that are linked to the construction of the linearizing output of an affine in the input nonlinear system. The algorithmic construction of the linearizing output proceeds inductively, and each stage has two…
The index of a Lie algebra is an important algebraic invariant, but it is notoriously difficult to compute. However, for the suggestively-named seaweed algebras, the computation of the index can be reduced to a combinatorial formula based…
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 propose a new approach to extending the notion of commutator and Lie algebra to algebras with ternary multiplication laws. Our approach is based on ternary associativity of the first and second kind. We propose a ternary commutator,…
Predicting answers to queries over knowledge graphs is called a complex reasoning task because answering a query requires subdividing it into subqueries. Existing query embedding methods use this decomposition to compute the embedding of a…
Tree adjoining grammar (TAG) is specifically suited for morph rich and agglutinated languages like Tamil due to its psycho linguistic features and parse time dependency and morph resolution. Though TAG and LTAG formalisms have been known…
We relate composition and substitution in pre- and post-Lie algebras to algebraic geometry. The Connes-Kreimer Hopf algebras, and MKW Hopf algebras are then coordinate rings of the infinite-dimensional affine varieties consisting of series…
A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an…
In this paper, we study post-Lie deformations of a pre-Lie algebra, namely deforming a pre-Lie algebra into a post-Lie algebra. We construct the differential graded Lie algebra that governs post-Lie deformations of a pre-Lie algebra. We…
Recent works have introduced Abstract Meaning Representation (AMR) for Document-level Event Argument Extraction (Doc-level EAE), since AMR provides a useful interpretation of complex semantic structures and helps to capture long-distance…
The rise of Artificial Intelligence (AI) recently empowered researchers to investigate hard mathematical problems which eluded traditional approaches for decades. Yet, the use of AI in Universal Algebra (UA) -- one of the fields laying the…
We introduce a class of algebras that can be used as recognisers for regular tree languages. We show that it is the only such class that forms a pseudo-variety and we prove the existence of syntactic algebras. Finally, we give a more…
We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…
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…