On distance-regular Cayley graphs of generalized dicyclic groups

Let G be a generalized dicyclic group with identity 1. An inverse closed subset S of $G?\{1\}$ is called minimal if $〈S〉=G$ and there exists some $s\in S$ such that $〈S?\{s,s^{?1}\}〉\ne G$. In this paper, we characterize distance-regular Cayley graphs $\mathrm{Cay}(G,S)$ of G under the condition that S is minimal.     

On Generalized Douglas–Weyl(α, β)-Metrics

In this paper, we study generalized Douglas–Weyl(α, β)-metrics. Suppose that a regular(α, β)-metric F is not of Randers type. We prove that F is a generalized Douglas–Weyl metric with vanishing S-curvature if and only if it is a Berwald metric. Moreover, by ignoring the regularity, if F is not a Berwald metric, then we find a family of almost regular Finsler metrics which is not Douglas nor Weyl. As its application, we show that generalized Douglas–Weyl square metric or Matsumoto metric with isotropic mean Berwald curvature are Berwald metrics.     

Synthesis and Photophysical Properties of a Sc3N@C80‐Corrole Electron Donor–Acceptor Conjugate

Embedding endohdedral metallofullerenes (EMFs) into electron donor–acceptor systems is still a challenging task owing to their limited quantities and their still largely unexplored chemical properties. In this study, we have performed a 1,3‐dipolar cycloaddition reaction of a corrole‐based precursor with Sc₃N@C₈₀ to regioselectively form a [5,6]‐adduct ( 1 ). The successful attachment of the corrole moiety was confirmed by mass spectrometry. In the electronic ground state, absorption spectra suggest sizeable electronic communications between the electron acceptor and the electron donor. Moreover, the addition pattern occurring at a [5,6]‐bond junction is firmly proven by NMR spectroscopy and electrochemical investigations performed with 1 . In the electronically excited state, which is probed in photophysical assays with 1 , a fast electron‐transfer yields the radical ion pair state consisting of the one‐electron‐reduced Sc₃N@C₈₀ and of the one‐electron‐oxidized corrole upon its exclusive photoexcitation. As such, our results shed new light on the practical work utilizing EMFs as building blocks in photovoltaics.     

Recent Progress in the $L_p$ Theory for Elliptic and Parabolic Equations with Discontinuous Coefficients

In this paper, we review some results over the last 10-15 years on elliptic and parabolic equations with discontinuous coefficients. We begin with an approach given by N. V. Krylov to parabolic equations in the whole space with $\rm{VMO}_x$ coefficients. We then discuss some subsequent development including elliptic and parabolic equations with coefficients which are allowed to be merely measurable in one or two space directions, weighted $L_p$estimates with Muckenhoupt ($A_p$) weights, non-local elliptic and parabolic equations, as well as fully nonlinear elliptic and parabolic equations.     

Spectral estimates for saddle point matrices arising in weak constraint four‐dimensional variational data assimilation

We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds.     

Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.     

Inner derivations and norm equality

We characterize when the norm of the sum of two bounded operators on a Hilbert space is equal to the sum of their norms.