Matrix Padé Approximation of rational functions

In many applications it is of major interest to decide whether a given formal power series with matrix-valued coefficients of arbitrary dimensions results from a matrix-valued rational function. As the main result of this paper we provide an answer to this question in terms of Matrix Padé Approximants of the given power series. Furthermore, given a matrix rational function, the smallest degrees of the matrix polynomials which represent it are not necessarily unique. Therefore we study a certain minimality-type, that is, minimum degrees. We aim to obtain all the minimum degrees for the polynomials which represent the function as equivalents. In addition, given that the rational representation of the function for the same pair of degrees need not be unique, we have obtained conditions to study the uniqueness of said representation. All the results obtained are presented graphically in tables setting out the above information. They lead to a number of properties concerning special structures, staired blocks, in the Padé Table.     

Gleason’s problem,rational functions and spaces of left-regular functions: The split-quaternion setting

We study Gleason’s problem, rational functions and spaces of regular functions in the setting of split-quaternions. There are two natural symmetries in the algebra of split-quaternions. The first symmetry allows to define positive matrices with split-quaternionic entries, and also reproducing Hilbert spaces of regular functions. The second leads to reproducing kernel Krein spaces.     

Integral estimates of lengths of level lines of rational functions and zolotarev’s problem

Integral estimates of lengths of level lines (lemniscates) of rational functions of a complex variable are obtained. These estimates are related to the problem of separation of compact sets by rational functions and to Zolotarev’s problem.     

Baxter’s difference systems and orthogonal rational functions

Rational functions orthogonal on the unit circle are considered beginning with their recurrence formulas. Various summability conditions are imposed on the recurrence coefficients and the asymptotics of the solutions are studied and the orthogonality measure is recovered. The techniques developed by Baxter and Benzaid and Lutz are used.     

A conjecture of Erdős and Reddy and the rational approximation of Mittag-Leffler type functions

Пусть \(f(z) = \mathop \sum \limits_{k = 0}^\infty a_k z^k ,a_0 \ne 0, a_k \geqq 0 (k \geqq 0)\) — целая функци я,π _n — класс обыкновен ных алгебраических мног очленов степени не вы ше \(n,a \lambda _n (f) = \mathop {\inf }\limits_{p \in \pi _n } \mathop {\sup }\limits_{x \geqq 0} |1/f(x) - 1/p(x)|\) . П. Эрдеш и А. Редди высказали пр едположение, что еслиf(z) имеет порядок ?ε(0, ∞) и $$\mathop {\lim sup}\limits_{n \to \infty } \lambda _n^{1/n} (f)< 1, TO \mathop {\lim inf}\limits_{n \to \infty } \lambda _n^{1/n} (f) > 0$$ В данной статье показ ано, что для целой функ ции $$E_\omega (z) = \mathop \sum \limits_{n = 0}^\infty \frac{{z^n }}{{\Gamma (1 + n\omega (n))}}$$ , где выполняется $$\lambda _n^{1/n} (E_\omega ) \leqq \exp \left\{ { - \frac{{\omega (n)}}{{e + 1}}} \right\}$$ , т.е. $$\mathop {\lim sup}\limits_{n \to \infty } \lambda _n^{1/n} (E_\omega ) \leqq \exp \left\{ { - \frac{1}{{\rho (e + 1)}}} \right\}< 1, a \mathop {\lim inf}\limits_{n \to \infty } \lambda _n^{1/n} (E_\omega ) = 0$$ . ФункцияE _ω (z) имеет порядок ?.     

Construction of noniterated boolean functions in the basis {&;, ∨, −} and estimation of their number

In this paper we consider noniterated Boolean functions in the basis {&;, ∨, ?}. We obtain the canonical form of the formula for a noniterated function in this basis. We construct the set of such formulas with respect to variables x ₁, …, x _n and calculate the number of its elements. Based on these results, we obtain the upper and lower bounds for the number of noniterated Boolean functions of n variables in the basis under consideration.     

The rational approximation of convex functions of the class Lip α

It is proved that if a function f(x) is convex on [a, b] and f ∈ Lip_K(f)α, 0<α<1, then the least uniform deviation of this function from rational functions of degree not higher than n does not exceed (v is a natural number; C(α, v) depends only onα andv; K(f) is a Lipschitz constant; and      

Convergence of rational multistep methods of Adams-Padé type

Rational generalizations of multistep schemes, where the linear stiff part of a given problem is treated by an A-stable rational approximation, have been proposed by several authors, but a reasonable convergence analysis for stiff problems has not been provided so far. In this paper we directly relate this approach to exponential multistep methods, a subclass of the increasingly popular class of exponential integrators. This natural, but new interpretation of rational multistep methods enables us to prove a convergence result of the same quality as for the exponential version. In particular, we consider schemes of rational Adams type based on A-acceptable Padé approximations to the matrix exponential. A numerical example is also provided.     

An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics

We define an isomorphism between the group of points of a conic and the set of integers modulo a prime equipped with a non-standard product. This product can be efficiently evaluated through the use of Rédei rational functions. We then exploit the isomorphism to construct a novel RSA-like scheme. We compare our scheme with classic RSA and with RSA-like schemes based on the cubic or conic equation. The decryption operation of the proposed scheme turns to be two times faster than RSA, and involves the lowest number of modular inversions with respect to other RSA-like schemes based on curves. Our solution offers the same security as RSA in a one-to-one communication and more security in broadcast applications.     

Construction of convex solutions for the second type of Feigenbaum’s functional equations

In this paper, convex solutions for the second type of Feigenbaum’s equation f (x) = λ1 f (f (λx)), 0 < λ < 1, f (0) = 1, 0 f (x) 1, x ∈ [0, 1] are investigated. Using constructive methods, we discuss the existence and uniqueness of continuous convex solutions, C1-convex solutions and C2-convex solutions of the above equation.     

Construction of Extremal Type II Codes over ℤ4

In this paper, we give a pseudo-random method to construct extremal Type II codes overℤ₄ . As an application, we give a number of new extremal Type II codes of lengths 24, 32 and 40, constructed from some extremal doubly-even self-dual binary codes. The extremal Type II codes of length 24 have the property that the supports of the codewords of Hamming weight 10 form 5−(24,10,36) designs. It is also shown that every extremal doubly-even self-dual binary code of length 32 can be considered as the residual code of an extremal Type II code over ℤ₄.     

Power series equivalent to rational functions: A shifting-origin kronecker type theorem,and normality of Padé tables

Letf(z) be a function analytic in a neighbourhood of zero. For each pair of non-negative integers (m, n), form then byn Toeplitz determinantD(m/n) whose entries are the Maclaurin series coefficients off, namely,

New Grüss’ type inequalities for functions of bounded variation and applications

Some new sharp Grüss’ type inequalities for functions of bounded variation and applications for selfadjoint operators in Hilbert spaces are given.     

On the Construction of d-Continuous Modules over Some Special Rings

ＯｎｔｈｅＣｏｎｓｔｒｕｃｔｉｏｎｏｆｄ－ＣｏｎｔｉｎｕｏｕｓＭｏｄｕｌｅｓｏｖｅｒＳｏｍｅＳｐｅｃｉａｌＲｉｎｇｓ￥ＣｈｅｎＪｉｎｊｉａｎ（ＧｕａｎｇｄｏｎｇＮａｔｉｏｎａｌＩｎｓｔｉｔｕｔｅ）Ａｂｓｔｒａｃｔ：Ｉｎｔｈｅｐｅｐｅｒ，ｗｅｕｓｉｎｇ...