Asymptotic Distribution of Eigenvalues of Weakly Dilute Wishart Matrices

We study the eigenvalue distribution of large random matrices that are randomly diluted. We consider two random matrix ensembles that in the pure (nondilute) case have a limiting eigenvalue distribution with a singular component at the origin. These include the Wishart random matrix ensemble and Gaussian random matrices with correlated entries. Our results show that the singularity in the eigenvalue distribution is rather unstable under dilution and that even weak dilution destroys it. This revised version was published online in July 2006 with corrections to the Cover Date.     

Group-Theoretical Approach to Extended Conformal Supersymmetry: Function Space Realizations and Invariant Differential Operators

We give function space realizations of all representations of the conformal superalgebra su(2,2/N) and of the supergroup SU(2, 2 /N) induced from irreducible finite-dimensional Lorentz and SU(N) representations realized without spin and isospin indices. We use the lowest weight module structure of our su(2,2/N) representations to present a general procedure (adapted from the semisimple Lie algebra case) for the canonical construction of invariant differential operators closely related to the reducible (indecomposable) representations. All conformal supercovariant derivatives are obtained in this way. Examples of higher order invariant differential operators are given.     

Supersymmetry and SWKB Approach to Dirac Equation with Hyperbolic Scarf Potential

By using the supersymmetric quantum mechanics and shape invariance concept, we study the Dirac equation with the hyperbolic Scarf potential and the exact energy spectrum is obtained. Also, we calculate the bound state energy eigenvalues by using the supersymmetric WKB approximation approach so that we get the same results.     

New Approach to Find Exact Solutions to Classical Boussinesq System

In this paper, based on a new system of three Riccati equations, we give a new method to construct more new exact solutions of nonlinear differential equations in mathematical physics. The classical Boussinesq system is chosen to illustrate our method. As a consequence, more families of new exact solutions are obtained, which include solitary wave solutions and periodic solutions.     

New Approach to Find Exact Solutions to Classical Boussinesq System

In this paper, based on a new system of three Riccati equations, we give a new method to construct more new exact solutions of nonlinear differential equations in mathematical physics. The classical Boussinesq system is chosen to illustrate our method. As a consequence, more families of new exact solutions are obtained, which include solitary wave solutions and periodic solutions.     

Decompose Boolean Matrices with Correlation Clustering

One of the tasks of data science is the decomposition of large matrices in order to understand their structures. A special case of this is when we decompose relations, i.e., logical matrices. In this paper, we present a method based on the similarity of rows and columns, which uses correlation clustering to cluster the rows and columns of the matrix, facilitating the visualization of the relation by rearranging the rows and columns. In this article, we compare our method with Gunther Schmidt’s problems and solutions. Our method produces the original solutions by selecting its parameters from a small set. However, with other parameters, it provides solutions with even lower entropy.     

Some Exact Results on Bond Percolation

We present some exact results on bond percolation. We derive a relation that specifies the consequences for bond percolation quantities of replacing each bond of a lattice ?? by ? bonds connecting the same adjacent vertices, thereby yielding the lattice ?? _? . This relation is used to calculate the bond percolation threshold on ?? _? . We show that this bond inflation leaves the universality class of the percolation transition invariant on a lattice of dimensionality d??2 but changes it on a one-dimensional lattice and quasi-one-dimensional infinite-length strips. We also present analytic expressions for the average cluster number per vertex and correlation length for the bond percolation problem on the N???? limits of several families of N-vertex graphs. Finally, we explore the effect of bond vacancies on families of graphs with the property of bounded diameter as N????.     

Model Approach to the Description of Graphane Properties: Analytical Results

Physics of the Solid State - Analytical expressions for the dispersion of electron bands are obtained by the method of Green’s functions in the tight-binding approximation. A parabolic...     

Algebraic Supersymmetry: A Case Study

The treatment of supersymmetry is known to cause difficulties in the C^*–algebraic framework of relativistic quantum field theory; several no–go theorems indicate that super–derivations and super–KMS functionals must be quite singular objects in a C^*–algebraic setting. In order to clarify the situation, a simple supersymmetric chiral field theory of a free Fermi and Bose field defined on is analyzed. It is shown that a meaningful C^*–version of this model can be based on the tensor product of a CAR–algebra and a novel version of a CCR–algebra, the “resolvent algebra”. The elements of this resolvent algebra serve as mollifiers for the super–derivation. Within this model, unbounded (yet locally bounded) graded KMS–functionals are constructed and proven to be supersymmetric. From these KMS–functionals, Chern characters are obtained by generalizing formulae of Kastler and of Jaffe, Lesniewski and Osterwalder. The characters are used to define cyclic cocycles in the sense of Connes’ noncommutative geometry which are “locally entire”. Dedicated to Daniel Kastler on the occasion of his 80th birthday     

Entropy-Based Approach in Selection Exact String-Matching Algorithms

The string-matching paradigm is applied in every computer science and science branch in general. The existence of a plethora of string-matching algorithms makes it hard to choose the best one for any particular case. Expressing, measuring, and testing algorithm efficiency is a challenging task with many potential pitfalls. Algorithm efficiency can be measured based on the usage of different resources. In software engineering, algorithmic productivity is a property of an algorithm execution identified with the computational resources the algorithm consumes. Resource usage in algorithm execution could be determined, and for maximum efficiency, the goal is to minimize resource usage. Guided by the fact that standard measures of algorithm efficiency, such as execution time, directly depend on the number of executed actions. Without touching the problematics of computer power consumption or memory, which also depends on the algorithm type and the techniques used in algorithm development, we have developed a methodology which enables the researchers to choose an efficient algorithm for a specific domain. String searching algorithms efficiency is usually observed independently from the domain texts being searched. This research paper aims to present the idea that algorithm efficiency depends on the properties of searched string and properties of the texts being searched, accompanied by the theoretical analysis of the proposed approach. In the proposed methodology, algorithm efficiency is expressed through character comparison count metrics. The character comparison count metrics is a formal quantitative measure independent of algorithm implementation subtleties and computer platform differences. The model is developed for a particular problem domain by using appropriate domain data (patterns and texts) and provides for a specific domain the ranking of algorithms according to the patterns’ entropy. The proposed approach is limited to on-line exact string-matching problems based on information entropy for a search pattern. Meticulous empirical testing depicts the methodology implementation and purports soundness of the methodology.     

Supersymmetry approach to the random heteropolymer theory

The effective equation of motion that describes the different monomer alternation along the heteropolymer chain is proposed. On this basis the supersymmetry field scheme is built up to analyze memory and ergodicity breaking effects.     

Exact Results for Fully Directed Flights is s-Dimensions

The critical behaviour of s-dimensional fully directed flights (FDFs) is treated by a generating function method and an exact calculation method. Our results show that the exponents v, v_|| and v_⊥ of FDFs are independent of the spatial dimensionality and the concrete form of the probability distribution of step lengths. They are in agreement with the Laplacian transformation method and the Monte Carlo simulation study for fully directed Levy flights.     

Pseudo-Hermitian Supersymmetry: A Brief Review

We give a brief review of supersymmetic pseudo-Hermitian quantum mechanics and its statistical structure. We also elaborate on abnormal pseudo-Hermitian fermions that arise as the ingredients of one of the two basic realizations of pseudo-Hermitian supersymmetry and discuss the associated algebraic structures.     

An Interference Approach to Perturbed Angular Correlation Spectroscopy

This paper recalls the formalism of H. J. Leisi, which shows an alternative way to understand Perturbed Angular Correlation Spectroscopy: as a quantum interference effect. This revised version was published online in July 2006 with corrections to the Cover Date.