552 research outputs found

    Gordon Hirabayashi v. United States: This is an American case

    Get PDF

    An elementary approach to toy models for D. H. Lehmer's conjecture

    Full text link
    In 1947, Lehmer conjectured that the Ramanujan's tau function τ(m)\tau (m) never vanishes for all positive integers mm, where τ(m)\tau (m) is the mm-th Fourier coefficient of the cusp form Δ24\Delta_{24} of weight 12. The theory of spherical tt-design is closely related to Lehmer's conjecture because it is shown, by Venkov, de la Harpe, and Pache, that τ(m)=0\tau (m)=0 is equivalent to the fact that the shell of norm 2m2m of the E8E_{8}-lattice is a spherical 8-design. So, Lehmer's conjecture is reformulated in terms of spherical tt-design. Lehmer's conjecture is difficult to prove, and still remains open. However, Bannai-Miezaki showed that none of the nonempty shells of the integer lattice \ZZ^2 in \RR^2 is a spherical 4-design, and that none of the nonempty shells of the hexagonal lattice A2A_2 is a spherical 6-design. Moreover, none of the nonempty shells of the integer lattices associated to the algebraic integers of imaginary quadratic fields whose class number is either 1 or 2, except for \QQ(\sqrt{-1}) and \QQ(\sqrt{-3}) is a spherical 2-design. In the proof, the theory of modular forms played an important role. Recently, Yudin found an elementary proof for the case of \ZZ^{2}-lattice which does not use the theory of modular forms but uses the recent results of Calcut. In this paper, we give the elementary (i.e., modular form free) proof and discuss the relation between Calcut's results and the theory of imaginary quadratic fields.Comment: 18 page

    New Algorithms for Position Heaps

    Full text link
    We present several results about position heaps, a relatively new alternative to suffix trees and suffix arrays. First, we show that, if we limit the maximum length of patterns to be sought, then we can also limit the height of the heap and reduce the worst-case cost of insertions and deletions. Second, we show how to build a position heap in linear time independent of the size of the alphabet. Third, we show how to augment a position heap such that it supports access to the corresponding suffix array, and vice versa. Fourth, we introduce a variant of a position heap that can be simulated efficiently by a compressed suffix array with a linear number of extra bits

    NcPred for accurate nuclear protein prediction using n-mer statistics with various classification algorithms

    Get PDF
    Prediction of nuclear proteins is one of the major challenges in genome annotation. A method, NcPred is described, for predicting nuclear proteins with higher accuracy exploiting n-mer statistics with different classification algorithms namely Alternating Decision (AD) Tree, Best First (BF) Tree, Random Tree and Adaptive (Ada) Boost. On BaCello dataset [1], NcPred improves about 20% accuracy with Random Tree and about 10% sensitivity with Ada Boost for Animal proteins compared to existing techniques. It also increases the accuracy of Fungal protein prediction by 20% and recall by 4% with AD Tree. In case of Human protein, the accuracy is improved by about 25% and sensitivity about 10% with BF Tree. Performance analysis of NcPred clearly demonstrates its suitability over the contemporary in-silico nuclear protein classification research

    Convergence to equilibrium under a random Hamiltonian

    Get PDF
    We analyze equilibration times of subsystems of a larger system under a random total Hamiltonian, in which the basis of the Hamiltonian is drawn from the Haar measure. We obtain that the time of equilibration is of the order of the inverse of the arithmetic average of the Bohr frequencies. To compute the average over a random basis, we compute the inverse of a matrix of overlaps of operators which permute four systems. We first obtain results on such a matrix for a representation of an arbitrary finite group and then apply it to the particular representation of the permutation group under consideration.Comment: 11 pages, 1 figure, v1-v3: some minor errors and typos corrected and new references added; v4: results for the degenerated spectrum added; v5: reorganized and rewritten version; to appear in PR
    • 

    corecore