Polynomial automorphisms of lattices (Q922565)

Let L be a lattice and let \(\phi\) be an automorphism of L. If there exist a lattice term \(f(x,y_ 1,...,y_ n)\) and elements \(a_ 1,...,a_ n\) in L such that \(\phi (x)=f(x,a_ 1,...,a_ n)\) for each \(x\in L\), then \(\phi\) is said to e a polynomial automorphism. (This notion is due to D. Schweigert.) Inspired by certain analogies with group theory the authors prove the following results: (A) If L is finite, then it can be embedded in a finite lattice K such that (i) each automorphism of K is a polynomial automorphism; (ii) each automorphism of L extends to a unique automorphism of K; (iii) each automorphism of K is the extension of an automorphism of L. (B) Each lattice L can be embedded as a convex sublattice in some lattice K such that every automorphism of L is the restriction of a unary polynomial function on K; if L has a least element, then this embedding is an ideal.