2000 character limit reached
Approximate homomorphisms on lattices
Published 10 Dec 2017 in math.CA | (1712.03513v1)
Abstract: We prove two results concerning an Ulam-type stability problem for homomorphisms between lattices. One of them involves estimates by quite general error functions; the other deals with approximate (join) homomorphisms in terms of certain systems of lattice neighborhoods. As a corollary, we obtain a stability result for approximately monotone functions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.