Related papers: On Lie algebra weight systems for 3-graphs
We describe a systematic method to construct arbitrary highest-weight modules, including arbitrary finite-dimensional representations, for any finite dimensional simple Lie algebra $\mathfrak{g}$. The Lie algebra generators are represented…
In the context of the variational bi-complex, we re-explain that irreducible gauge systems define a particular example of a Lie algebroid. This is used to review some recent and not so recent results on gauge, global and asymptotic…
A Lie system is the non-autonomous system of differential equations describing the integral curves of a non-autonomous vector field taking values in a finite-dimensional Lie algebra of vector fields, a so-called Vessiot--Guldberg Lie…
Graph Weighted Models (GWMs) have recently been proposed as a natural generalization of weighted automata over strings and trees to arbitrary families of labeled graphs (and hypergraphs). A GWM generically associates a labeled graph with a…
General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…
Denote m_0 the infinite dimensional N-graded Lie algebra defined by basis e_i, i>= 1 and relations [e_1,e_i] = e_(i+1) for all i>=2. We compute in this article the bracket structure on H1(m_0,m_0), H2(m_0,m_0) and in relation to this, we…
For any Inonu-Wigner contraction of a three dimensional Lie algebra we construct the corresponding contractions of representations. Our method is quite canonical in the sense that in all cases we deal with realizations of the…
Let $L$ be a finite-dimensional Lie algebra over a field $F$. In This paper we introduce the \emph{nilpotent graph} $\Gamma_\mathfrak{N}(L)$ as the graph whose vertices are the elements of $L \setminus \nil(L)$, where \[\nil(L) = \{x \in L…
We consider the complexity of counting homomorphisms from an $r$-uniform hypergraph $G$ to a symmetric $r$-ary relation $H$. We give a dichotomy theorem for $r>2$, showing for which $H$ this problem is in FP and for which $H$ it is…
We establish that the Lie algebra of weight one states in a (strongly) rational vertex operator algebra is reductive, and that its Lie rank is bounded above by the effective central charge. We show that lattice vertex operator algebras may…
Kings, Lei, Loeffler and Zerbes constructed a three-variable Euler system $\kappa({\bf g},{\bf h})$ of Beilinson-Flach elements associated to a pair of Hida families $({\bf g},{\bf h})$ and exploited it to obtain applications to the…
We present a new method of analysis of associative algebras. This method bears a certain resemblance to the famous analysis of commutative $C^*$-algebras in which an important role is played by multiplicative functionals over the algebra.…
We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…
A type of directed multigraph called a W-digraph is introduced to model the structure of certain representations of Hecke algebras, including those constructed by Lusztig and Vogan from involutions in a Weyl group. Building on results of…
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their…
In two seminal papers Kontsevich used a construction called_graph homology_ as a bridge between certain infinite dimensional Lie algebras and various topological objects, including moduli spaces of curves, the group of outer automorphisms…
A Lie version of Turaev's $\overline{G}$-Frobenius algebras from 2-dimensional homotopy quantum field theory is proposed. The foundation for this Lie version is a structure we call a \textit{$\frak{g}$-quasi-Frobenius Lie algebra} for…
A complex unit gain graph (or ${\mathbb T}$-gain graph) is a triple $\Phi=(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…
Let $G=(V,E)$ be a simple graph of size $m$ and $L$ a set of $m$ distinct real numbers. An $L$-labeling of $G$ is a bijection $\phi: E \rightarrow L$. We say that $\phi$ is an antimagic $L$-labeling if the induced vertex sum $\phi_+: V…
For a weighted graph $E$, we construct representation graphs $F$, and consequently, $L_K(E)$-modules $V_F$, where $L_K(E)$ is the Leavitt path algebra associated to $E$, with coefficients in a field $K$. We characterise representation…