In a recent paper, the authors have proved that for lattices A and B with zero, the isomorphism Conc(A ⊗ B) ∼ = Conc A ⊗ Conc B, holds, provided that the tensor product satisfies a very natural condition (of being capped) implying that A ⊗ B is a lattice. In general, A ⊗ B is not a lattice; for instance, we proved that M 3 ⊗ F(3) is not a lattice. In this paper, we introduce a new lattice const...

*Research and preparation of this report were substantially assisted by National Science Foundation grants DMS-8407102 and DMS-8606102. For certain matroids on the edges of a graph, digraph, or bidirected graph with group gains (edge labels from a group), the ats form intriguing new geometric lattices whose Whitney numbers have geometrical signiicance. In this chapter, the rst of a series, we l...

in this work, one and two-dimensional lattices are studied theoretically by a statistical mechanical approach. the nearest and next-nearest neighbor interactions are both taken into account, and the approximate thermodynamic properties of the lattices are calculated. the results of our calculations show that: (1) even though the next-nearest neighbor interaction may have an insignificant effect...

There are several ways for constructing (bigger) networks from smaller networks. We consider here the cartesian and the Kronecker (tensor) product networks. Our main aim is to determine a relation between the lattices of synchrony subspaces for a product network and the component networks of the product. In this sense, we show how to obtain the lattice of regular synchrony subspaces for a produ...

A classical tensor product A⊗B of complete lattices A and B, consisting of all down-sets in A×B that are join-closed in either coordinate, is isomorphic to the complete lattice Gal(A,B) of Galois maps from A to B, turning arbitrary joins into meets. We introduce more general kinds of tensor products for closure spaces and for posets. They have the expected universal property for bimorphisms (se...

Recent work in the ideal theory of commutative rings and that of C*-algebra is unified and generalized by first noting that these spaces are Lawson-closed subspaces of continuous lattices, equipped with the restriction of the lower topology. These topologies were first studied by Nachbin in the late 1940’s (in [32]), as the topologies of those open sets in a compact Hausdorff space which are up...

partial frames provide a rich context in which to do pointfree structured and unstructured topology. a small collection of axioms of an elementary nature allows one to do much traditional pointfree topology, both on the level of frames or locales, and that of uniform or metric frames. these axioms are sufficiently general to include as examples bounded distributive lattices, $sigma$-frames, $ka...

In a totally ordered set the notion of sorting a finite sequence is defined through the existence of a suitable permutation of the sequence’s indices. A drawback of this definition is that it only implicitly expresses how the elements of a sequence are related to those of its sorted counterpart. To alleviate this situation we prove a simple formula that explicitly describes how the kth element ...

In general, the tensor product, A ⊗ B, of the lattices A and B with zero is not a lattice (it is only a join-semilattice with zero). If A ⊗ B is a capped tensor product, then A ⊗ B is a lattice (the converse is not known). In this paper, we investigate lattices A with zero enjoying the property that A ⊗ B is a capped tensor product, for every lattice B with zero; we shall call such lattices ame...