Symmetric nonnegative realizability via partitioned majorization

A sufficient condition for symmetric nonnegative realizability of a spectrum is given in terms of (weak) majorization of a partition of the negative eigenvalues by a selection of the positive eigenvalues. If there are more than two positive eigenvalues, an additional condition, besides majorization, is needed on the partition. This generalizes observations of Suleǐmanova and Loewy about the cases of one and two positive eigenvalues, respectively. It may be used to provide insight into realizability of 5-element spectra and beyond.     

Accelerating electromagnetic magic field from the C-metric

Various aspects of the C-metric representing two rotating charged black holes accelerated in opposite directions are summarized and its limits are considered. A particular attention is paid to the special-relativistic limit in which the electromagnetic field becomes the “magic field” of two oppositely accelerated rotating charged relativistic discs. When the acceleration vanishes the usual electromagnetic magic field of the Kerr–Newman black hole with gravitational constant set to zero arises. Properties of the accelerated discs and the fields produced are studied and illustrated graphically. The charges at the rim of the accelerated discs move along spiral trajectories with the speed of light. If the magic field has some deeper connection with the field of the Dirac electron, as is sometimes conjectured because of the same gyromagnetic ratio, the “accelerating magic field” represents the electromagnetic field of a uniformly accelerated spinning electron. It generalizes the classical Born’s solution for two uniformly accelerated monopole charges.     

On the cut‐off phenomenon for the transitivity of randomly generated subgroups

Consider K ≥ 2 independent copies of the random walk on the symmetric group S_N starting from the identity and generated by the products of either independent uniform transpositions or independent uniform neighbor transpositions. At any time $n\in \mathbb{N}$, let G_n be the subgroup of S_N generated by the K positions of the chains. In the uniform transposition model, we prove that there is a cut‐off phenomenon at time N ln(N)/(2K) for the non‐existence of fixed point of G_n and for the transitivity of G_n, thus showing that these properties occur before the chains have reached equilibrium. In the uniform neighbor transposition model, a transition for the non‐existence of a fixed point of G_n appears at time of order $N^{1+\frac{2}{K}}$ (at least for K ≥ 3), but there is no cut‐off phenomenon. In the latter model, we recover a cut‐off phenomenon for the non‐existence of a fixed point at a time proportional to N by allowing the number K to be proportional to ln(N). The main tools of the proofs are spectral analysis and coupling techniques. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012     

Path-following interior point algorithms for the Cartesian <Emphasis Type="Italic">P</Emphasis><Subscript>*</Subscript>(κ)-LCP over symmetric cones

In this paper, we establish a theoretical framework of path-following interior point algorithms for the linear complementarity problems over symmetric cones (SCLCP) with the Cartesian P _*(κ)-property, a weaker condition than the monotonicity. Based on the Nesterov-Todd, xy and yx directions employed as commutative search directions for semidefinite programming, we extend the variants of the short-, semilong-, and long-step path-following algorithms for symmetric conic linear programming proposed by Schmieta and Alizadeh to the Cartesian P _*(κ)-SCLCP, and particularly show the global convergence and the iteration complexities of the proposed algorithms. This work was supported by National Natural Science Foundation of China (Grant Nos. 10671010, 70841008)     

On an open problem of Sankaranarayanan

Let λ(n) be the n-th normalized Fourier coeficient of a holomorphic Hecke eigenform f(z) ∈ Sk(Γ) for the full modular group.In one of his papers,Sankaranarayanan mentioned that it is an open problem to give a non-trivial estimate for the sum of λ(n) over cubes,i.e.n x λ(n3).In this paper,we are able to use the analytic properties of symmetric power L-functions to solve his problem.More precisely,we prove that Σn≤zλ(n3) x(3/4 +ε),Σn≤zλ(n4) x(97+ε).     

A Polynomial Complexity Optimal Multiuser Detection Algorithm Based on Monotonicity Properties

An optimal multiuser detection algorithm with a computational complexity of O(K log K) is proposed for the class of linear multiple‐access systems which have constant cross‐correlation values. Here the optimal multiuser detection is implemented by searching for a monotone sequence with maximum likelihood, under the ranking of sufficient statistics. The proposed algorithm is intuitive and concise. It is carried out in just two steps, and at each step only one kind of operation is performed. Also, the proposed algorithm can be extended to more complex systems having more than a single cross‐correlation value.     

Binding energy of an off-center donor impurity in ellipsoidal quantum dot with parabolic confinement potential

The binding energy of an off-center hydrogenic donor impurity in weakly oblate Ellipsoidal Quantum Dot (EQD), using the expansion method within the framework of effective mass approximation in strong confinement, is investigated. In this regard, the binding energies of different states of GaAs structures, as functions of the donor position and ellipticity parameter, are calculated. The results show that variations of binding energies are proportional to the ellipticity constant, the dot dimension and the location of impurity.     

Systematic Study of Selected Diagonalization Methods for Configuration Interaction Matrices

Several modifications to the Davidson algorithm are systematically explored to establish their performance for an assortment of configuration interaction (CI) computations. The combination of a generalized Davidson method, a periodic two‐vector subspace collapse, and a blocked Davidson approach for multiple roots is determined to retain the convergence characteristics of the full subspace method. This approach permits the efficient computation of wave functions for large‐scale CI matrices by eliminating the need to ever store more than three expansion vectors ( b _i) and associated matrix‐vector products ( σ _i), thereby dramatically reducing the I/O requirements relative to the full subspace scheme. The minimal‐storage, single‐vector method of Olsen is found to be a reasonable alternative for obtaining energies of well‐behaved systems to within μE_h accuracy, although it typically requires around 50% more iterations and at times is too inefficient to yield high accuracy (ca. 10^?10 E_h) for very large CI problems. Several approximations to the diagonal elements of the CI Hamiltonian matrix are found to allow simple on‐the‐fly computation of the preconditioning matrix, to maintain the spin symmetry of the determinant‐based wave function, and to preserve the convergence characteristics of the diagonalization procedure. © 2001 John Wiley & Sons, Inc. J Comput Chem 22: 1574–1589, 2001     

The Campbell- Hausdorff Series of Local Analytic Bruck Loops

The class of local analyitic Bruck loops (or equivalently K-loops) is strongly related to locally symmetric spaces. In particular, both have Lie triple systems as their tangent algebra. In this paper, we consider the existence and some properties of the Campbell-Hausdorff series of local analytic Bruck loops (K-loops). This formula can be used to determine the local symmetries of the associated symmetric space.     

On Some Extremal Properties of Lagrange Interpolatory Polynomials

In this paper, we will show that Lagrange interpolatory polynomials are optimal for solving some approximation theory problems concerning the finding of linear widths.In particular, we will show that

Full-size image

, where _n is a set of the linear operators with finite rank n+1 defined on −1,1], and where _n+1 denotes the set of polynomials p=∑_i=0ⁿ⁺¹a_ixⁱ of degreen+1 such that a_n+11. The infimum is achieved for Lagrange interpolatory polynomial for nodes .