Special classes of <Emphasis Type="Italic">l</Emphasis>-rings

We study a special class of lattice-ordered rings and a special radical. We prove that a special radical of an l-ring is equal to the intersection of the right l-prime l-ideals for each of which the following condition holds: the quotient l-ring by the maximal l-ideal contained in a given right l-ideal belongs to the special class. The prime radical of an l-ring is equal to the intersection of the right l-semiprime l-ideals. We introduce the notion of a completely l-prime l-ideal. We prove that N ₃(R) is equal to the intersection of the completely l-prime, right l-ideals of an l-ring R, where N ₃(R) is the special radical of the l-ring R defined by the class of l-rings without positive divisors of zero.     

Radicals of <Emphasis Type="Italic">l</Emphasis>-rings and special classes of <Emphasis Type="Italic">l</Emphasis>-modules

A special class of lattice-ordered modules is studied. We show that for any special class of l-modules we can define a special class of l-rings. The special radical of an l-ring R can be represented as the intersection of the l-annihilators of l-modules over R belonging to the special class. The prime radical of an l-ring R can be represented as the intersection of the l-annihilators of l-prime l-modules over R.     

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

Continuous <Emphasis Type="Italic">l</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">p</Emphasis></Subscript>-symmetric distributions

For p > 0, the l _n,p -generalized surface measure on the l _n,p -unit sphere is studied and used for deriving a geometric measure representation for l _n,p -symmetric distributions having a density.     

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

On list incidentor (<Emphasis Type="Italic">k</Emphasis>, <Emphasis Type="Italic">l</Emphasis>)-coloring

A proper incidentor coloring is called a (k, l)-coloring if the difference between the colors of the final and initial incidentors ranges between k and l. In the list variant, the extra restriction is added: the color of each incidentor must belong to the set of admissible colors of the arc. In order to make this restriction reasonable we assume that the set of admissible colors for each arc is an integer interval. The minimum length of the interval that guarantees the existence of a list incidentor (k, l)-coloring is called a list incidentor (k, l)-chromatic number. Some bounds for the list incidentor (k, l)-chromatic number are proved for multigraphs of degree 2 and 4.     

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.     

Periods of residual representations of <Emphasis Type="Italic">SO</Emphasis>(2<Emphasis Type="Italic">l</Emphasis>)

In this paper, we extend the results on G₂-period of residual representations of SO₈ in [Jng98a], [Jng98b] to a generalized G₂-period of residual representations of SO_2l (l4). The period is expected to detect the nonvanishing of the relevant tensor product L-function at the center of the symmetry, which is a special case of the Gross- Prasad conjecture. More general cases will be considered in our forth-coming work [GJRa], [GJRb].The second named author is partially supported by NSF grant DMS-0098003 and the Sloan Research Fellowship.     

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.     

Subgenerators of <Emphasis Type="Italic">C</Emphasis>-semigroups on <Emphasis Type="Italic">l</Emphasis><Superscript>2</Superscript>

This paper gives some results about the subgenerators of special C-semigroups on l2, partly answers the problem mentioned in [1].     

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.     

<Emphasis Type="Italic">l</Emphasis><Superscript><Emphasis Type="Italic">k</Emphasis>,<Emphasis Type="Italic">s</Emphasis></Superscript>-Singular values and spectral radius of partially symmetric rectangular tensors

The real rectangular tensors arise from the strong ellipticity condition problem in solid mechanics and the entanglement problem in quantum physics. In this paper, we first study properties of l ^k,s -singular values of real rectangular tensors. Then, a necessary and sufficient condition for the positive definiteness of partially symmetric rectangular tensors is given. Furthermore, we show that the weak Perron-Frobenius theorem for nonnegative partially symmetric rectangular tensor keeps valid under some new conditions and we prove a maximum property for the largest l ^k,s -singular values of nonnegative partially symmetric rectangular tensor. Finally, we prove that the largest l ^k,s -singular value of nonnegative weakly irreducible partially symmetric rectangular tensor is still geometrically simple.     

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.     

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

<Emphasis Type="Italic">l</Emphasis><Subscript>1</Subscript>-<Emphasis Type="Italic">l</Emphasis><Subscript>2</Subscript> regularization of split feasibility problems

Numerous problems in signal processing and imaging, statistical learning and data mining, or computer vision can be formulated as optimization problems which consist in minimizing a sum of convex functions, not necessarily differentiable, possibly composed with linear operators and that in turn can be transformed to split feasibility problems (SFP); see for example Censor and Elfving (Numer. Algorithms 8, 221–239 1994). Each function is typically either a data fidelity term or a regularization term enforcing some properties on the solution; see for example Chaux et al. (SIAM J. Imag. Sci. 2, 730–762 2009) and references therein. In this paper, we are interested in split feasibility problems which can be seen as a general form of Q-Lasso introduced in Alghamdi et al. (2013) that extended the well-known Lasso of Tibshirani (J. R. Stat. Soc. Ser. B 58, 267–288 1996). Q is a closed convex subset of a Euclidean m-space, for some integer m ≥ 1, that can be interpreted as the set of errors within given tolerance level when linear measurements are taken to recover a signal/image via the Lasso. Inspired by recent works by Lou and Yan (2016), Xu (IEEE Trans. Neural Netw. Learn. Syst. 23, 1013–1027 2012), we are interested in a nonconvex regularization of SFP and propose three split algorithms for solving this general case. The first one is based on the DC (difference of convex) algorithm (DCA) introduced by Pham Dinh Tao, the second one is nothing else than the celebrate forward-backward algorithm, and the third one uses a method introduced by Mine and Fukushima. It is worth mentioning that the SFP model a number of applied problems arising from signal/image processing and specially optimization problems for intensity-modulated radiation therapy (IMRT) treatment planning; see for example Censor et al. (Phys. Med. Biol. 51, 2353–2365, 2006).     

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)] < ∞.     

Equilateral Sets in <Emphasis Type="Italic">l</Emphasis><Stack><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript></Stack>

We show that for every odd integer p 1 there is an absolute positive constantc_p, so that the maximum cardinality of a set of vectors in Rⁿ such that the l_p distance between any pair is precisely 1, is at most c_p n log n. We prove some upper bounds for other l_p norms as well.     

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