Hassan Sedaghat

Learn More
The scalar difference equation x n+1 = f n (x n , x n−1 , · · · , x n−k) may exhibit symmetries in its form that allow for reduction of order through substitution or a change of variables. Such form symmetries can be defined generally using the semicon-jugate relation on a group which yields a reduction of order through the semiconjugate factorization of(More)
Consider the difference equation x n+1 = cx n + f (x n − x n−1) where 0 ≤ c < 1 and f is continuous on R and has a global minimum (not necessarily unique) at the origin. Sufficient conditions are given on c and f for the unique fixed point ¯ x = f (0)/(1 − c) to be globally asymptotically stable. Also, conditions under which solutions converge to ¯ x(More)
Considering a binary operation as a ternary relation permits certain sections of the latter (which are functions) to be used in representing an abstract semigroup as a family of the self-maps of its underlying set under function composition. The idea is thus seen to be entirely similar to the way that the sections of a partial ordering under set inclusion(More)
  • 1