The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Let be a prime. We assign to each positive number a digraph whose set of vertices is and there exists a directed edge from a vertex to a vertex if . In this paper we obtain a necessary and sufficient condition for .
We investigate the formal matrix ring over defined by a certain system of factors. We give a method for constructing formal matrix rings from non-negative integer matrices. We also show that the principal factor matrix of a binary system of factors determine the structure of the system.
An element in a ring is clean (or, unit-regular) if it is the sum (or, the product) of an idempotent and a unit, and is nil-clean if it is the sum of an idempotent and a nilpotent. Firstly, we show that Jacobson’s lemma does not hold for nil-clean elements in a ring, answering a question posed by Koşan, Wang and Zhou (2016). Secondly, we present new counter-examples to Diesl’s question whether a nil-clean element is clean in a ring. Lastly, we give new examples of unit-regular elements that are...
Download Results (CSV)