A Class of Constrained Inverse Eigenproblem and Associated Approximation Problem for Symmetric Reflexive Matrices

Let S∈Rn×n be a symmetric and nontrival involution matrix. We say that A∈E R n×n is a symmetric reflexive matrix if AT = A and SAS = A. Let S R r n×n(S)={A|A= AT,A = SAS, A∈Rn×n}. This paper discusses the following two problems. The first one is as follows. Given Z∈Rn×m (m < n),∧= diag(λ1,...,λm)∈Rm×m, andα,β∈R withα<β. Find a subset (?)(Z,∧,α,β) of SRrn×n(S) such that AZ = Z∧holds for any A∈(?)(Z,∧,α,β) and the remaining eigenvaluesλm 1 ,...,λn of A are located in the interval [α,β], Moreover, for a given B∈Rn×n, the second problem is to find AB∈(?)(Z,∧,α,β) such that where ||.|| is the Frobenius norm. Using the properties of symmetric reflexive matrices, the two problems are essentially decomposed into the same kind of subproblems for two real symmetric matrices with smaller dimensions, and then the expressions of the general solution for the two problems are derived.     

分块矩阵[A B]中一块的广义逆

给出矩阵[A B]的广义逆,其中A∈Cm×k,B∈Cm×(n-k),本文得到子块A的相关广义逆的计算公式.     

On a Solution of the Quaternion Matrix Equation X - A X B = C and Its Application

This paper first studies the solution of a complex matrix equation X - AXB = C, obtains an explicit solution of the equation by means of characteristic polynomial, and then studies the quaternion matrix equation X - A X B = C, characterizes the existence of a solution to the matrix equation, and derives closed-form solutions of the matrix equation in explicit forms by means of real representations of quaternion matrices. This paper also gives an application to the complex matrix equation X - AXB =C.     

The least squares problem of the matrix equation A1X1B1^T ＋ A2X2B2^T = T

The matrix least squares （LS） problem minx ｜｜AXB^T--T｜｜F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ｜｜A1X1B1^T ＋ A2X2B2^T - T｜｜F can also be regarded as the constrained LS problem minx=diag（x1,x2） ｜｜AXB^T -T｜｜F with A = [A1, A2] and B = [B1, B2]. The authors transform T to T such that min x1,x2 ｜｜A1X1B1^T＋A2X2B2^T -T｜｜F is equivalent to min x=diag（x1 ,x2） ｜｜AXB^T - T｜｜F whose solutions are included in the solution set of unconstrained problem minx ｜｜AXB^T - T｜｜F. So the general solutions of min x1,x2 ｜｜A1X1B^T ＋ A2X2B2^T -T｜｜F are reconstructed by selecting the parameter matrix in that of minx ｜｜AXB^T - T｜｜F.     

A Theorem à la Fatou for the Square Root of Poisson Kernel in $$\delta $$-Hyperbolic Spaces and Decay of Matrix Coefficients of Boundary Representations

In this note, we prove a theorem à la Fatou for the square root of Poisson Kernel in the context of quasi-convex cocompact discrete groups of isometries of \(\delta \)-hyperbolic spaces. As a corollary we show that some matrix coefficients of boundary representations cannot satisfy the weak inequality of Harish-Chandra. Nevertheless, such matrix coefficients satisfy an inequality which can be viewed as a particular case of the inequality coming from property RD for boundary representations. The inequality established in this paper is based on a uniform bound which appears in the proof of the irreducibility of boundary representations. Moreover this uniform bound can be used to prove that the Harish-Chandra’s Schwartz space associated with some discrete groups of isometries of \(\delta \)-hyperbolic spaces carries a natural structure of a convolution algebra. Then in the context of CAT(?1) spaces we show how our elementary techniques enable us to apply an equidistribution theorem of Roblin to obtain information about the decay of matrix coefficient of boundary representations associated with continuous functions.     

On the Solvability of x∈Ax＋λBx in a General Cone with A and B Multivalued k－set－contractive

ＯｎｔｈｅＳｏｌｖａｂｉｌｉｔｙｏｆｘ∈Ａｘ＋λＢｘｉｎａＧｅｎｅｒａｌＣｏｎｅ　ｗｉｔｈＡａｎｄＢＭｕｌｔｉｖａｌｕｅｄ　ｋ－ｓｅｔ－ｃｏｎｔｒａｃｔｉｖｅＺｈａｎｇＱｉｎｇｙｏｎｇ（张庆雍）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｓｉｃ...     

块阵广义逆的块独立性的一些等价条件

基于[1]中关于块阵广义逆的块独立性的讨论,给出了两个同阶矩阵关于{1,2}-逆具有块独立性的一些等价条件.     

<Emphasis Type="Italic">G</Emphasis>-compactness and groups

Lascar described E _KP as a composition of E _L and the topological closure of E _L (Casanovas et al. in J Math Log 1(2):305–319). We generalize this result to some other pairs of equivalence relations. Motivated by an attempt to construct a new example of a non-G-compact theory, we consider the following example. Assume G is a group definable in a structure M. We define a structure M′ consisting of M and X as two sorts, where X is an affine copy of G and in M′ we have the structure of M and the action of G on X. We prove that the Lascar group of M′ is a semi-direct product of the Lascar group of M and G/G _L . We discuss the relationship between G-compactness of M and M′. This example may yield new examples of non-G-compact theories. The first author is supported by the Polish Goverment grant N N201 384134. The second author is supported by the Polish Goverment grant N201 032 32/2231.     

Consecutive customer losses in regular and oscillating <Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">G</Emphasis>/1/<Emphasis Type="Italic">n</Emphasis> systems

We derive fast recursions to compute the probability that k or more consecutive customer losses take place during a busy period of a queue, the so called k-CCL probability, for regular and oscillating M ^X /G/1/n systems.     

Injective and Projective Properties of <Emphasis Type="Italic">R</Emphasis>[<Emphasis Type="Italic">x</Emphasis>]-Modules

We study whether the projective and injective properties of left R-modules can be implied to the special kind of left R[x]-modules, especially to the case of inverse polynomial modules and Laurent polynomial modules.     

Approximations for the <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">GI</Emphasis>/<Emphasis Type="Italic">N</Emphasis>+<Emphasis Type="Italic">GI</Emphasis> type call center

In this paper, we propose approximations to compute the steady-state performance measures of the M/GI/N+GI queue receiving Poisson arrivals with N identical servers, and general service and abandonment-time distributions. The approximations are based on scaling a single server M/GI/1+GI queue. For problems involving deterministic and exponential abandon times distributions, we suggest a practical way to compute the waiting time distributions and their moments using the Laplace transform of the workload density function. Our first contribution is numerically computing the workload density function in the M/GI/1+GI queue when the abandon times follow general distributions different from the deterministic and exponential distributions. Then we compute the waiting time distributions and their moments. Next, we scale-up the M/GI/1+GI queue giving rise to our approximations to capture the behavior of the multi-server system. We conduct extensive numerical experiments to test the speed and performance of the approximations, which prove the accuracy of their predictions.      

On the value distribution of <Emphasis Type="Italic">ƒ</Emphasis> + <Emphasis Type="Italic">a</Emphasis>(<Emphasis Type="Italic">ƒ</Emphasis>′)<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

Let ƒ be a transcendental meromorphic function, a a nonzero finite complex number, and n ⩾ 2 a positive integer. Then ƒ + a(ƒ′) ⁿ assumes every complex value infinitely often. This answers a question of Ye for n = 2. A related normality criterion is also given. This work was supported by the National Natural Science Foundation of China (Grant No. 10771076), the Natural Science Foundation of Guangdong Province, China (Grant No. 07006700) and by the German-Israeli Foundation for Scientific Research and Development (Grant No. G-809-234.6/2003)     

<Emphasis Type="Italic">G</Emphasis>-projectable and Λ-projectable binary linear block codes

The binary [24,12,8] Golay code has projection O onto the quaternary [6,3,4] hexacode [9] and the [32,16,8] Reed-Muller code has projection E onto the quaternary self-dual [8,4,4] code [6]. Projection E was extended to projection G in [8]. In this paper we introduce a projection, to be called projection Λ, that covers projections O, E and G. We characterise G-projectable self-dual codes and Λ-projectable codes. Explicit methods for constructing codes having G and Λ projections are given and several so constructed codes that have best known optimal parameters are introduced.      

Three classes of smooth Banach submanifolds in B(E,F)

Let E, F be two Banach spaces, and B(E, F), Φ(E, F), SΦ(E, F) and R(E,F) be the bounded linear, Fredholm, semi-Frdholm and finite rank operators from E into F, respectively. In this paper, using the continuity characteristics of generalized inverses of operators under small perturbations, we prove the following result Let ∑ be any one of the following sets {T ∈ Φ(E, F) IndexT =const, and dim N(T) = const.}, {T ∈ SΦ(E, F) either dim N(T) = const. ＜ ∞ or codim R(T) = const.＜ ∞} and {T ∈ R(E, F) RankT =const.＜∞}. Then ∑ is a smooth submanifold of B(E, F) with the tangent space TA∑ = {B ∈ B(E,F) BN(A) (∪) R(A)} for any A ∈ ∑. The result is available for the further application to Thom's famous results on the transversility and the study of the infinite dimensional geometry.     

Composite Integers n for Which φ（n）｜n- 1

In this note, we show that the number of composite integers n ≤ x such that φ（n）｜n - 1 is at most O（x^1/2（loglog x）^1/2）, thus improving earlier results by Pomerance and by Shan.