Results 151 to 160 of about 96,933 (288)

Nilpotent Graph [PDF]

open access: yesarXiv, 2018
In this article, we introduce the concept of nilpotent graph of a finite commutative ring. The set of all non nilpotent elements of a ring is taken as the vertex set and two vertices are adjacent if and only if their sum is nilpotent. We discuss some graph theoretic properties of nilpotent graph.
arxiv  

NILPOTENT CLASSICAL MECHANICS [PDF]

open access: yesInternational Journal of Modern Physics A, 2007
The formalism of nilpotent mechanics is introduced in the Lagrangian and Hamiltonian form. Systems are described using nilpotent, commuting coordinates η. Necessary geometrical notions and elements of generalized differential η-calculus are introduced. The so-called s-geometry, in a special case when it is orthogonally related to a traceless symmetric
openaire   +2 more sources

The number of nilpotent semigroups of degree 3

open access: yes, 2012
A semigroup is \emph{nilpotent} of degree 3 if it has a zero, every product of 3 elements equals the zero, and some product of 2 elements is non-zero.
Distler, Andreas, Mitchell, James D.
core  

Some Residual Properties of Finite Rank Groups

open access: yesМоделирование и анализ информационных систем, 2014
The generalization of one classical Seksenbaev theorem for polycyclic groups is obtained. Seksenbaev proved that if G is a polycyclic group which is residually finite p-group for infinitely many primes p, it is nilpotent. Recall that a group G is said to
D. N. Azarov
doaj   +1 more source

The upper bound for the index of nilpotency for a matrix commuting with a given nilpotent matrix [PDF]

open access: yesarXiv, 2007
We study the set $\partition{\nb}$ of all possible Jordan canonical forms of nilpotent matrices commuting with a given nilpotent matrix $B$. We describe $\partition{\nb}$ in the special case when $B$ has only one Jordan block. In the general case, we find the maximal possible index of nilpotency in the set of all nilpotent matrices commuting with a ...
arxiv  

Home - About - Disclaimer - Privacy