Related papers: On Lie algebra weight systems for 3-graphs
Let $\mathfrak{g}$ be a finite dimensional complex Lie algebra and let $A$ be a finite dimensional complex, associative and commutative algebra with unit. We describe the structure of the derivation Lie algebra of the current Lie algebra…
In this article, we study orbifold constructions associated with the Leech lattice vertex operator algebra. As an application, we prove that the structure of a strongly regular holomorphic vertex operator algebra of central charge $24$ is…
In this paper, first using the higher derived brackets, we give the controlling algebra of relative difference Lie algebras, which are also called crossed homomorphisms or differential Lie algebras of weight 1 when the action is the adjoint…
We call the \emph{$p$-fundamental string} of a complex simple Lie algebra to the sequence of irreducible representations having highest weights of the form $k\omega_1+\omega_p$ for $k\geq0$, where $\omega_j$ denotes the $j$-th fundamental…
A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a non-negative weight to each of its triangles such that the sum of the weights of the…
We study the spectral implications of re-weighting a graph by the $\ell_\infty$-Lewis weights of its edges. Our main motivation is the ER-Minimization problem (Saberi et al., SIAM'08): Given an undirected graph $G$, the goal is to find…
We study methods to manipulate weights in stress-graph embeddings to improve convex straight-line planar drawings of 3-connected planar graphs. Stress-graph embeddings are weighted versions of Tutte embeddings, where solving a linear system…
The weight distribution and weight hierarchy of a linear code are two important research topics in coding theory. In this paper, choosing $ D=\Big\{(x,y)\in \Big(\F_{p^{s_1}}\times\F_{p^{s_2}}\Big)\Big\backslash\{(0,0)\}:…
For a complete lattice $L$ and a relational structure $\mathfrak{X}=(X,(R_i)_I)$, we introduce the convolution algebra $L^{\mathfrak{X}}$. This algebra consists of the lattice $L^X$ equipped with an additional $n_i$-ary operation $f_i$ for…
A $\mathbb{T}$-gain graph is a triple $\Phi=(G,\mathbb{T},\varphi)$ consisting of a graph $G=(V,E)$, the circle group $\mathbb{T}=\{z\in C: |z|=1\}$ and a gain function $\varphi:\overrightarrow{E}\rightarrow \mathbb{T}$ such that…
In this paper, we focus on how we can interpret the actions of the elements in the Gelfand spectrum of a weighted Fourier algebra on connected Lie groups. They can be viewed as evaluations on specific points of the complexification of the…
In this paper we present Affine.m - program for computations in representation theory of finite-dimensional and affine Lie algebras and describe implemented algorithms. Algorithms are based upon the properties of weights and Weyl symmetry.…
In two seminal papers M. Kontsevich introduced graph homology as a tool to compute the homology of three infinite dimensional Lie algebras, associated to the three operads `commutative,' `associative' and `Lie.' We generalize his theorem to…
Let $ G $ be a connected Lie group with real Lie algebra $ \mathfrak{g}$. Suppose $G$ is also a complex manifold. We obtain explicit holomorphic sectional and bisectional curvature formulas of left-invariant strongly pseudoconvex complex…
An independent set in a graph G is a set of vertices no two of which are joined by an edge. A vertex-weighted graph associates a weight with every vertex in the graph. A vertex-weighted graph G is called a unique independence…
We study the exact learnability of real valued graph parameters $f$ which are known to be representable as partition functions which count the number of weighted homomorphisms into a graph $H$ with vertex weights $\alpha$ and edge weights…
The deformation complex of an algebra over a colored PROP P is defined in terms of a minimal (or, more generally, cofibrant) model of P. It is shown that it carries the structure of an L_\infty-algebra which induces a graded Lie bracket on…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
A complex unit gain graph is a triple $\varphi=(G, \mathbb{T}, \varphi)$ (or $G^{\varphi}$ for short) consisting of a simple graph $G$, as the underlying graph of $G^{\varphi}$, the set of unit complex numbers $\mathbb{T}={z\in \mathbb{C}:…
A weight system on graph homology was constructed by Rozansky and Witten using a compact hyperk\"ahler manifold. A variation of this construction utilizing holomorphic vector bundles over the manifold gives a weight system on chord…