Related papers: A Lie-algebraic perspective on Tree-Adjoining Gram…
In this paper we examine how the notion of algebra of quotients for Lie algebras ties up with the corresponding well-known concept in the associative case. Specifically, we completely characterize when a Lie algebra $Q$ is an algebra of…
Given a natural language phrase, relation linking aims to find a relation (predicate or property) from the underlying knowledge graph to match the phrase. It is very useful in many applications, such as natural language question answering,…
Let $\Gamma$ be a generic subgroup of the multiplicative group $\mathbb{C}^*$ of nonzero complex numbers. We define a class of Lie algebras associated to $\Gamma$, called twisted $\Gamma$-Lie algebras, which is a natural generalization of…
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
We develop a graphical notation to introduce classical Lie algebras. Although this paper deals with well-known results, our pictorial point of view is slightly different to the traditional one. Our graphical notation is fairly elementary…
This paper shows how DATR, a widely used formal language for lexical knowledge representation, can be used to define an LTAG lexicon as an inheritance hierarchy with internal lexical rules. A bottom-up featural encoding is used for LTAG…
Vector autoregression has been widely used for modeling and analysis of multivariate time series data. In high-dimensional settings, model parameter regularization schemes inducing sparsity yield interpretable models and achieved good…
In the CHY-frame for the tree-level amplitudes, the bi-adjoint scalar theory has played a fundamental role because it gives the on-shell Feynman diagrams for all other theories. Recently, an interesting generalization of the bi-adjoint…
An algebraic structure with two constants and one ternary operation, which is not completely commutative, is put forward to accommodate ternary Boolean algebras. When the ternary operation is interpreted as Church's conditioned disjunction,…
Traces and their extension called combined traces (comtraces) are two formal models used in the analysis and verification of concurrent systems. Both models are based on concepts originating in the theory of formal languages, and they are…
In the note some construction of Lie algebras is introduced. It is proved that the construction has the same property as a well known wreath product of groups [1]: Any extension of groups can be embedded into their wreath product [2].
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…
We study in detail the operad controlling several pre-Lie algebra structures sharing the same Lie bracket. Specifically, we show that this operad admits a combinatorial description similar to that of Chapoton and Livernet for the pre-Lie…
Conjunctive table algebras are introduced and axiomatically characterized. A conjunctive table algebra is a variant of SPJR algebra (a weaker form of relational algebra), which corresponds to conjunctive queries with equality. The table…
Text-Attributed Graphs (TAGs) are graphs of connected textual documents. Graph models can efficiently learn TAGs, but their training heavily relies on human-annotated labels, which are scarce or even unavailable in many applications. Large…
We prove several basic extension theorems for reductive group schemes. We also prove that each Lie algebra with a perfect Killing form over a commutative $\dbZ$-algebra, is the Lie algebra of an adjoint group scheme.
We study generalizations of pre-Lie algebras, where the free objects are based on rooted trees which edges are typed, instead of usual rooted trees, and with generalized pre-Lie products formed by graftings. Working with a discrete set of…
Representation learning on text-attributed graphs (TAGs), where nodes are represented by textual descriptions, is crucial for textual and relational knowledge systems and recommendation systems. Currently, state-of-the-art embedding methods…
In this paper we give a way of equipping the derivation algebra of a group algebra with the structure of a graded algebra. The derived group is used as the grading group. For the proof, the identification of the derivation with the…
Recently the notion of post-Hopf algebra was introduced, with the universal enveloping algebra of a post-Lie algebra as the fundamental example. A novel property is that any cocommutative post-Hopf algebra gives rise to a sub-adjacent Hopf…