Ultrapowers ofL 1(μ) and the subsequence splitting principle

We study the ultrapowers $L_1 (\mu )_\mathfrak{U} $ of aL ₁(μ) space, by describing the components of the well-known representation $L_1 (\mu )_\mathfrak{U} = L_1 (\mu _\mathfrak{U} ) \oplus _1 L_1 (\nu _\mathfrak{U} )$ , and we give a representation of the projection from $L_1 (\mu )_\mathfrak{U} $ onto $L_1 (\mu _\mathfrak{U} )$ . Moreover, the subsequence splitting principle forL ₁(μ) motivates the following question: if $\mathfrak{V}$ is an ultrafilter on ? and $[f_i ] \in L_1 (\mu )_\mathfrak{V} $ , is it possible to find a weakly convergent sequence (g _i ) ?L ₁(μ) following $\mathfrak{V}$ and a disjoint sequence (h _i ) ?L ₁(μ) such that [f _i ]=[g _i ]+[h _i ]? If $\mathfrak{V}$ is a selective ultrafilter, we find a positive answer by showing that $f = [f_i ] \in L_1 (\mu )_\mathfrak{V} $ belongs to $L_1 (\mu _{_\mathfrak{V} } )$ if and only if its representatives {f _i } are weakly convergent following $\mathfrak{V}$ and $f \in L_1 (\nu _\mathfrak{V} )$ if and only if it admits a representative consisting of pairwise disjoint functions. As a consequence, we obtain a new proof of the subsequence splitting principle. If $\mathfrak{V}$ is not a p-point then the above characterizations of $L_1 (\nu _{_\mathfrak{V} } )$ and $L_1 (\nu _{_\mathfrak{V} } )$ fail and the answer to the question is negative.     

A central-limit-theorem version ofL=λw

Underlying the fundamental queueing formulaL=W is a relation between cumulative processes in continuous time (the integral of the queue length process) and in discrete time (the sum of the waiting times of successive customers). Except for remainder terms which usually are asymptotically negligible, each cumulative process is a random time-transformation of the other. As a consequence, in addition to the familiar relation between the with-prob ability-one limits of the averages, roughly speaking, the customer-average wait obeys a central limit theorem if and only if the time-average queue length obeys a central limit theorem, in which case both averages, properly normalized, converge in distribution jointly, and the individual limiting distributions are simply related. This relation between the central limit theorems is conveniently expressed in terms of functional central limit theorems, using the continuous mapping theorem and related arguments. The central limit theorems can be applied to compare the asymptotic efficiency of different estimators of queueing parameters. For example, when the arrival rate is known and the interarrivai times and waiting times are negatively correlated, it is more asymptotically efficient to estimate the long-run time-average queue lengthL indirectly by the sample-average of the waiting times, invokingL=W, than it is to estimate it by the sample-average of the queue length. This variance-reduction principle extends a corresponding result for the standard GI/G/s model established by Carson and Law [2].Supported by the National Science Foundation under Grant No. ECS-8404809 and by the U.S. Army under Contract No. DAAG29-80-C-0041.     

A review ofL=λW and extensions

A fundamental principle of queueing theory isL=W (Little's law), which states that the time-average or expected time-stationary number of customers in a system is equal to the product of the arrival rate and the customer-average or expected customer-stationary time each customer spends in the system. This principle is now well known and frequently applied. However, in recent years there have been extensions, such as H=G and the continuous, distributional, ordinal and central-limit-theorem versions, which show that theL=W relation, when viewed properly, has much more power than was previously realized. Moreover, connections have been established between H=G and other fundamental relations, such as the rate conservation law and PASTA (Poisson arrivals see time averages), which show that there is a much greater unity in the overall theory than was previously realized. This paper provides a review.This paper is dedicated to the memory of our colleague Professor Peter Franken (1937–1989), who contributed greatly to the subject of this paper and to queueing theory more generally.     

Sufficient conditions for functional-limit-theorem versions ofL = λW

The familiar queueing principle expressed by the formulaL=W can be interpreted as a relation among strong laws of large numbers. In a previous paper, we showed that this principle can be extended to include relations among other classical limit theorems such as central limit theorems and laws of the iterated logarithm. Here we provide sufficient conditions for these limit theorems using regenerative structure.Supported by the National Science Foundation under Grant No. ECS-8404809 and by the U.S. Army under Contract No. DAAG29-80-C-0041.     

Multiwavelet packets and frame packets ofL 2(ℝ d )

The orthonormal basis generated by a wavelet ofL ²(ℝ) has poor frequency localization. To overcome this disadvantage Coifman, Meyer, and Wickerhauser constructed wavelet packets. We extend this concept to the higher dimensions where we consider arbitrary dilation matrices. The resulting basis ofL ²(ℝ ^d ) is called the multiwavelet packet basis. The concept of wavelet frame packet is also generalized to this setting. Further, we show how to construct various orthonormal bases ofL ²(ℝ ^d ) from the multiwavelet packets.     

不存在秩为r(G)+2c(G)-1或r(G)-2c(G)+1的符号图

设Γ=(G,σ)是一个符号图,其中G是Γ的基图.设r(G,σ)是Γ的秩.[Linear Algebra Appl.,2018,538:166-186]和[Linear Multilinear Algebra,2019,67:2520-2539]分别证明了r(G)-2c(G)≤r(G,σ)≤r(G)+2c(G),其中,r(G)和c(G)分别是G的秩和圈空间维数.本文主要证明没有符号图的秩能够达到r(G)+2c(G)-1和r(G)-2c(G)+1,并且证明了存在无穷多个符号图的秩r(G,σ)=r(G)+2c(G)-s,其中s∈[0,4c(G)]且s≠1及4c(G)-1.     

A general sufficient condition for a graph G with λ_m(G)≤ξ_m(G)

It has been shown that a λ m-connected graph G has the property λ m (G)≤ξ m (G) for m≤3.But for m≥4,Bonsma et al.pointed out that in general the inequality λ m (G)≤ξ m (G) is no longer true.Recently Ou showed that any λ 4-connected graph G with order at least 11 has the property λ 4 (G)≤ξ 4 (G).In this paper,by investigating some structure properties of a λ m-connected graph G with λ m (G) ξ m (G),we obtain easily the above result.Furthermore,we show that every λ m-connected graph G with order greater than m(m-1) satisfies the inequality λ m (G)≤ξm (G) for m≥5.And by constructing some examples,we illustrate that our conditions are the best possible.     

3-γ-临界图G中关于i(G)=γ(G)的一个充分条件

如果图G满足γ（G）＝k且对图G中任两个相邻的点x,y有γ（G＋xy)=k-1,则称图G为k-γ-临界图,如果图G满足γ（G）＝k且对图G中任何距离为d的两点x,y有γ（G＋xy)=k-1,则称图G为k-(γ,d)－临界图。Sumner和Blitch猜想在3－γ－临界图中有γ（G）＝i(G).Oellermann和Swart猜想3－（γ,2）－临界图中有γ（G）＝i(G),这篇文章中我们提出3－γ－临界图中使γ（G）＝i(G)的一个充分条件。     

On the best approximation of functions on the sphere in the metric ofL p (Sn), 1<p<∞

L _p , 1<p<, S ⁿ R ⁿ⁺¹,n1, , , .     

推广的M~x/G(M/G)/1(M/G)可修排队系统(I)── 一些排队指标

考虑M     

Limq → ∞ \frac{c(G)}{r(G)} for Simple Groups

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. For a given finite group G, let c(G) denote the minimal degree of a faithful representation of G by complex quasi-permutation matrices and let r(G) denote the minimal degree of a faithful rational valued character of G. Also let G denote one of the symbols A_l, B_l, C_l, D_l, E₆, E₇, E₈, G₂, F₄, ²B₂, ²E₄, ²G₂, and ³D₄. Let G(q) denote simple group of type G over GF(q). Let c(q) = c(G(q)) and r(q) = r(G(q)). Then we will show that lim Lim_q = 1.     

推广的M~x/G(M/G)/1(M/G)可修排队系统(I)── 一些排队指标

考虑Ｍｘ／Ｇ（Ｍ／Ｇ）／１（Ｍ／Ｇ）可修排队系统,且把该系统推广到休假时间、服务时间、修理时间和延误休假时间都为任意分布（不一定连续）,利用服务员忙期和拉普拉斯交换,我们直接获得队长瞬态分布的Ｌ变换递推式和稳态分布的递推式,以及队长的概率母函数,同时指出了１９９４年史定华文中存在的错误．     

从L~p(G,A)到L~p(G,X)的L~1(G,A)-模同态和不变算子(1

于树模 《数学年刊A辑(中文版)》1990,(6)

利用推广的(G′/G)展开法求解(2+1)维BBM方程

利用推广的(G′/G)展开法,借助于计算机代数系统Mathematica,获得了(2+1)维BBM方程的丰富的显式行波解,分别以含两个任意参数的双曲函数、三角函数及有理函数表示.     

|A(G)|=26p2(p为奇素数)的有限Abel群G

本文根据有限Abel群G的自同构群A(G)的阶研究了群G的构造.利用有限交换群的一些性质,经过详细的理论推导,获得了|A(G)|=26p2(p为奇素数)的有限Abel群G的全部类型.     

MULTIPLIERS OF SEGAL ALGEBRAS A_p(G)

Let G be a locally compact but non-compact abelian group,It is proved thatM(A_p(G),L_1(G))=M(G)and M(A_p(G),L_1(G)∩C_0(G))=M(L_1(G),L_1(G)∩C_0(G)).If G is discrete,then M(A_p(G),L_1(G))=A_p(G),M(A_p,(G),L_1(G)∩C_0(G))=A_p(G).