Semimodular Lattices and Semibuildings

In a ranked lattice, we consider two maximal chains, or flags to be i-adjacent if they are equal except possibly on rank i. Thus, a finite rank lattice is a chamber system. If the lattice is semimodular, as noted in [9], there is a Jordan-Hölder permutation between any two flags. This permutation has the properties of an S_n-distance function on the chamber system of flags. Using these notions, we define a W-semibuilding as a chamber system with certain additional properties similar to properties Tits used to characterize buildings. We show that finite rank semimodular lattices form an S_n-semibuilding, and develop a flag-based axiomatization of semimodular lattices. We refine these properties to axiomatize geometric, modular and distributive lattices as well, and to reprove Tits' result that S_n-buildings correspond to relatively complemented modular lattices (see [16], Section 6.1.5).     

A structure theorem for dismantlable lattices and enumeration

The concept of `adjunct' operation of two lattices with respect to a pair of elements is introduced. A structure theorem namely, `A finite lattice is dismantlable if and only if it is an adjunct of chains' is obtained. Further it is established that for any adjunct representation of a dismantlable lattice the number of chains as well as the number of times a pair of elements occurs remains the same. If a dismantlable lattice L has n elements and n+k edges then it is proved that the number of irreducible elements of L lies between n-2k-2 and n-2. These results are used to enumerate the class of lattices with exactly two reducible elements, the class of lattices with n elements and upto n+1 edges, and their subclasses of distributive lattices and modular lattices. This revised version was published online in June 2006 with corrections to the Cover Date.     

Extremal Bases for the Adjoint Representations of the Simple Lie Algebras

We construct n distinct weight bases, which we call extremal bases, for the adjoint representation of each simple Lie algebra 𝔤 of rank n: One construction for each simple root. We explicitly describe actions of the Chevalley generators on the basis elements. We show that these extremal bases are distinguished by their “supporting graphs” in three ways. (In general, the supporting graph of a weight basis for a representation of a semisimple Lie algebra is a directed graph with colored edges that describe the supports of the actions of the Chevalley generators on the elements of the basis.) We show that each extremal basis constructed is essentially the only basis with its supporting graph (i.e., each extremal basis is solitary), and that each supporting graph is a modular lattice. Each extremal basis is shown to be edge-minimizing: Its supporting graph has the minimum number of edges. The extremal bases are shown to be the only edge-minimizing as well as the only modular lattice weight bases (up to scalar multiples) for the adjoint representation of 𝔤. The supporting graph for an extremal basis is shown to be a distributive lattice if and only if the associated simple root corresponds to an end node for a “branchless” simple Lie algebra, i.e., type A, B, C, F, or G. For each extremal basis, basis elements for the Cartan subalgebra are explicitly expressed in terms of the h _i Chevalley generators.     

Cutset Condition for Geometric Lattices

In this paper we prove that an atomistic lattice L of finite length is geometric if it has the nontrivial modular cutset condition, that is, every maximal chain of L contains a modular element which is different from the minimum element and the maximum element of L. The first author is partially supported by the National Natural Science Foundation of China (Grant no. 10471016).     

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.     

On tolerance lattices of algebras in congruence modular varieties

We prove that the tolerance lattice TolA of an algebra A from a congruence modular variety V is 0-1 modular and satisfies the general disjointness property. If V is congruence distributive, then the lattice Tol A is pseudocomplemented. If V admits a majority term, then Tol A is 0-modular. This revised version was published online in June 2006 with corrections to the Cover Date.     

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.     

The M3[D] construction and n-modularity

In 1968, Schmidt introduced the M ₃[D] construction, an extension of the five-element modular nondistributive lattice M ₃ by a bounded distributive lattice D, defined as the lattice of all triples satisfying . The lattice M ₃[D] is a modular congruence-preserving extension of D.? In this paper, we investigate this construction for an arbitrary lattice L. For every n > 0, we exhibit an identity such that is modularity and is properly weaker than . Let M _n denote the variety defined by , the variety of n-modular lattices. If L is n-modular, then M ₃[L] is a lattice, in fact, a congruence-preserving extension of L; we also prove that, in this case, Id M ₃[L] M ₃[Id L]. ? We provide an example of a lattice L such that M ₃[L] is not a lattice. This example also provides a negative solution to a problem of Quackenbush: Is the tensor product of two lattices A and B with zero always a lattice. We complement this result by generalizing the M ₃[L] construction to an M ₄[L] construction. This yields, in particular, a bounded modular lattice L such that M ₄ L is not a lattice, thus providing a negative solution to Quackenbush’s problem in the variety M of modular lattices.? Finally, we sharpen a result of Dilworth: Every finite distributive lattice can be represented as the congruence lattice of a finite 3-modular lattice. We do this by verifying that a construction of Gr?tzer, Lakser, and Schmidt yields a 3-modular lattice. Received May 26, 1998; accepted in final form October 7, 1998.     

Martingales in Banach Lattices

In this article, we present a version of martingale theory in terms of Banach lattices. A sequence of contractive positive projections (E_n) on a Banach lattice F is said to be a filtration if E_nE_m = E_{n∧ m}. A sequence (x_n) in F is a martingale if E_nx_m = x_n whenever n ≤ m. Denote by M = M(F, (E_n)) the Banach space of all norm uniformly bounded martingales. It is shown that if F doesn’t contain a copy of c₀ or if every E_n is of finite rank then M is itself a Banach lattice. Convergence of martingales is investigated and a generalization of Doob Convergence Theorem is established. It is proved that under certain conditions one has isometric embeddings . Finally, it is shown that every martingale difference sequence is a monotone basic sequence. Mathematics Subject Classification (2000). 60G48, 46B42     

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     

Order Ideals in Weak Subposets of Young’s Lattice and Associated Unimodality Conjectures

The k-Young lattice Y^k is a weak subposet of the Young lattice containing partitions whose first part is bounded by an integer k > 0. The Y^k poset was introduced in connection with generalized Schur functions and later shown to be isomorphic to the weak order on the quotient of the affine symmetric group S_{k + 1} by a maximal parabolic subgroup. We prove a number of properties for Y^k including that the covering relation is preserved when elements are translated by rectangular partitions with hook-length k. We highlight the order ideal generated by an m x n rectangular shape. This order ideal, L^k(m, n), reduces to L(m, n) for large k, and we prove it is isomorphic to the induced subposet of L(m, n) whose vertex set is restricted to elements with no more than k - m + 1 parts smaller than m. We provide explicit formulas for the number of elements and the rank-generating function of L^k(m, n). We conclude with unimodality conjectures involving q-binomial coefficients and discuss how implications connect to recent work on sieved q-binomial coefficients.AMS Subject Classification: 06A06, 05A17, 05A10, 05E05.     

A Constructive Approach to Lattice Rule Canonical Forms

The rank and invariants of a general lattice rule are conventionally defined in terms of the group-theoretic properties of the rule. Here we give a constructive definition of the rank and invariants using integer matrices. This underpins a nonabstract algorithm set in matrix algebra for obtaining the Sylow p-decomposition of a lattice rule. This approach is particularly useful when it is not known whether the form in which the lattice rule is specified is canonical or even repetitive. A new set of necessary and sufficient conditions for recognizing a canonical form is given.     

The cardinality of FM(1+1+n)

The aim of this note is to develop a counting formula for the modular lattice FM(1+1+n) freely generated by two single elements and an n-element chain. This answers Problem 44 in Birkhoff [1] which asks one to determine FM(1+1+n). The proof of our recursive formula is based on the scaffolding method developed by R. Wille.     

Minimally Supported Frequency Composite Dilation Wavelets

A composite dilation wavelet is a collection of functions generating an orthonormal basis for L ²(ℝ ⁿ ) under the actions of translations from a full rank lattice and dilations by products of elements of non-commuting groups A and B. A minimally supported frequency composite dilation wavelet has generating functions whose Fourier transforms are characteristic functions of a lattice tiling set. In this paper, we study the case where A is the group of integer powers of some expanding matrix while B is a finite subgroup of the invertible n×n matrices. This paper establishes that with any finite group B together with almost any full rank lattice, one can generate a minimally supported frequency composite dilation wavelet system. The paper proceeds by demonstrating the ability to find such minimally supported frequency composite dilation wavelets with a single generator.     

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.     

Matchings and radon transforms in lattices. I. Consistent lattices

An element in a lattice is join-irreducible if x=ab implies x=a or x=b. A meet-irreducible is a join-irreducible in the order dual. A lattice is consistent if for every element x and every join-irreducible j, the element xj is a join-irreducible in the upper interval [x, î]. We prove that in a finite consistent lattice, the incidence matrix of meet-irreducibles versus join-irreducibles has rank the number of join-irreducibles. Since modular lattices and their order duals are consistent, this settles a conjecture of Rival on matchings in modular lattices.     

Indecomposable matrices over a distributive lattice

In this paper, the concepts of indecomposable matrices and fully indecomposable matrices over a distributive lattice L are introduced, and some algebraic properties of them are obtained. Also, some characterizations of the set F _n (L) of all n × n fully indecomposable matrices as a subsemigroup of the semigroup H _n (L) of all n × n Hall matrices over the lattice L are given.     

Semilattice Operations Generated by Lattice Terms

Let ℒ=〈L;∨,∧〉 be a subdirectly irreducible modular lattice, c∈L and p(x,y,z) an essentially ternary lattice term. In this paper we show that if p(x,y,c) is a semilattice operation then p(x,y,c)=∨ or ∧ and L is bounded and c=0 or c=1. This sheds light on the methodology used to move back and forth between generalizations of median algebras and lattices, and provides a negative answer to a problem posed by A. Knoebel and G. Meletiou. Mathematics Subject Classifications (2000) Primary 06A12, 06C99, 08B26.     

The Number of Lattice Rules of Specified Upper Class and Rank

The upper class of a lattice rule is a convenient entity for classification and other purposes. The rank of a lattice rule is a basic characteristic, also used for classification. By introducing a rank proportionality factor and obtaining certain recurrence relations, we show how many lattice rules of each rank exist in any prime upper class. The Sylow p-decomposition may be used to obtain corresponding results for any upper class.     

格的TL-模糊理想

本文研究了格的TL-模糊理想. 利用生成TL-模糊理想, 证明了一个模格的全体T_M-模糊理想形成一个完备的模格. 此外, 利用L-模糊集的投影和截影, 获得了将直积格的TL-模糊理想表示成分量格的TL-模糊理想的L-直积的一个充分必要条件. 所得结果进一步推广和发展了格的模糊理想的理论.