Matchings for linearly indecomposable modular lattices
โ Scribed by Klaus Reuter
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 181 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
Given a finite lattice L, let J(L) (M(L)) denote the set of nonzero join irreducible (nonunit meet irreducible) elements of L. A finite lattice L is said to be linearly indecomposable if there do not exist x, y E L with x < y such that z cx or z 2 y for all z E L{x, y}. We prove: Every finite linearly indecomposable modular lattice L has a matching of J(L) to M(L), i.e., a bijection f of J(L) to M(L) with x <f(x) for each x E J(L).
๐ SIMILAR VOLUMES
We calculate explicitly the character of some indecomposable tilting modules for ลฝ . SL K where K is a field of characteristic p ) 2. แฎ 2000 Academic Press 3 This paper presents a central result of my Ph.D. thesis, and it is my pleasure to express my gratitude to my thesis advisor, H. H. Andersen ลฝ
A Petersen brick is a graph whose underlying simple graph is isomorphic to the Petersen graph. For a matching covered graph G, b(G) denotes the number of bricks of G, and p(G) denotes the number of Petersen bricks of G. An ear decomposition of G is optimal if, among all ear decompositions of G, it u
In this work we report on the activation of KY 1-x-y Gd x Lu y (WO 4 ) 2 lattice matched epitaxial layers with Er 3+ and Tm 3+ ions. The epilayers posses low enough lattice mismatch as well as high enough refractive index contrast with respect to the KY(WO 4 ) 2 substrates, which are key parameters