Largest <Emphasis Type="Italic">H</Emphasis>-eigenvalue of uniform <Emphasis Type="Italic">s</Emphasis>-hypertrees

The k-uniform s-hypertree G = (V,E) is an s-hypergraph, where 1 ≤ s ≤ k - 1; and there exists a host tree T with vertex set V such that each edge of G induces a connected subtree of T. In this paper, some properties of uniform s-hypertrees are establised, as well as the upper and lower bounds on the largest H-eigenvalue of the adjacency tensor of k-uniform s-hypertrees in terms of the maximal degree Δ. Moreover, we also show that the gap between the maximum and the minimum values of the largest H-eigenvalue of k-uniform s-hypertrees is just Θ(Δ ^s/k ).     

Modular <Emphasis Type="Italic">W</Emphasis> and <Emphasis Type="Italic">H</Emphasis> Type Lie Algebras

The modular Witt algebra W(p, n) and H(p, 2n) are defined on the polynomial rings Z_p[x₁,...,x_n] and Z_p[X₁,...,x_n, y₁,...,y_n] respectively. We generalize Z_p[x₁,...,xn] and Zp[x₁,...,xn, y₁,...,y_n], so we get the generalized W-type and H-type modular Lie algebras. We find all the derivations of W(p, 1).AMS Subject Classification: Primary 17B40, 17B56.     

Nonlinear Preserver Problems on B（H）

Let H be a complex Hilbert space of dimension greater than 2, and B(H) denote the Banach algebra of all bounded linear operators on H. For A, B ∈ B(H), define the binary relation A ≤* B by A*A = A*B and AA* = AB*. Then (B(H), “≤*”) is a partially ordered set and the relation “≤*” is called the star order on B(H). Denote by Bs(H) the set of all self-adjoint operators in B(H). In this paper, we first characterize nonlinear continuous bijective maps on B _s (H) which preserve the star order in both directions. We characterize also additive maps (or linear maps) on B(H) (or nest algebras) which are multiplicative at some invertible operator.     

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.     

Hadamard variational formulas for <Emphasis Type="Italic">p</Emphasis>-torsion and <Emphasis Type="Italic">p</Emphasis>-eigenvalue with applications

In this paper, we pose two kinds of Minkowski problems involving the p-Laplacian operator. The Hadamard variational formulas for some p-Laplacian functionals are obtained. A good application is to prove symmetry results for solutions to some overdetermined problems of p-Laplacian equations.     

Equivalent characterization of centralizers on <Emphasis Type="Italic">B</Emphasis>(<Emphasis Type="Italic">H</Emphasis>)

Let H be a Hilbert space with dim H≥2 and Z∈ß(H) be an arbitrary but fixed operator. In this paper we show that an additive map Φ:ß(H) → ß(H) satisfies Φ(AB)=Φ(A)B=AΦ(B) for any A,B∈ß(H) with AB=Z if and only if Φ(AB)=Φ(A)B=AΦ(B), ∀A, B∈ß(H), that is, Φ is a centralizer. Similar results are obtained for Hilbert space nest algebras. In addition, we show that Φ(A²)=AΦ(A)=Φ(A)A for any A∈ ß(H) with AA²=0 if and only if Φ(A)=AΦ(I)=Φ(I)A, ∀A∈ß(H), and generalize main results in Linear Algebra and its Application, 450, 243-249 (2014) to infinite dimensional case. New equivalent characterization of centralizers on ß(H) is obtained.     

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.     

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

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.     

<Emphasis Type="Italic">C</Emphasis><Superscript>*</Superscript>-Subalgebras Generated by a Single Operator in <Emphasis Type="Italic">B</Emphasis>(<Emphasis Type="Italic">H</Emphasis>)

In this paper, we characterize a C ^*-subalgebra C ^*(x) of B(H), generated by a single operator x. We show that if x is polar-decomposed by aq, where a is the partial isometry part and q is the positive operator part of x, then C ^*(x) is *-isomorphic to the groupoid crossed product algebra A_q×_a\mathbbG_a\mathcal{A}_{q}\times_{\alpha }\mathbb{G}_{a} , where A_q=C^*(q)\mathcal{A}_{q}=C^{*}(q) and \mathbbG_a\mathbb{G}_{a} is the graph groupoid induced by a partial isometry part a of x.     

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

On the <Emphasis Type="Italic">k</Emphasis>-gamma <Emphasis Type="Italic">q</Emphasis>-distribution

We provide combinatorial as well as probabilistic interpretations for the q-analogue of the Pochhammer k-symbol introduced by Díaz and Teruel. We introduce q-analogues of the Mellin transform in order to study the q-analogue of the k-gamma distribution.     

Asymptotic <Emphasis Type="Italic">T</Emphasis><Subscript><Emphasis Type="Italic">u</Emphasis></Subscript>-Toeplitzness of weighted composition operators on <Emphasis Type="Italic">H</Emphasis><Superscript>2</Superscript>

Given a unilateral forward shift S acting on a complex, separable, innite dimensional Hilbert space H, an asymptotically S-Toeplitz operator is a bounded linear operator T on H satisfying that {S* ⁿ TS ⁿ } is convergent with respect to one of the topologies commonly used in the algebra of bounded linear operators on H. In this paper, we study the asymptotic T _u -Toeplitzness of weighted composition operators on the Hardy space H², where u is a nonconstant inner function.     

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.     

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.     

On <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis>,<Emphasis Type="Italic">q</Emphasis></Subscript>-factorization of complete bipartite multigraphs

Let λK _m,n be a complete bipartite multigraph with two partite sets having m and n vertices, respectively. A K _p,q -factorization of λK _m,n is a set of edge-disjoint K _p,q -factors of λK _m,n which partition the set of edges of λK _m,n . When p = 1 and q is a prime number, Wang, in his paper [On K _1,q -factorization of complete bipartite graph, Discrete Math., 126: (1994), 359-364], investigated the K _1,q -factorization of K _m,n and gave a sufficient condition for such a factorization to exist. In papers [K _1,k -factorization of complete bipartite graphs, Discrete Math., 259: 301-306 (2002),; K _p,q -factorization of complete bipartite graphs, Sci. China Ser. A-Math., 47: (2004), 473-479], Du and Wang extended Wang’s result to the case that p and q are any positive integers. In this paper, we give a sufficient condition for λK _m,n to have a K _p,q -factorization. As a special case, it is shown that the necessary condition for the K _p,q -factorization of λK _m,n is always sufficient when p : q = k : (k + 1) for any positive integer k.