Elementary criteria for irreducibility of <Emphasis Type="Italic">f</Emphasis>(<Emphasis Type="Italic">X</Emphasis><Superscript><Emphasis Type="Italic">r</Emphasis></Superscript>)

In this paper, very simple sufficient conditions for the irreducibility of f(X ^r ) over an arbitrary unique factorization domain Z are established.     

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.     

Composition operators on <Emphasis Type="Italic">f</Emphasis>-algebras

By a composition operator between two f-algebras we mean a positive algebra homomorphism. This paper intends to give a systematic study of such operators. A particular attention is paid to their connection with separating regular operators as well as to their global behavior in the module of regular operators. The paper ends with some open problems.     

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.     

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.     

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.     

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.     

On the Distribution of Values of <Emphasis Type="Italic">L</Emphasis>(1, <Emphasis Type="Italic">f</Emphasis>)

Let S_k(N)⁺ be the set of newforms of weight k for Γ₀(N), and let L (s, f), f ∈ S_k(N)⁺, be the Hecke L-function of the form f. It is proved that for every integer m ≥ 1, k = 2, and N = p → ∞,

$\mathop \sum \limits_{f \in S_2 (N)^ + } L^m (1,f) = \frac{1}{{12}}B_m N + O(N^{1 - \alpha } ),$

where B_m is a constant defined in the paper, and α = α(m) > 0 is a certain constant. This result implies the existence of the distribution function of the sequence

$\{ L(1,f),f \in S_2 (N)^ + \} ,\quad N = p \to \infty ,$

and also yields an explicit expression for the corresponding characteristic function. Bibliography: 11 titles.

     

(<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.     

A study of (<Emphasis Type="Italic">x</Emphasis>(<Emphasis Type="Italic">q</Emphasis> + 1), <Emphasis Type="Italic">x</Emphasis>; 2, <Emphasis Type="Italic">q</Emphasis>)-minihypers

In this paper, we study the weighted (x(q + 1), x; 2, q)-minihypers. These are weighted sets of x(q + 1) points in PG(2, q) intersecting every line in at least x points. We investigate the decomposability of these minihypers, and define a switching construction which associates to an (x(q + 1), x; 2, q)-minihyper, with x ≤ q ² − q, not decomposable in the sum of another minihyper and a line, a (j(q + 1), j; 2, q)-minihyper, where j = q ² − q − x, again not decomposable into the sum of another minihyper and a line. We also characterize particular (x(q + 1), x; 2, q)-minihypers, and give new examples. Additionally, we show that (x(q + 1), x; 2, q)-minihypers can be described as rational sums of lines. In this way, this work continues the research on (x(q + 1), x; 2, q)-minihypers by Hill and Ward (Des Codes Cryptogr 44:169–196, 2007), giving further results on these minihypers.     

The Center of <Emphasis Type="Italic">Dist</Emphasis> (<Emphasis Type="Italic">GL</Emphasis>(<Emphasis Type="Italic">m</Emphasis>|<Emphasis Type="Italic">n</Emphasis>)) in Positive Characteristic

The purpose of this paper is to investigate central elements in distribution algebras D i s t(G) of general linear supergroups G = G L(m|n). As an application, we compute explicitly the center of D i s t(G L(1|1)) and its image under Harish-Chandra homomorphism.     

<Emphasis Type="Italic">l</Emphasis>-Groups <Emphasis Type="Italic">C</Emphasis>(<Emphasis Type="Italic">X</Emphasis>) in continuous logic

In the context of continuous logic, this paper axiomatizes both the class \(\mathcal {C}\) of lattice-ordered groups isomorphic to C(X) for X compact and the subclass \(\mathcal {C}^+\) of structures existentially closed in \(\mathcal {C}\); shows that the theory of \(\mathcal {C}^+\) is \(\aleph _0\)-categorical and admits elimination of quantifiers; establishes a Nullstellensatz for \(\mathcal {C}\) and \(\mathcal {C}^+\); shows that \(C(X)\in \mathcal {C}\) has a prime-model extension in \(\mathcal {C}^+\) just in case X is Boolean; and proves that in a sense relevant to continuous logic, positive formulas admit in \(\mathcal {C}^+\) elimination of quantifiers to positive formulas.     

<Emphasis Type="Italic">X</Emphasis>-decomposable finite groups for <Emphasis Type="Italic">X</Emphasis>={1, <Emphasis Type="Italic">m</Emphasis>, <Emphasis Type="Italic">m</Emphasis> + 1, <Emphasis Type="Italic">m</Emphasis> + 2}

A normal subgroup N of a finite group G is called n-decomposable in G if N is the union of n distinct G-conjugacy classes. We study the structure of nonperfect groups in which every proper nontrivial normal subgroup is m-decomposable, m+1-decomposable, or m+2-decomposable for some positive integer m. Furthermore, we give classification for the soluble case.     

Processes of <Emphasis Type="Italic">r</Emphasis><Superscript><Emphasis Type="Italic">t</Emphasis><Emphasis Type="Italic">h</Emphasis></Superscript> largest

For integers n ≥ r, we treat the rth largest of a sample of size n as an \(\mathbb {R}^{\infty }\)-valued stochastic process in r which we denote as M^(r). We show that the sequence regarded in this way satisfies the Markov property. We go on to study the asymptotic behavior of M^(r) as r → ∞, and, borrowing from classical extreme value theory, show that left-tail domain of attraction conditions on the underlying distribution of the sample guarantee weak limits for both the range of M^(r) and M^(r) itself, after norming and centering. In continuous time, an analogous process Y^(r) based on a two-dimensional Poisson process on \(\mathbb {R}_{+}\times \mathbb {R}\) is treated similarly, but we note that the continuous time problems have a distinctive additional feature: there are always infinitely many points below the rth highest point up to time t for any t >?0. This necessitates a different approach to the asymptotics in this case.     

<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.     

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

Riesz <Emphasis Type="Italic">s</Emphasis>-Equilibrium Measures on <Emphasis Type="Italic">d</Emphasis>-Rectifiable Sets as <Emphasis Type="Italic">s</Emphasis> Approaches <Emphasis Type="Italic">d</Emphasis>

Let A be a compact set in of Hausdorff dimension d. For s ∈ (0,d) the Riesz s-equilibrium measure μ ^s is the unique Borel probability measure with support in A that minimizes

Smooth noncompact operators from <Emphasis Type="Italic">C</Emphasis>(<Emphasis Type="Italic">K</Emphasis>), <Emphasis Type="Italic">K</Emphasis> scattered

Let X be a Banach space, K be a scattered compact and T: B _C(K) → X be a Fréchet smooth operator whose derivative is uniformly continuous. We introduce the smooth biconjugate T**: B _C(K)** → X** and prove that if T is noncompact, then the derivative of T** at some point is a noncompact linear operator. Using this we conclude, among other things, that either is compact or that ℓ₁ is a complemented subspace of X*. We also give some relevant examples of smooth functions and operators, in particular, a C ^1,u -smooth noncompact operator from B _{c O} which does not fix any (affine) basic sequence. P. Hájek was supported by grants A100190502, Institutional Research Plan AV0Z10190503.     

Packet loss characteristics for <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">G</Emphasis>/1/<Emphasis Type="Italic">N</Emphasis> queueing systems

In this contribution we investigate higher-order loss characteristics for M/G/1/N queueing systems. We focus on the lengths of the loss and non-loss periods as well as on the number of arrivals during these periods. For the analysis, we extend the Markovian state of the queueing system with the time and number of admitted arrivals since the instant where the last loss occurred. By combining transform and matrix techniques, expressions for the various moments of these loss characteristics are found. The approach also yields expressions for the loss probability and the conditional loss probability. Some numerical examples then illustrate our results.