A note on the spectrum of an upper triangular operator matrix

Let be a upper triangular operator matrix acting on the Banach space . We investigate the set of the operators for which , where denotes the spectrum.

     

A New Proof of the Mullineux Conjecture

Let S _d denote the symmetric group on d letters. In 1979 Mullineux conjectured a combinatorial algorithm for calculating the effect of tensoring with an irreducible S _d-module with the one dimensional sign module when the ground field has positive characteristic. Kleshchev proved the Mullineux conjecture in 1996. In the present article we provide a new proof of the Mullineux conjecture which is entirely independent of Kleshchev's approach. Applying the representation theory of the supergroup GL(m | n) and the supergroup analogue of Schur-Weyl Duality it becomes straightforward to calculate the combinatorial effect of tensoring with the sign representation and, hence, to verify Mullineux's conjecture. Similar techniques also allow us to classify the irreducible polynomial representations of GL(m | n) of degree d for arbitrary m, n, and d.     

Quadruple systems of the projective special linear group PSL(2,q), q ≡ 1 (mod 4)

We determine the distribution of quadruple systems among the orbits of 4‐element subsets under the action of PSL(2,q) on the projective line when q ≡ 1 (mod 4). © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 339–351, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10043     

The heat kernel and Hardy’s theorem on symmetric spaces of noncompact type

For symmetric spaces of noncompact type we prove an analogue of Hardy’s theorem which characterizes the heat kernel in terms of its order of magnitude and that of its Fourier transform.     

The Constrained Solutions of Two Matrix Equations

We study the symmetric positive semidefinite solution of the matrix equation AX ₁ A ^T + BX ₂ B ^T = C, where A is a given real m×n matrix, B is a given real m×p matrix, and C is a given real m×m matric, with m, n, p positive integers; and the bisymmetric positive semidefinite solution of the matrix equation D ^T XD = C, where D is a given real n×m matrix, C is a given real m×m matrix, with m, n positive integers. By making use of the generalized singular value decomposition, we derive general analytic formulae, and present necessary and sufficient conditions for guaranteeing the existence of these solutions. Received December 17, 1999, Revised January 10, 2001, Accepted March 5, 2001     

A Fast, Direct Algorithm for the Lippmann–Schwinger Integral Equation in Two Dimensions

The state-of-the-art, large-scale numerical simulations of the scattering problem for the Helmholtz equation in two dimensions rely on iterative solvers for the Lippmann–Schwinger integral equation, with an optimal CPU time O(m ³ log(m)) for an m-by-m wavelength problem. We present a method to solve the same problem directly, as opposed to iteratively, with the obvious advantage in efficiency for multiple right-hand sides corresponding to distinct incident waves. Analytically, this direct method is a hierarchical, recursive scheme consisting of the so-called splitting and merging processes. Algebraically, it amounts to a recursive matrix decomposition, for a cost of O(m ³), of the discretized Lippmann–Schwinger operator. With this matrix decomposition, each back substitution requires only O(m ² log(m)); therefore, a scattering problem with m incident waves can be solved, altogether, in O(m ³ log(m)) flops.     

Jordan标准形定理的初等变换证明

本文对 Jordan标准形定理给出了一种使用初等变换的证明 ,直观意义明显、易于理解 ,可用于线性代数教学 .     

Third order efficiency implies fourth order efficiency: A resolution of the conjecture of J. K. Ghosh

Under suitable regularity conditions, it is shown that a third order asymptotically efficient estimator is fourth order asymptotically efficient in some class of estimators in the sense that the estimator has the most concentration probability in any symmetric interval around the true parameter up to the fourth order in the class. This is a resolution of the conjecture by Ghosh (1994, Higher Order Asymptotics, Institute of Mathematical Statistics, Hayward, California). It is also shown that the bias-adjusted maximum likelihood estimator is fourth order asymptotically efficient in the class.     

Block plan for a fractional 2 m factorial design derived from a 2 r factorial design

Summary For a given fractional 2 ^m factorial (2 ^m -FF) designT, the constitution of a block plan to divideT intok (2 ^r−1<k≦2 ^r ) blocks withr block factors each at two levels is proposed and investigated. The well-known three norms of the confounding matrix are used as measures for determining a “good” block plan. Some theorems concerning the constitution of a block plan are derived for a 2 ^m -FF design of odd or even resolution. Two norms which may be preferred over the other norm are slightly modified. For each value ofN assemblies with 11≦N≦26, optimum block plans fork=2 blocks with block sizes [N/2] andN−[N/2] minimizing the two norms are presented forA-optimal balanced 2⁴-FF designs of resolutionV given by Srivastava and Chopra (Technometrics,13, 257–269).     

Achieving Optical Tri-Stability Through Periodic Metal-Dielectric Structure

Abstract

Through the modified transfer matrix method, the transmission properties of a one-dimensional coupled-resonator optical waveguide structure composed of metal layers and non-linear material layers is studied. Given proper incident frequency and structure parameters, an optical tri-stability has been achieved. The effect of loss has been considered.