2000 character limit reached
Linear degree growth in lattice equations
Published 27 Feb 2017 in nlin.SI | (1702.08295v1)
Abstract: We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth and hence are linearizable.
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.