✦ LIBER ✦

On a conjecture of Herstein

✍ Scribed by V.P Camillo

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 107 KB
Volume: 50
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(78)90154-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a conjecture of I. N. Herstein

✍ M Chacron 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 225 KB

On Herstein's Lie Map Conjectures, III

✍ K.I. Beidar; M. Brešar; M.A. Chebotar; W.S. Martindale 3rd 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 263 KB

In the two papers, "On Herstein's Lie Map Conjectures, I and II," solutions of all of Herstein's problems concerning Lie isomorphisms and derivations were given under the assumption that the algebras involved were of "sufficiently high" dimension. In the present paper we remove this restriction, the

On Herstein's Lie Map Conjectures, II

✍ K.I Beidar; M Brešar; M.A Chebotar; W.S Martindale 3rd 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 191 KB

On Herstein′s Theorems Relating Modulari

On Herstein′s Theorems Relating Modularity in A and A(+)

✍ J.A. Anquela 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 414 KB

In this paper we examine the relationship between the lattices of subalgebras of \(A\) and \(A^{(+)}\)(for \(A\) an associative algebra) with respect to the property of being modular, by defining a radical-type ideal which measures this modular behavior. 1994 Academic Press, Inc

On a Conjecture of Chalk

✍ Ping Ding 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Let f # Z[x] with degree k and let p be a prime. By a complete trigonometric sum we mean a sum of the form S(q, f )= q x=1 e q ( f (x)), where q is a positive integer and e q (:)=exp(2?if (x)Âq). Professor Chalk made a conjecture on the upper bound of S(q, f ) when q is a prime power. We prove Chalk

On a Conjecture of Woodall

✍ Hao Li 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Dirac proved in 1952 that every 2-connected graph of order n and minimum degree k admits a cycle of length at least minfn; 2kg: As a possible improvement, Woodall conjectured in 1975 that if a 2-connected graph of order n has at least n 2 þ k vertices of degree at least k; then it has a cycle of len