activity
20072025
most citedFast Fourier Transforms for Finite Inverse Semigroups

17 citations · 52 across the 12 of their papers we have counts for

collaborators

12 papers

cs.SD2025

Barwise Section Boundary Detection in Symbolic Music Using Convolutional Neural Networks

Omar Eldeeb, Martin Malandro

Current methods for Music Structure Analysis (MSA) focus primarily on audio data. While symbolic music can be synthesized into audio and analyzed using existing MSA techniques, suc…

cs.SD2025

The Florence Price Art Song Dataset and Piano Accompaniment Generator

Tao-Tao He, Martin E. Malandro, Douglas Shadle

Florence B. Price was a composer in the early 20th century whose music reflects her upbringing in the American South, her African heritage, and her Western classical training. She…

cs.SD2024

Composer's Assistant 2: Interactive Multi-Track MIDI Infilling with Fine-Grained User Control

Martin E. Malandro

We introduce Composer's Assistant 2, a system for interactive human-computer composition in the REAPER digital audio workstation. Our work upgrades the Composer's Assistant system…

cs.SD2023

Composer's Assistant: An Interactive Transformer for Multi-Track MIDI Infilling

Martin E. Malandro

We introduce Composer's Assistant, a system for interactive human-computer composition in the REAPER digital audio workstation. We consider the task of multi-track MIDI infilling w…

math.CO2018

Partial Difference Sets in

Martin E. Malandro, Ken W. Smith

We give an algorithm for enumerating the regular nontrivial partial difference sets (PDS) in the group . We use our algorithm to obtain all of these PD…

math.CO2013★ 9 cited

Enumeration of finite inverse semigroups

Martin E. Malandro

We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This i…

math.GR2012

Fourier inversion for finite inverse semigroups

Martin E. Malandro

This paper continues the study of Fourier transforms on finite inverse semigroups, with a focus on Fourier inversion theorems and FFTs for new classes of inverse semigroups. We beg…

math.ST2011★ 10 cited

Inverse semigroup spectral analysis for partially ranked data

Martin E. Malandro

Motivated by the notion of symmetric group spectral analysis developed by Diaconis, we introduce the notion of spectral analysis on the rook monoid (also called the symmetric inver…

math.CO2011★ 6 cited

Integer compositions with part sizes not exceeding k

Martin E. Malandro

We study the compositions of an integer n whose part sizes do not exceed a fixed integer k. We use the methods of analytic combinatorics to obtain precise asymptotic formulas for t…

math.CO2011★ 1 cited

Algebraic and combinatorial aspects of sandpile monoids on directed graphs

Scott Chapman, Rebecca Garcia, Luis David García-Puente +2

The sandpile group of a graph is a well-studied object that combines ideas from algebraic graph theory, group theory, dynamical systems, and statistical physics. A graph's sandpile…

math.GR2009★ 17 cited

Fast Fourier Transforms for Finite Inverse Semigroups

Martin Malandro

We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite…

math.RT2007★ 9 cited

Fast Fourier Transforms for the Rook Monoid

Martin Malandro, Daniel N. Rockmore

We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourie…