Related papers: Defects in weighted graphs and Commutators
A Lie-Yamaguti algebra is a non-associative algebraic structure that generalizes both Lie algebras and Lie triple systems. We first consider the factorization problem for Lie-Yamaguti algebras that essentially related to the bicrossed…
First, we construct some families of nonsolvable anticommutative algebras, solvable Lie algebras and even nilpotent Lie algebras, that can be endowed with the structure of a simple Hom-Lie algebra. This situation shows that a classification…
In this work, we refine recent results on the explicit construction of polynomial algebras associated with commutants of subalgebras in enveloping algebras of Lie algebras by considering an additional grading with respect to the subalgebra.…
Derivations extend the concept of differentiation from functions to algebraic structures as linear operators satisfying the Leibniz rule. In Lie algebras, derivations form a Lie algebra via the commutator bracket of linear endomorphisms.…
We define a new homotopy algebraic structure, that we call a braided $L_\infty$-algebra, and use it to systematically construct a new class of noncommutative field theories, that we call braided field theories. Braided field theories have…
We introduce a new series $R_k$, $k=2,3,4,\dots$, of integer valued weight systems. The value of the weight system $R_k$ on a chord diagram is a signed number of cycles of even length $2k$ in the intersection graph of the diagram. We show…
In this article we show that there are branching systems (which induce representations of the graph algebra $C^*(E)$) associated to each row-countable graph $E$. For row-countable graphs, we characterize the condition $(L)$ via branching…
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…
A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…
In real-world networks, predicting the weight (strength) of links is as crucial as predicting the existence of the links themselves. Previous studies have primarily used shallow graph features for link weight prediction, limiting the…
A way to associate unweighted graphs from weighted ones is presented, such that linear stable equilibria of the Kuramoto homogeneous model associated to both graphs coincide, i.e., equilibria of the system $\dot\theta_i = \sum_{j \sim i}…
Let R be a finite commutative ring with unity, and let G = (V, E) be a simple graph. The zero-divisor graph, denoted by {\Gamma}(R) is a simple graph with vertex set as R, and two vertices x, y \in R are adjacent in {\Gamma}(R) if and only…
The main purpose of this work is to develop the basic notions of the Lie theory for commutative algebras. We introduce a class of $\mathbbZ_2$-graded commutative but not associative algebras that we call ``Lie antialgebras''. These algebras…
Let G be a locally compact non-compact group. We show that under a very mild assumption on the weight function w, the weighted group algebra L_1(G,w) is strongly Arens irregular in the sense of Dales-Lamb-Lau. To this end, we first derive a…
In this paper, we give sharp bounds for the homological dimensions of the Leavitt path algebra $L_K(E)$ of a finite graph $E$ with coefficients in a commutative ring $K$, as well as establish a formula for calculating the homological…
The objective of this thesis is to study the automorphism groups of the Lie algebras attached to linear systems. A linear system is a pair of vector spaces $(U,W)$ with a nondegenerate pairing $\langle\cdot,\cdot\rangle\colon U\otimes W\to…
Given an $\mathcal{N}=2$ superconformal field theory, we reconsider the Schur index $\mathcal{I}_L(q)$ in the presence of a half line defect $L$. Recently Cordova-Gaiotto-Shao found that $\mathcal{I}_L(q)$ admits an expansion in terms of…
Estimation of graph parameters based on a collection of graphs is essential for a wide range of graph inference tasks. In practice, weighted graphs are generally observed with edge contamination. We consider a weighted latent position graph…
It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition and multiplication, respectively. This led to a…
Lifted probabilistic inference exploits symmetries in probabilistic graphical models to allow for tractable probabilistic inference with respect to domain sizes. To exploit symmetries in, e.g., factor graphs, it is crucial to identify…