Related papers: Complex structures on 2-step nilpotent Lie algebra…
Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implications in diverse fields ranging from matching problems to the…
Recent advancements in complex network analysis are encouraging and may provide useful insights when applied in software engineering domain, revealing properties and structures that cannot be captured by traditional metrics. In this paper,…
A Hermitian metric on a complex manifold is called SKT (strong K\"ahler with torsion) if the Bismut torsion $3$-form $H$ is closed. As the conformal generalization of the SKT condition, we introduce a new type of Hermitian structure, called…
In an earlier work, finite groups whose power graphs are minimally edge connected have been classified. In this article, first we obtain a necessary and sufficient condition for an arbitrary graph to be minimally edge connected.…
The concept of breadth has been used in the classification of p-groups and nilpotent Lie algebras. In this paper, we investigate this notion for finite-dimensional solvable Lie algebras. Our main focus is to characterize solvable Lie…
We present graph-based modeling abstractions to represent cyber-physical dependencies arising in complex systems. Specifically, we propose an algebraic graph abstraction to capture physical connectivity in complex optimization models and a…
We present an easy structure theorem for graphs which do not admit an immersion of the complete graph. The theorem motivates the definition of a variation of tree decompositions based on edge cuts instead of vertex cuts which we call…
Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…
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.…
We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of…
The enhanced power graph of a group is the simple graph whose vertex set is consisted of all elements of the group, and whose any pair of vertices are adjacent if they generate a cyclic subgroup. In this paper, we classify all finite groups…
In this paper we give the list of all 7-dimensional nilpotent real Lie algebras that admit a contact structure. Based on this list, we describe all 7-dimensional nilmanifolds that admit an invariant contact structure.
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…
Let $(M,J)$ be a complex manifold of complex dimension $n$. A $p$-K\"ahler structure on $(M,J)$ is a real, closed $(p,p)$-transverse form. In this paper, we address the conjecture of L. Alessandrini and G. Bassanelli on $(n-2)$-K\"ahler…
We define and analyze various generalizations of the punctual Hilbert scheme of the plane, associated to complex or real Lie algebras. Out of these, we construct new geometric structures on surfaces whose moduli spaces share multiple…
Properties of graphs that can be characterized by the spectrum of the adjacency matrix of the graph have been studied systematically recently. Motivated by the complexity of these properties, we show that there are such properties for which…
In this paper we develop the obstruction theory for lifting complexes, up to quasi-isomorphism, to derived categories of flat nilpotent deformations of abelian categories. As a particular case we also obtain the corresponding obstruction…
The adaptive processing of structured data is a long-standing research topic in machine learning that investigates how to automatically learn a mapping from a structured input to outputs of various nature. Recently, there has been an…
If G is a non-nilpotent group and nil(G) = {g \in G : <g, h> is nilpotent for all h\in G}, the nilpotent graph of G is the graph with set of vertices G-nil(G) in which two distinct vertices are related if they generate a nilpotent subgroup…
We review the known results about characteristically nilpotent complex Lie algebras, as well as we comment recent developements in the theory.