Related papers: Nilpotent Graph

An inaccessible, vertex transitive, locally finite graph is described. This graph is not quasi-isometric to a Cayley graph.

Let $R$ be a ring (not necessary commutative) with non-zero identity. The unit graph of $R$, denoted by $G(R)$, is a graph with elements of $R$ as its vertices and two distinct vertices $a$ and $b$ are adjacent if and only if $a+b$ is a…

We classify the twisted tensor products of a finite set algebra with a two elements set algebra using colored quivers obtained through considerations analogous to Ore extensions. This provides also a classification of entwining structures…

In this paper we discuss graph inverse semigroups which are constucted from a directed graphs and study several interesting properties of graph inverse semigroups such as the nature of its idempotents, the structure of semilattice of…

We develop a structure theory for nilpotent symplectic alternating algebras.

To any 2x2-matrix K one assigns a commutative subalgebra B^{K}\subset U(gl_2[t]) called a Bethe algebra. We describe relations between the Bethe algebras, associated with the zero matrix and a nilpotent matrix.

We define a solvable extension of the graph 2-step nilpotent Lie algebras of [5] by adding elements corresponding to the 3-cliques of the graph. We study some of their basic properties and we prove that two such Lie algebras are isomorphic…

We introduce the concept of a weak nil clean ring, a generalization of nil clean ring, which is nothing but a ring with unity in which every element can be expressed as sum or difference of a nilpotent and an idempotent. Further if the…

We prove that in the graded commutative ring $K_{*}(\mathbb{S})$, all positive degree elements are multiplicatively nilpotent. The analogous statements also hold for $TC_{*}(\mathbb{S};\mathbb{Z}^{\wedge}_p)$ and $K_{*}(\mathbb{Z})$.

{Generalizing the notion of nil cleanness from \cite{D13}, in parallel to \cite{DM14}, we define the concept of {\it weak nil cleanness} for an arbitrary ring. Its comprehensive study in different ways is provided as well. A decomposition…

We show that the definition of unipotent (resp. nilpotent) pieces for classical groups given by Lusztig (resp. Lusztig and the author) coincides with the combinatorial definition using closure relations on unipotent classes (resp. nilpotent…

We discuss multi-graded nilpotent tuples of multi-graded vector spaces which are a generalization of graded nilpotent pairs. The multi-grading yields a natural notion of a shape of such tuple and our main interest is to answer the question…

Given a finite group $G$ and a subset $S\subseteq G,$ the bi-Cayley graph $\bcay(G,S)$ is the graph whose vertex set is $G \times \{0,1\}$ and edge set is $\{\{(x,0),(s x,1)\} : x \in G, s\in S \}$. A bi-Cayley graph $\bcay(G,S)$ is called…

In this note we consider 2-step nilpotent Lie algebras associated with graphs. We prove that 2-step nilpotent Lie algebras $\n$ and $\n'$ associated with graphs $(S, E)$ and $(S', E')$ respectively are isomorphic if and only if $(S, E)$ and…

It is shown that finite groups in which the order of the product of every pair of elements of co-prime order is the product of the orders, is nilpotent.

We prove that if an involution in a ring is the sum of an idempotent and a nilpotent then the idempotent in this decomposition must be 1. As a consequence, we completely characterize weakly nil-clean rings introduced recently in [Breaz,…

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…

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.…

Word maps provide a wealth of information about finite groups. We examine the connection between the probability distribution induced by a word map and the underlying structure of a finite group. We show that a finite group is nilpotent if…

We construct some examples of polynomial maps over finite fields that admit subvarieties with a peculiar property: every geometric point is mapped to a fixed point by some iteration of the map, while the whole subvariety is not. Several…