The generalized bisymmetric solutions of the matrix equation A 1 X 1 B 1 + A 2 X 2 B 2 + ? + A l X l B l = C and its optimal approximation

For fixed generalized reflection matrix P, i.e. P ^T  = P, P ² = I, then matrix X is said to be generalized bisymmetric, if X = X ^T  = PXP. In this paper, an iterative method is constructed to find the generalized bisymmetric solutions of the matrix equation A ₁ X ₁ B ₁ + A ₂ X ₂ B ₂ + ⋯ + A _l X _l B _l  = C where [X ₁,X ₂, ⋯ ,X _l ] is real matrices group. By this iterative method, the solvability of the matrix equation can be judged automatically. When the matrix equation is consistent, for any initial generalized bisymmetric matrix group , a generalized bisymmetric solution group can be obtained within finite iteration steps in the absence of roundoff errors, and the least norm generalized bisymmetric solution group can be obtained by choosing a special kind of initial generalized bisymmetric matrix group. In addition, the optimal approximation generalized bisymmetric solution group to a given generalized bisymmetric matrix group in Frobenius norm can be obtained by finding the least norm generalized bisymmetric solution group of the new matrix equation , where . Given numerical examples show that the algorithm is efficient. Research supported by: (1) the National Natural Science Foundation of China (10571047) and (10771058), (2) Natural Science Foundation of Hunan Province (06JJ2053), (3) Scientific Research Fund of Hunan Provincial Education Department(06A017).     

On the Homological Dimension of Lattices

Let L be a finite lattice and let . It is shown that if the order complex satisfies then |L| ≥ 2 ^k . Equality |L| = 2 ^k holds iff L is isomorphic to the Boolean lattice {0,1} ^k . Research supported by the Israel Science Foundation.     

On a conjectured inequality of Gautschi and Leopardi for Jacobi polynomials

Motivated by work on positive cubature formulae over the spherical surface, Gautschi and Leopardi conjectured that the inequality holds for α,β > − 1 and n ≥ 1, θ ∈ (0, π), where are the Jacobi polynomials of degree n and parameters (α, β). We settle this conjecture in the special cases where .      

An iterative method for the least squares symmetric solution of matrix equation AXB = C

This paper an iterative method is presented to solve the minimum Frobenius norm residual problem: with unknown symmetric matrix . By the iterative method, for any initial symmetric matrix , a solution can be obtained within finite iteration steps in the absence of roundoff errors, and the solution with least Frobenius norm can be obtained by choosing a special kind of initial symmetric matrix. In addition, in the solution set of the minimum Frobenius norm residual problem, the unique optimal approximation solution to a given matrix in Frobenius norm can be expressed as , where is the least norm symmetric solution of the new minimum residual problem: with . Given numerical examples are show that the iterative method is quite efficient.Research supported by Scientific Research Fund of Hunan Provincial Education Department of China (05C797), by China Postdoctoral Science Foundation (2004035645) and by National Natural Science Foundation of China (10571047).     

Conjectured inequalities for Jacobi polynomials and their largest zeros

Inequalities are conjectured for the Jacobi polynomials and their largest zeros. Special attention is given to the cases β = α − 1 and β = α.      

A generalization of Euler’s constant

The purpose of this paper is to evaluate the limit γ(a) of the sequence , where a ∈ (0, + ∞ ).      

From light tails to heavy tails through multiplier

Let X and Y be two independent nonnegative random variables, of which X has a distribution belonging to the class or for some γ ≥ 0 and Y is unbounded. We study how their product XY inherits the tail behavior of X. Under some mild technical assumptions we prove that the distribution of XY belongs to the class or accordingly. Hence, the multiplier Y builds a bridge between light tails and heavy tails.      

Hermite polynomials on the plane

The space of bivariate generalised Hermite polynomials of degree n is invariant under rotations. We exploit this symmetry to construct an orthonormal basis for which consists of the rotations of a single polynomial through the angles , ℓ=0,...n. Thus we obtain an orthogonal expansion which retains as much of the symmetry of as is possible. Indeed we show that a continuous version of this orthogonal expansion exists.      

Relations between different types of spectra and spectral characterizations

In the study of the asymptotic behaviour of solutions of differential-difference equations the -spectrum has been useful, where and implies Fourier transform , with given , φ∈L ^∞(ℝ,X), X a Banach space, (half)line. Here we study and related concepts, give relations between them, especially weak Laplace half-line spectrum of φ, and thus ⊂ classical Beurling spectrum = Carleman spectrum =  ; also  = Beurling spectrum of “φ modulo ” (Chill-Fasangova). If satisfies a Loomis type condition (L _U ), then countable and uniformly continuous ∈U are shown to imply ; here (L _U ) usually means , indefinite integral Pf of f in U imply Pf in (the Bohl-Bohr theorem for = almost periodic functions, U=bounded functions). This spectral characterization and other results are extended to unbounded functions via mean classes , ℳ ^m U ((2.1) below) and even to distributions, generalizing various recent results for uniformly continuous bounded φ. Furthermore for solutions of convolution systems S*φ=b with in some we show . With these above results, one gets generalizations of earlier results on the asymptotic behaviour of solutions of neutral integro-differential-difference systems. Also many examples and special cases are discussed.     

Restarted generalized Krylov subspace methods for solving large-scale polynomial eigenvalue problems

In this paper, we introduce a generalized Krylov subspace based on a square matrix sequence {A _j } and a vector sequence {u _j }. Next we present a generalized Arnoldi procedure for generating an orthonormal basis of . By applying the projection and the refined technique, we derive a restarted generalized Arnoldi method and a restarted refined generalized Arnoldi method for solving a large-scale polynomial eigenvalue problem (PEP). These two methods are applied to solve the PEP directly. Hence they preserve essential structures and properties of the PEP. Furthermore, restarting reduces the storage requirements. Some theoretical results are presented. Numerical tests report the effectiveness of these methods. Yimin Wei is supported by the National Natural Science Foundation of China and Shanghai Education Committee.     

The ratio of the extreme to the sum in a random sequence

For X ₁ , X ₂ , ..., X _n a sequence of non-negative independent random variables with common distribution function F(t), X _(n) denotes the maximum and S _n denotes the sum. The ratio variate R _n  = X _(n) / S _n is a quantity arising in the analysis of process speedup and the performance of scheduling. O’Brien (J. Appl. Prob. 17:539–545, 1980) showed that as n → ∞, R _n →0 almost surely iff is finite. Here we show that, provided either (1) is finite, or (2) 1 − F (t) is a regularly varying function with index ρ < − 1, then . An integral representation for the expected ratio is derived, and lower and upper asymptotic bounds are developed to obtain the result. Since is often known or estimated asymptotically, this result quantifies the rate of convergence of the ratio’s expected value. The result is applied to the performance of multiprocessor scheduling.      

Restriction De La Cohomologie D’une Variété De Shimura à Ses Sous-variétés

Let G be a connected semisimple group over . Given a maximal compact subgroup K ⊂ G() such that X = G()/K is a Hermitian symmetric domain, and a convenient arithmetic subgroup Γ ⊂ G(), one constructs a (connected) Shimura variety S = S(Γ) = Γ\X. If H ⊂ G is a connected semisimple subgroup such that H() / K is maximal compact, then Y = H()/K is a Hermitian symmetric subdomain of X. For each g ∈ G() one can construct a connected Shimura variety S(H, g) = (H() ∩ g ⁻¹Γg)\Y and a natural holomorphic map j _g : S(H, g) → S induced by the map H() → G(), h → gh. Let us assume that G is anisotropic, which implies that S and S(H, g) are compact. Then, for each positive integer k, the map j _g induces a restriction map

On the Affine Schur Algebra of Type A II

By studying certain centralizer subalgebras of the affine Schur algebra we show that is Noetherian and we determine its center. Assuming n ≥ r, we show that is Morita equivalent to , and the Schur functor is an equivalence under certain conditions. The author acknowledges support by National Natural Science Foundation of China No.10131010.     

Largest Families Without an <Emphasis Type="Italic">r</Emphasis>-Fork

Let [n] = { 1,2,...,n} be a finite set, a family of its subsets, 2 ≤ r a fixed integer. Suppose that contains no r + 1 distinct members F, G ₁,..., G _r such that F ⊂ G ₁,...,F ⊂ G _r all hold. The maximum size is asymptotically determined up to the second term, improving the result of Tran. The work of the second author was supported by the Hungarian National Foundation for Scientific Research grant numbers NK0621321, AT048826, the Bulgarian National Science Fund under Grant IO-03/2005 and the projects of the European Community: INTAS 04-77-7171, COMBSTRU–HPRN-CT-2002-000278, FIST–MTKD-CT-2004-003006.     

Epicompletion in Frames with Skeletal Maps,I: Compact Regular Frames

A frame homomorphism h : A ⟶ B is skeletal if x ^⊥⊥ = 1 in A implies that h(x)^⊥⊥ = 1 in B. It is shown that, in , the category of compact regular frames with skeletal maps, the subcategory , consisting of the frames in which every polar is complemented, coincides with the epicomplete objects in . Further, is the least epireflective subcategory, and, indeed, the target of the monoreflection which assigns to a compact regular frame A, the ideal frame ε A of , the boolean algebra of polars of A.      

Estimates of the Green’s Functions for the Elasto-static Equations and Stokes Equations in a Three Dimensional Lipschitz Domain

In this paper, we study a Green’s functions G ^E , G ^S for an elasto-static equations and Stokes equations in a three-dimensional bounded Lipschitz domain Ω. We prove that there is a positive constant c > 0 depending on the Lipschitz constant such that for all . Furthermore, we show that there is a positive constant η ∈ (0,1) depending on the Lipschitz constant such that for all . The second author is partially supported by Korea Research Foundation Grant KRF C-00005.     

Cocycle and orbit equivalence superrigidity for malleable actions of w-rigid groups

We prove that if a countable discrete group Γ is w-rigid, i.e. it contains an infinite normal subgroup H with the relative property (T) (e.g. , or Γ=H×H’ with H an infinite Kazhdan group and H’ arbitrary), and is a closed subgroup of the group of unitaries of a finite separable von Neumann algebra (e.g. countable discrete, or separable compact), then any -valued measurable cocycle for a measure preserving action of Γ on a probability space (X,μ) which is weak mixing on H and s-malleable (e.g. the Bernoulli action ) is cohomologous to a group morphism of Γ into . We use the case discrete of this result to prove that if in addition Γ has no non-trivial finite normal subgroups then any orbit equivalence between and a free ergodic measure preserving action of a countable group Λ is implemented by a conjugacy of the actions, with respect to some group isomorphism Γ≃Λ.     

Multivariate polynomial interpolation: conjectures concerning GC-sets

GC-sets are subsets T of of the appropriate cardinality for which, for each τ ∈ T, there are n hyperplanes whose union contains all of T except for τ, thus making interpolation to arbitrary data on T by polynomials of degree ≤ n uniquely possible. The existing bivariate theory of such sets is extended to the general multivariate case and the concept of a maximal hyperplane for T is highlighted, in hopes of getting more insight into existing conjectures for the bivariate case.      

Distribution of values of bounded generalized polynomials

A generalized polynomial is a real-valued function which is obtained from conventional polynomials by the use of the operations of addition, multiplication, and taking the integer part; a generalized polynomial mapping is a vector-valued mapping whose coordinates are generalized polynomials. We show that any bounded generalized polynomial mapping u: Z ^d  → R ^l has a representation u(n) = f(ϕ(n)x), n ∈ Z ^d , where f is a piecewise polynomial function on a compact nilmanifold X, x ∈ X, and ϕ is an ergodic Z ^d -action by translations on X. This fact is used to show that the sequence u(n), n ∈ Z ^d , is well distributed on a piecewise polynomial surface (with respect to the Borel measure on that is the image of the Lebesgue measure under the piecewise polynomial function defining ). As corollaries we also obtain a von Neumann-type ergodic theorem along generalized polynomials and a result on Diophantine approximations extending the work of van der Corput and of Furstenberg–Weiss.     

Convex Sets in Acyclic Digraphs

A non-empty set X of vertices of an acyclic digraph is called connected if the underlying undirected graph induced by X is connected and it is called convex if no two vertices of X are connected by a directed path in which some vertices are not in X. The set of convex sets (connected convex sets) of an acyclic digraph D is denoted by and its size by co(D) (cc(D)). Gutin et al. (2008) conjectured that the sum of the sizes of all convex sets (connected convex sets) in D equals Θ(n · co(D)) (Θ(n · cc(D))) where n is the order of D. In this paper we exhibit a family of connected acyclic digraphs with and . We also show that the number of connected convex sets of order k in any connected acyclic digraph of order n is at least n − k + 1. This is a strengthening of a theorem of Gutin and Yeo.