相关论文: Independence Polynomials of 2-step Nilpotent Lie A…
We generalize a result on the Heisenberg Lie algebra that gives restrictions to possible Lie bialgebra cobrackets on 2-step nilpotent algebras with some additional properties. For the class of 2-step nilpotent Lie algebras coming from…
Dani and Mainkar introduced a method for constructing a 2-step nilpotent Lie algebra $\mathfrak{n}_G$ from a simple directed graph $G$ in 2005. There is a natural inner product on $\mathfrak{n}_G$ arising from the construction. We study…
We consider real 2-step metric nilpotent Lie algebras associated to graphs with possibly repeated edge labels as constructed by Ray in 2016. We determine how the structure of the egde labeling within the graph contributes to the abelian…
We consider a method popular in the literature of associating a two-step nilpotent Lie algebra with a finite simple graph. We prove that the two-step nilpotent Lie algebras associated with two graphs are Lie isomorphic if and only if the…
We associate a two-step nilpotent Lie algebra to an arbitrary Schreier graph. We then use properties of the Schreier graph to determine necessary and sufficient conditions for this Lie algebra to extend to a three-step nilpotent Lie…
The graph polynomial for the number of independent sets of size $k$ in a general undirected graph is shown to be equal to an elementary symmetric polynomial of the vertex monomials, which are determined by the edges incident at the…
For each 3-dimensional non-Lie Leibniz algebra over the complex numbers, we describe the algebra of polynomial invariants and determine its group of automorphisms. As a consequence, we establish that any two non-nilpotent 3-dimensional…
Every finite dimensional real representation of a compact real semisimple Lie algebra determines a metric 2-step nilpotent Lie algebra and a corresponding simply connected metric 2-step nilpotent Lie group N. We study the differential…
We present a construction of 2-step nilpotent Lie algebras using labeled directed simple graphs, which allows us to give a criterion to detect certain ideals and subalgebras by finding special subgraphs. We prove that if a label occurs only…
This work investigates the existence of complex structures on 2-step nilpotent Lie algebras arising from finite graphs. We introduce the notion of adapted complex structure, namely a complex structure that maps vertices and edges of the…
We characterize those graphs which correspond to a rigid 2-step nilpotent Lie algebra in the variety of at most 2-step nilpotent Lie algebras.
In this paper, we systematically investigate the nilpotentizer and nilpotent graph for a Lie superalgebra over the field of characteristic not equal to 2. First, we establish some fundamental properties of the nilpotentizer. Next, we show…
In this work we find necessary and sufficient conditions for a free nilpotent or a free metabelian nilpotent Lie algebra to be endowed with an ad-invariant metric. For such nilpotent Lie algebras admitting an ad-invariant metric the…
To define the notion of a generic property of finite dimensional 2-step nilpotent Lie algebras we use standard correspondence between such Lie algebras and points of an appropriate algebraic variety, where a negligible set is one contained…
We generalize two main theorems of matching polynomials of undirected simple graphs, namely, real-rootedness and the Heilmann-Lieb root bound. Viewing the matching polynomial of a graph $G$ as the independence polynomial of the line graph…
We present structural properties of Lie algebras admitting symmetric, invariant and nondegenerate bilinear forms. We show that these properties are not satisfied by nilradicals of parabolic subalgebras of real split forms of complex simple…
In this note we consider 2-step nilpotent Lie algebras associated with graphs. We prove that 2-step nilpotent Lie algebras $\n$ and $\n'$ associated with graphs $(S, E)$ and $(S', E')$ respectively are isomorphic if and only if $(S, E)$ and…
We prove that a 2-step nilpotent Lie algebras admitting an ad-invariant metric can be constructed from a vector space $\mathfrak v$ endowed with a inner product $<, >$ and an injective homomorphism $\rho: \mathfrak v \to…
An independent set in a graph is a set of pairwise non-adjacent vertices. The independence number $\alpha{(G)}$ is the size of a maximum independent set in the graph $G$. The independence polynomial of a graph is the generating function for…
We construct families of $k$-step nilpotent symplectic Lie algebras associated with graphs, extending the construction given in [Pouseele-Tirao, JPAA 213 (2009)] for the 2-step case. We also show that, under mild conditions on the…