Related papers: Nilpotent graphs over skew PBW extensions
The diameter of an undirected or a directed graph is defined to be the maximum shortest path distance over all pairs of vertices in the graph. Given an undirected graph $G$, we examine the problem of assigning directions to each edge of $G$…
The aim of this short note is to completely answer Questions 2.34 and 2.35 of arXiv:1806.01127. In particular, we show that a finite strong-nil skew brace $B$ of abelian type need not be right-nilpotent, but that this is the case if~$B$ is…
Let F be a finite field and R = M2(F) be 2x2 matrix ring over F. In this paper, we explicitly determine all the idempotents in R. Using these idempotents, we study the idempotent graph of R whose vertex set is the set of non-trivial…
Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a strong resolving…
We introduce the concept of weight graph for the weight system $P\frak{g}(T)$ of a finite dimensional nilpotent Lie algebra $\frak{g}$ and analyze the necessary conditions for a $(p,q)$-graph to be a weight graph for some $\frak{g}$.
Many rings and algebras arising in quantum mechanics can be interpreted as skew PBW (Poincar\'e-Birkhoff-Witt) extensions. Indeed, Weyl algebras, enveloping algebras of finite-dimensional Lie algebras (and its quantization), Artamonov…
We extend results on finite dimensional nilpotent Lie algebras to Leibniz algebras and counterexamples to others are found. One generator algebras are used in these examples and are investigated further.
Clique-width is a well-known graph parameter. Many NP-hard graph problems admit polynomial-time solutions when restricted to graphs of bounded clique-width. The same holds for NLC-width. In this paper we study the behavior of clique-width…
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…
There are normal sub-blocks of nilpotent blocks which are NOT nilpotent or, equivalently, nilpotent extensions of non-nilpotent blocks. In this paper we determine the source algebra structure of the non-nilpotent blocks involved in these…
The modelling of interconnection networks by graphs motivated the study of several extremal problems that involve well known parameters of a graph (degree, diameter, girth and order) and ask for the optimal value of one of them while…
Gromov claimed, with a sketch of proof, that simply connected nilpotent Lie groups have polynomially bounded filling invariants. The literature establishes this, often with a stronger conclusion where the exponent of polynomiality is…
In this paper we extend the theory of bidimensionality to two families of graphs that do not exclude fixed minors: map graphs and power graphs. In both cases we prove a polynomial relation between the treewidth of a graph in the family and…
In this paper we introduce a new infinite class of bipartite graphs, called jumped Wenger graphs, which are closely related to Wenger graphs. An tight upper bound of the diameter and the exact girth of a jumped Wenger graph $J_m(q, i, j )$…
It is well known that 3--regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3--regular graphs without reducing the girth, thereby proving that such graphs with…
We study iterated differential polynomial rings over a locally nilpotent ring and show that a large class of such rings are Behrens radical. This extends results of Chebotar and Chen et al.
In recent work, Graham has constructed a variety with a map to the nilpotent cone which is similar in some ways to the Springer resolution. One aspect in which Graham's map differs is that it is not in general an isomorphism over the…
In [Curtin and Pourgholi, A group sum inequality and its application to power graphs, J. Algebraic Combinatorics, 2014], it is proved that among all directed power graphs of groups of a given order $ n $, the directed power graph of cyclic…
The degree/diameter problem for mixed graphs asks for the largest possible order of a mixed graph with given diameter and degree parameters. Similarly the \emph{degree/geodecity} problem concerns the smallest order of a $k$-geodetic mixed…
In this paper we describe the prime ideals of some important classes of skew PBW extensions, using the classical technique of extending and contracting ideals. Skew PBW extensions include as particular examples Weyl algebras, enveloping…