scientific article; zbMATH DE number 1313604
For a lattice \((L,\vee,\wedge)\) all of whose elements \(a,b\) fulfil the implication \[ \text{If }a\wedge b\text{ is a lower cover of \(a\), then \(b\) is a lower cover of }a\vee b. \tag{Sm} \] Wilcox coined the term semimodular. For lattices of finite length semimodularity represents ``one half of modularity, because the latter is implied by the conjunction of (Sm) and its reverse. Although in the absence of finite length the concept of semimodularity ``ramifies in a most unpleasant way (G. Birkhoff 1967; cf. this book, page x) the author succeeded in writing a most pleasant book which among others presents the different facets of the concept of semimodularity in lattices of infinite length as they have been revealed by Wilcox, Mac Lane, and others. The book under review is an extended version of the author's earlier monograph [Semimodular lattices. Dedicated to Garrett Birkhoff, Teubner-Texte zur Mathematik. 125. Stuttgart etc.: B. G. Teubner Verlagsgesellschaft (1991; Zbl 0743.06008)]. To the profit of the reader the book proceeds in a historico-genetical manner. The text as well as the corresponding notes contain an impressing wealth of material on semimodularity. The style of writing spans the gap between a research monograph reviewing results only and a detailed textbook -- giving those proofs which hitherto have not been provided by other textbooks. Many exercises are given and open problems are mentioned. Hence the book is useful for students as well as researchers interested in the subject of semimodularity. The nine chapters of the book are entitled as follows: 1) From Boolean algebras to semimodular lattices; 2) M-symmetric lattices; 3) Conditions related to semimodularity, 0-conditions, and disjointness properties; 4) Supersolvable and admissible lattices; consistent and strong lattices; 5) The covering graph; 6) Semimodular lattices of finite length; 7) Local distributivity; 8) Local modularity; 9) Congruence semimodularity. Chapters 2 and 3 analyze so-called conditions related to semimodularity, i.e. conditions which are equivalent to semimodularity for lattices of finite length. Chapter 2 examines Wilcox' concept of M-symmetry referring also to partly unpublished work of Wilcox which was fed from the relationship between projective and affine geometry. The main reason for Wilcox' objection against (Sm) was that (Sm) refers to the covering relation such that it holds trivially in any lattice with only continuous chains. Orthomodular lattices and M-symmetry are revisited in 2.6, whence here quantum logics are touched upon. Chapter 3 takes a look at Mac Lane's covering-free approach to semimodularity: A lattice is said to satisfy Mac Lane's condition if for any \(x,y,z\in L\) with \(y\wedge z< x< z< y\vee x\) there exists \(t\in L\) such that \(y\wedge z< t< y\) and \(x= (x\vee t)\wedge z\), which means that inside \(L\) any (non-modular) pentagon extends to a (semimodular) centered hexagon. The author shows in 3.1 how Mac Lane's condition (Mac), Birkhoff's condition (Bi), semimodularity (Sm), M-symmetry (Ms) are related in general, and that in particular they are equivalent in upper continuous strongly atomic lattices. Here (Bi) stands for a weakening of (Sm), namely: If \(a\wedge b\) is a lower cover of \(a\) and \(b\), then \(a\) and \(b\) are lower covers of \(a\vee b\). Chapter 3.2 looks at (Mac), (Bi), (Sm) and (Ms) as conditions on the ideal lattice or the lattice of dual ideals of \(L\) and shows how such requirements relate to properties of \(L\) itself. 3.3 studies the simplifications which are gained by assuming chain conditions (ACC or DCC). In 3.4 ``local properties are studied which arise when semimodularity, modularity and distributivity are required only ``at 0 (for instance setting \(a=0\) in (Sm)). Disjointness properties are also examined. Chapter 3.5 gives many results for lattices which have complementation properties, in particular with respect to the question of when ``local properties become global ones. Chapter 4 starts with the Möbius function of a poset (of a finite semimodular lattice, in particular). The author then studies supersolvable lattices [cf. \textit{R. Stanley}, Algebra Univers. 2, 197-217 (1972; Zbl 0256.06002)], which may or may not be semimodular, and he shows how finite semimodular lattices and supersolvable lattices fit into the framework of admissible lattices and of Cohen-Macaulay posets [cf. \textit{R. Stanley}, Algebra Univers. 4, 361-371 (1974; Zbl 0303.06006); \textit{A. Björner}, Trans. Am. Math. Soc. 260, 159-183 (1980; Zbl 0441.06002)]. Consistency [cf. \textit{J. P. S. Kung}, Math. Proc. Camb. Philos. Soc. 101, 221-231 (1987; Zbl 0626.06008)], and strongness [cf. \textit{U. Faigle}, J. Comb. Theory, Ser. B 28, 26-51 (1980; Zbl 0416.05029)] are examined in detail, for instance they are shown to be independent properties in general, which coincide for finite semimodular lattices. In chapter 5 the covering graph is a principal tool. The author among others describe covering graph isomorphisms of graded balanced lattices by direct product decompositions, thereby generalizing results of \textit{J. Jakubík} [Czech. Math. J. 4, 131-142 (1954; Zbl 0059.02602)], and \textit{D. Duffus} and \textit{I. Rival} [Discrete Math. 19, 139-158 (1977; Zbl 0372.06005)]. Finite semimodular lattices with centrally symmetric covering graph are finite Boolean lattices; this statement is shown to hold even if semimodularity is replaced by strongness of the dual lattice. Chapter 6 gives embedding results for finite semimodular lattices and many other classes of lattices, it considers a description of semimodular lattices by closure operators, or by selectors. Chapter 7 gives characterizations of local distributivity for finite lattices mainly following \textit{S. P. Avann} [Math. Ann. 154, 420-426 (1964; Zbl 0202.31703), and Math. Ann. 142, 345-354 (1961; Zbl 0094.01603)]. Chapter 8 contains for instance a characterization of the Kurosh-Ore replacement property for strongly atomic algebraic lattices, and applications to lattices of subnormal subgroups. Chapter 9 refers to algebras whose congruence lattice is semimodular. The semigroup case is given special attention. Each of the nine chapters is divided into subchapters each of which is supplemented by notes and references. For convenience of the reader a table of notations, a detailed subject index, and a master reference list containing all citations are given. All this underlines the overall impression of a very well organized book it is a pleasure to read in. It will certainly become a standard source.
- A characterization of neutral elements by the exclusion of sublattices
- On the NBC-complexes and \(\beta \)-invariants of abstract convex geometries
- Frankl's conjecture and the dual covering property
- A construction of semimodular lattices
- On upper continuous and semimodular lattices
- Semimodular lattices and semibuildings
- Excluded-minor characterizations of antimatroids arisen from posets and graph searches.
- A greedy algorithm for convex geometries
- The presence of lattice theory in discrete problems of mathematical social sciences. Why.
- Decomposition spaces, incidence algebras and Möbius inversion. II: Completeness, length filtration, and finiteness
- Chains, antichains, and complements in infinite partition lattices
- On 3-generated lattices with a completely modular element among generators
- On the embedding of the free lattice of rank 3 in the lattice freely generated by three completely right modular elements
- Slim semimodular lattices. I. A visual approach
- How many ways can two composition series intersect?
- A characterization of a semimodular lattice
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- A generalization of semimodular supersolvable lattice
- Complementation in representable theories of region-based space
- A cover-preserving embedding of semimodular lattices into geometric lattices
- A compact representation for modular semilattices and its applications
- Free 3-generated lattices with standard element among generators
- Semimodularity and the Jordan-Hölder theorem in posets, with applications to partial partitions
- Finite convex geometries of circles
- Translating between the representations of a ranked convex geometry
- Lattice characterization of finite nilpotent groups
- The lattice of varieties of monoids
- Enumerating maximal consistent closed sets in closure systems
- Subrecursive equivalence relations and (non-)closure under lattice operations
- On graphs of bounded semilattices
- Sufficient conditions for the finiteness of the 3-generated lattice with modular and distributive type elements among generators
- Coordinatization of finite join-distributive lattices.
- On the finiteness of a 3-generated lattice with left modular and separating elements among generators
- Constructions of triangular norms on lattices by means of irreducible elements
- Finitely generated lattices with completely modular elements among generators.
- Diagrams and rectangular extensions of planar semimodular lattices
- Distributivity for upper continuous and strongly atomic lattices
- Antichain cutsets of strongly connected posets
- Slim semimodular lattices. II: A description by patchwork systems
- Reducibility number
- Modularity and distributivity of 3-generated lattices with special elements among generators
- On infinity of the free 3-generated lattice with one left modular generator
- Comparability graphs of lattices
- Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive super\-matroid
- Linear algebra in lattices and nilpotent endomorphisms of semisimple modules
- On rank functions of lattices
- Modularity for upper continuous and strongly atomic lattices
- Finitely generated lattices with \(M\)-standard elements among generators.
- Comparability Axioms in Orthomodular Lattices and Rings with Involution
- Relational lattices: from databases to universal algebra
- Quasiplanar diagrams and slim semimodular lattices
- Interval decomposition lattices are balanced
- Lattice of retracts of monounary algebras
- Graph isomorphic discrete partially ordered sets and semimodularity
- scientific article; zbMATH DE number 5610899 (Why is no real title available?)
- Lattices with Complemented Tolerance Lattice
- Wilcox posets and parallelism in posets.
- Semilattice structures of spreading models
- scientific article; zbMATH DE number 4066965 (Why is no real title available?)
- Isometrical embeddings of lattices into geometric lattices
- CD-independent subsets in meet-distributive lattices.
- scientific article; zbMATH DE number 50948 (Why is no real title available?)
- scientific article; zbMATH DE number 51319 (Why is no real title available?)
- scientific article; zbMATH DE number 3557832 (Why is no real title available?)
- scientific article; zbMATH DE number 1226264 (Why is no real title available?)
- Particle simulations of space weather
- scientific article; zbMATH DE number 1013851 (Why is no real title available?)
- Relations between some dimensions of semimodular lattices.
- An extension theorem for planar semimodular lattices.
- Algebraic lattices in QFT renormalization
- Notes on join semidistributive lattices
- Algorithms for k-meet-semidistributive lattices
- Embedding convex geometries and a bound on convex dimension
- scientific article; zbMATH DE number 7122741 (Why is no real title available?)
- On the efficacy of state space reconstruction methods in determining causality
- A broad class of shellable lattices
- Semilattice structures.
- The geometry of discrete \(L\)-algebras
- Chordal and perfect zero-divisor graphs of posets and applications to graphs associated with algebraic structures
- The best extending cover-preserving geometric lattices of semimodular lattices
- Properties of congruences of twisted partition monoids and their lattices
- On the metrization of the infinite partition lattice
- On semigroups with lower semimodular lattice of subsemigroups.
- The Jordan-Hölder theorem with uniqueness for groups and semimodular lattices
- The lattice of compatible quasiorders of acyclic monounary algebras
- On the problem of characterizing standard elements by the exclusion of sublattices
- Dual digraphs of finite meet-distributive and modular lattices
- On the lattice of pronormal subgroups of dicyclic, alternating and symmetric groups.
- Decompositions in complete lattices. II: Replaceable irredundant decompositions
- A combinatorial structure for many hierarchically hyperbolic spaces
- On the Kurosh-Ore replacement property in semimodular lattices
- Convex geometries yielded by transit functions
- On forbidden configuration of pseudomodular lattices.
- Pointed lattice subreducts of varieties of residuated lattices
- The affine representation theorem for abstract convex geometries
- Characterization of supermodular semilattice
- Free 3-generated lattices with two semi-normal generators
- On the lattice of group topologies
- Geometry of convex geometries
- Evaluations and structural properties of finite lattices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256200)