Commutator-finite orthomodular lattices

The class of orthomodular lattices which have only finitely many commutators is investigated. The following theorems are proved: contains the block-finite orthomodular lattices. Every irreducible element of is simple. Every element of is a direct product of a Boolean algebra and finitely many simple orthomodular lattices. The irreducible elements of which are modular, or are M-symmetric with at least one atom, have height two or less.     

Classification of integral trees

A finite poset Q is called integral over a field k if there exists an ASL (algebra with straightening laws) domain on Q{–} over k. We classify all trees (rank one connected posets without cycles) which are integral over an infinite field.     

Partitioning Boolean lattices into chains of subsets

We prove that the Boolean lattice of all subsets of an n-set can be partitioned into chains of size four if and only if n9.Research supported in part by N.S.F. grant DMS-8401281.Research supported in part by N.S.F. grant DMS-8406451.     

Comparison of Boolean algebras

In this work, some results related to superatomic Boolean interval algebras are presented, and proved in a topological way. Let x be an uncountable cardinal. To each I x, we can associate a superatomic interval Boolean algebra B _I of cardinality x in such a way that the following properties are equivalent: (i) I I x, (ii) B _I is a quotient algebra of B _J, and (iii) there is an homomorphism f from B _J into B _I such that for every atom b of B _I, there is an atom a of B _J satisfying f(a)=b. As a corollary, there are 2 ^x isomorphism types of superatomic interval Boolean algebras of cardinality x. This case is quite different from the countable one.     

Regressions and monotone chains II: The poset of integer intervals

A regressive function (also called a regression or contractive mapping) on a partial order P is a function mapping P to itself such that (x)x. A monotone k-chain for is a k-chain on which is order-preserving; i.e., a chain x ₁<...ksuch that (x ₁)...(x_k). Let P _nbe the poset of integer intervals {i, i+1, ..., m} contained in {1, 2, ..., n}, ordered by inclusion. Let f(k) be the least value of n such that every regression on P _nhas a monotone k+1-chain, let t(x,j) be defined by t(x, 0)=1 and t(x,j)=x ^t(x,j–1). Then f(k) exists for all k (originally proved by D. White), and t(2,k) < f(K) <t( + _k, k) , where _k 0 as k. Alternatively, the largest k such that every regression on P _nis guaranteed to have a monotone k-chain lies between lg^*(n) and lg^*(n)–2, inclusive, where lg^*(n) is the number of appliations of logarithm base 2 required to reduce n to a negative number. Analogous results hold for choice functions, which are regressions in which every element is mapped to a minimal element.     

Some inequalities for partial orders

We establish some inequalities connecting natural parameters of a partial order P. For example, if every interval [a,b] contains at most maximal chains, if some antichain has cardinality v, and if there are ₁ chains whose union is cofinal and coinitial in P, then the chain decomposition number for P is ₁v (Theorem 2.2), and the inequality is sharp in a certain sense (Section 3).This paper was written while the authors were visitors at the Laboratoire d'algèbre ordinale, Département de Mathématiques, Université Claude Bernard, Lyon 1, France.Research supported by NSERC grant # A5198.     

The fixed point property in ordered sets of width two

We consider the fixed point property (FPP) in an ordered set of width two (every antichain contains at most two elements). The necessary condition of the FPP and a number of equivalent conditions to the FPP in such sets is established. The product theorem is proved, as well.     

Gold nanoparticle-enhanced surface plasmon resonance measurement with a highly sensitive quantification for human tissue inhibitor of metalloproteinases-2

Two different methods for the quantification of human tissue inhibitor of metalloproteinases-2 (TIMP-2) were developed using surface plasmon resonance (SPR) and gold nanoparticles for signal enhancement. The first method, a competitive assay, used TIMP-2 immobilized to the sensor surface and the inactive form of matrix metalloproteinase-2 (proMMP-2) (EC 3.4.24.24) adsorbed to gold nanoparticles. The sensor signals resulting from the interaction of MMP-2-gold nanoparticles with immobilized TIMP-2 were inversely proportional to the amounts of TIMP-2 of the sample. The measuring range for TIMP-2 was about 15–180 pM. The second method, a one-step sandwich assay, used proMMP-2 immobilized to the sensor surface and an anti-TIMP-2 monoclonal antibody coupled to gold nanoparticles. The lower detection limit of this assay format was 0.5 pM of TIMP-2. The binding signals were highly reproducible up to 100 pM of the inhibitor. The improvements obtained in TIMP-2 quantification over already existing tests could contribute to a better understanding and diagnosis of diseases like cancer.     

The endomorphism spectrum of an ordered set

Theendomorphism spectrum of an ordered setP, spec(P)={|f(P)|:f End(P)} andspectrum number, sp(P)=max(spec(P)\{|P|}) are introduced. It is shown that |P|>(1/2)n(n – 1) ^{n – 1} implies spec(P) = {1, 2, ...,n} and that if a projective plane of ordern exists, then there is an ordered setP of size 2n ²+2n+2 with spec(P)={1, 2, ..., 2n+2, 2n+4}. Lettingh(n)=max{|P|: sp(P)n}, it follows thatc ₁ n ²h(n)c ₂ n ⁿ⁺¹ for somec ₁ andc ₂. The lower bound disproves the conjecture thath(n)2n. It is shown that if |P| – 1 spec(P) thenP has a retract of size |P| – 1 but that for all there is a bipartite ordered set with spec(P) = {|P| – 2, |P| – 4, ...} which has no proper retract of size|P| – . The case of reflexive graphs is also treated.Partially supported by a grant from the NSERC.Partially supported by a grant from the NSERC.     

On isotone functions with the Substitution Property in distributive lattices

A universal algebra isaffine complete if all functions satisfying the Substitution Property are polynomials (composed of the basic operations and the elements of the algebra). In 1962, the first author proved that a bounded distributive lattice is affine complete if and only if it does not contain a proper Boolean interval. Recently, M. Ploica generalized this result to arbitrary distributive lattices.In this paper, we introduce a class of functions on a latticeL, we call themID-polynomials, that derive from polynomials on the ideal lattice (resp., dual ideal lattice) ofL; they are isotone functions and satisfy the Substitution Property. We prove that for a distributive latticeL, all unary functions with the Substitution Property are ID-polynomials if and only ifL contains no proper Boolean interval.The research of the first author was supported by the NSERC of Canada. The research of the second author was supported by the Hungarian National Foundation for Scientific Research, under Grant No. 1903.