An Analogue of Distributivity for Ungraded Lattices

In this paper, we study lattices that posess both the properties of being extremal (in the sense of Markowsky) and of being left modular (in the sense of Blass and Sagan). We call such lattices trim and show that they posess some additional appealing properties, analogous to those of a distributive lattice. For example, trimness is preserved under taking intervals and suitable sublattices. Trim lattices satisfy a weakened form of modularity. The order complex of a trim lattice is contractible or homotopic to a sphere; the latter holds exactly if the maximum element of the lattice is a join of atoms. Any distributive lattice is trim, but trim lattices need not be graded. The main example of ungraded trim lattices are the Tamari lattices and generalizations of them. We show that the Cambrian lattices in types A and B defined by Reading are trim; we conjecture that all Cambrian lattices are trim.     

模糊幂格

本文研究了格向其模糊幂集上提升的问题.利用模糊集理论,引入了模糊幂格的概念,获得了模糊幂格及其模糊理想的若干基本性质,推广了格的结果.     

Interpreting arithmetics in the ideal lattice of a free vector lattice ℱ<Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

A vector space V over a real field R is a lattice under some partial order, which is referred to as a vector lattice if u + (v ∨ w) = (u + v) ∨ (u + w) and u + (v ∧ w) = (u + v) ∧ (u + w) for all u, v, w ∈ V. It is proved that a model N of positive integers with addition and multiplications is relatively elementarily interpreted in the ideal lattice ℱ _n of a free vector lattice ℱ _n on a set of n generators. This, in view of the fact that an elementary theory for N is hereditarily undecidable, implies that an elementary theory for ℱ _n is also hereditarily undecidable. __________ Translated from Algebra i Logika, Vol. 47, No. 1, pp. 71–82, January–February, 2008.     

幂格与幂集格的关系

由幂格的定义知 ,幂格与幂集格是不同的 ,然而它们却有一定的联系 .本文在幂格概念的基础上 ,进一步地讨论幂格和幂集格在一定条件下的联系 .     

分配格中理想诱导的幂格

本文在文 [1 ]的基础上 ,给出由分配格中理想诱导的两种幂格 .     

幂格的同态与同余关系

本文在文[1]已引入幂格同态概念的基础上，进一步引入幂格同余关系的概念，并得到它们的一些相关性质．以及幂格同态与幂格同余关系的对应关系．     

模糊幂格的素理想与素对偶理想

讨论格与其模糊幂格的理想,对偶理想的关系,以及格与其模糊幂格的素理想,素对偶的关系.     

分配格中模糊理想诱导的模糊幂格

在模糊幂格讨论基础上,给出了由分配格中模糊理想诱导的两种模糊幂格.     

Lattices embeddable in subsemigroup lattices. I. Semilattices

V. B. Repnitskii showed that any lattice embeds in some subsemilattice lattice. In his proof, use was made of a result by D. Bredikhin and B. Schein, stating that any lattice embeds in the suborder lattice of a suitable partial order. We present a direct proof of Repnitskii’s result, which is independent of Bredikhin—Schein’s, giving the answer to a question posed by L. N. Shevrin and A. J. Ovsyannikov. We also show that a finite lattice is lower bounded iff it is isomorphic to the lattice of subsemilattices of a finite semilattice that are closed under a distributive quasiorder. Supported by INTAS grant No. 03-51-4110; RF Ministry of Education grant No. E02-1.0-32; Council for Grants (under RF President) and State Aid of Fundamental Science Schools, project NSh-2112.2003.1; a grant from the Russian Science Support Foundation; SB RAS Young Researchers Support project No. 11. __________ Translated from Algebra i Logika, Vol. 45, No. 2, pp. 215–230, March–April, 2006.     

幂格与商格的关系

该文在文［1］中幂格概念的基础上,得到了幂格的一个充要条件,给出了正则幂格、相对幂格的概念,并讨论了商格与正则幂格、相对幂格的关系.〖HT5”H〗关键词:〖HT5”SS〗格;幂格;商格;正则幂格;相对幂格.     

Notes on sectionally complemented lattices. IV How far does the Atom Lemma go?

There are two results in the literature that prove that the ideal lattice of a finite, sectionally complemented, chopped lattice is again sectionally complemented. The first is in the 1962 paper of G. Grätzer and E. T. Schmidt, where the ideal lattice is viewed as a closure space to prove that it is sectionally complemented; we call the sectional complement constructed then the 1960 sectional complement. The second is the Atom Lemma from a 1999 paper of the same authors that states that if a finite, sectionally complemented, chopped lattice is made up of two lattices overlapping in an atom and a zero, then the ideal lattice is sectionally complemented. In this paper, we show that the method of proving the Atom Lemma also applies to the 1962 result. In fact, we get a stronger statement, in that we get many sectional complements and they are rather close to the componentwise sectional complement.     

On nondecomposable positive definite Hermitian forms over imaginary quadratic fields

Methods are presented for the construction of nondecomposable positive definite integral Hermitian forms over the ring of integers R_m of an imaginary quadratic field ℚ(√−m). Using our methods, one can construct explicitly an n-ary nondecomposable positive definite Hermitian R_m-lattice ( L, h) with given discriminant 2 for every n⩾2 (resp. n⩾13 or odd n⩾3) and square-free m = 12 k + t with k⩾1 and t∈ (1,7) (resp. k⩾1 and t = 2 or k⩾0 and t∈ 5,10,11). We study also the case for discriminant different from 2.     

Notes on sectionally complemented lattices. III

Summary In a recent survey article, G. Grätzer and E. T. Schmidt raise the problem when is the ideal lattice of a sectionally complemented chopped lattice sectionally complemented. The only general result is a 1999 lemma of theirs, stating that if the finite chopped lattice is the union of two ideals that intersect in a two-element ideal U, then the ideal lattice of M is sectionally complemented. In this paper, we present examples showing that in many ways their result is optimal. A typical result is the following: For any finite sectionally complemented lattice U with more than two elements, there exists a finite sectionally complemented chopped lattice M that is (i) the union of two ideals intersecting in the ideal U; (ii) the ideal lattice of M is not sectionally complemented.     

Layer-Projective Lattices. II

The main result of this paper is: any primary Arguesian lattice over the field GF(p) of geometric dimension at least three is isomorphic to the lattice of all submodules of a finitely generated module over the ring of polynomials of bounded degree over the field GF(p).     

具有析取性质的分配格的拓扑表示及性质

本文首先给出了一般格成为析取分配格的几个条件，并证明了在满足并无限分配律的条件下，具有析取性质的分配格与Ｂｏｏｌｅ格是等价的。文章还给出了析取分配格的拓扑表示。     

格中两类分配等式的关系研究

针对离散数学经典教材中提出的"交运算对并运算的分配等式和并运算对交运算的分配等式是等价的"这一结论,分析了一种常见的错误证明,通过一个反例说明该结论在一般的格中不一定成立,进一步证明这两个分配等式在且仅在模格中是等价的,并提出利用定义判断一个模格是否是分配格的简便算法.作为一个应用,重新证明了该教材中的一条定理.     

分子格上伪补的构造

本文给出了分子格上伪补的构造定理，并证明了当一个非平凡分子格上有伪补，其既约因子上并不一定存在伪补，但其准既约因子上一定存在伪补，且任一分子格上的伪补都可表为其准既约因子上伪补的直积．     

Determination of the rank of an integration lattice

The continuing and widespread use of lattice rules for high-dimensional numerical quadrature is driving the development of a rich and detailed theory. Part of this theory is devoted to computer searches for rules, appropriate to particular situations. In some applications, one is interested in obtaining the (lattice) rank of a lattice rule Q(Λ) directly from the elements of a generator matrix B (possibly in upper triangular lattice form) of the corresponding dual lattice Λ^⊥. We treat this problem in detail, demonstrating the connections between this (lattice) rank and the conventional matrix rank deficiency of modulo p versions of B. AMS subject classification (2000) 65D30     

Four-generated quasiorder lattices and their atoms in a four-generated sublattice

Quasiorders, also known as preorders, on a set A form a lattice Quo(A). We prove that if A is a finite set consisting of 2, 3, 5, 7, 9, or more than 10 elements, then Quo(A) is four-generated but not three-generated. Also, if A is countably infinite, then a four-generated sublattice contains all atoms of Quo(A). These statements improve Ivan Chajda and the present author’s 1996 result, where six generators were constructed, and Tamás Dolgos and Júlia Kulin’s recent results, where five generators were given.