ANALYZING SONG STRUCTURE WITH SPECTRAL CLUSTERING Brian McFee Center for Jazz Studies Columbia University

Source URL: bmcfee.github.io

• Matrix theory
• Algebraic graph theory
• Spectral clustering
• Graph partition
• Spectral graph theory
• Eigenvalues and eigenvectors
• Image segmentation
• Matrix
• Self-similarity matrix
• Graph theory
• Eigendecomposition of a matrix

PARITY OF THE PARTITION FUNCTION IN ARITHMETIC PROGRESSIONS, II Matthew Boylan and Ken Ono Appearing in the Bulletin of the London Mathematical Society. Abstract. Let p(n) denote the ordinary partition function. Subbarao

Source URL: www.mathcs.emory.edu

ASYMPTOTIC ENUMERATION OF NON-CROSSING PARTITIONS ON SURFACES? ´ IGNASI SAU, AND DIMITRIOS M. THILIKOS JUANJO RUE, Abstract. We generalize the notion of non-crossing partition on a disk to general surfaces

Source URL: www-ma2.upc.edu

CONGRUENCE PROPERTIES FOR THE PARTITION FUNCTION Scott Ahlgren Ken Ono

Source URL: www.mathcs.emory.edu

ON THE POSITIVITY OF THE NUMBER OF t−CORE PARTITIONS Ken Ono Abstract. A partition of a positive integer n is a nonincreasing sequence of positive integers whose sum is n. A Ferrers graph represents a partition in the

Source URL: www.mathcs.emory.edu

COMPUTING THE PARTITION FUNCTION FOR PERFECT MATCHINGS IN A HYPERGRAPH Alexander Barvinok and Alex Samorodnitsky September 2011 Abstract. Given non-negative weights wS on the k-subsets S of a km-element

Source URL: www.math.lsa.umich.edu

• Graph theory
• Mathematics
• Hypergraphs
• Bipartite graph
• Line graph
• Matching
• Graph factorization
• Permanent
• Line graph of a hypergraph
• Packing in a hypergraph

COLLINEAR CLUSTER TRI-PARTITION – POSSIBLE PHYSICS BEHIND Yu.V. Pyatkov1, 2, D.V. Kamanin1 1 Joint Institute for Nuclear Research, Dubna, Russia National Nuclear Research University «MEPHI», Moscow, Russia

Source URL: isinn.jinr.ru

PARITY OF THE PARTITION FUNCTION Ken Ono Abstract. Let p(n) denote the number of partitions of a non-negative integer n. A well-known conjecture asserts that every arithmetic progression contains infinitely many integer

Source URL: www.mathcs.emory.edu

BIPARTITIONS OF HIGHLY CONNECTED TOURNAMENTS ¨ JAEHOON KIM, DANIELA KUHN, DERYK OSTHUS Abstract. We show that if T is a strongly 109 k6 log(2k)-connected tournament, there exists a partition A, B of V (T ) such that eac

Source URL: web.mat.bham.ac.uk

DIVISIBILITY OF CERTAIN PARTITION FUNCTIONS BY POWERS OF PRIMES Basil Gordon and Ken Ono Dedicated to the memory of Nathan Fine am

Source URL: www.mathcs.emory.edu