Lattice Classification by Cut-through Coding
Inspired by engineering of high-speed switching with quality of service, this paper introduces a new approach to classify finite lattices by the concept of cut-through coding. An n-ary cut-through code of a finite lattice encodes all lattice elements by distinct n-ary strings of a uniform length such that for all j, the initial j encoding symbols of any two elements x and y determine the initial j encoding symbols of the meet and join of x and y. In terms of lattice congruences, some basic criteria are derived to characterize the n-ary cut-through codability of a finite lattice. N-ary cut-through codability also gives rise to a new classification of lattice varieties and in particular, defines a chain of ideals in the lattice of lattice varieties.
KeywordsCut-through coding Finite lattice Lattice congruence Lattice variety
Unable to display preview. Download preview PDF.
- 2.Davey, B.A., Priestly, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press (2002)Google Scholar
- 3.Freese, R., Ježek, J., Nation, J.B.: Free Lattices. Mathematical Surveys and Monographs, vol. 42. American Mathematical Society (1995)Google Scholar
- 4.Grätzer, G.: General Lattice Theory, 2 edn. Birkhäuser (1998)Google Scholar
- 5.Grätzer, G.: The Congruences of a Finite Lattice: A Proof-by-Picture Approach. Birkhäuser (2006)Google Scholar
- 6.Habib, M., Nourine, L.: Bit-vector encoding for partially ordered sets. In: Proc. Int. Workshop Orders, Algorithms, Appl., Lyon, France (1994)Google Scholar
- 12.Zhu, J., Li, S.Y.R.: Optimizing switching element for minimal latency. U.S. Patent No. 7,609,695 (2009)Google Scholar