Contiguity relations for linearisable systems of Gambier type
نویسندگان
چکیده
We introduce the Schlesinger transformations for Gambier, linearisable, equation and by combining former construct contiguity relations of solutions latter. extend approach to discrete domain obtaining thus Gambier mapping. In all cases resulting relation is a linearisable equation, involving free functions, which can be related generic
منابع مشابه
a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولchannel estimation for mimo-ofdm systems
تخمین دقیق مشخصات کانال در سیستم های مخابراتی یک امر مهم محسوب می گردد. این امر به ویژه در کانال های بیسیم با خاصیت فرکانس گزینی و زمان گزینی شدید، چالش بزرگی است. مقالات متعدد پر از روش های مبتکرانه ای برای طراحی و آنالیز الگوریتم های تخمین کانال است که بیشتر آنها از روش های خاصی استفاده می کنند که یا دارای عملکرد خوب با پیچیدگی محاسباتی بالا هستند و یا با عملکرد نه چندان خوب پیچیدگی پایینی...
Quotient G-systems and Green\'s Relations
In this paper, we first introduce the concepts of G-systems, quotient G-systems and isomorphism theorems on G-systems of n-ary semihypergroups . Also we consider the Green's equivalences on G-systems and further in-vestigate some of their properties. A number of n-ary semihypergroups are constructed and presented as examples in this paper.
متن کاملLinearisable Mappings and the Low-growth Criterion
We examine a family of discrete second-order systems which are integrable through reduction to a linear system. These systems were previously identified using the singularity confinement criterion. Here we analyse them using the more stringent criterion of nonexponential growth of the degrees of the iterates. We show that the linearisable mappings are characterised by a very special degree grow...
متن کاملHow to Prove Algorithms Linearisable
Linearisability is the standard correctness criterion for concurrent data structures. In this paper, we present a sound and complete proof technique for linearisability based on backward simulations. We exemplify this technique by a linearisability proof of the queue algorithm presented in Herlihy and Wing’s landmark paper. Except for the manual proof by them, none of the many other current app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Nonlinear Mathematical Physics
سال: 2021
ISSN: ['1776-0852', '1402-9251']
DOI: https://doi.org/10.1080/14029251.2013.868269