Related papers: On weight graphs for nilpotent Lie algebras I

We exploit the Seiberg -- Witten map technique to formulate the theory of gravity defined on a Lie algebraic noncommutative space time. Detailed expressions of the Seiberg -- Witten maps for the gauge parameters, gauge potentials and the…

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…

Given a vertex-weighted oriented graph, we can associate to it a set of monomials. We consider the toric ideal whose defining map is given by these monomials. We find a generating set for the toric ideal for certain classes of graphs which…

A graph $G = (V,E)$ is called equistable if there exist a positive integer $t$ and a weight function $w : V \to \mathbb{N}$ such that $S \subseteq V$ is a maximal stable set of $G$ if and only if $w(S) = t$. Such a function $w$ is called an…

We solve the following problem: Can an undirected weighted graph G be parti- tioned into two non-empty induced subgraphs satisfying minimum constraints for the sum of edge weights at vertices of each subgraph? We show that this is possible…

In this work, we prove that partially commutative, partially commutative metabelian, or partially commutative nilpotent Lie algebra splits into the direct sum of two subalgebras if and only if the completion of the defining graph of this…

S. Bera (Line graph characterization of power graphs of finite nilpotent groups, \textit{Communication in Algebra}, 50(11), 4652-4668, 2022) characterized finite nilpotent groups whose power graphs and proper power graphs are line graphs.…

Let $\mathfrak{g}$ be the $p$-dimensional Witt algebra over an algebraically closed field $k$ of characteristic $p>3$. Let $\mathscr{N}={x\in\ggg\mid x^{[p]}=0}$ be the nilpotent variety of $\mathfrak{g}$, and…

Let $R$ be a commutative ring with identity and ${\rm Nil}(R)$ be the set of nilpotent elements of $R$. The nil-graph of ideals of $R$ is defined as the graph $\mathbb{AG}_N(R)$ whose vertex set is $\{I:\ (0)\neq I\lhd R$ and there exists a…

We establish combinatorial formulas for the index of a class of matrix Lie algebras whose matrix forms are encoded by strict partial orderings.

We introduce a concept, $d$-complete, and show that a Lie algebra is $d$-complete if and only if its full graph is complete.

The aim of this work is to prove the nonexistence of complex structures over nilpotent Lie algebras of maximal class (also called filiform).

The filiform and the quasi-filiform Lie algebras form a special class of nilpotent Lie algebras. The aim of this paper is to compute the index and provide regular vectors of this two class of nilpotent Lie algebras. we consider the graded…

We present `liesuperalg` a SageMath package for representation-theoretic calculations involving Lie superalgebras in Type A. Our package introduces functionality to calculate invariants of weights and produce the associated cup diagrams. We…

We study left-invariant pseudo-Riemannian metrics on Lie groups using the bracket flow of the corresponding Lie algebra. We focus on metrics where the Lie algebra is in the null cone of the $G=O(p,q)$-action; i.e., Lie algebras $\mu$ where…

In this paper, we consider a Borel measurable map of a compact metric space which admits an inducing scheme. Under the finite weighted complexity condition, we establish a thermodynamic formalism for a parameter family of potentials…

We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching polynomial of complete bipartite graphs with bounded weights…

Let g denote a Lie algebra over a field of characteristic zero, and let T(g) denote the tensor product of g with a ring of truncated polynomials. The Lie algebra T(g) is called a truncated current Lie algebra, or in the special case when g…

We present a program package which generates homogeneous random graphs with probabilities prescribed by the user. The statistical weight of a labeled graph $\alpha$ is given in the form $W(\alpha)=\prod_{i=1}^N p(q_i)$, where $p(q)$ is an…

We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…