Multilinear isometries on spaces of vector-valued continuous functions

In this paper we study multilinear isometries defined on certain subspaces of vector-valued continuous functions. We provide conditions under which such maps can be properly represented. Our results contain all known results concerning linear and bilinear isometries defined between spaces of continuous functions. The key result is a vector-valued version of the additive Bishop’s Lemma, which we think has interest in itself.     

Excluding pairs of tournaments

The Erdős–Hajnal conjecture states that for every given undirected graph H there exists a constant such that every graph G that does not contain H as an induced subgraph contains a clique or a stable set of size at least . The conjecture is still open. Its equivalent directed version states that for every given tournament H there exists a constant such that every H‐free tournament T contains a transitive subtournament of order at least . In this article, we prove that for several pairs of tournaments, H₁ and H₂, there exists a constant such that every ‐free tournament T contains a transitive subtournament of size at least . In particular, we prove that for several tournaments H, there exists a constant such that every ‐free tournament T, where stands for the complement of H, has a transitive subtournament of size at least . To the best of our knowledge these are first nontrivial results of this type.     

On the Counting Process for a Class of Markovian Arrival Processes with an Application to a Queueing System

In this paper, we consider the counting process for a class of Markovian arrival processes (MAPs). We assume that the representing matrices in such MAPs are expanded in terms of matrix representations of the standard generators in the Lie algebra of the special linear group. The primary purpose of this paper is to construct an explicit solution of the time-dependent distribution and factorial moments of the number of arrival events in (0,t] of the counting process for this class of MAPs. Our construction relies on the Baker–Hausdorff lemma and the specific structure of the representing matrices. To investigate the efficiency of CPU usage with the explicit solution, we have conducted numerical experiments on computing the time-dependent distribution of the counting process through the explicit solution and uniformization-based method. We show that the CPU times required to compute the time-dependent distribution of the number of arrival events in (0,t] through the explicit solution have little sensitivity to t, while the consumption of CPU times with the uniformization-based method becomes greater as t increases. For illustrative purposes, we present a system performance analysis of a queueing system for possible use in automatic call distribution (ACD) systems. As an application of the explicit solution, we use it to express the waiting time distribution of the queueing system. Some numerical examples are also given with comparisons to computer simulations.AMS subject classification: 60K20, 60K25, 68M20This revised version was published online in June 2005 with corrected coverdate     

Summation formulae for twisted cubic q‐series

A new class of twisted cubic q‐series is investigated by means of the modified Abel lemma on summation by parts. Several remarkable summation and transformation formulae are established for both terminating and nonterminating series.     

包含次临界和临界Sobolev指数的Schr(o)dinger-Possion方程的正解

讨论了一类包含次临界和临界Sobolev指数的Schr(o)dinger-Possion方程解的存在性.应用Nehari流形和变分方法,在不同情况下,得到了方程至少存在一个解.     

Flat functions in Carleman ultraholomorphic classes via proximate orders

Whenever the defining sequence of a Carleman ultraholomorphic class (in the sense of H. Komatsu) is strongly regular and associated with a proximate order, flat functions are constructed in the class on sectors of optimal opening. As consequences, we obtain analogues of both Borel–Ritt–Gevrey theorem and Watson's lemma in this general situation.     

Compactness in kinetic transport equations and hypoellipticity

We establish improved hypoelliptic estimates on the solutions of kinetic transport equations, using a suitable decomposition of the phase space. Our main result shows that the relative compactness in all variables of a bounded family of nonnegative functions fλ(x,v)∈L¹ satisfying some appropriate transport relation

     

关于M／M~［r］／1系统的一个注记

徐光辉［１，第六章§１］讨论了成批服务系统Ｍ／Ｍ［ｒ］／１，并在ｌｉｍＰｊ（ｔ）＝Ｐｊ＞０假设下，求出马氏过程Ｎ（ｔ）的平稳分布｛Ｐｉ｝，李文琦等在［２，Ｐ１６８８］指出［１．Ｐ２１８—２１９］给出的关于ｌｉｍＰｊ（ｔ）＝Ｐｊ＞０的证明是不准确的，并利用Ｆｏｓｔｅｒ判别法给出Ｎ（ｔ）的遍历性的严格证明。本文指出Ｎ（ｔ）的遍历性可由Ｐｉｊ（△ｔ）的表达式及Ｔａｋａｃｓ［４，Ｐ９４定理２］推出。