55,642 research outputs found

    Sequential Complexity as a Descriptor for Musical Similarity

    Get PDF
    We propose string compressibility as a descriptor of temporal structure in audio, for the purpose of determining musical similarity. Our descriptors are based on computing track-wise compression rates of quantised audio features, using multiple temporal resolutions and quantisation granularities. To verify that our descriptors capture musically relevant information, we incorporate our descriptors into similarity rating prediction and song year prediction tasks. We base our evaluation on a dataset of 15500 track excerpts of Western popular music, for which we obtain 7800 web-sourced pairwise similarity ratings. To assess the agreement among similarity ratings, we perform an evaluation under controlled conditions, obtaining a rank correlation of 0.33 between intersected sets of ratings. Combined with bag-of-features descriptors, we obtain performance gains of 31.1% and 10.9% for similarity rating prediction and song year prediction. For both tasks, analysis of selected descriptors reveals that representing features at multiple time scales benefits prediction accuracy.Comment: 13 pages, 9 figures, 8 tables. Accepted versio

    Proof of a Conjectured Three-Valued Family of Weil Sums of Binomials

    Full text link
    We consider Weil sums of binomials of the form WF,d(a)=xFψ(xdax)W_{F,d}(a)=\sum_{x \in F} \psi(x^d-a x), where FF is a finite field, ψ ⁣:FC\psi\colon F\to {\mathbb C} is the canonical additive character, gcd(d,F×)=1\gcd(d,|F^\times|)=1, and aF×a \in F^\times. If we fix FF and dd and examine the values of WF,d(a)W_{F,d}(a) as aa runs through F×F^\times, we always obtain at least three distinct values unless dd is degenerate (a power of the characteristic of FF modulo F×|F^\times|). Choices of FF and dd for which we obtain only three values are quite rare and desirable in a wide variety of applications. We show that if FF is a field of order 3n3^n with nn odd, and d=3r+2d=3^r+2 with 4r1(modn)4 r \equiv 1 \pmod{n}, then WF,d(a)W_{F,d}(a) assumes only the three values 00 and ±3(n+1)/2\pm 3^{(n+1)/2}. This proves the 2001 conjecture of Dobbertin, Helleseth, Kumar, and Martinsen. The proof employs diverse methods involving trilinear forms, counting points on curves via multiplicative character sums, divisibility properties of Gauss sums, and graph theory.Comment: 19 page
    corecore