Applications of operator identities to the multiple q-binomial theorem and q-Gauss summation theorem

In this paper, we first give an interesting operator identity. Furthermore, using the q-exponential operator technique to the multiple q-binomial theorem and q-Gauss summation theorem, we obtain some transformation formulae and summation theorems of multiple basic hypergeometric series.     

Irrationality proof of certain Lambert series using little q-Jacobi polynomials

We apply the Padé technique to find rational approximations to

     

Uniform asymptotics of some q-orthogonal polynomials

Uniform asymptotic formulas are obtained for the Stieltjes-Wigert polynomial, the q⁻¹-Hermite polynomial and the q-Laguerre polynomial as the degree of the polynomial tends to infinity. In these formulas, the q-Airy polynomial, defined by truncating the q-Airy function, plays a significant role. While the standard Airy function, used frequently in the uniform asymptotic formulas for classical orthogonal polynomials, behaves like the exponential function on one side and the trigonometric functions on the other side of an extreme zero, the q-Airy polynomial behaves like the q-Airy function on one side and the q-Theta function on the other side. The last two special functions are involved in the local asymptotic formulas of the q-orthogonal polynomials. It seems therefore reasonable to expect that the q-Airy polynomial will play an important role in the asymptotic theory of the q-orthogonal polynomials.     

Operator identities involving the bivariate Rogers-Szegö polynomials and their applications to the multiple q-series identities

In this paper, we first give several operator identities involving the bivariate Rogers-Szegö polynomials. By applying the technique of parameter augmentation to the multiple q-binomial theorems given by Milne [S.C. Milne, Balanced summation theorems for U(n) basic hypergeometric series, Adv. Math. 131 (1997) 93-187], we obtain several new multiple q-series identities involving the bivariate Rogers-Szegö polynomials. These include multiple extensions of Mehler's formula and Rogers's formula. Our U(n+1) generalizations are quite natural as they are also a direct and immediate consequence of their (often classical) known one-variable cases and Milne's fundamental theorem for An or U(n+1) basic hypergeometric series in Theorem 1.49 of [S.C. Milne, An elementary proof of the Macdonald identities for , Adv. Math. 57 (1985) 34-70], as rewritten in Lemma 7.3 on p. 163 of [S.C. Milne, Balanced summation theorems for U(n) basic hypergeometric series, Adv. Math. 131 (1997) 93-187] or Corollary 4.4 on pp. 768-769 of [S.C. Milne, M. Schlosser, A new An extension of Ramanujan's summation with applications to multilateral An series, Rocky Mountain J. Math. 32 (2002) 759-792].     

Optimal stopping for non-linear expectations—Part II

Relying on the stochastic analysis tools developed in Bayraktar and Yao (2011) [1], we solve the optimal stopping problems for non-linear expectations.     

Optimal stopping for non-linear expectations—Part I

We develop a theory for solving continuous time optimal stopping problems for non-linear expectations. Our motivation is to consider problems in which the stopper uses risk measures to evaluate future rewards. Our development is presented in two parts. In the first part, we will develop the stochastic analysis tools that will be essential in solving the optimal stopping problems, which will be presented in Bayraktar and Yao (2011) [1].     

Identities between q-hypergeometric and hypergeometric integrals of different dimensions

Given complex numbers m₁,l₁ and nonnegative integers m₂,l₂, such that m₁+m₂=l₁+l₂, for any a,b=0,…,min(m₂,l₂) we define an l₂-dimensional Barnes type q-hypergeometric integral I_a,b(z,μ;m₁,m₂,l₁,l₂) and an l₂-dimensional hypergeometric integral J_a,b(z,μ;m₁,m₂,l₁,l₂). The integrals depend on complex parameters z and μ. We show that I_a,b(z,μ;m₁,m₂,l₁,l₂) equals J_a,b(e^μ,z;l₁,l₂,m₁,m₂) up to an explicit factor, thus establishing an equality of l₂-dimensional q-hypergeometric and m₂-dimensional hypergeometric integrals. The identity is based on the duality for the qKZ and dynamical difference equations.     

On k-networks and weak bases for spaces

In this paper, we answer some problems on k-networks and weak bases posed by Liu and Tanaka (2007) [19].     

Periodic solutions for a class of superquadratic Hamiltonian systems

We prove the existence of nontrivial critical points for a class of superquadratic nonautonomous second-order Hamiltonian systems by applying condition ^∗(C) to critical point theory, and some new solvability conditions of nontrivial periodic solutions are obtained.     

Constructions for cyclic Moebius ladder systems

J.A. Gallian has proved [J.A. Gallian, Labeling prisms and prism related graphs, Congr. Numer. 59 (1987) 89-100] that every cubic graph M_2k obtainable from a 2k-cycle by adding its k diameters (the so-called Moebius Ladder of order 2k) is graceful. Here, in the case of k even, we propose a new graceful labeling that besides being simpler than Gallian’s one is able to give, at the same time, a graceful labeling of the prism of order 2k. Most importantly in the case of k odd, namely in the bipartite case, we prove that M_2k also admits an α-labeling. This implies that there exists a cyclic decomposition of the complete graph K_6kt+1 into copies of M_2k for every pair of positive integers k and t with k odd.In some cases we are able to give such decompositions also when k is even. Apart from the case of t=1 that is an obvious consequence of the gracefulness of M_2k, this happens, for instance, when k≡2 (mod 4) and 6kt+1 is a prime.     

Further improved recursions for a class of compound Poisson distributions

In the present paper we develop more efficient recursive formulae for the evaluation of the t-order cumulative function Γ^th(x) and the t-order tail probability Λ^th(x) of the class of compound Poisson distributions in the case where the derivative of the probability generating function of the claim amounts can be written as a ratio of two polynomials. These efficient recursions can be applied for the exact evaluation of the probability function (given by De Pril [De Pril, N., 1986a. Improved recursions for some compound Poisson distributions. Insurance Math. Econom. 5, 129-132]), distribution function, tail probability, stop-loss premiums and t-order moments of stop-loss transforms of compound Poisson distributions. Also, efficient recursive algorithms are given for the evaluation of higher-order moments and r-order factorial moments about any point for this class of compound Poisson distributions. Finally, several examples of discrete claim size distributions belonging to this class are also given.     

Comparison of two randomized policy M/G/1 queues with second optional service, server breakdown and startup

The problem addressed in this paper is to compare the minimum cost of the two randomized control policies in the M/G/1 queueing system with an unreliable server, a second optional service, and general startup times. All arrived customers demand the first required service, and only some of the arrived customers demand a second optional service. The server needs a startup time before providing the first required service until the system becomes empty. After all customers are served in the queue, the server immediately takes a vacation and the system operates the (T, p)-policy or (p, N)-policy. For those two policies, the expected cost functions are established to determine the joint optimal threshold values of (T, p) and (p, N), respectively. In addition, we obtain the explicit closed form of the joint optimal solutions for those two policies. Based on the minimal cost, we show that the optimal (p, N)-policy indeed outperforms the optimal (T, p)-policy. Numerical examples are also presented for illustrative purposes.     

On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture

For a given permutation matrix P, let fP(n) be the maximum number of 1-entries in an n×n(0,1)-matrix avoiding P and let SP(n) be the set of all n×n permutation matrices avoiding P. The Füredi-Hajnal conjecture asserts that cP:=limn→∞fP(n)/n is finite, while the Stanley-Wilf conjecture asserts that is finite.In 2004, Marcus and Tardos proved the Füredi-Hajnal conjecture, which together with the reduction introduced by Klazar in 2000 proves the Stanley-Wilf conjecture.We focus on the values of the Stanley-Wilf limit (sP) and the Füredi-Hajnal limit (cP). We improve the reduction and obtain which decreases the general upper bound on sP from sP?constconstO(klog(k)) to sP?constO(klog(k)) for any k×k permutation matrix P. In the opposite direction, we show .For a lower bound, we present for each k a k×k permutation matrix satisfying cP=Ω(k²).     

Mapping properties for oscillatory integrals in d-dimensions

For aj,bj?1, j=1,2,…,d, we prove that the operator maps into itself for , where , and k(x,y)=φ(x,y)eig(x,y), φ(x,y) satisfies (1.2) (e.g. φ(x,y)=|x−y|^iτ,τ real) and the phase g(x,y)=xa⋅yb. We study operators with more general phases and for these operators we require that aj,bj>1, j=1,2,…,d, or al=bl?1 for some l∈{1,2,…,d}.     

A group-based search for solutions of the n-queens problem

The n-queens problem is a well-known problem in mathematics, yet a full search for n-queens solutions has been tackled until now using only simple algorithms (with the exception of the Rivin-Zabih algorithm). In this article, we discuss optimizations that mainly rely on group actions on the set of n-queens solutions. Most of our arguments deal with the case of toroidal queens; at the end, the application to the regular n-queens problem is discussed, and also the Rivin-Zabih algorithm.     

Identities for the Widder transform and transforms with Bessel function kernels

In the present paper, we consider the classical Widder transform, the H_ν-transform, the K_ν-transform, and the Y_ν-transform. Some identities involving these transforms and many others are given. By making use of these identities, a number of new Parseval-Goldstein type identities are obtained for these and other well-known integral transforms.     

Letter to the Editor: A note on the preconditioned Gauss-Seidel (GS) method for linear systems

Wen Li (J. Comput. Appl. Math., 182 (2005) 81-90) asserted that there are some errors in article by Hiroshi Niki, Kyouji Harada, Munenori Morimoto and Michio Sakakihara (J. Comput. Appl. Math., 164-165 (2004) 587-600). And Li presented a new proof for the corresponding results in H. Niki et al. In this paper, we point out some errors in Li’s assertion. Moreover, we show that a new proof presented by Li is imperfect.     

Binary relations and reduced hypergroups

Different partial hypergroupoids are associated with binary relations defined on a set H. In this paper we find sufficient and necessary conditions for these hypergroupoids in order to be reduced hypergroups. Given two binary relations ρ and σ on H we investigate when the hypergroups associated with the relations ρ∩σ, ρ∪σ and ρσ are reduced. We also determine when the cartesian product of two hypergroupoids associated with a binary relation is a reduced hypergroup.     

Optimal interleaving schemes for correcting two-dimensional cluster errors

We present an elementary theory of optimal interleaving schemes for correcting cluster errors in two-dimensional digital data. It is assumed that each data page contains a fixed number of, say n, codewords with each codeword consisting of m code symbols and capable of correcting a single random error (or erasure). The goal is to interleave the codewords in the m×n array such that different symbols from each codeword are separated as much as possible, and consequently, an arbitrary error burst with size up to t can be corrected for the largest possible value of t. We show that, for any given m, n, the maximum possible interleaving distance, or equivalently, the largest size of correctable error bursts in an m×n array, is given by if n?⌈m²/2⌉, and t=m+⌊(n-⌈m²/2⌉)/m⌋ if n?⌈m²/2⌉. Furthermore, we develop a simple cyclic shifting algorithm that can provide a systematic construction of an m×n optimal interleaving array for arbitrary m and n. This extends important earlier work on the complementary problem of constructing interleaving arrays that, given the burst size t, minimize the interleaving degree, that is, the number of different codewords in a 2-D (or 3-D) array such that any error burst with given size t can be corrected. Our interleaving scheme thus provides the maximum burst error correcting power without requiring prior knowledge of the size or shape of an error burst.     

The inclusion relation between Sobolev and modulation spaces

The inclusion relations between the Lp-Sobolev spaces and the modulation spaces is determined explicitly. As an application, mapping properties of unimodular Fourier multiplier eiα|D| between Lp-Sobolev spaces and modulation spaces are discussed.