Some combinatorial principles for solving algebraic problems
Black Boxcombinatorial principlesdiamondrealizing rings as endomorphism ringstorsion-free Abelian groups
Applications of set theory (03E75) Applications of logic in associative algebras (16B70) Endomorphism rings; matrix rings (16S50) Applications of logic to group theory (20A15) General structure theorems for groups (20E34) Torsion-free groups, infinite rank (20K20) Automorphisms, homomorphisms, endomorphisms, etc. for abelian groups (20K30)
This very interesting paper provides a well written survey on the influence and application of combinatorial methods in algebra. The author offers various infinite combinatorial principles which are designed for applications in different areas of mathematics. Some of these theorems are provable in ordinary set theory, others need additional set theoretic assumptions like the (generalized) continuum hypothesis or even more which hold for instance in Gödel's universe. In the first section Shelah's Black Box is stated for use in torsion-free Abelian groups and the main steps of the proof are explained in an easy way which helps the reader to modify the Black Box to adopt it to her/his own mathematical needs. One of the earliest examples of the use of the Black Box is illustrated in section two. The existence of arbitrarily large torsion-free Abelian groups with endomorphism ring the ring of integers is shown, a result due to Shelah. In the third section prediction principles like the stationary Black Box, the Shelah elevator, and diamond principles are explained. Some of them are based on ZFC and some of them need additional set theory. However, the author has found an easy way of explanation and has avoided confusing details. Finally, in the last section recent results obtained using these combinatorial principles are stated, mostly from group theory. It is demonstrated how powerful infinite combinatorics can influence (and simplify) algebra and which amazing and strong results have been proved. In the end the author discusses a list of open problems (mostly from non-commutative group theory) which are likely to be solved using the described principles. Moreover, he gives an extensive list of references for the combinatorial principles themselves and also for their applications to algebra. For the entire collection see [Zbl 0945.00021].
- Problems in algebraic combinatorics
- A combinatorial principle and endomorphism rings. I: On \(p\)-groups
- Small almost free modules with prescribed topological endomorphism rings.
- Rigid Abelian groups and the probabilistic method.
- scientific article; zbMATH DE number 980363 (Why is no real title available?)
- scientific article; zbMATH DE number 2169346 (Why is no real title available?)
- Infinite combinatorics plain and simple
- Derivation of some formulae in combinatrics by heuristic methods
This page was built for publication: Some combinatorial principles for solving algebraic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2702063)
