Stability analysis of GI/GI/c/K retrial queue with constant retrial rate

We consider a finite buffer capacity GI/GI/c/K-type retrial queueing system with constant retrial rate. The system consists of a primary queue and an orbit queue. The primary queue has \(c\) identical servers and can accommodate up to \(K\) jobs (including \(c\) jobs under service). If a newly arriving job finds the primary queue to be full, it joins the orbit queue. The original primary jobs arrive to the system according to a renewal process. The jobs have i.i.d. service times. The head of line job in the orbit queue retries to enter the primary queue after an exponentially distributed time independent of the length of the orbit queue. Telephone exchange systems, medium access protocols, optical networks with near-zero buffering and TCP short-file transfers are some telecommunication applications of the proposed queueing system. The model is also applicable in logistics. We establish sufficient stability conditions for this system. In addition to the known cases, the proposed model covers a number of new particular cases with the closed-form stability conditions. The stability conditions that we obtained have clear probabilistic interpretation.     

Markov-modulated infinite-server queues with general service times

This paper analyzes several aspects of the Markov-modulated infinite-server queue. In the system considered (i) particles arrive according to a Poisson process with rate $\lambda _i$ when an external Markov process (“background process”) is in state $i$ , (ii) service times are drawn from a distribution with distribution function $F_i(\cdot )$ when the state of the background process (as seen at arrival) is $i$ , (iii) there are infinitely many servers. We start by setting up explicit formulas for the mean and variance of the number of particles in the system at time $t\ge 0$ , given the system started empty. The special case of exponential service times is studied in detail, resulting in a recursive scheme to compute the moments of the number of particles at an exponentially distributed time, as well as their steady-state counterparts. Then we consider an asymptotic regime in which the arrival rates are sped up by a factor $N$ , and the transition times by a factor $N^{1+\varepsilon }$ (for some $\varepsilon >0$ ). Under this scaling it turns out that the number of customers at time $t\ge 0$ obeys a central limit theorem; the convergence of the finite-dimensional distributions is proven.     

Finite groups with \mathbb{P }-subnormal subgroups

A subgroup $H$ of a group $G$ is called $\mathbb{P }$ -subnormal in $G$ whenever either $H=G$ or there is a chain of subgroups $H=H_0\subset H_1\subset \cdots \subset H_n=G$ such that $|H_i:H_{i-1}|$  is a prime for all $i$ . In this paper we study groups with $\mathbb{P }$ -subnormal 2-maximal subgroups, and groups with $\mathbb{P }$ -subnormal primary cyclic subgroups.     

Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs

We consider the online scheduling of equal-length jobs with incompatible families on \(m\) identical batch machines. Each job has a release time, a deadline and a weight. Each batch machine can process up to \(b\) jobs (which come from the same family) simultaneously as a batch, where \(b\) is called the capacity of the machines. Our goal is to determine a preemption-restart schedule which maximizes the weighted number of early jobs. For this problem, Li et al. (Inf Process Lett 112:503–508, 2012) provided an online algorithm of competitive ratio \(3+2\sqrt{2}\) for both \(b=\infty \) and \(b<\infty \) . In this paper, we study two special cases of this problem. For the case that \(m=2\) , we first present a lower bound 2, and then provide an online algorithm with a competitive ratio of 3 for both \(b=\infty \) and \(b<\infty \) . For the case in which \(m=3\) , \(b=\infty \) and all jobs come from a common family, we present an online algorithm with a competitive ratio of \((8+2\sqrt{15})/3\approx 5.249\) .     

Approximations of periodic functions to \mathbb R ^n by curvatures of closed curves

We show that for any $n$ real periodic functions $f_1,\ldots , f_n$ with the same period, such that $f_i>0$ for $i<n$ , and a real number $\varepsilon >0$ , there is a closed curve in $\mathbb R ^{n+1}$ with curvatures $\kappa _1, \ldots , \kappa _n$ such that $\left| \kappa _{i(t)}-f_{i(t)}\right|<\varepsilon $ for all $i$ and $t$ . This does not hold for parametric families of closed curves in $\mathbb R ^{n+1}$ .     

Characterization of some simple groups by the multiplicity pattern

Let $G$ be a finite group and let ${\mathrm{Irr}}(G)$ denote the set of all complex irreducible characters of $G.$ Let ${\mathrm{cd}}(G)$ be the set of all character degrees of $G.$ For each positive integer $d,$ the multiplicity of $d$ in $G$ is defined to be the number of irreducible characters of $G$ having the same degree $d.$ The multiplicity pattern ${\mathrm{mp}}(G)$ is the vector whose first coordinate is $|G:G^{\prime }|$ and for $i\ge 1,$ the $(i+1)$ th-coordinate of ${\mathrm{mp}}(G)$ is the multiplicity of the $i$ th-smallest nontrivial character degree of $G.$ In this paper, we show that every nonabelian simple group with at most $7$ distinct character degrees is uniquely determined by the multiplicity pattern.     

Solving convex optimization with side constraints in a multi-class queue by adaptive c\mu rule

We study convex optimization problems with side constraints in a multi-class \(M/G/1\) queue with controllable service rates. In the simplest problem of optimizing linear costs with fixed service rate, the \(c\mu \) rule is known to be optimal. A natural question to ask is whether such simple policies exist for more complex control objectives. In this paper, combining the achievable region approach in queueing systems and the Lyapunov drift theory suitable to optimize renewal systems with time-average constraints, we show that convex optimization problems can be solved by variants of adaptive \(c\mu \) rules. These policies greedily re-prioritize job classes at the end of busy periods in response to past observed delays in each job class. Our method transforms the original problems into a new set of queue stability problems, and the adaptive \(c\mu \) rules are queue stable policies. An attractive feature of the adaptive \(c\mu \) rules is that they use limited statistics of the queue, where no statistics are required for the problem of satisfying average queueing delay in each job class.     

The topology of parabolic character varieties of free groups

Let $G$ be a complex affine algebraic reductive group, and let $K\,\subset \, G$ be a maximal compact subgroup. Fix h $\,:=\,(h_{1}\,,\ldots \,,h_{m})\,\in \, K^{m}$ . For $n\, \ge \, 0$ , let $\mathsf X _{\mathbf{{h}},n}^{G}$ (respectively, $\mathsf X _{\mathbf{{h}},n}^{K}$ ) be the space of equivalence classes of representations of the free group on $m+n$ generators in $G$ (respectively, $K$ ) such that for each $1\le i\le m$ , the image of the $i$ -th free generator is conjugate to $h_{i}$ . These spaces are parabolic analogues of character varieties of free groups. We prove that $\mathsf X _{\mathbf{{h}},n}^{K}$ is a strong deformation retraction of $\mathsf X _{\mathbf{{h}},n}^{G}$ . In particular, $\mathsf X _{\mathbf{{h}},n}^{G}$ and $\mathsf X _{\mathbf{{h}},n}^{K}$ are homotopy equivalent. We also describe explicit examples relating $\mathsf X _{\mathbf{{h}},n}^{G}$ to relative character varieties.     

Asymptotics for Some Combinatorial Characteristics of the Convex Hull of a Poisson Point Process in the Clifford Torus

Let $\mathcal P _\lambda $ be a homogeneous Poisson point process of rate $\lambda $ in the Clifford torus $T^2\subset \mathbb E ^4$ . Let $(f_0, f_1, f_2, f_3)$ be the $f$ -vector of conv $\,\mathcal P _\lambda $ and let $\bar{v}$ be the mean valence of a vertex of the convex hull. Asymptotic expressions for $\mathsf E \, f_1$ , $\mathsf E \, f_2$ , $\mathsf E \, f_3$ and $\mathsf E \, \bar{v}$ as $\lambda \rightarrow \infty $ are proved in this paper.     

Variance asymptotics for random polytopes in smooth convex bodies

Let $K \subset \mathbb R ^d$ be a smooth convex set and let $\mathcal{P }_{\lambda }$ be a Poisson point process on $\mathbb R ^d$ of intensity ${\lambda }$ . The convex hull of $\mathcal{P }_{\lambda }\cap K$ is a random convex polytope $K_{\lambda }$ . As ${\lambda }\rightarrow \infty $ , we show that the variance of the number of $k$ -dimensional faces of $K_{\lambda }$ , when properly scaled, converges to a scalar multiple of the affine surface area of $K$ . Similar asymptotics hold for the variance of the number of $k$ -dimensional faces for the convex hull of a binomial process in $K$ .     

Efficient simulation of complete and censored samples from common bivariate exponential distributions

Let $(X_{i:n},Y_{[i:n]})$ be the vector of the $i$ th $X$ -order statistic and its concomitant observed in a random sample of size $n$ where the marginal distribution of $X$ is absolutely continuous. We describe some general algorithms for simulation of complete and Type II censored samples $\{(X_{i:n}, Y_{[i:n]}), 1 \le i \le r \le n\}$ from such bivariate distributions. We study in detail several algorithms for simulating complete and censored samples from Downton, Marshall–Olkin, Gumbel (Type I) and Farlie-Gumbel-Morgenstern bivariate exponential distributions. We show that the conditioning method in conjunction with an efficient simulation of exponential order statistics that exploits the independence of spacings provides the best method with substantial savings over the basic method. Efficient simulation is essential for investigating the finite-sample distributional  properties of functions of order statistics and their concomitants.     

Join the shortest queue among k parallel queues: tail asymptotics of its stationary distribution

We are concerned with an $M/M$ -type join the shortest queue ( $M/M$ -JSQ for short) with $k$ parallel queues for an arbitrary positive integer $k$ , where the servers may be heterogeneous. We are interested in the tail asymptotic of the stationary distribution of this queueing model, provided the system is stable. We prove that this asymptotic for the minimum queue length is exactly geometric, and its decay rate is the $k$ th power of the traffic intensity of the corresponding $k$ server queues with a single waiting line. For this, we use two formulations, a quasi-birth-and-death (QBD for short) process and a reflecting random walk on the boundary of the $k+1$ -dimensional orthant. The QBD process is typically used in the literature for studying the JSQ with two parallel queues, but the random walk also plays a key roll in our arguments, which enables us to use the existing results on tail asymptotics for the QBD process.     

On some primary subgroups and the structure of finite groups

Suppose that $G$ is a finite group and $H$ is a subgroup of $G$ . $H$ is said to be an $s$ -quasinormally embedded in $G$ if for each prime $p$ dividing the order of $H$ , a Sylow $p$ -subgroup of $H$ is also a Sylow $p$ -subgroup of some $S$ -quasinormal subgroup of $G$ ; $H$ is said to be $c$ -normal in $G$ if $G$ has a normal subgroup $T$ such that $G=HT$ and $H\cap T\le H_{G}$ , where $H_{G}$ is the normal core of $H$ in $G$ . We fix in every non-cyclic Sylow subgroup $P$ of $G$ some subgroup $D$ satisfying $1<|D|<|P|$ and study the structure of $G$ under the assumption that every subgroup $H$ of $P$ with $|H|=|D|$ is either $s$ -quasinormally embedded or $c$ -normal in $G$ . Some recent results are generalized and unified.     

On perturbation of a functional with the mountain pass geometry

Consider a functional $I_0$ with the mountain-pass geometry and a critical point $u_0$ of mountain-pass type. In this paper, we discuss about the existence of critical points $u_\varepsilon $ around $u_0$ for functionals $I_\varepsilon $ perturbed from $I_0$ in a suitable sense. As applications, we show the existence of a solution to the nonlinear Schrödinger–Poisson equations and the nonlinear Klein–Gordon–Maxwell equations with quite general class of nonlinearity.     

The asymptotic distribution of a single eigenvalue gap of a Wigner matrix

We show that the distribution of (a suitable rescaling of) a single eigenvalue gap $\lambda _{i+1}(M_n)-\lambda _i(M_n)$ of a random Wigner matrix ensemble in the bulk is asymptotically given by the Gaudin–Mehta distribution, if the Wigner ensemble obeys a finite moment condition and matches moments with the GUE ensemble to fourth order. This is new even in the GUE case, as prior results establishing the Gaudin–Mehta law required either an averaging in the eigenvalue index parameter $i$ , or fixing the energy level $u$ instead of the eigenvalue index. The extension from the GUE case to the Wigner case is a routine application of the Four Moment Theorem. The main difficulty is to establish the approximate independence of the eigenvalue counting function $N_{(-\infty ,x)}(\tilde{M}_n)$ (where $\tilde{M}_n$ is a suitably rescaled version of $M_n$ ) with the event that there is no spectrum in an interval $[x,x+s]$ , in the case of a GUE matrix. This will be done through some general considerations regarding determinantal processes given by a projection kernel.     

Generalized derivations with annihilating and centralizing Engel conditions on Lie ideals

Let $R$ be a non-commutative prime ring, with center $Z(R)$ , extended centroid $C$ and let $F$ be a non-zero generalized derivation of $R$ . Denote by $L$ a non-central Lie ideal of $R$ . If there exists $0\ne a\in R$ such that $a[F(x),x]_k\in Z(R)$ for all $x\in L$ , where $k$ is a fixed integer, then one of the followings holds: (1) either there exists $\lambda \in C$ such that $F(x)=\lambda x$ for all $x\in R$ , (2) or $R$ satisfies $s_4$ , the standard identity in $4$ variables, and $char(R)=2$ ; (3) or $R$ satisfies $s_4$ and there exist $q\in U, \gamma \in C$ such that $F(x)=qx+xq+\gamma x$ .     

Scattered linear sets generated by collineations between pencils of lines

Let \(A\) and \(B\) be two points of \(\mathrm{{PG}}(2,q^n)\) , and let \(\Phi \) be a collineation between the pencils of lines with vertices \(A\) and \(B\) . In this paper, we prove that the set of points of intersection of corresponding lines under \(\Phi \) is either the union of a scattered \(\mathrm{{GF}}(q)\) -linear set of rank \(n+1\) with the line \(AB\) or the union of \(q-1\) scattered \(\mathrm{{GF}}(q)\) -linear sets of rank \(n\) with \(A\) and \(B\) . We also determine the intersection configurations of two scattered \(\mathrm{{GF}}(q)\) -linear sets of rank \(n+1\) of \(\mathrm{{PG}}(2,q^n)\) both meeting the line \(AB\) in a \(\mathrm{{GF}}(q)\) -linear set of pseudoregulus type with transversal points \(A\) and \(B\) .     

Integer-valued polynomials over matrices and divided differences

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided differences. A necessary and sufficient condition on $f\in K[X]$ to be integer-valued over $M_n(D)$ is that, for each $k$ less than $n$ , the $k$ th divided difference of $f$ is integral-valued on every subset of the roots of any monic polynomial over $D$ of degree $n$ . If in addition $D$ has zero Jacobson radical then it is sufficient to check the above conditions on subsets of the roots of monic irreducible polynomials of degree $n$ , that is, conjugate integral elements of degree $n$ over $D$ .     

Some Integral Representations and Singular Integral over Plane in Clifford Analysis

In this paper, Cauchy type integral and singular integral over hyper-complex plane \({\prod}\) are considered. By using a special Möbius transform, an equivalent relation between \({\widehat{H}^\mu}\) class functions over \({\prod}\) and \({H^\mu}\) class functions over the unit sphere is shown. For \({\widehat{H}^\mu}\) class functions over \({\prod}\) , we prove the existence of Cauchy type integral and singular integral over \({\prod}\) . Cauchy integral formulas as well as Poisson integral formulas for monogenic functions in upper-half and lower-half space are given respectively. By using Möbius transform again, the relation between the Cauchy type integrals and the singular integrals over \({\prod}\) and unit sphere is built.     

On an extension of the Frobenius^{\prime } theorem about p-nilpotency of a finite group

Suppose that \(G\) is a finite group and \(H\) is a subgroup of \(G\) . \(H\) is said to be \(s\) -quasinormally embedded in \(G\) if for each prime \(p\) dividing the order of \(H\) , a Sylow \(p\) -subgroup of \(H\) is also a Sylow \(p\) -subgroup of some \(s\) -quasinormal subgroup of \(G\) . We fix in every non-cyclic Sylow subgroup \(P\) of \(G\) some subgroup \(D\) satisfying \(1<|D|<|P|\) and study the \(p\) -nilpotency of \(G\) under the assumption that every subgroup \(H\) of \(P\) with \(|H|=|D|\) is \(s\) -quasinormally embedded in \(G\) . Some recent results and the Frobenius \(^{\prime }\) theorem are generalized.