相关论文: Independence Polynomials of 2-step Nilpotent Lie A…
We provide a classification of all dynamical Lie algebras generated by 2-local spin interactions on undirected graphs. Building on our previous work where we provided such a classification for spin chains, here we consider the more general…
For a finite set of homogeneous locally nilpotent derivations of the algebra of polynomials in several variables, a finite dimensionality criterion for the Lie algebra generated by these derivations is known. Also the structure of the…
The structure of a solvable Lie groups admitting an Einstein left-invariant metric is, in a sense, completely determined by the nilradical of its Lie algebra. We give an easy-to-check necessary and sufficient condition for a nilpotent…
The $k$-independence number of a graph is the maximum size of a set of vertices at pairwise distance greater than $k$. A graph is called $k$-partially walk-regular if the number of closed walks of a given length $l\le k$, rooted at a vertex…
The paper is devoted to the study of local derivations and automorphisms of nilpotent Lie algebras. Namely, we proved that nilpotent Lie algebras with indices of nilpotency $3$ and $4$ admit local derivation (local automorphisms) which is…
In this paper, we focus on the study of immanantal polynomials for linear combination matrices composed of the degree matrix and adjacency matrix of a graph. First, applying the concept of vertex orientation for general graphs, we provide a…
Results describing Lie ideals and maximal finite-codimensional Lie subalgebras of the Lie algebras associated with Lie algebroids with non-singular anchor maps are presented. It is also proved that every isomorphism of such Lie algebras…
Main ideas of the differential geometry on affine bundles are presented. Affine counterparts of Lie algebroid and Poisson structures are introduced and discussed. The developed concepts are applied in a frame-independent formulation of the…
Write ${\cal I}(G)$ for the set of independent sets of a graph $G$ and $i(G)$ for $|{\cal I}(G)|$. It has been conjectured (by Alon and Kahn) that for an $N$-vertex, $d$-regular graph $G$, $$ i(G) \leq \left(2^{d+1}-1\right)^{N/2d}. $$ If…
We propose the study and description of the structure of complex Lie algebras with nilradical a nilpotent Lie algebra of type 2 by using sl2(C)-representation theory. Our results will be applied to review the classification given in [1] (J.…
An independent dominating set of the simple graph $G=(V,E)$ is a vertex subset that is both dominating and independent in $G$. The independent domination polynomial of a graph $G$ is the polynomial $D_i(G,x)=\sum_{A} x^{|A|}$, summed over…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
All subalgebras, idempotents, left(right) ideals and left quasi-units of two-dimensional algebras are described. Classification of algebras with given number of subalgebras, left(right) ideals are provided. In particular, a list of…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
This paper studies how many orthogonal bi-invariant complex structures exist on a metric Lie algebra over the real numbers. Recently, it was shown that irreducible Lie algebras which are additionally $2$-step nilpotent admit at most one…
Given a sequence $\vec d=(d_1,\dots,d_k)$ of natural numbers, we consider the Lie subalgebra $\mathfrak{h}$ of $\mathfrak{gl}(d,\mathbb{F})$, where $d=d_1+\cdots +d_k$ and $\mathbb{F}$ is a field of characteristic 0, generated by two block…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
We introduce a lower bound for the independence number of an arbitrary $k$-uniform hypergraph that only depends on the number of vertices and number of edges of the hypergraph.
Fix a positive integer $n$ and consider the bipartite graph whose vertices are the $3$-element subsets and the $2$-element subsets of $[n]=\{1,2,\dots,n\}$, and there is an edge between $A$ and $B$ if $A\subset B$. We prove that the…
We consider the space of degree $n\ge 2$ rational maps of the Riemann sphere with $k$ distinct marked periodic orbits of given periods. First, we show that this space is irreducible. For $k=2n-2$ and with some mild restrictions on the…