Related papers: A Lie-algebraic perspective on Tree-Adjoining Gram…
In this paper we prove several theorems about the behavior of index of Lie algebras derived from associative algebras under tensor products of underlying associative algebras.
Novikov algebras provide a simple but powerful algebraic axiomatization of important features of classical diferential calculus. We study their structure properties, modeling their relationships with commutative algebras with a derivation,…
Learning on text-attributed graphs (TAGs), in which nodes are associated with one or more texts, has been the subject of much recent work. However, most approaches tend to make strong assumptions about the downstream task of interest, are…
We construct an associative product on the symmetric module S(L) of any pre-Lie algebra L. Then we proove that in the case of rooted trees our construction is dual to that of Connes and Kreimer. We also show that symmetric brace algebras…
We introduce the notions of pre-morphism and pre-derivation for arbitrary non-associative algebras over a commutative ring $k$ with identity. These notions are applied to the study of pre-Lie $k$-algebras and, more generally, Lie-admissible…
This text, based on the author's Bachelor's thesis, introduces the theory of Algebraic Operads, a mathematical formalism that provides a unifying framework for modern algebra. We demonstrate how the fundamental theories of associative,…
For a finite-dimensional representation V of a group G we introduce and study the notion of a Lie element in the group algebra k[G]. The set L(V) \subset k[G] of Lie elements is a Lie algebra and a G-module acting on the original…
We develop a new, intrinsic, computationally friendly approach to Lie coalgebras through graph coalgebras, which are new and likely to be of independent interest. Our graph coalgebraic approach has advantages both in finding relations…
State-of-the-art methods for data-driven modelling of non-linear dynamical systems typically involve interactions with an expert user. In order to partially automate the process of modelling physical systems from data, many EA-based…
We present a semantic parser for Abstract Meaning Representations which learns to parse strings into tree representations of the compositional structure of an AMR graph. This allows us to use standard neural techniques for supertagging and…
Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…
Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…
We consider string junctions with endpoints on a set of branes of IIB string theory defining an ADE-type gauge Lie algebra. We show how to characterize uniquely equivalence classes of junctions related by string/brane crossing through…
This paper proposes an equivariant neural network that takes data in any semi-simple Lie algebra as input. The corresponding group acts on the Lie algebra as adjoint operations, making our proposed network adjoint-equivariant. Our framework…
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…
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasetsstructured as graphs. We introduce a novel class of tree-shapedpatterns called tree queries, and present algorithms for…
Sentence matching is a fundamental task of natural language processing with various applications. Most recent approaches adopt attention-based neural models to build word- or phrase-level alignment between two sentences. However, these…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
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…
We propose an approach to extending the concept of a Lie algebra to ternary structures based on $\omega$-symmetry, where $\omega$ is a primitive cube root of unity. We give a definition of a corresponding structure, called a ternary Lie…