Related papers: A Lie-algebraic perspective on Tree-Adjoining Gram…
In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce a set of logical connectives allowing us to extend the correspondence between cographs and classical propositional formulas to any…
We study so called regular Lie algebras, i.e. Lie algebras in which each nonzero element is regular. We make a connection with an open problem whether any element of reduced trace zero in a simple associative algebra is a commutator.
The rapid rise of large language models (LLMs) and their ability to capture semantic relationships has led to their adoption in a wide range of applications. Text-attributed graphs (TAGs) are a notable example where LLMs can be combined…
We develop a version of the Bass-Serre theory for Lie algebras (over a field $k$) via a homological approach. We define the notion of fundamental Lie algebra of a graph of Lie algebras and show that this construction yields Mayer-Vietoris…
Text-attributed graphs (TAGs) integrate textual data with graph structures, providing valuable insights in applications such as social network analysis and recommendation systems. Graph Neural Networks (GNNs) effectively capture both…
Most graph query languages are rooted in logic. By contrast, in this paper we consider graph query languages rooted in linear algebra. More specifically, we consider MATLANG, a matrix query language recently introduced, in which some basic…
We survey some uses of adjoint functors in graph theory pertaining to colourings, complexity reductions, multiplicativity, circular colourings and tree duality. The exposition of these applications through adjoint functors unifies the…
Latent tree learning models represent sentences by composing their words according to an induced parse tree, all based on a downstream task. These models often outperform baselines which use (externally provided) syntax trees to drive the…
This paper explores the kinds of probabilistic relations that are important in syntactic disambiguation. It proposes that two widely used kinds of relations, lexical dependencies and structural relations, have complementary disambiguation…
Let $(V,\gamma )$ be a real finite dimensional vector space with a symmetric bilinear form $\gamma $ whose kernel is spanned by a nonzero vector. The set of invertible real linear mappings of $(V, \gamma )$ into itself forms a Lie group…
Hopf algebra structures on rooted trees are by now a well-studied object, especially in the context of combinatorics. In this work we consider a Hopf algebra H by introducing a coproduct on a (commutative) algebra of rooted forests,…
We expand on an idea of Vinberg to take a tensor space and the natural Lie algebra that acts on it and embed their direct sum into an auxiliary algebra. Viewed as endomorphisms of this algebra, we associate adjoint operators to tensors. We…
Let $\g$ be a simple Lie algebra of type A or C. We show that the coadjoint representation of any seaweed subalgebra of $\g$ has some properties similar to that of the adjoint representation of a reductive Lie algebra. Namely, a) the field…
We introduce a neural network that represents sentences by composing their words according to induced binary parse trees. We use Tree-LSTM as our composition function, applied along a tree structure found by a fully differentiable natural…
In this paper, using extension theory and cohomological approach we introduce the notion of the obstruction class for an inner post-Lie algebra being induced by a Rota-Baxter operator, and show that an inner post-Lie algebra is induced by a…
The notion of associativity (which differs from the straightforward generalization of the usual associativity given by the move of parentheses in the relevant expression) for operations of high arity is introduced. It is proved that the…
This is an extended version of a talk presented by the second author on the Third Mile High Conference on Nonassociative Mathematics (August 2013, Denver, CO). The purpose of this paper is twofold. First, we would like to review the…
In this note we further explore the properties of universal enveloping algebras associated to a post-Lie algebra. Emphasizing the role of the Magnus expansion, we analyze the properties of group like-elements belonging to (suitable…
Dialogue-based Relation Extraction (DRE) aims to predict the relation type of argument pairs that are mentioned in dialogue. The latest trigger-enhanced methods propose trigger prediction tasks to promote DRE. However, these methods are not…
We define a family of multigraded operads $O_\lambda$ depending on a scalar parameter, such that forgetting the multigraduation gives back the pre-Lie operad when the parameter $\lambda$ is equal to one, and the NAP operad governing…