scholarly journals Existence of Meromorphic Solutions of First-Order Difference Equations

2019 ◽  
Vol 51 (3) ◽  
pp. 465-504
Author(s):  
Risto Korhonen ◽  
Yueyang Zhang

AbstractIt is shown that if $$\begin{aligned} f(z+1)^n=R(z,f), \end{aligned}$$f(z+1)n=R(z,f),where R(z, f) is rational in f with meromorphic coefficients and $$\deg _f(R(z,f))=n$$degf(R(z,f))=n, has an admissible meromorphic solution, then either f satisfies a difference linear or Riccati equation with meromorphic coefficients, or the equation above can be transformed into one in a list of ten equations with certain meromorphic or algebroid coefficients. In particular, if $$f(z+1)^n=R(z,f)$$f(z+1)n=R(z,f), where the assumption $$\deg _f(R(z,f))=n$$degf(R(z,f))=n has been discarded, has rational coefficients and a transcendental meromorphic solution f of hyper-order $$<1$$<1, then either f satisfies a difference linear or Riccati equation with rational coefficients, or the equation above can be transformed into one in a list of five equations which consists of four difference Fermat equations and one equation which is a special case of the symmetric QRT map. Solutions to all of these equations are presented in terms of Weierstrass or Jacobi elliptic functions, or in terms of meromorphic functions that are solutions to a difference Riccati equation. This provides a natural difference analogue of Steinmetz’ generalization of Malmquist’s theorem.

2019 ◽  
Vol 17 (1) ◽  
pp. 677-688 ◽  
Author(s):  
Hai-Ying Chen ◽  
Xiu-Min Zheng

Abstract In this paper, we investigate the relationships between fixed points of meromorphic functions, and their higher order differences and shifts, and generalize the case of fixed points into the more general case for first order difference and shift. Concretely, some estimates on the order and the exponents of convergence of special points of meromorphic functions and their differences and shifts are obtained.


1978 ◽  
Vol 43 (1) ◽  
pp. 23-44 ◽  
Author(s):  
Nicolas D. Goodman

In this paper we introduce a new notion of realizability for intuitionistic arithmetic in all finite types. The notion seems to us to capture some of the intuition underlying both the recursive realizability of Kjeene [5] and the semantics of Kripke [7]. After some preliminaries of a syntactic and recursion-theoretic character in §1, we motivate and define our notion of realizability in §2. In §3 we prove a soundness theorem, and in §4 we apply that theorem to obtain new information about provability in some extensions of intuitionistic arithmetic in all finite types. In §5 we consider a special case of our general notion and prove a kind of reflection theorem for it. Finally, in §6, we consider a formalized version of our realizability notion and use it to give a new proof of the conservative extension theorem discussed in Goodman and Myhill [4] and proved in our [3]. (Apparently, a form of this result is also proved in Mine [13]. We have not seen this paper, but are relying on [12].) As a corollary, we obtain the following somewhat strengthened result: Let Σ be any extension of first-order intuitionistic arithmetic (HA) formalized in the language of HA. Let Σω be the theory obtained from Σ by adding functionals of finite type with intuitionistic logic, intensional identity, and axioms of choice and dependent choice at all types. Then Σω is a conservative extension of Σ. An interesting example of this theorem is obtained by taking Σ to be classical first-order arithmetic.


2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Liang Zhao

This paper presents a novel abnormal data detecting algorithm based on the first order difference method, which could be used to find out outlier in building energy consumption platform real time. The principle and criterion of methodology are discussed in detail. The results show that outlier in cumulative power consumption could be detected by our method.


Sign in / Sign up

Export Citation Format

Share Document