Eigenvalues of Hermite and Laguerre ensembles: large beta asymptotics

In this paper we examine the zero and first order eigenvalue fluctuations for the β-Hermite and β-Laguerre ensembles, using tridiagonal matrix models, in the limit as β→∞. We prove that the fluctuations are described by multivariate Gaussians of covariance O(1/β), centered at the roots of a corresponding Hermite (Laguerre) polynomial. The covariance matrix itself is expressed as combinations of Hermite or Laguerre polynomials respectively.We show that the approximations are of real value even for small β; we can use them to approximate the true functions even for the traditional β=1,2,4 values.     

Synthesis and gas barrier characterization of poly(ethylene isophthalate)

Poly(ethylene isophthalate) (PEI) was synthesized for this research with essentially a condensation polymerization of isophthalic acid and ethylene glycol catalyzed by zinc acetate and antimony trioxide. Several samples were obtained, and their characteristics were observed and compared with poly(ethylene terephthalate) (PET). The synthesized PEI samples were chemically identified by ¹H NMR. Thermal analysis with differential scanning calorimetry (DSC) yielded results that indicate the samples were primarily amorphous, with a glass‐transition temperature of 55–60 °C. Molecular weights of these PEI samples were also obtained through intrinsic viscosity measurements (Mark–Houwink equation). Molecular weights varied with conditions of the polymerization, and the highest molecular weight achieved was 21,000 g/mol. Finally, the diffusion coefficient, solubility, and permeability of CO₂ gas in PEI were measured and found to be substantially lower than in PET, as anticipated from their isomeric chemical structures. This is because in PET the phenyl rings are substituted in the para (1,4) positions, which allows for their facile flipping, effectively permitting gases to pass through. However, the meta‐substituted phenyl rings in PEI do not permit such ring flipping, and thus PEI may be more suitable for barrier applications. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 4247–4254, 2004     

Backward extensions of subnormal operators

The concept of backward extension for subnormal weighted shifts is generalized to arbitrary subnormal operators. Several differences and similarities in these contexts are explored, with emphasis on the structure of the underlying measures.

     

Asymptotic Correction of More Sturm–Liouville Eigenvalue Estimates

The asymptotic correction technique of Paine, de Hoog and Anderssen can dramatically improve the accuracy of finite difference or finite element eigenvalues at negligible extra cost if closed form expressions are available for the errors in a simpler related problem. This paper gives closed form expressions for the errors in the eigenvalues of certain Sturm–Liouville problems obtained by various methods, thereby increasing the range of problems for which asymptotic correction can achieve maximum efficiency. It also investigates implementation of the method for more general problems.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007