The Marica-Schonheim Inequality in Lattices

The Marica-Schönheim Inequality says that if A is a finitefamily of sets, then |A–||A| where A–A=[A₁\A₂:A₁,A₂A]. For a finite lattice L and AL, we define a–b=(J_a\J_b)where J_a=[jL:ja and j is join-irreducible], and if AL then welet A–A=[a₁–a₂: a₁, a₂A]. Then the analogue of theMarica-Schöonheim Inequality is |A–A|A| for all AL.We prove that this is true if L is distributive or complementedand modular or L is a partition lattice.     

On the combinatorics of an origami model

We consider the problem of how the assembly process of an origami model, made up of similar pieces, can be completed given that at each step there are several choices. A result is given in the language of graphs that provides a sufficient condition under which assembly of the model will never fail.