On Lattices of Uniformities

We study lattice theoretical properties of lattices of uniformities such as modularity, distributive laws and the existence of (relative) complements. For this the concepts of permutable uniformities (see Definition 3.1) and independent uniformities (see Definition 4.1) are important. Moreover, we show that e.g. the lattice of all lattice uniformities on a lattice L is a closed sublattice of the lattice of all uniformities on L.     

剩余格与FI代数的可嵌入性

给出剩余格可嵌入于全序剩余格的乘积的充要条件。还给出定义在格上的FI代数可嵌入于全序FI代数的乘积的充要条件。     

Geometric lattice actions, entropy and fundamental groups

Let be a lattice in a noncompact simple Lie Group G, where . Suppose acts analytically and ergodically on a compact manifold M preserving a unimodular rigid geometric structure (e.g. a connection and a volume). We show that either the action is isometric or there exists a "large image" linear representation of . Under an additional assumption on the dynamics of the action, we associate to a virtual arithmetic quotient of full entropy. Received: December 14, 2000     

On the complexity of submodular function minimisation on diamonds

Let (L;?,?) be a finite lattice and let n be a positive integer. A function f:Lⁿ→R is said to be submodular if for all . In this article we study submodular functions when L is a diamond. Given oracle access to f we are interested in finding such that as efficiently as possible. We establish

• • 

  a min–max theorem, which states that the minimum of the submodular function is equal to the maximum of a certain function defined over a certain polyhedron; and

• • 

  a good characterisation of the minimisation problem, i.e., we show that given an oracle for computing a submodular f:Ln→Z and an integer m such that , there is a proof of this fact which can be verified in time polynomial in n and ; and

• • 

  a pseudopolynomial-time algorithm for the minimisation problem, i.e., given an oracle for computing a submodular f:Ln→Z one can find in time bounded by a polynomial in n and .

     

Bounds for solid angles of lattices of rank three

We find sharp absolute constants C₁ and C₂ with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spanned by these basis vectors lies in the interval [C₁,C₂]. In fact, we show that these absolute bounds hold for a larger class of lattices than just well-rounded, and the upper bound holds for all. We state a technical condition on the lattice that may prevent it from satisfying the absolute lower bound on the solid angle, in which case we derive a lower bound in terms of the ratios of successive minima of the lattice. We use this result to show that among all spherical triangles on the unit sphere in RN with vertices on the minimal vectors of a lattice, the smallest possible area is achieved by a configuration of minimal vectors of the (normalized) face centered cubic lattice in R³. Such spherical configurations come up in connection with the kissing number problem.     

完备格上基于Sup-T合成算子的矩阵的平方根

对于完备格L上给定的|I|×|I|的矩阵R,若存在|I|×|I|的L上的矩阵S满足S⊙S=R,则称S为R的平方根,其中I表示指标集|I|的基数,⊙在本文中指的是sup-T合成算子并且T是无限∨分配的保序的算子。本文给出了完备格上基于sup-T合成算子的矩阵平方根存在的充要条件以及相应的理论上的算法求解所有的平方根。     

Modular lattices over cyclotomic fields

This paper is concerned with modular lattices over cyclotomic fields. In particular, the notion of Arakelov modular ideal lattice is introduced. All the cyclotomic fields over which there exists an Arakelov modular lattice of given level are characterised.     

Polyhedra related to a lattice

Without using the l.p. duality theorem, we give a new and direct proof that Hoffman's lattice polyhedra, polyhedra from problems of Edmonds and Giles, and others, are integer. These polyhedra are intersections of more simple polyhedra such that every vertex of the initial polyhedron is a vertex of some simple polyhedron. In many cases encountered in combinatorics the simple polyhedra have a totally unimodular constraint matrix. This implies that all vertices of the initial polyhedron are integral. The proof is based on a theorem on submodular functions, which was not known earlier. The method of this paper can be applied to the consideration of the matching polyhedron.     

Lattices of Subalgebras of Leibniz Algebras

I describe the lattice ?(L) of subalgebras of a one-generator Leibniz algebra L. Using this, I show that, apart from one special case, a lattice isomorphism φ: ?(L) → ?(L′) between Leibniz algebras L, L′ maps the Leibniz kernel Leib(L) of L to Leib(L′).