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 representation theorem of <Emphasis Type="Italic">G</Emphasis>-expectations and paths of <Emphasis Type="Italic">G</Emphasis>-Brownian motion

We give a very simple and elementary proof of the existence of a weakly compact family of probability measures {Pθ ： θ∈θ} representing an important sublinear expectation- G-expectation E[·]. We also give a concrete approximation of a bounded continuous function X（ω） by an increasing sequence of cylinder functions Lip（Ω） in order to prove that Cb（Ω） belongs to the completion of Lip（Ω） under the natural norm E[｜·｜].     

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.     

On Resolvable Multipartite <Emphasis Type="Italic">G</Emphasis>-Designs

A necessary and sufficient condition for the existence of a _km–factorization of the complete symmetric k–partite multi-digraph K*(n₁,n₂,...,n_k) is obtained for odd k. As a consequence, a resolvable (k,n,km,) multipartite _km–design exists for odd k if and only if m|n. This deduces a result of Ushio when m=1 and k=3. Further, a necessary and sufficient condition for the existence of a _km–factorization of is established for even k, where denotes the wreath product of graphs. Finally, a simple and short proof for the non-existence of a _k–factorization of is obtained for odd k.Acknowledgments.The author thanks Dr. P. Paulraja for his useful ideas in writing this paper and the Department of Science and Technology, New Delhi, for its support (Project Grant No. DST/MS/103/99).Final version received: November 17, 2003     

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.     

2-Connected factor-critical graphs <Emphasis Type="Italic">G</Emphasis> with exactly |<Emphasis Type="Italic">E</Emphasis>(<Emphasis Type="Italic">G</Emphasis>)| + 1 maximum matchings

A connected graph G is said to be a factor-critical graph if G ?v has a perfect matching for every vertex v of G. In this paper, the 2-connected factor-critical graph G which has exactly |E(G)| + 1 maximum matchings is characterized.     

Extremal <Emphasis Type="Italic">G</Emphasis>-invariant eigenvalues of the Laplacian of <Emphasis Type="Italic">G</Emphasis>-invariant metrics

The study of extremal properties of the spectrum often involves restricting the metrics under consideration. Motivated by the work of Abreu and Freitas in the case of the sphere S ² endowed with S ¹-invariant metrics, we consider the subsequence of the spectrum of a Riemannian manifold M which corresponds to metrics and functions invariant under the action of a compact Lie group G. If G has dimension at least 1, we show that the functional λ _k ^G admits no extremal metric under volume-preserving G-invariant deformations. If, moreover, M has dimension at least three, then the functional is unbounded when restricted to any conformal class of G-invariant metrics of fixed volume. As a special case of this, we can consider the standard O(n)-action on S ⁿ ; however, if we also require the metric to be induced by an embedding of S ⁿ in , we get an optimal upper bound on .      

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.     

The Combinatorial Quantum Cohomology Ring of <Emphasis Type="Italic">G</Emphasis>/<Emphasis Type="Italic">B</Emphasis>

A purely combinatorial construction of the quantum cohomology ring of the generalized flag manifold is presented. We show that the ring we construct is commutative, associative and satisfies the usual grading condition. By using results of our previous papers [12, 13], we obtain a presentation of this ring in terms of generators and relations, and formulas for quantum Giambelli polynomials. We show that these polynomials satisfy a certain orthogonality property, which—for G = SL_n( )—was proved previously in the paper [5].     

On properties of <Emphasis Type="Italic">G</Emphasis>-expansive homeomorphisms

We show that LUB of the set of G-expansive constants for a G-expansive homeomorphism h on a compact metric G-space, G compact, is not a G-expansive constant for h. We obtain a result regarding projecting and lifting of G-expansive homeomorphisms having interesting applications. We also prove that the G-expansiveness is a dynamical property for homeomorphisms on compact metric G-spaces and study G-periodic points.     

<Emphasis Type="Italic">R</Emphasis>-bounded Representations of <Emphasis Type="Italic">L</Emphasis><Superscript>1</Superscript> (<Emphasis Type="Italic">G</Emphasis>)

We investigate R-bounded representations , where X is a Banach space and G is a lca group. Observing that Ψ induces a (strongly continuous) group homomorphism , we are then able to analyze certain classical homomorphisms U (e.g. translations in L^p (G)) from the viewpoint of R-boundedness and the theory of scalar-type spectral operators. Dedicated to the memory of H. H. Schaefer     

Cyclicity conditions for <Emphasis Type="Italic">G</Emphasis>-chief factors of normal subgroups of a group <Emphasis Type="Italic">G</Emphasis>

We find conditions under which every G-chief factor of a normal subgroup E of a finite group G is cyclic.     

Unified analysis of <Emphasis Type="Italic">BMAP</Emphasis>/<Emphasis Type="Italic">G</Emphasis>/1 cyclic polling models

In this paper we present a unified analysis of the BMAP/G/1 cyclic polling model and its application to the gated and exhaustive service disciplines as examples. The applied methodology is based on the separation of the analysis into service discipline independent and dependent parts. New expressions are derived for the vector-generating function of the stationary number of customers and for its mean in terms of vector quantities depending on the service discipline. They are valid for a broad class of service disciplines and both for zero- and nonzero-switchover-times polling models. We present the service discipline specific solution for the nonzero-switchover-times model with gated and exhaustive service disciplines. We set up the governing equations of the system by using Kronecker product notation. They can be numerically solved by means of a system of linear equations. The resulting vectors are used to compute the service discipline specific vector quantities.     

Scheduling policies in the <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">G</Emphasis>/1 make-to-stock queue

In this paper, we analyse a production/inventory system modelled as an M/G/1 make-to-stock queue producing different products requiring different and general production times. We study different scheduling policies including the static first-come-first-served, preemptive and non-preemptive priority disciplines. For each static policy, we exploit the distributional Little's law to obtain the steady-state distribution of the number of customers in the system and then find the optimal inventory control policy and the cost. We additionally provide the conditions under which it is optimal to produce a product according to a make-to-order policy. We further extend the application area of a well-known dynamic scheduling heuristic, Myopic(T), for systems with non-exponential service times by permitting preemption. We compare the performance of the preemptive-Myopic(T) heuristic alongside that of the static preemptive-bμ rule against the optimal solution. The numerical study we have conducted demonstrates that the preemptive-Myopic(T) policy is superior between the two and yields costs very close to the optimal.     

Integral varieties of the canonical cone structure on <Emphasis Type="Italic">G</Emphasis>/<Emphasis Type="Italic">P</Emphasis>

The canonical cone structure on a compact Hermitian symmetric space G/P is the fiber bundle where is the cone of the highest weight vectors under the action of the reductive part of P. It is known that the cone coincides with the cone of the vectors tangent to the lines in G/P passing through x, when we consider G/P as a projective variety under its homogeneous embedding into the projective space of the irreducible representation space V of G with highest weight associated to P. A subvariety X of G/P is said to be an integral variety of at all smooth points xG/P. Equivalently, an integral variety of is a subvariety of G/P whose embedded projective tangent space at each smooth point is a linear space We prove a kind of rigidity of the integral varieties under some dimension condition. After making a uniform setting to study the problem, we apply the theory of Lie algebra cohomology as a main tool. Finally we show that the dimension condition is necessary by constructing counterexamples.     

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.     

Some isomorphism results for Thompson-like groups <Emphasis Type="Italic">V</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>(<Emphasis Type="Italic">G</Emphasis>)

The natural automorphism group of a translation surface is its group of translations. For finite translation surfaces of genus g ≥ 2 the order of this group is naturally bounded in terms of g due to a Riemann–Hurwitz formula argument. In analogy with classical Hurwitz surfaces, we call surfaces which achieve the maximal bound Hurwitz translation surfaces. We study for which g there exist Hurwitz translation surfaces of genus g.     

Semi-lattices of bicompact <Emphasis Type="Italic">G</Emphasis>-extensions

It is shown that any semilattice of bicompact G-extensions can be realized as a semilattice for a pseudocompact phase space with an action of a discrete group. The following examples are given: lattices of bicompact G-extensions which cannot be lattices of bicompact extensions of any Tikhonov space and a pseudocompact G-space with a discrete acting group whose semilattice of bicompact G-extensions has a countable number of minimal elements.     

Representations of <Emphasis Type="Italic">G</Emphasis>-Brauer Algebras

A new class of G-Brauer algebras which generalizes signed Brauer algebras has been introduced. The structure and representations of such algebras have been studied.AMS Subject Classification: 16S99