An (<Emphasis Type="Italic">r</Emphasis>, <Emphasis Type="Italic">nQ</Emphasis>) inventory model for packaged deteriorating products with compound Poisson demand

We consider a liquid type of a deteriorating item which is packaged by an outside supplier and is delivered to final customers by a distributor. Customers arrive according to a Poisson process and ask for an integer number of packages. Unsatisfied demands are backordered. The inventory is reviewed continuously and replenished from an external supplier with a positive deterministic lead time following an (r, nQ) policy. The product in each package deteriorates continuously over time during transportation and storage. Therefore, the distributor cannot deliver exactly one unit of usable material in each package. We develop a model to determine the optimal inventory control parameters and the required size of a package to minimize expected average costs and illustrate the benefit of this method compared to a sequential approach based on an example from practice.     

(<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">Q</Emphasis>-Upper Algebras

Given a poset we introduce the notion of Q-upper algebras and study the (positive) implicativity, commutativity and quasi-commutativity in Q-upper algebras.     

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.     

Bipartite <Emphasis Type="Italic">Q</Emphasis>-Polynomial Distance-Regular Graphs

Let denote a bipartite distance-regular graph with diameter D12. We show is Q-polynomial if and only if one of the following (i)–(iv) holds: (i) is the ordinary 2D-cycle. (ii) is the Hamming cube H(D,2). (iii) is the antipodal quotient of H(2D,2). (iv) The intersection numbers of satisfy where q is an integer at least 2. We obtain the above result using the Terwilliger algebra of .AMS 1991 Subject Classification: Primary 05E30Final version received: April 10, 2003     

Periodic review (<Emphasis Type="Italic">s</Emphasis>, <Emphasis Type="Italic">S</Emphasis>) inventory model with permissible delay in payments

This paper investigates the effect of permissible delay in payments on ordering policies in a periodic review (s, S) inventory model with stochastic demand. A new mathematical model is developed, which is an extension to that of Veinott and Wagner (Mngt Sci 1965; 11: 525) who applied renewal theory and stationary probabilistic analysis to determine the equivalent average cost per review period. The performance of the model is validated using a custom-built simulation programme. In addition, two distribution-free heuristic methods of reasonable accuracy develop approximate optimal policies for practical purposes based only on the mean and the standard deviation of the demand. Numerical examples are presented with results discussed.     

Discreteness criteria in <Emphasis Type="Italic">PU</Emphasis> (1, <Emphasis Type="Italic">n</Emphasis>; <Emphasis Type="Italic">C</Emphasis>)

In this paper, we study the discreteness for non-elementary subgroups in PU (1, n; C), and several discreteness criteria are obtained.     

<Emphasis Type="Italic">K</Emphasis>-Radical classes and product radical classes of <Emphasis Type="Italic">MV</Emphasis>-algebras

For an MV-algebra let J ₀( ) be the system of all closed ideals of ; this system is partially ordered by the set-theoretical inclusion. A radical class X of MV-algebras will be called a K-radical class iff, whenever ∈ X and is an MV-algebra with J ₀( ) ≅ J ₀( ), then ∈ X. An analogous notation for lattice ordered groups was introduced and studied by Conrad. In the present paper we show that there is a one-to-one correspondence between K-radical classes of MV-algebras and K-radical classes of abelian lattice ordered groups. We also prove an analogous result for product radical classes of MV-algebras; product radical classes of lattice ordered groups were studied by Ton. This work has been partially supported by the Slovak Academy of Sciences via the project Center of Excellence-Physics of Information, Grant I/2/2005.     

Decomposition theorems for<Emphasis Type="Italic">Q</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> spaces

We study the Möbius invariant spacesQ _p andQ _{p, 0} of analytic functions. These scales of spaces include BMOA=Q₁, VMOA=Q_{1, 0} and the Dirichlet space=Q₀. Using the Bergman metric, we establish decomposition theorems for these spaces. We obtain also a fractional derivative characterization for bothQ _p andQ _{p, 0} .     

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.     

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.     

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">T</Emphasis>, <Emphasis Type="Italic">S</Emphasis><Subscript><Emphasis Type="Italic">i</Emphasis></Subscript>) Policy Inventory Model for Deteriorating Items with Time Proportional Demand

An EOQ model is reconsidered here in which the demand rate is changing linearly with time and the deterioration is assumed to be a constant fraction of the onhand inventory. The planning horizon is finite and known and the replenishment periods are assumed to be constant. The problem is to find the optimal number of replenishments, which are instantaneous. When there is no deterioration, the model developed is related to the corresponding model for nondeteriorating items. An example followed by sensitivity analysis is given to illustrate the derived results.     

Maximal subgroups of <Emphasis Type="Italic">GL</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>(<Emphasis Type="Italic">D</Emphasis>) with finite conjugacy classes

Let D be an infinite division ring. A famous result due to Herstein says that every non-central element of D has infinitely many conjugates and so, if D ^* is an FC-group, then D is a field. Let M be a maximal subgroup of GL _n (D), where n ≥ 1. In this paper, we prove that if M is an FC-group, then it is the multiplicative group of some maximal subfield of M _n (D). Moreover, if M is algebraic over Z(D), then [D : Z(D)] < ∞.     

On (<Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">m</Emphasis>)-semigroups

We generalize Green’s lemma and Green’s theorem for usual binary semigroups to (n,m)-semigroups, define and describe the regularity for an element of an (n,m)-semigroup, give some criteria for an element of an (n,m)-semigroup to be invertible, and further apply the invertibility for (n,m)-semigroups to (n,m)-groups and give some equivalent characterizations for (n,m)-groups. We establish Hosszú-Gluskin theorems for (n,m)-semigroups in two cases, as generalizations of the corresponding theorems for n-groups.     

Facets of the <Emphasis Type="Italic">r</Emphasis>-Stable (<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">k</Emphasis>)-Hypersimplex

Let k, n, and r be positive integers with k < n and \({r \leq \lfloor \frac{n}{k} \rfloor}\). We determine the facets of the r-stable n, k-hypersimplex. As a result, it turns out that the r-stable n, k-hypersimplex has exactly 2n facets for every \({r < \lfloor \frac{n}{k} \rfloor}\). We then utilize the equations of the facets to study when the r-stable hypersimplex is Gorenstein. For every k > 0 we identify an infinite collection of Gorenstein r-stable hypersimplices, consequently expanding the collection of r-stable hypersimplices known to have unimodal Ehrhart \({\delta}\)-vectors.     

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.     

Isolated 2-computably enumerable <Emphasis Type="Italic">Q</Emphasis>-degrees

In this work we prove that for every pair of computably enumerable degrees a<Q b there exists a properly 2-computably enumerable degree d such that a <Q d <Q b, a isolates d from below, and b isolates d from above. Two corollaries follow from this result. First, there exists a 2-computably enumerable degree which is Q-incomparable with any nontrivial (different from 0 and 0′) computably enumerable degree. Second, every nontrivial computably enumerable degree isolates some 2-computably enumerable degree from below and some 2-computably enumerable degree from above.     

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