9 citations
3 papers
math.CO2005
An analogue of distributivity for ungraded lattices
Hugh Thomas
In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded,…
q-bio.MN2004★ 9 cited
Modeling Genetic Networks from Clonal Analysis
Radhakrishnan Nagarajan, Jane E. Aubin, Charlotte A. Peterson
In this report a systematic approach is used to determine the approximate genetic network and robust dependencies underlying differentiation. The data considered is in the form of…
math.CO2004
Graded left modular lattices are supersolvable
Hugh Thomas
We provide a direct proof that a finite graded lattice with a maximal chain of left modular elements is supersolvable. This result was first established via a detour through EL-lab…