✦ LIBER ✦

On a theorem of Berkovich

✍ Scribed by Manuel J. Alejandre; A. Ballester-Bolinches

Publisher: The Hebrew University Magnes Press
Year: 2002
Tongue: English
Weight: 344 KB
Volume: 131
Category: Article
ISSN: 0021-2172
DOI: 10.1007/bf02785855

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note on a paper of Berkovich

✍ Norman Blackburn 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 598 KB

On the Taketa Theorem

✍ Yakov Berkovich 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 164 KB

In this note we prove that a finite group is almost solvable if every irreducible Ž character is induced from a character of degree at most 4 more precisely, such a Ž . Ž . .

On Thompson's Theorem

✍ Lev Kazarin; Yakov Berkovich 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 138 KB

Let p be a prime divisor of the order of a finite group G. Thompson (1970, J. Algebra 14, 129-134) has proved the following remarkable result: a finite group G is p-nilpotent if the degrees of all its nonlinear irreducible characters are divisible by p (in fact, in that case G is solvable). In this

A criterion for weak convergence on Berk

A criterion for weak convergence on Berkovich projective space

✍ Clayton Petsche 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 235 KB

A Double Bounded Version of Schur's Part

A Double Bounded Version of Schur's Partition Theorem

✍ Krishnaswami Alladi; Alexander Berkovich 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 255 KB

A Computer Proof of a Polynomial Identit

A Computer Proof of a Polynomial Identity Implying a Partition Theorem of Göllnitz

✍ Alexander Berkovich; Axel Riese 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 117 KB

In this paper we give a computer proof of a new polynomial identity, which extends a recent result of Alladi and the first author. In addition, we provide computer proofs for new finite analogs of Jacobi and Euler formulas. All computer proofs are done with the aid of the new computer algebra packag