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

The independence polynomial $I(G,x)$ of a finite graph $G$ is the generating function for the sequence of the number of independent sets of each cardinality. We investigate whether, given a fixed number of vertices and edges, there exists…

A Riemannian Einstein solvmanifold (possibly, any noncompact homogeneous Einstein space) is almost completely determined by the nilradical of its Lie algebra. A nilpotent Lie algebra, which can serve as the nilradical of an Einstein metric…

We investigate Lie algebras whose Lie bracket is also an associative or cubic associative multiplication to characterize the class of nilpotent Lie algebras with a nilindex equal to 2 or 3. In particular we study the class of 2-step…

We consider a space of complex polynomials of degree $n\ge 3$ with $n-1$ distinguished periodic orbits. We prove that the multipliers of these periodic orbits considered as algebraic functions on that space, are algebraically independent…

We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.

We consider left-invariant (purely) coclosed G$_2$-structures on 7-dimensional 2-step nilpotent Lie groups. According to the dimension of the commutator subgroup, we obtain various criteria characterizing the Riemannian metrics induced by…

We thoroughly explore the class of k-step nilpotent Lie algebras associated with a simple graph looking for k-step nilpotent Lie algebras which are rigid in the variety of at most k-step nilpotent Lie algebras. We find out that, besides the…

The index of a Lie algebra is an important invariant which arises in several areas, e.g. in the study of coadjoint orbits for a Lie group, in invariant theory and in representation theory. We study the index for several classes of nilpotent…

We construct several pairwise-incomparable bounds on the projective dimensions of edge ideals. Our bounds use combinatorial properties of the associated graphs; in particular we draw heavily from the topic of dominating sets. Through…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size and its roots are called independence roots. We bound the maximum modulus, $\mbox{maxmod}(n)$, of an independence root over…

This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…

We proved in previous work that all real nilpotent Lie algebras of dimension up to $10$ carrying an ad-invariant metric are nice. In this paper we show by constructing explicit examples that nonnice irreducible nilpotent Lie algebras…

From around 2010 onward, Elsner et al.,developed and applied a method in which the algebraic independence of n quantities x_1,...,x_n over a field is transferred to further n quantities y_1,...,y_n by means of a system of polynomials in 2n…

We introduce a notion of non-commutative joint independence for multiple algebras in a non-commutative probability space. The pairwise relationships between these algebras are encoded by a graph with two edge sets -- a combinatorial…

Recently, Davies, Jenssen, Perkins, and Roberts gave a very nice proof of the result (due, in various parts, to Kahn, Galvin-Tetali, and Zhao) that the independence polynomial of a $d$-regular graph is maximized by disjoint copies of…

The independence polynomial $i(G,x)$ of a graph $G$ is the generating function of the numbers of independent sets of each size. A graph of order $n$ is very well-covered if every maximal independent set has size $n/2$. Levit and Mandrescu…

We establish the independence of multipliers for polynomial endomorphisms of $\mathbb C^n$ and endomorphisms of $\mathbb P^n.$ This allows us to extend results about the bifurcation measure and the critical height obtained in…

A 2-step nilpotent Lie algebra n is called nonsingular if ad(X): n --> [n,n] is onto for any X not in [n,n]. We explore nonsingular algebras in several directions, including the classification problem (isomorphism invariants), the existence…

Given a simple undirected graph, one can construct from it a $c$-step nilpotent Lie algebra for every $c \geq 2$ and over any field $K$, in particular also over the real and complex numbers. These Lie algebras form an important class of…

The invariants of solvable Lie algebras with nilradicals isomorphic to the algebra of strongly upper triangular matrices and diagonal nilindependent elements are studied exhaustively. Bases of the invariant sets of all such algebras are…