On waiting time distributions associated with compound patterns in a sequence of multi-state trials

In this article, waiting time distributions of compound patterns are considered in terms of the generating function of the numbers of occurrences of the compound patterns. Formulae for the evaluation of the generating functions of waiting time are given, which are very effective computational tools. We provide several viewpoints on waiting time problems associated with compound patterns and develop a general workable framework for the study of the corresponding distributions. The general theory is employed for the investigation of some examples in order to illustrate how the distributions of waiting time can be derived through our theoretical results. This research was partially supported by the ISM Cooperative Research Program (2006-ISM·CRP-2007).     

On the matching polynomial of subdivision graphs

Let G be a simple graph and let S(G) be the subdivision graph of G, which is obtained from G by replacing each edge of G by a path of length two. In this paper, by the Principle of Inclusion and Exclusion we express the matching polynomial and Hosoya index of S(G) in terms of the matchings of G. Particularly, if G is a regular graph or a semi-regular bipartite graph, then the closed formulae of the matching polynomial and Hosoya index of S(G) are obtained. As an application, we prove a combinatorial identity.     

Instanton partition functions and M-theory

We discuss instanton partition functions in various spacetime dimensions. These partition functions capture some information about the spectrum of the supersymmetric gauge theories and their low-energy dynamics. Some of these theories can be defined microscopically only through string theory. Remarkably, they even know about the M-theory. Our conjectures include the identities between the generalization of the MacMahon formula and the character of M-theory, compactified down to 0 + 1 dimension. This article is based on the 5th Takagi Lectures that the author delivered at the University of Tokyo on October 4 and 5, 2008.     

On a class of renewal risk model with random income

In this paper, we consider a renewal risk process with random premium income based on a Poisson process. Generating function for the discounted penalty function is obtained. We show that the discounted penalty function satisfies a defective renewal equation and the corresponding explicit expression can be obtained via a compound geometric tail. Finally, we consider the Laplace transform of the time to ruin, and derive the closed‐form expression for it when the claims have a discrete K_m distribution (i.e. the generating function of the distribution function is a ratio of two polynomials of order m∈?⁺). Copyright © 2008 John Wiley & Sons, Ltd.     

Birkhoff‐Frink representations as functors

In an earlier article we characterized, from the viewpoint of set theory, those closure operators for which the classical result of Birkhoff and Frink, stating the equivalence between algebraic closure spaces, subalgebra lattices and algebraic lattices, holds in a many‐sorted setting. In the present article we investigate, from the standpoint of category theory, the form these equivalences take when the adequate morphisms of the several different species of structures implicated in them are also taken into account. Specifically, our main aim is to provide a functorial rendering of the Birkhoff‐Frink representation theorems for both single‐sorted algebras and many‐sorted algebras, by defining the appropriate categories and functors, covariant and contravariant, involved in the process (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Pattern avoidance in binary trees

This paper considers the enumeration of trees avoiding a contiguous pattern. We provide an algorithm for computing the generating function that counts n-leaf binary trees avoiding a given binary tree pattern t. Equipped with this counting mechanism, we study the analogue of Wilf equivalence in which two tree patterns are equivalent if the respective n-leaf trees that avoid them are equinumerous. We investigate the equivalence classes combinatorially. Toward establishing bijective proofs of tree pattern equivalence, we develop a general method of restructuring trees that conjecturally succeeds to produce an explicit bijection for each pair of equivalent tree patterns.     

Double Series Identity and Some Laurent Type Hypergeometric Generating Relations

The main aim of this article is to obtain certain Laurent type hypergeometric generating relations. Using a general double series identity, Laurent type generating functions(in terms of Kampéde Fériet double hypergeometric function) are derived. Some known results obtained by the method of Lie groups and Lie algebras, are also modified here as special cases.     

常微分方程形式的M/M/1排队算子的谱分析

在l~1空间研究了常微分方程形式的M/M/1排队模型确定的算子A的谱问题.通过细致的谱分析,表明算子A的谱是一个椭圆型,椭圆内部点全是算子A的本征值.0位于椭圆的右边界点是边界上唯一的本征值,从而0不能与其它谱点相分离.这一结果表明常微分方程形式的M/M/1排队系统在有限时间不可能看到系统的稳定状态.     

具有随机控制函数的受控分枝过程

本文研究了具有随机控制函数的受控分枝过程的各类概率母函数间的关系.利用对概率母函数求导的方法,获得了过程的期望和方差,推广了该过程概率母函数和矩量的一些基本结果.     

q-Laguerre polynomials and related q-partial differential equations

In this paper, we define two homogenous q-Laguerre polynomials, by introducing a modified q-differential operator, we prove that an analytic function can be expanded in terms of the q-Laguerre polynomials if and only if the function satisfies certain q-partial differential equations. Using this main result, we derive the generating functions, bilinear generating functions and mixed generating functions for the q-Laguerre polynomials and generalized q-Hahn polynomials. Cigler’s polynomials and its generating functions discussed in [J. Cao, D.-W. Niu, A note on q -difference equations for Cigler’s polynomials, J. Difference Equ. Appl. 22 (2016), 1880–1892.] are generalized. At last, we obtain an q-integral identity involving q-Laguerre polynomials. These applications indicate that the q-partial differential equation is an effective tool in studying q-Laguerre polynomials.