关于环Fpm+uFpm+u2Fpm上循环码的注记

本文研究了环F_p^m+uF_p^m+u²F_p^m上长度为p^s的循环码分类.通过建立环F_p^m+uF_p^m+u²F_p^m到环F_p^m+uF_p^m的同态,给出了环F_p^m+uF_p^m+u²F_p^m上长度为p^s的循环码的新分类方法.应用这种方法,得到了环F_p^m+uF_p^m+u²F_p^m长度为p^s的循环码的码词数.     

Embedding of Hpω in the class eL

We obtain the necessary conditions for the embedding H _p ^ω ⊂ e ^L (1≤p∞) with convex modulus of continuity ω in terms of this modulus. In the case p=1 these conditions are also sufficient.     

On the nonlinear wave equation Utt−B(t,‖Ux‖)Uxx=f(x,t,U,Ux,Ut) associated with the mixed homogeneous conditions

In this paper we consider the following nonlinear wave equation

(1)     

环Fpm[u]/<ua>上一类常循环码

本文研究有限链环上一类λ-常循环码.利用x~n-1在R_a[x]上可唯一分解为两两互素的首一基本不可约多项式乘积,刻画了R_a中长为p~sn的所有λ-常循环码,推广了开晓山等人在文献[4]中的结果.     

关于矩阵方程X+A*X-αA+B*X-βB=I的正定解

本文研究了矩阵方程X+A*X-αA+B*X-βB=I在α,β∈(0,1]时的正定解.利用单调有界极限存在准则,构造三种迭代算法,获得了方程的正定解,拓宽了此类方程的求解方法.数值算例说明算法的可行性.     

On irreducible characters of the group Sn that are semiproportional on An or Sn?An. II

In the author’s previous paper, the hypothesis that the alternating groups A _n have no pairs of semiproportional irreducible characters is reduced to a hypothesis concerning the problem of describing the pairs of irreducible characters of the symmetric group S _n that are semiproportional on one of the sets A _n or S _n ∖A _n . In this hypothesis, properties of such a pair of characters are expressed in terms of Young’s diagrams corresponding to these characters. The theorem proved in this paper allows one to exclude from consideration some stages of the verification of this hypothesis.     

LPE GaxIn1-xAs1-ySby/InP和GaxIn1-xAs1-ySby/InAs的生长及其估价

将电负性差法估算的Ga_xIn_1-xAs_1-ySb_y/InP和Ga_xIn_1-xAs_1-ySb_y/InAs的固相和液相组份数据应用于液相外延生长,均获得了晶格匹配的材料,并首次获得了波长λ>3.5μm的Ga_xIn_1-xAs_1-ySb_y/InAs异质外延材料。Ga_xIn_1-xAs_1-ySb_y/InP的固体组份为...     

Small solutions of the congruencea1x12 +a2x22 +a3x32 +a4x42 ≡c(modp)

For any integersa ₁,a ₂,a ₃,a ₄ andc witha ₁ a ₂ a ₃ a ₄≢0(modp), this paper shows that there exists a solutionX=(x ₁,x ₂,x ₃,x ₄) ∈Z ⁴ of the congruencea ₁ x ₁ ² +a ₂ x ₂ ² +a ₃ x ₃ ² +a ₄ x ₄ ² ≡c(modp) such that

KO?i groups of G3(?n), n odd

We use the work of Karoubi and Mudrinski on the real Grothendieck's groups of certain complex projective bundles to show that the torsion of the KO ^–i groups of G ₃( ⁿ ), n odd, are related to the known torsion of the KO ^–i groups of G₂( ⁿ ).     

Solving Ck/Cm/1/N queues by using characteristic roots in matrix analytic methods

In this paper, we study a C_k/C_m/1/N open queueing system with finite capacity. We investigate the property which shows that a product of the Laplace Stieltjes Transforms of interarrival and service times distributions satisfies an equation of a simple form. According to this equation, we present that the stationary probabilities on the unboundary states can be written as a linear combination of vector product-forms. Each component of these products is expressed in terms of roots of an associated characteristic polynomial. As a result, we carry out an algorithm for solving stationary probabilities in C_k/C_m/1/N systems, which is independent of N, hence greatly reducing the computational complexity.     

Analyzing discrete-time D-BMAP/G/1/N queue with single and multiple vacations

This paper analyzes a single-server finite-buffer vacation (single and multiple) queue wherein the input process follows a discrete-time batch Markovian arrival process (D-BMAP). The service and vacation times are generally distributed and their durations are integral multiples of a slot duration. We obtain the state probabilities at service completion, vacation termination, arbitrary, and prearrival epochs. The loss probabilities of the first-, an arbitrary- and the last-customer in a batch, and other performance measures along with numerical aspects have been discussed. The analysis of actual waiting time of these customers in an accepted batch is also carried out.     

Dimension of the crown Skn

In 1941, Dushnik and Miller introduced the concept of the dimension of a poset (X, P) as the minimum number of linear extensions of P whose intersection is exactly P. Although Dilworth has given a formula for the dimension of distributive lattices, the general problem of determining the dimension of a poset is quite difficult. An equally difficult problem is to classify those posets which are dimension irreducible, i.e., those posets for which the removal of any point lowers the dimension. In this paper, we construct for each n≥3, k≥0, a poset, called a crown and denoted S^k_n, for which the dimension is given by the formula $\text{2?(n+k)}\text{(k+2)}$. Furthermore, for each t≥3, we show that there are infinitely many crowns which are irreducible and have dimension t. We then demonstrate a method of combining a collection of irreducible crowns to form an irreducible poset whose dimension is the sum of the crowns in the collection. Finally, we construct some infinite crowns possessing combinatorial properties similar to finite crowns.     

Une question sur les équations xm ? ym = Rzn (A Question on the Equations xm ? ym = Rzn)

Let m and n be integers at least two and R be a nonzero natural number. In this paper, we study the problem of the determination of the proper solutions of the Diophantine equation x ^m – y ^m equals; Rz ⁿ . We raise a question concerning the existence of any proper nontrivial solution of this equation, in case some precise conditions are satisfied by the triple (m, n, R). We prove some results about it.     

Approximation of M/M/s/K retrial queue with nonpersistent customers

We consider the M/M/s/K retrial queues in which a customer who is blocked to enter the service facility may leave the system with a probability that depends on the number of attempts of the customer to enter the service facility. Approximation formulae for the distributions of the number of customers in service facility, waiting time in the system and the number of retrials made by a customer during its waiting time are derived. Approximation results are compared with the simulation.     

Expansion in SLd(Z/qZ), q arbitrary

Let S be a fixed finite symmetric subset of SL _d (Z), and assume that it generates a Zariski-dense subgroup G. We show that the Cayley graphs of π _q (G) with respect to the generating set π _q (S) form a family of expanders, where π _q is the projection map Z→Z/q Z.     

Analysis of the MAP/G/1/N queue with multiple vacations

This paper deals with a batch service queue and multiple vacations. The system consists of a single server and a waiting room of finite capacity. Arrival of customers follows a Markovian arrival process (MAP). The server is unavailable for occasional intervals of time called vacations, and when it is available, customers are served in batches of maximum size ‘b’ with a minimum threshold value ‘a’. We obtain the queue length distributions at various epochs along with some key performance measures. Finally, some numerical results have been presented.     

Automorphisms of Chevalley groups of types Al, Dl, El over local rings without 1/2

In this paper, we prove that every automorphism of a Chevalley group of type B _l , l ≥ 2, over a commutative local ring with 1/2 is standard, i.e., it is a composition of ring, inner, and central automorphisms.     

Large-time asymptotics for the Gt/Mt/st+GIt many-server fluid queue with abandonment

We previously introduced and analyzed the G _t /M _t /s _t +GI _t many-server fluid queue with time-varying parameters, intended as an approximation for the corresponding stochastic queueing model when there are many servers and the system experiences periods of overload. In this paper, we establish an asymptotic loss of memory (ALOM) property for that fluid model, i.e., we show that there is asymptotic independence from the initial conditions as time t evolves, under regularity conditions. We show that the difference in the performance functions dissipates over time exponentially fast, again under the regularity conditions. We apply ALOM to show that the stationary G/M/s+GI fluid queue converges to steady state and the periodic G _t /M _t /s _t +GI _t fluid queue converges to a periodic steady state as time evolves, for all finite initial conditions.