K -Theory with R / Z Coefficients and von Neumann Algebras

This paper provides a realization of K-theory with R/Z coefficients and proves an R/Z index theorem. (Received: February 2006)     

Relative ( pn , p , pn , n )-difference sets with GCD ( p , n )=1

Let p be an odd prime. We first get some non-existence and structural results on (pn,p,pn,n) relative difference sets with gcd(p,n)=1 through a group ring approach. We then give a construction of (p(p+1),p,p(p+1),p+1) relative difference sets with p a Mersenne prime. Supported by National Natural Science Foundation of China (10331030).     

BMAP/G/1/N queue with vacations and limited service discipline

We consider a finite buffer single server queue with batch Markovian arrival process (BMAP), where server serves a limited number of customer before going for vacation(s). Single as well as multiple vacation policies are analyzed along with two possible rejection strategies: partial batch rejection and total batch rejection. We obtain queue length distributions at various epochs and some important performance measures. The Laplace–Stieltjes transforms of the actual waiting time of the first customer and an arbitrary customer in an accepted batch have also been obtained.     

Approximation of M/M/c retrial queue with PH-retrial times

We consider the M/M/c retrial queues with PH-retrial times. Approximation formulae for the distribution of the number of customers in service facility and the mean number of customers in orbit are presented. Some numerical results are presented.     

Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue

This paper studies a multi-server queueing system with multiple types of customers and last-come-first-served (LCFS) non-preemptive service discipline. First, a quasi-birth-and-death (QBD) Markov process with a tree structure is defined and some classical results of QBD Markov processes are generalized. Second, the MMAP[K]/PH[K]/N/LCFS non-preemptive queue is introduced. Using results of the QBD Markov process with a tree structure, explicit formulas are derived and an efficient algorithm is developed for computing the stationary distribution of queue strings. Numerical examples are presented to show the impact of the correlation and the pattern of the arrival process on the queueing process of each type of customer.     

Fast formula of a reliability ofm-consecutive-k-out-of-n:F system with cyclek

Anm-consecutive-k-out-of-n:F system is a system ofn linearly arranged components which fails if and only if at leastm non-overlapping sequences ofk components fail, when there arek distinct components with failure probabilitiesq _i fori=1,...,k and where the failure probability of thej-th component (j=rk+i (1 ≤i ≤k) isq _j =q _i , we call this system by anm-consecutive-k-out-of-n:F system with cycle (or period)k. In this paper we give a formula of the failure probability ofm-consecutive-k-out-of-n:F system with cyclek via the failure probability of consecutive-k-out-of-n:F system.     

On the M/G/1 queue with D-policy

This paper deals with the M/G/1 queue with D-policy, i.e., the server is turned off at the end of a busy period and turned on when the cumulative amount of work firstly exceeds some fixed value D. We first concentrate on the computation of the steady-state probabilities. The first moments and relationships among the busy period, the number of customers served and other performance measures are investigated. Some variants of the main model and the special case of the M/M/1 are also studied.     

The smooth Banach submanifold B*(E, F) in B(E, F)

Let E,F be two Banach spaces,B(E,F),B+(E,F),Φ(E,F),SΦ(E,F) and R(E,F) be bounded linear,double splitting,Fredholm,semi-Frdholm and finite rank operators from E into F,respectively. Let Σ be any one of the following sets:{T ∈Φ(E,F):Index T=constant and dim N(T)=constant},{T ∈ SΦ(E,F):either dim N(T)=constant< ∞ or codim R(T)=constant< ∞} and {T ∈ R(E,F):Rank T=constant< ∞}. Then it is known that Σ is a smooth submanifold of B(E,F) with the tangent space TAΣ={B ∈ B(E,F):BN(A)-R(A) } for any A ∈Σ. However,for ...     

Oscillators in resonance p:q:r

A canonical transformation is proposed to handle Hamiltonian systems made of the addition or subtraction of three harmonic oscillators in p:q:r resonance. This transformation is an extension of the classical Lissajous transformation for the 1:1 resonance. Our extended Lissajous variables consist of three pairs of action-angle variables, which makes possible the application of perturbation theories without encountering small divisors. A set of functions, related with the Lissajous variables, are found, and are used to describe the phase flow of reduced space after normalization.     

On the law S ( S ( x , y ), T ( x , y )) = S ( x , y ) of fuzzy logic

Motivated by some functional models arising in fuzzy logic, when classical boolean relations between sets are generalized, we study the functional equation S(S(x, y), T(x, y)) = S(x, y), where S is a continuous t-conorm and T is a continuous t-norm. Some interesting methods for solving this type of equations are introduced.     

The general common Hermitian nonnegative-definite solution to the matrix equations AXA=BB and CXC=DD with applications in statistics

We deduce a necessary and sufficient condition for the matrix equations AXA^*=BB^* and CXC^*=DD^* to have a common Hermitian nonnegative-definite solution and a representation of the general common Hermitian nonnegative-definite solution to these two equations when they have such common solutions. Thereby, we solve a statistical problem which is concerned in testing linear hypotheses about regression coefficients in the multivariate linear model. This paper is a revision of Young et al. (J. Multivariate Anal. 68 (1999) 165) whose mistake was pointed out in (Linear Algebra Appl. 321 (2000) 123).     

Approximations for the delay probability in the M/G/s queue

This paper develops approximations for the delay probability in an M/G/s queue. For M/G/s queues, it has been well known that the delay probability in the M/M/s queue, i.e., the Erlang delay formula, is usually a good approximation for other service-time distributions. By using an excellent approximation for the mean waiting time in the M/G/s queue, we provide more accurate approximations of the delay probability for small values of s. To test the quality of our approximations, we compare them with the exact value and the Erlang delay formula for some particular cases.     

Best Simultaneous Approximation in L(I,E)

Let G be a reflexive subspace of the Banach space E and let L^p(I,E) denote the space of all p-Bochner integrable functions on the interval I=[0,1] with values in E, 1p∞. Given any norm N( , ) on R², N nondecreasing in each coordinate on the set R²₊, we prove that L^p(I,G) is N-simultaneously proximinal in L^p(I,E). Other results are also obtained.     

Rado Numbers fora(x+y)=bz

In the case of existence the smallest numberN=Ra_kis called a Rado number if it is guaranteed that anyk-coloring of the numbers 1, 2, …, Ncontains a monochromatic solution of a given system of linear equations. We will determine Ra_k(a, b) for the equationa(x+y)=bzifb=2 andb=a+1. Also, the case of monochromatic sequences {x_n} generated bya(x_n+x_n+1)=bx_n+2 is discussed.     

Integer Polynomials with Roots mod p for all Primes p

Let f(X) be an integer polynomial which is a product of two irreducible factors. Assume that f(X) has a root mod p for all primes p. If the splitting field of f(X) over the rationals is a cyclic extension of the stem fields, then the Galois group of f(X) over the rationals is soluble and of bounded Fitting length. Moreover, the fixed groups of the stem extensions are in, some sense, unique.     

The (b; c)-inverse in semigroups and rings with involution

We first prove that if a is both left (b; c)-invertible and left (c; b)- invertible, then a is both (b; c)-invertible and (c; b)-invertible in a *-monoid, which generalizes the recent result about the inverse along an element by L. Wang and D. Mosić [Linear Multilinear Algebra, Doi.org/10.1080/03081087. 2019.1679073], under the conditions (ab)* = ab and (ac)* = ac: In addition, we consider that ba is (c; b)-invertible, and at the same time ca is (b; c)-invertible under the same conditions, which extend the related results about Moore- Penrose inverses studied by J. Chen, H. Zou, H. Zhu, and P. Patrício [Mediterr J. Math., 2017, 14: 208] to (b; c)-inverses. As applications, we obtain that under condition (a²)* = a²; a is an EP element if and only if a is one-sided core invertible, if and only if a is group invertible.