Further Results for the Queueing System <Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">x</Emphasis></Superscript>/<Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">c</Emphasis>

For the multi-channel bulk-arrival queue, M ^x /M/c, Abol'nikov and Kabak independently obtained steady state results. In this paper the results of these authors are extended, corrected and simplified. A number of measures of efficiency are calculated for three cases where the arrival group size has: (i) a constant value, (ii) a geometric distribution, or (iii) a positive Poisson distribution. The paper also shows how to calculate fractiles for both the queue length and the waiting time distribution. Examples of extensive numerical results for certain measures of efficiency are presented in tabular and chart form.     

<Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">c</Emphasis> Queue with catastrophes and state-dependent control at idle time

We consider an M ^X /M/c queue with catastrophes and state-dependent control at idle time. Properties of the queues which terminate when the servers become idle are first studied. Recurrence, equilibrium distribution, and equilibrium queue-size structure are studied for the case of resurrection and no catastrophes. All of these properties and the first effective catastrophe occurrence time are then investigated for the case of resurrection and catastrophes. In particular, we obtain the Laplace transform of the transition probability for the absorbing M ^X /M/c queue.     

Rate of convergence to stationarity of the system <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">N</Emphasis>/<Emphasis Type="Italic">N</Emphasis>+<Emphasis Type="Italic">R</Emphasis>

We consider the M/M/N/N+R service system, characterized by N servers, R waiting positions, Poisson arrivals and exponential service times. We discuss representations and bounds for the rate of convergence to stationarity of the number of customers in the system, and study its behaviour as a function of R, N and the arrival rate λ, allowing λ to be a function of N.     

On <Emphasis Type="Italic">S</Emphasis>-quasinormal and <Emphasis Type="Italic">c</Emphasis>-normal subgroups of a finite group

Let be a saturated formation containing the class of supersolvable groups and let G be a finite group. The following theorems are presented: (1) G ∈ if and only if there is a normal subgroup H such that G/H ∈ and every maximal subgroup of all Sylow subgroups of H is either c-normal or S-quasinormally embedded in G. (2) G ∈ if and only if there is a normal subgroup H such that G/H ∈ and every maximal subgroup of all Sylow subgroups of F*(H), the generalized Fitting subgroup of H, is either c-normal or S-quasinormally embedded in G. (3) G ∈ if and only if there is a normal subgroup H such that G/H ∈ and every cyclic subgroup of F*(H) of prime order or order 4 is either c-normal or S-quasinormally embedded in G. Supported by the Natural Science Foundation of China and the Natural Science Foundation of Guangxi Autonomous Region (No. 0249001). Corresponding author. Supported in part by the Natural Science Foundation of China (10571181), NSF of Guangdong Province (06023728) and ARF(GDEI).     

On <Emphasis Type="Italic">g</Emphasis><Subscript><Emphasis Type="Italic">c</Emphasis></Subscript>-colorings of nearly bipartite graphs

Let G be a simple graph, let d(v) denote the degree of a vertex v and let g be a nonnegative integer function on V (G) with 0 ≤ g(v) ≤ d(v) for each vertex v ∈ V (G). A g _c -coloring of G is an edge coloring such that for each vertex v ∈ V (G) and each color c, there are at least g(v) edges colored c incident with v. The g _c -chromatic index of G, denoted by χ′g _c (G), is the maximum number of colors such that a gc-coloring of G exists. Any simple graph G has the g _c -chromatic index equal to δ _g (G) or δ _g (G) ? 1, where \({\delta _g}\left( G \right) = \mathop {\min }\limits_{v \in V\left( G \right)} \left\lfloor {d\left( v \right)/g\left( v \right)} \right\rfloor \). A graph G is nearly bipartite, if G is not bipartite, but there is a vertex u ∈ V (G) such that G ? u is a bipartite graph. We give some new sufficient conditions for a nearly bipartite graph G to have χ′g _c (G) = δ _g (G). Our results generalize some previous results due to Wang et al. in 2006 and Li and Liu in 2011.     

<Emphasis Type="Italic">T</Emphasis>-optimal designs for discrimination between rational and polynomial models

This paper considers the problem of the analytical construction of experimental designs optimal with respect to the popular T-optimality criterion proposed by A.C. Atkinson and V.V. Fedorov in 1975 for discrimination between the simplest rational and polynomial regression models. It is shown how the classical results from approximation theory can be used to derive explicit formulas describing the behavior of support points and weights of T-optimal designs for different fixed parameter values. An applied discrimination problem for rational and polynomial regression models is considered as an example. For this models the numerical construction of experimental designs optimal with respect to robust analogues of T-criterion is also briefly discussed.     

On the <Emphasis Type="Italic">KO</Emphasis> Characteristic Cycle of a Spin<Superscript><Emphasis Type="Italic">c</Emphasis></Superscript> Manifold

We compute the KO-characteristic numbers of a characteristic submanifold of a Spin^c manifold in terms of its K-characteristic numbers. The proof is based on the geometry of the Thom class in K-theory and is simpler than the existing proofs of several previously known special cases.     

On the directions problem in <Emphasis Type="Italic">AG</Emphasis>(<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">q</Emphasis>)

We prove that if q = p ^h , p a prime, do not exist sets U í AG(n,q){U {\subseteq} AG(n,q)}, with |U| = q ^k and 1 < k < n, determining N directions where

<Emphasis Type="Italic">c</Emphasis>*-Supplemented subgroups and <Emphasis Type="Italic">p</Emphasis>-nilpotency of finite groups

A subgroup H of a finite group G is said to be c*-supplemented in G if there exists a subgroup K such that G = HK and H ⋂ K is permutable in G. It is proved that a finite group G that is S ₄-free is p-nilpotent if N _G (P) is p-nilpotent and, for all x ∈ G\N _G (P), every minimal subgroup of is c*-supplemented in P and (if p = 2) one of the following conditions is satisfied: (a) every cyclic subgroup of of order 4 is c*-supplemented in P, (b) , (c) P is quaternion-free, where P a Sylow p-subgroup of G and is the p-nilpotent residual of G. This extends and improves some known results. Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 59, No. 8, pp. 1011–1019, August, 2007.     

Eigenvalues of the Manifold Sp（n）/U（n）

In this paper, we give the eigenvalues of the manifold Sp(n)/U(n). We prove that an eigenvalue λ _s (f ₂, f ₂, …, f _n ) of the Lie group Sp(n), corresponding to the representation with label (f ₁, f ₂, ..., f _n ), is an eigenvalue of the manifold Sp(n)/U(n), if and only if f ₁, f ₂, …, f _n are all even.     

Refining the Diffusion Approximation for the <Emphasis Type="Italic">GI</Emphasis><Superscript><Emphasis Type="Italic">x</Emphasis></Superscript><Emphasis Type="Italic">/G/c</Emphasis> Queue

This paper deals with the GI ^x /G/c queueing system in a steady state. We refine a diffusion approximation method incorporating the constraint of traffic conservation for general queueing systems. An approximate expression for the distribution of the number of customers is obtained. Numerical results are presented to show that the refined model provides improved performance.     

On the <Emphasis Type="Italic">k</Emphasis>-gamma <Emphasis Type="Italic">q</Emphasis>-distribution

We provide combinatorial as well as probabilistic interpretations for the q-analogue of the Pochhammer k-symbol introduced by Díaz and Teruel. We introduce q-analogues of the Mellin transform in order to study the q-analogue of the k-gamma distribution.     

<Emphasis Type="Italic">L</Emphasis>-optimal designs in the trigonometric regression model on the full circle

Singular L-optimal designs minimizing the sum of the variances of the estimates for different pairs of coefficients in the trigonometric regression models on the full circle are found.     

The <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">G</Emphasis>/1+<Emphasis Type="Italic">G</Emphasis> queue revisited

We consider an M/G/1 queue with the following form of customer impatience: an arriving customer balks or reneges when its virtual waiting time, i.e., the amount of work seen upon arrival, is larger than a certain random patience time. We consider the number of customers in the system, the maximum workload during a busy period, and the length of a busy period. We also briefly treat the analogous model in which any customer enters the system and leaves at the end of his patience time or at the end of his virtual sojourn time, whichever occurs first.     

Cyclotomic Hecke Algebras of <Emphasis Type="Italic">G</Emphasis>(<Emphasis Type="Italic">r</Emphasis>, <Emphasis Type="Italic">p</Emphasis>, <Emphasis Type="Italic">n</Emphasis>)

In this note, we find a monomial basis of the cyclotomic Hecke algebra \({\mathcal{H}_{r,p,n}}\) of G(r,p,n) and show that the Ariki-Koike algebra \({\mathcal{H}_{r,n}}\) is a free module over \({\mathcal{H}_{r,p,n}}\), using the Gröbner-Shirshov basis theory. For each irreducible representation of \({\mathcal{H}_{r,p,n}}\), we give a polynomial basis consisting of linear combinations of the monomials corresponding to cozy tableaux of a given shape.     

(<Emphasis Type="Italic">s</Emphasis>, <Emphasis Type="Italic">t</Emphasis>, <Emphasis Type="Italic">d</Emphasis>)-bi-Koszul algebras

The paper focuses on the 1-generated positively graded algebras with non-pure resolutions and mainly discusses a new kind of algebras called(s,t,d)-bi-Koszul algebras as the generalization of bi-Koszul algebras. An(s,t,d)-bi-Koszul algebra can be obtained from two periodic algebras with pure resolutions. The generation of the Koszul dual of an(s,t,d)-bi-Koszul algebra is discussed. Based on it,the notion of strongly(s,t,d)-bi-Koszul algebras is raised and their homological properties are further discussed.     

On <Emphasis Type="Italic">c</Emphasis>-normal maximal and minimal subgroups of Sylow <Emphasis Type="Italic">p</Emphasis>-subgroups of finite groups

A subgroup H of a finite group G is called c-normal in G if there exists a normal subgroup N of G such that G = HN and $H \cap N \leq H_{G} = {\rm core}_{G}(H)$. In this paper, we investigate the class of groups of which every maximal subgroup of its Sylow p-subgroup is c-normal and the class of groups of which some minimal subgroups of its Sylow p-subgroup is c-normal for some prime number p. Some interesting results are obtained and consequently, many known results related to p-nilpotent groups and p-supersolvable groups are generalized.     

<Emphasis Type="Italic">c</Emphasis>-Semipermutable subgroups of finite groups

A subgroup is called c-semipermutable in G if A has a minimal supplement T in G such that for every subgroup T ₁ of T there is an element x ∈ T satisfying AT ₁ ^x = T ₁ ^x A. We obtain a few results about the c-semipermutable subgroups and use them to determine the structures of some finite groups.     

On a new property of <Emphasis Type="Italic">n</Emphasis>-poised and <Emphasis Type="Italic">G</Emphasis><Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> sets

In this paper we consider n-poised planar node sets, as well as more special ones, called G C _n sets. For the latter sets each n-fundamental polynomial is a product of n linear factors as it always holds in the univariate case. A line ? is called k-node line for a node set \(\mathcal X\) if it passes through exactly k nodes. An (n + 1)-node line is called maximal line. In 1982 M. Gasca and J. I. Maeztu conjectured that every G C _n set possesses necessarily a maximal line. Till now the conjecture is confirmed to be true for n ≤ 5. It is well-known that any maximal line M of \(\mathcal X\) is used by each node in \(\mathcal X\setminus M, \)meaning that it is a factor of the fundamental polynomial. In this paper we prove, in particular, that if the Gasca-Maeztu conjecture is true then any n-node line of G C _n set \(\mathcal {X}\) is used either by exactly \(\binom {n}{2}\) nodes or by exactly \(\binom {n-1}{2}\) nodes. We prove also similar statements concerning n-node or (n ? 1)-node lines in more general n-poised sets. This is a new phenomenon in n-poised and G C _n sets. At the end we present a conjecture concerning any k-node line.     

On the Theory of <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(<Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">q</Emphasis></Subscript>)-Banach Lattices

Given 1≤ p,q < ∞, let BL_pL_q be the class of all Banach lattices X such that X is isometrically lattice isomorphic to a band in some L_p(L_q)-Banach lattice. We show that the range of a positive contractive projection on any BL_pL_q-Banach lattice is itself in BL_pL_q. It is a consequence of this theorem and previous results that BL_pL_q is first-order axiomatizable in the language of Banach lattices. By studying the pavings of arbitrary BL_pL_q-Banach lattices by finite dimensional sublattices that are themselves in this class, we give an explicit set of axioms for BL_pL_q. We also consider the class of all sublattices of L_p(L_q)-Banach lattices; for this class (when p/q is not an integer) we give a set of axioms that are similar to Krivine’s well-known axioms for the subspaces of L_p-Banach spaces (when p/2 is not an integer). We also extend this result to the limiting case q = ∞.