Related papers: On weight graphs for nilpotent Lie algebras I
In this article, the concept of nil clean graph of a ring has been generalised to weakly nil clean graph of a ring and graph theoretic properties like girth, clique number, diameter and chromatic index of the graph have been studied for a…
A $t$-spanner of a weighted undirected graph $G=(V,E)$, is a subgraph $H$ such that $d_H(u,v)\le t\cdot d_G(u,v)$ for all $u,v\in V$. The sparseness of the spanner can be measured by its size (the number of edges) and weight (the sum of all…
We give necessary and sufficient conditions for a weight system on multiloop chord diagrams to be obtainable from a metrized Lie algebra representation, in terms of a bound on the ranks of associated connection matrices. Here a multiloop…
The purpose of the present paper is to investigate the necessary conditions for unitarity of the spectrum of non-compact gauged WZNW models to some depth. In particular, we would like to investigate the necessity of integer weights and…
We give an expression of the $q$-analogues of the multiplicities of weights in irreducible $\sl_{n+1}$-modules in terms of the geometry of the crystal graph attached to the corresponding $U_q(\sl_{n+1})$-modules. As an application, we…
We present the classification of real nilpotent quasi-filiform Lie algebras endowed with a complex structure. A nilpotent Lie algebra g is called quasi-filiform is the nilindex is equal to dim(n)-2. We recall that the filiform case…
I show how to associate a Clifford algebra to a graph. I describe the structure of these Clifford graph algebras and provide many examples and pictures. I describe which graphs correspond to isomorphic Clifford algebras and also discuss…
We study the Lusztig-Vogan bijection for the case of a local system. We compute the bijection explicitly in type A for a local system and then show that the dominant weights obtained for different local systems on the same orbit are related…
The theory of dependency graphs is a powerful toolbox to prove asymptotic normality of sums of random variables. In this article, we introduce a more general notion of weighted dependency graphs and give normality criteria in this context.…
A total weighting of a graph $G$ is a mapping $f$ which assigns to each element $z \in V(G) \cup E(G)$ a real number $f(z)$ as its weight. The vertex sum of $v$ with respect to $f$ is $\phi_f(v)=\sum_{e \in E(v)}f(e)+f(v)$. A total…
The Difference graph $\mathcal{D}(G)$ of a finite group $G$ is the difference of the enhanced power graph $\mathcal{P}_{E}(G)$ and the power graph $\mathcal{P}(G)$ with all the isolated vertices removed. In this paper, we characterize the…
We introduce a combinatorial method to construct indefinite Ricci-flat metrics on nice nilpotent Lie groups. We prove that every nilpotent Lie group of dimension $\leq6$, every nice nilpotent Lie group of dimension $\leq7$ and every…
Let ${\cal G}=(G,w)$ be a weighted graph , that is, a graph $G$ endowed with a function $w$ from the edge set of $G$ to the set of real numbers; for any subset $S$ of the vertex set of $G$, we define $D_S({\cal G})$ to be the minimum of the…
A graph $G=(V,E)$ is total weight $(k,k')$-choosable if the following holds: For any list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and assigns to each edge $e$ a set $L(e)$ of $k'$ real numbers,…
Let $\mathfrak{g}$ be a finite-dimensional simple complex Lie algebra. A layer sum is introduced as the sum of formal exponentials of the distinct weights appearing in an irreducible $\mathfrak{g}$-module. It is argued that the character of…
We develop a structure theory for nilpotent symplectic alternating algebras.
A graph is called $t$-tough if the removal of any vertex set $S$ that disconnects the graph leaves at most $|S|/t$ components. The toughness of a graph is the largest $t$ for which the graph is $t$-tough. A graph is minimally $t$-tough if…
We present a constructive approach to torsion-free gradings of Lie algebras. Our main result is the computation of a maximal grading. Given a Lie algebra, using its maximal grading we enumerate all of its torsion-free gradings as well as…
In recent years, the finite W-algebras associated to a semisimple Lie algebra and its nilpotent element have been studied intensively from different viewpoints. In this lecture series, we shall present some basic constructions, connections,…
Let $S$ be a set of integers. A graph G is said to have the S-property if there exists an S-edge-weighting $w : E(G) \rightarrow S$ such that any two adjacent vertices have different sums of incident edge-weights. In this paper we…