The lattice of closure operators on a subgroup lattice

We say a lattice L is a subgroup lattice if there exists a group G such that Sub(G)?L, where Sub(G) is the lattice of subgroups of G, ordered by inclusion. We prove that the lattice of closure operators which act on the subgroup lattice of a finite group G is itself a subgroup lattice if and only if G is cyclic of prime power order.     

Embedding a polytope in a lattice

We present a special similarity ofR ⁴ⁿ which maps lattice points into lattice points. Applying this similarity, we prove that if a (4n−1)-polytope is similar to a lattice polytope (a polytope whose vertices are all lattice points) inR ⁴ⁿ , then it is similar to a lattice polytope inR ⁴ⁿ⁻¹, generalizing a result of Schoenberg [4]. We also prove that ann-polytope is similar to a lattice polytope in someR ^N if and only if it is similar to a lattice polytope inR ²ⁿ⁺¹, and if and only if sin²(<ABC) is rational for any three verticesA, B, C of the polytope.     

Convex partitions of a finite lattice

The purpose of this paper is to introduce the lattice of convex partitions for a lattice L. Then we will show some properties of this lattice. Finally, we will show that if the convex partition lattice of L is finite and modular if and only if L is a finite chain. Presented by R. McKenzie. Received December 16, 2004; accepted in final form March 7, 2006.     

Lie algebras whose lattice of ideals is closely related with a subspace lattice

Relationships between the structure of a Lie algebra and that of its lattice of ideals is studied for those Lie algebras whose ideal lattice is very close to that of an almost-abelian Lie algebra. It is shown here that if the base field is algebraically closed, finite or the real one, for any n ≥3 the only solvable Lie algebra whose lattice of ideals is isomorphic to that of the (n+l)-dimensional almost-abelian Lie algebra is itself.     

集对Fuzzy格及其在格表示论中的应用

用幂集格构造了集对 Ｆｕｚｚｙ 格（这与用整数对构造有理数集有相似之处）,并用它证明了完整的软代数表示定理,即定义了到自身的映射且有最大元和最小元的格为软代数的充要条件是它与某个集对 Ｆｕｚｚｙ 格的子格同构．这样,与分配格在幂集 Ｂｏｏｌｅ 格中表示相对应,软代数在集对 Ｆｕｚｚｙ 格中有表示,在理论上是很完美的     

Convex lattice polygons with all lattice points visible

Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the polygon are visible from it. We completely classify such polygons, show that there are finitely many of lattice width greater than 2, and computationally enumerate them. As an application of this classification, we prove new obstructions to graphs arising as skeleta of tropical plane curves.     

Binomial arithmetical rank of lattice ideals

 In this paper, we will show that a lattice ideal is a complete intersection if and only if its binomial arithmetical rank equals its height, if the characteristic of the base field k is zero. And we will give the condition that a binomial ideal equals a lattice ideal up to radical in the case of char k=0. Further, we will study the upper bound of the binomial arithmetical rank of lattice ideals and give a sharp bound for the lattice ideals of codimension two. Received: 12 June 2001 / Revised version: 22 July 2002     

On discrete subgroups containing a lattice in a horospherical subgroup

We showed in [Oh] that for a simple real Lie groupG with real rank at least 2, if a discrete subgroup Γ ofG contains lattices in two opposite horospherical subgroups, then Γ must be a non-uniform arithmetic lattice inG, under some additional assumptions on the horospherical subgroups. Somewhat surprisingly, a similar result is true even if we only assume that Γ contains a lattice in one horospherical subgroup, provided Γ is Zariski dense inG.     

Hyperplane arrangements with a lattice of regions

A hyperplane arrangement is a finite set of hyperplanes through the origin in a finite-dimensional real vector space. Such an arrangement divides the vector space into a finite set of regions. Every such region determines a partial order on the set of all regions in which these are ordered according to their combinatorial distance from the fixed base region.We show that the base region is simplicial whenever the poset of regions is a lattice and that conversely this condition is sufficient for the lattice property for three-dimensional arrangements, but not in higher dimensions. For simplicial arrangements, the poset of regions is always a lattice.In the case of supersolvable arrangements (arrangements for which the lattice of intersections of hyperplanes is supersolvable), the poset of regions is a lattice if the base region is suitably chosen. We describe the geometric structure of such arrangements and derive an expression for the rank-generating function similar to a known one for Coxeter arrangements. For arrangements with a lattice of regions we give a geometric interpretation of the lattice property in terms of a closure operator defined on the set of hyperplanes.The results generalize to oriented matroids. We show that the adjacency graph (and poset of regions) of an arrangement determines the associated oriented matroid and hence in particular the lattice of intersections.The work of Anders Björner was supported in part by a grant from the NSF. Paul Edelman's work was supported in part by NSF Grants DMS-8612446 and DMS-8700995. The work of Günter Ziegler was done while he held a Norman Levinson Graduate Fellowship at MIT.     

Free lattice algorithms

In the late 1930s Phillip Whitman gave an algorithm for deciding for lattice terms v and u if vu in the free lattice on the variables in v and u. He also showed that each element of the free lattice has a shortest term representing it and this term is unique up to commutivity and associativity. He gave an algorithm for finding this term. Almost all the work on free lattices uses these algorithms. Building on the work of Ralph McKenzie, J. B. Nation and the author have developed very efficient algorithms for deciding if a lattice term v has a lower cover (i.e., if there is a w with w covered by v, which is denoted by w) and for finding them if it does. This paper studies the efficiency of both Whitman's algorithm and the algorithms of Freese and Nation. It is shown that although it is often quite fast, the straightforward implementation of Whitman's algorithm for testing vu is exponential in time in the worst case. A modification of Whitman's algorithm is given which is polynomial and has constant minimum time. The algorithms of Freese and Nation are then shown to be polynomial.     

On the number of lattice points in a small sphere and a recursive lattice decoding algorithm

Let L be a lattice in ${\mathbb{R}^n}$ . This paper provides two methods to obtain upper bounds on the number of points of L contained in a small sphere centered anywhere in ${\mathbb{R}^n}$ . The first method is based on the observation that if the sphere is sufficiently small then the lattice points contained in the sphere give rise to a spherical code with a certain minimum angle. The second method involves Gaussian measures on L in the sense of Banaszczyk (Math Ann 296:625–635, 1993). Examples where the obtained bounds are optimal include some root lattices in small dimensions and the Leech lattice. We also present a natural decoding algorithm for lattices constructed from lattices of smaller dimension, and apply our results on the number of lattice points in a small sphere to conclude on the performance of this algorithm.     

Projectivity of the free Banach lattice generated by a lattice

We study the projectivity of the free Banach lattice generated by a lattice $${\mathbb {L}}$$ in two cases: when the lattice is finite, and when the lattice is an infinite linearly ordered set. We prove that in the first case, it is projective while in the second case, it is not.     

Every finite lattice can be embedded in a finite partition lattice

Conclusions There are many questions, which arise in connection with the theorem presented. In general, we would like to know more about the class of embeddings of a given lattice in the lattices of all equivalences over finite sets. Some of these problems are studied in [4]. In this paper, an embedding is called normal, if it preserves 0 and 1. Using regraphs, our result can be easily improved as follows: THEOREM.For every lattice L, there exists a positive integer n ₀,such that for every n≥n ₀,there is a normal embedding π: L→Eq(A), where |A|=n. Embedding satisfying special properties are shown in Lemma 3.2 and Basic Lemma 6.2. We hope that our method of regraph powers will produce other interesting results. There is also a question about the effectiveness of finding an embedding of a given lattice. In particular, the proof presented here cannot be directly used to solve the following. Problem. Can the dual of Eq(4) be embedded into Eq(2¹⁰⁰⁰)? Presented by G. Gr?tzer.     

On lattice properties of the composition operator

The vector space £_b(E) of all order bounded linear operators on a Dedekind complete Riesz space E is both a Riesz space and an algebra. This note investigates the degree of compatibility between the algebraic and lattice structures of £_b(E). Two of the main results are the following:

1. An operator on a Banach lattice with an order continuous norm factors through the lattice operations if and only if it is an interval preserving Riesz homotnorphism.
2. A Dedekind complete Banach lattice E has an order continuous norm if and only if 0≤T_n ↑ T in £_b(E) implies T _n ² ↑ T².

     

On the lattice of stratified principal L-topologies

We investigate the lattice structure of the set of all stratified principal L-topologies on a given set X. It proves that the lattice of stratified principal L-topologies S p(X) has atoms and dual atoms if and only if L has atoms and dual atoms respectively. Moreover, it is complete and semi-complemented. We also discuss some other properties of the lattice.     

A constructive approach to the finite congruence lattice representation problem

A finite lattice is representable if it is isomorphic to the congruence lattice of a finite algebra. In this paper, we develop methods by which we can construct new representable lattices from known ones. The techniques we employ are sufficient to show that every finite lattice which contains no three element antichains is representable. We then show that if an order polynomially complete lattice is representable then so is every one of its diagonal subdirect powers. Received August 30, 1999; accepted in final form November 29, 1999.     

A reduction of lattice tiling by translates of a cubical cluster

A cluster is the union of a finite number of cubes from the standard partition ofn-dimensional Euclidean space into unit cubes. If there is lattice tiling by translates of a cluster, then must there be a lattice tiling by translates of the cluster in which the translation vectors have only integer coordinates? In this article we prove that if the interior of the cluster is connected and the dimension is at most three, then the answer is affirmative.     

An optimal odd unimodular lattice in dimension 72

It is shown that if there is an extremal even unimodular lattice in dimension 72, then there is an optimal odd unimodular lattice in that dimension. Hence, the first example of an optimal odd unimodular lattice in dimension 72 is constructed from the extremal even unimodular lattice which has been recently found by G. Nebe.     

Lattices of lattice homomorphisms

IfL andM are lattices, Hom (L, M) denotes the set of homomorphisms ofL intoM with the pointwise partial order.L is calledcatalytic if Hom (L, M) is a lattice for every latticeM. Among other results, it is shown that every retract of a lattice completely freely generated by a partially ordered set is catalytic, and that every catalytic lattice is semidistributive and satisfies Whitman's condition (W). Presented by R. McKenzie