Two independent approaches have been used to analyze choices. A prominent notion is rationalizability: individuals choose maximizing binary relations. An alternative choices in terms of standards behavior with the von Neumann–Morgenstern (vNM)-stability. We introduce a new concept ( r - $r \mbox{-} $ stability) that turn extends stability and rationality. Our main result establishes every ratio...

Rational functions are transformations from words to words that can be defined by string transducers. Rational functions are also captured by deterministic string transducers with lookahead. We show for the first time that the class of rational functions can be learned in the limit with polynomial time and data, when represented by string transducers with lookahead in the diagonal-minimal norma...

A word-to-word function is continuous for a class of languages V if its inverse maps V_languages to V. This notion provides a basis for an algebraic study of transducers, and was integral to the characterization of the sequential transducers computable in some circuit complexity classes. Here, we report on the decidability of continuity for functional transducers and some standard classes of re...

The purpose of this study is to present an approximate numerical method for solving high order linear Fredholm-Volterra integro-differential equations in terms of rational Chebyshev functions under the mixed conditions. The method is based on the approximation by the truncated rational Chebyshev series. Finally, the effectiveness of the method is illustrated in several numerical examples. The p...

We recount previous development of d-fold doubling of orthogonal polynomial sequences and give new results on rational function coefficients, recurrence formulas, continued fractions, Rodrigues’ type formulas, and differential equations, for the general case and, in particular, for the d-fold Hermite orthogonal rational functions.

For a field K, rational function φ ∈ K(z) of degree at least two, and α ∈ P(K), we study the polynomials in K[z] whose roots are given by the solutions in K to φ(z) = α, where φ denotes the nth iterate of φ. When the number of irreducible factors of these polynomials stabilizes as n grows, the pair (φ,α) is called eventually stable over K. We conjecture that (φ, α) is eventually stable over K w...

Making use of the Hardy-Littlewood maximal function, we give a new proof of the following theorem of Pekarski: If f' is in L log L on a finite interval, then f can be approximated in the uniform norm by rational functions of degree n to an error 0(1/n) on that interval. It is well known that approximation by rational functions of degree n can produce a dramatically smaller error than that for p...

Introduction This monograph forms an introduction to the theory of orthogonal rational functions. The simplest way to see what we mean by orthogonal rational functions is to consider them as generalizations of orthogonal polynomials. There is not much confusion about the meaning of an orthogonal polynomial sequence. One says that f n g 1 n=0 is an orthogonal polynomial sequence if n is a polyno...