Related papers: Nilpotent graphs over skew PBW extensions
Let G be an almost simple group over an algebraically closed field k of characteristic zero, let g be its Lie algebra and let B be a Borel subgroup of G. Then B acts with finitely many orbits on the variety N_2 of the nilpotent elements in…
In this work we prove general bounds for the diameter of random graphs generated by a preferential attachment model whose parameter is a function $f:\mathbb{N}\to[0,1]$ that drives the asymptotic proportion between the numbers of vertices…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
This paper initiates the study of effective twisted conjugacy separability for finitely generated groups, which measures the complexity of separating distinct twisted conjugacy classes via finite quotients. The focus is on nilpotent groups,…
The flip graph is the graph whose nodes correspond to non-isomorphic combinatorial triangulations and whose edges connect pairs of triangulations that can be obtained one from the other by flipping a single edge. In this note we show that…
We study relations between different notions of nilpotency in the context of skew braces and applications to the structure of solutions to the Yang-Baxter equation. In particular, we consider annihilator nilpotent skew braces, an important…
We present a proof of an upper bound for the lengths of finite dimensional representations of algebras obeying a modified PBW property, including Lie algebras and quantum groups. The sharpness of the bound is proved and discussed.
In \cite{Chan95}, the authors classified the 2-extendable abelian Cayley graphs and posed the problem of characterizing all 2-extendable Cayley graphs. We first show that a connected bipartite Cayley (vertex-transitive) graph is…
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…
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity…
In 1967, Katona and Szemer\'{e}di showed that no undirected graph with $n$ vertices and fewer than $\frac{n}{2}\log_2\frac{n}{2}$ edges admits an orientation of diameter two. In 1978, Chv\'atal and Thomassen revealed the complexity of…
In this paper, we determine the structure of the nilpotent multipliers of all pairs $(G,N)$ of finitely generated abelian groups where $N$ admits a complement in $G$. Moreover, some inequalities for the nilpotent multipliers of pairs of…
A Lie algebra $L$ is said to be of breadth $k$ if the maximal dimension of the images of left multiplication by elements of the algebra is $k$. In this paper we give characterization of finite dimensional nilpotent Lie algebras of breadth…
We study the linear extension complexity of stable set polytopes of perfect graphs. We make use of known structural results permitting to decompose perfect graphs into basic perfect graphs by means of two graph operations: 2-join and skew…
For a graph G, its rth power G^r has the same vertex set as G, and has an edge between any two vertices within distance r of each other in G. We give a lower bound for the number of edges in the rth power of G in terms of the order of G and…
We construct a 3-variable enrichment of the Lawrence-Krammer-Bigelow (LKB) representation of the braid groups, which is the limit of a pro-nilpotent tower of representations having the original LKB representation as its bottom layer. We…
In this paper the strong metric dimension of generalized Petersen graphs $GP(n,2)$ is considered. The exact value is determined for cases $n=4k$ and $n=4k+2$, while for $n=4k+1$ an upper bound of the strong metric dimension is presented.
We derive attainable upper bounds on the algebraic connectivity (spectral gap) of a regular graph in terms of its diameter and girth. This bound agrees with the well-known Alon-Boppana-Friedman bound for graphs of even diameter, but is an…
The survey is devoted to associative $\Z_{\ge0}$-graded algebras presented by n generators and n(n-1)/2 quadratic relations and satisfying the so-called Poincare-Birkhoff-Witt condition (PBW-algebras). We consider examples of such algebras…
We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…