The state-dependent <Emphasis Type="Italic">M</Emphasis> / <Emphasis Type="Italic">G</Emphasis> / 1 queue with orbit

We consider a state-dependent single-server queue with orbit. This is a versatile model for the study of service systems, where the server needs a non-negligible time to retrieve waiting customers every time he completes a service. This situation arises typically when the customers are not physically present at a system, but they have a remote access to it, as in a call center station, a communication node, etc. We introduce a probabilistic approach for the performance evaluation of this queueing system, that we refer to as the queueing and Markov chain decomposition approach. Moreover, we discuss the applicability of this approach for the performance evaluation of other non-Markovian service systems with state dependencies.     

Customers’ abandonment strategy in an <Emphasis Type="Italic">M</Emphasis> / <Emphasis Type="Italic">G</Emphasis> / 1 queue

We consider an M / G / 1 queue in which the customers, while waiting in line, may renege from it. We show the Nash equilibrium profile among customers and show that it is defined by two sequences of thresholds. For each customer, the decision is based on the observed past (which determines from what sequence the threshold is taken) and the observed queue length (which determines the appropriate element in the chosen sequence). We construct a set of equations that has the Nash equilibrium as its solution and discuss the relationships between the properties of the service time distribution and the properties of the Nash equilibrium, such as uniqueness and finiteness.     

Perturbation analysis of an <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">M</Emphasis>/1 queue in a diffusion random environment

We study in this paper an M/M/1 queue whose server rate depends upon the state of an independent Ornstein–Uhlenbeck diffusion process (X(t)) so that its value at time t is μ φ(X(t)), where φ(x) is some bounded function and μ>0. We first establish the differential system for the conditional probability density functions of the couple (L(t),X(t)) in the stationary regime, where L(t) is the number of customers in the system at time t. By assuming that φ(x) is defined by φ(x)=1−ε((x ∧ a/ε)∨(−b/ε)) for some positive real numbers a, b and ε, we show that the above differential system has a unique solution under some condition on a and b. We then show that this solution is close, in some appropriate sense, to the solution to the differential system obtained when φ is replaced with Φ(x)=1−ε x for sufficiently small ε. We finally perform a perturbation analysis of this latter solution for small ε. This allows us to check at the first order the validity of the so-called reduced service rate approximation, stating that everything happens as if the server rate were constant and equal to .      

Quantitative properties of ground-states to an <Emphasis Type="Italic">M</Emphasis>-coupled system with critical exponent in ℝ<Superscript><Emphasis Type="Italic">N</Emphasis></Superscript>

In this paper, we consider the ground-states of the following M-coupled system:

$$\left\{ {\begin{array}{*{20}{c}}{ - \Delta {u_i} = \sum\limits_{j = 1}^M {{k_{ij}}\frac{{2{q_{ij}}}}{{2*}}{{\left| {{u_j}} \right|}^{{p_{ij}}}}{{\left| {{u_i}} \right|}^{{q_{ij}} - {2_{{u_i}}}}},x \in {\mathbb{R}^N},} } \\{{u_i} \in {D^{1,2}}\left( {{\mathbb{R}^N}} \right),i = 1,2, \ldots ,M,}\end{array}} \right.$$

where \(p_{ij} + q_{ij} = 2*: = \frac{{2N}}{{N - 2}}(N \geqslant 3)\). We prove the existence of ground-states to the M-coupled system. At the same time, we not only give out the characterization of the ground-states, but also study the number of the ground-states, containing the positive ground-states and the semi-trivial ground-states, which may be the first result studying the number of not only positive ground-states but also semi-trivial ground-states.

     

On blocks with <Emphasis Type="Italic">K</Emphasis>(<Emphasis Type="Italic">B</Emphasis>)−<Emphasis Type="Italic">L</Emphasis>(<Emphasis Type="Italic">B</Emphasis>)=1

We use the method of local representation and original method of Brauer to study the block with K(B)−L(B)=1, and get some properties on the defect group and the structure of this kind of blocks. Then, we show that K(B) conjecture holds for this kind of blocks.     

On the inapproximability of <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">G</Emphasis>/<Emphasis Type="Italic">K</Emphasis>: why two moments of job size distribution are not enough

The M/G/K queueing system is one of the oldest models for multiserver systems and has been the topic of performance papers for almost half a century. However, even now, only coarse approximations exist for its mean waiting time. All the closed-form (nonnumerical) approximations in the literature are based on (at most) the first two moments of the job size distribution. In this paper we prove that no approximation based on only the first two moments can be accurate for all job size distributions, and we provide a lower bound on the inapproximability ratio, which we refer to as “the gap.” This is the first such result in the literature to address “the gap.” The proof technique behind this result is novel as well and combines mean value analysis, sample path techniques, scheduling, regenerative arguments, and asymptotic estimates. Finally, our work provides insight into the effect of higher moments of the job size distribution on the mean waiting time.     

On common values of <Emphasis Type="Italic">φ</Emphasis>(<Emphasis Type="Italic">n</Emphasis>) and <Emphasis Type="Italic">σ</Emphasis>(<Emphasis Type="Italic">m</Emphasis>). I

We show, conditional on a uniform version of the prime k-tuples conjecture, that there are x/(log x)^1+o(1) numbers not exceeding x common to the ranges of φ and σ. Here φ is Euler’s totient function and σ is the sum-of-divisors function.     

Double Arrays,Triple Arrays and Balanced Grids with <Emphasis Type="Italic">v</Emphasis>=<Emphasis Type="Italic">r</Emphasis>+<Emphasis Type="Italic">c</Emphasis> −1

In Theorem 6.1 of McSorley et al. [3] it was shown that, when v=r+c−1, every triple array TA(v,k,λ_rr,λ_cc,k:r× c) is a balanced grid BG(v,k,k:r × c). Here we prove the converse of this Theorem. Our final result is: Let v=r+c−1. Then every triple array is a TA(v,k,c−k,r−k,k:r× c) and every balanced grid is a BG(v,k,k:r× c), and they are equivalent.Communicated by: J.D. Key     

Difference sets with <Emphasis Type="Italic">n</Emphasis> = 5<Emphasis Type="Italic"> p</Emphasis><Superscript><Emphasis Type="Italic">r</Emphasis></Superscript>

Let D be a (v, k, λ)-difference set in an abelian group G, and (v, 31) = 1. If n = 5p ^r with p a prime not dividing v and r a positive integer, then p is a multiplier of D. In the case 31|v, we get restrictions on the parameters of such difference sets D for which p may not be a multiplier.      

On Analytic Campanato and <Emphasis Type="Italic">F</Emphasis>(<Emphasis Type="Italic">p</Emphasis>, <Emphasis Type="Italic">q</Emphasis>, <Emphasis Type="Italic">s</Emphasis>) Spaces

We investigate the relation between analytic Campanato spaces \(\mathcal {AL}_{p,s}\) and the spaces F(p, q, s), characterize the bounded and compact Riemann–Stieltjes operators from \(\mathcal {AL}_{p,s}\) to \(F(p,p-s-1,s)\). We also describe the corona theorem and the interpolating sequences for the class \(F(p,p-2,s)\), which is the Möbius invariant subspace of the analytic Besov type spaces \(B_p(s)\).     

On the equation Δ<Emphasis Type="Italic">u</Emphasis> + <Emphasis Type="Italic">q</Emphasis>(<Emphasis Type="Italic">x</Emphasis>)<Emphasis Type="Italic">u</Emphasis> = 0

Sufficient conditions for the blow-up of nontrivial generalized solutions of the interior Dirichlet problem with homogeneous boundary condition for the homogeneous elliptic-type equation Δu + q(x)u = 0, where either q(x) ≠ const or q(x) = const= λ > 0, are obtained. A priori upper bounds (Theorem 4 and Remark 6) for the exact constants in the well-known Sobolev and Steklov inequalities are established.     

Systematic Construction of <Emphasis Type="Italic">q</Emphasis>-Analogs of <Emphasis Type="Italic">t</Emphasis>−(<Emphasis Type="Italic">v</Emphasis>,<Emphasis Type="Italic">k</Emphasis>,λ)-Designs

In the present paper we consider a q-analog of t–(v,k,)-designs. It is canonic since it arises by replacing sets by vector spaces over GF(q), and their orders by dimensions. These generalizations were introduced by Thomas [Geom.Dedicata vol. 63, pp. 247–253 (1996)] they are called t –(v,k,;q)- designs. A few of such q-analogs are known today, they were constructed using sophisticated geometric arguments and case-by-case methods. It is our aim now to present a general method that allows systematically to construct such designs, and to give complete catalogs (for small parameters, of course) using an implemented software package. &nbsp; In order to attack the (highly complex) construction, we prepare them for an enormous data reduction by embedding their definition into the theory of group actions on posets, so that we can derive and use a generalization of the Kramer-Mesner matrix for their definition, together with an improved version of the LLL-algorithm. By doing so we generalize the methods developed in a research project on t –(v,k,)-designs on sets, obtaining this way new results on the existence of t–(v,k,;q)-designs on spaces for further quintuples (t,v,k,;q) of parameters. We present several 2–(6,3,;2)-designs, 2–(7,3,;2)-designs and, as far as we know, the very first 3-designs over GF(q).classification 05B05     

On the regularity of scalar <Emphasis Type="Italic">p</Emphasis>-Harmonic functions in <Emphasis Type="Italic">n</Emphasis> dimensions with 2 ≤ <Emphasis Type="Italic">p</Emphasis> < <Emphasis Type="Italic">n</Emphasis>

Using Tilli’s technique [Cal Var 25(3):395–401, 2006], we shall give a new proof of the regularity of the local minima of the functional

$J\left( u\right) =\int\limits_{\Omega } \left\vert \partial u\right\vert^{p}\,dx$

with Ω a domain of class C ^{0, 1} in \({\mathbb{R}^{n}}\) and 2 ≤ p < n.

     

On the divergence of trigonometric Fourier series in classes <Emphasis Type="Italic">ϕ</Emphasis>(<Emphasis Type="Italic">L</Emphasis>) close to <Emphasis Type="Italic">L</Emphasis>

We show the unimprovability of a theorem on sufficient convergence conditions for the trigonometric Fourier series of a function in classes ?(L) in the case when the class ?(L) is “close” to L.     

Derivatives for smooth representations of <Emphasis Type="Italic">GL</Emphasis>(<Emphasis Type="Italic">n</Emphasis>, ℝ) and <Emphasis Type="Italic">GL</Emphasis>(<Emphasis Type="Italic">n</Emphasis>, ℂ)

The notion of derivatives for smooth representations of GL(n, ? _p ) was defined in [BZ77]. In the archimedean case, an analog of the highest derivative was defined for irreducible unitary representations in [Sah89] and called the “adduced” representation. In this paper we define derivatives of all orders for smooth admissible Fréchet representations of moderate growth. The real case is more problematic than the p-adic case; for example, arbitrary derivatives need not be admissible. However, the highest derivative continues being admissible, and for irreducible unitarizable representations coincides with the space of smooth vectors of the adduced representation.In the companion paper [AGS] we prove exactness of the highest derivative functor, and compute highest derivatives of all monomial representations.We apply those results to finish the computation of adduced representations for all irreducible unitary representations and to prove uniqueness of degenerate Whittaker models for unitary representations, thus completing the results of [Sah89, Sah90, SaSt90, GS13a].     

A theorem of the alternatives for the equation |<Emphasis Type="Italic">Ax</Emphasis>| − |<Emphasis Type="Italic">B</Emphasis>||<Emphasis Type="Italic">x</Emphasis>| = <Emphasis Type="Italic">b</Emphasis>

A theorem of the alternatives for the equation \({|Ax|-|B||x|=b\ (A,B\in{\mathbb{R}}^{n\times n},\, b\in{\mathbb{R}}^n)}\) is proved and several consequences are drawn. In particular, a class of matrices A, B is identified for which the equation has exactly 2 ⁿ solutions for each positive right-hand side b.     

Equitable total coloring of <Emphasis Type="Italic">F</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> ⋁ <Emphasis Type="Italic">W</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

The minimum number of total independent partition sets of V ∪ E of graph G(V,E) is called the total chromatic number of G denoted by χ _t (G). If the difference of the numbers of any two total independent partition sets of V ∪ E is no more than one, then the minimum number of total independent partition sets of V ∪ E is called the equitable total chromatic number of G, denoted by χ _et (G). In this paper, we obtain the equitable total chromatic number of the join graph of fan and wheel with the same order. Supported by the National Natural Science Foundation of China (No. 10771091).     

The stationary workload of the <Emphasis Type="Italic">G</Emphasis>/<Emphasis Type="Italic">M</Emphasis>/1 queue with impatient customers

We consider a G/M/1 queue in which the patience time of the customers is constant. The stationary distribution of the workload of the server, or the virtual waiting time, is derived by the level crossing argument. To this end, we obtain the expected downcrossings of a level in the workload process during a busy cycle and then the expected length of a busy cycle. For both the expectations, we use the dual property between the M/G/1 and G/M/1 queue.     

The critical group of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">m</Emphasis></Subscript> × <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

In this paper, the structure of the critical group of the graph K _m × C _n is determined, where m, n ≥ 3.     

An <Emphasis Type="Italic">L</Emphasis>-approach for packing (<Emphasis Type="Italic">ℓ</Emphasis>, <Emphasis Type="Italic">w</Emphasis>)-rectangles into rectangular and <Emphasis Type="Italic">L</Emphasis>-shaped pieces

This paper presents an approach using a recursive algorithm for packing (?, w)-rectangles into larger rectangular and L-shaped pieces. Such a problem has actual applications for non-guillotine cutting and pallet/container loading. Our motivation for developing the L-approach is based on the fact that it can solve difficult pallet loading instances. Indeed, it is able to solve all testing problems (more than 20 000 representatives of infinite equivalence classes of the literature), including the 18 hard instances unresolved by other heuristics. We conjecture that the L-approach always finds optimum packings of (?, w)-rectangles into rectangular pieces. Moreover, the approach may also be useful when dealing with cutting and packing problems involving L-shaped pieces.