相关论文: Independence Polynomials of 2-step Nilpotent Lie A…

We give a characterization of the $2$-step nilpotent Lie algebras whose corresponding Lie groups admit a left invariant complex structure. This is done by considering separately the cases when the complex structure is 2-step or 3-step…

In this paper we study the Lie algebras of derivations of two-step nilpotent algebras. We obtain a class of Lie algebras with trivial center and abelian ideal of inner derivations. Among these, the relations between the complex and the real…

Let $G=(V,E)$ be a finite simple graph. In this paper, we study the degree of the $h$-polynomial of the edge ideal of $G$ in relation to the independence number of $G$. Our approach is based on the value of the independence polynomial of…

We delineate the image of multilinear Lie polynomial of degree $2$ evaluated on $L$ where $L$ is a finite-dimensional nilpotent Lie algebra over field $k$ with $\dim L' \leq 4$.

Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each cardinality and its roots are called independence roots. We investigate here purely imaginary independence roots. We show that…

In this paper we give a complete classification of two-step nilpotent Leibniz algebras in terms of Kronecker modules associated with pairs of bilinear forms. In particular, we describe the complex and the real case of the indecomposable…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

We consider finite-dimensional complex Lie algebras admitting a periodic derivation, i.e., a nonsingular derivation which has finite multiplicative order. We show that such Lie algebras are at most two-step nilpotent and give several…

The metric approach to studying 2-step nilpotent Lie algebras by making use of non-degenerate scalar products is realised. We show that any 2-step nilpotent Lie algebra is isomorphic to its standard pseudo-metric form, that is a 2-step…

We give a full classification of 6-dimensional nilpotent Lie algebras over an arbitrary field, including fields that are not algebraically closed and fields of characteristic~2. To achieve the classification we use the action of the…

We provide a self contained, elementary, and geometrically-flavored classification of $8$-dimensional $2$-step nilpotent Lie algebras over algebraically closed fields of characteristic $\ne 2,3$, using the algebro-geometric arguments from…

We define a solvable extension of the graph 2-step nilpotent Lie algebras of [5] by adding elements corresponding to the 3-cliques of the graph. We study some of their basic properties and we prove that two such Lie algebras are isomorphic…

We study symplectic structures on nilpotent Lie algebras. Since the classification of nilpotent Lie algebras in any dimension seems to be a crazy dream, we approach this study in case of 2-step nilpotent Lie algebras (in this sub-case also,…

Let $\mathbf{A}$ be a finite nilpotent algebra in a congruence modular variety with finitely many fundamental operations. If $\mathbf{A}$ is of prime power order, then it is known that there is a polynomial $p$ such that for every $n \in…

A 2-step nilpotent Lie algebra n is said to be of type (p,q)if dim(n)=p+q and dim([n,n])=p. By considering a class of 2-step nilpotent Lie algebras naturally attached to graphs, we prove that there exist indecomposable, 2-step nilpotent Lie…

For a graph $G$, its $k$-th power $G^k$ is constructed by placing an edge between two vertices if they are within distance $k$ of each other. The $k$-independence number $\alpha_k(G)$ is defined as the independence number of $G^k$. By using…

In 1973, Gauger proposed a generator-relation method and a duality theory for two-step nilpotent Lie algebras. Based upon these, he classified two-step nilpotent Lie algebras of dimension $8$. In 1999, Galitski and Timashev continued this…

Given an integer $k\geq 3$ and an initial $k-1$ isolated vertices, an {\em antiregular $k$-hypergraph} is constructed by alternatively adding an isolated vertex (connected to no other vertices) or a dominating vertex (connected to every…