Results 291 to 300 of about 16,769 (309)
Some of the next articles are maybe not open access.
Commutativity of rings with constraints on commutators
2000This paper studies commutativity of rings \(R\) satisfying polynomial identities of the form\break \(x^t[x^n,y]y^r=[x,y^m]y^s\) and three similar forms, where \(n,m,r,s,t\) are suitably-chosen nonnegative integers. Whether the theorems are correct as stated is not clear, but for some \((n,m,r,s,t)\) the proofs given do not work.
openaire +2 more sources
Canadian Journal of Mathematics, 1960
Let A, B, and X be n-square matrices over an algebraically closed field F of characteristic 0. Let [A, B] = AB — BA and set (A, B) = [A, [A, B]]. Recently several proofs (1; 3; 5) of the following result have appeared: if det (AB) ≠ 0 and (A,B) = 0 then A-1B-1AB - I is nilpotent.
Marcus, Marvin, Khan, Nisar A.
openaire +2 more sources
Let A, B, and X be n-square matrices over an algebraically closed field F of characteristic 0. Let [A, B] = AB — BA and set (A, B) = [A, [A, B]]. Recently several proofs (1; 3; 5) of the following result have appeared: if det (AB) ≠ 0 and (A,B) = 0 then A-1B-1AB - I is nilpotent.
Marcus, Marvin, Khan, Nisar A.
openaire +2 more sources
Canadian Journal of Mathematics, 1963
The following elementary facts about certain commutative diagrams, called "squares," are stated and proved in terms of abelian groups and their homomorphisms. However, they are valid for arbitrary abelian categories and can be proved also for them. This does not need to be shown, since every abelian category can be embedded into the category of abelian
openaire +2 more sources
The following elementary facts about certain commutative diagrams, called "squares," are stated and proved in terms of abelian groups and their homomorphisms. However, they are valid for arbitrary abelian categories and can be proved also for them. This does not need to be shown, since every abelian category can be embedded into the category of abelian
openaire +2 more sources
American Journal of Mathematics, 1952
A mathematical formulation of the famous Heisenberg uncertainty principle is that a certain pair of linear transformations P and Q satisfies, after suitable normalizations, the equation PQ - QP = 1. It is easy enough to produce a concrete example of this behavior; consider L2(-∞, +∞) and let P and Q be the differentiation transformation and the ...
openaire +1 more source
A mathematical formulation of the famous Heisenberg uncertainty principle is that a certain pair of linear transformations P and Q satisfies, after suitable normalizations, the equation PQ - QP = 1. It is easy enough to produce a concrete example of this behavior; consider L2(-∞, +∞) and let P and Q be the differentiation transformation and the ...
openaire +1 more source
18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 1977
In this paper we show that the computation of the determinant requires an exponential number of multiplications if the commutativity of indeterminates is not allowed. The determinant can be computed in polynomial time with the commutation of indeterminates.
openaire +1 more source
In this paper we show that the computation of the determinant requires an exponential number of multiplications if the commutativity of indeterminates is not allowed. The determinant can be computed in polynomial time with the commutation of indeterminates.
openaire +1 more source
Commutativity, non-commutativity, and bilinearity
Information Processing Letters, 1976openaire +2 more sources
Commutation Failure Mitigation Method Based on Imaginary Commutation Process
Journal of Modern Power Systems and Clean Energy, 2022Renlong Zhu +2 more
exaly