Inverse semigroup spectral analysis for partially ranked data

  title={Inverse semigroup spectral analysis for partially ranked data},
  author={Martin E. Malandro},
  journal={Applied and Computational Harmonic Analysis},
  • Martin E. Malandro
  • Published 25 October 2011
  • Mathematics
  • Applied and Computational Harmonic Analysis

Tables from this paper

Fourier Inversion for Finite Inverse Semigroups
This paper introduces four inverse semigroup generalizations of the Fourier inversion theorem for finite groups, and describes a general approach to the construction of fast inverse Fourier transforms for finite inverse semigroups complementary to an approach to FFTs given in previous work.
The Efficient Computation of Fourier Transforms on Semisimple Algebras
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best
Approximating monoid actions by group actions.
Let $M$ be a monoid. We construct a family of model structures on the category of $M$-spaces. The weak equivalences of these model categories are defined by using the universally assigned groups
Simplicity of Augmentation Submodules for Transformation Monoids
For finite permutation groups, simplicity of the augmentation submodule is equivalent to 2-transitivity over the field of complex numbers. We note that this is not the case for transformation
The Global Dimension of the full Transformation Monoid (with an Appendix by V. Mazorchuk and B. Steinberg)
The representation theory of the symmetric group has been intensively studied for over 100 years and is one of the gems of modern mathematics. The full transformation monoid 𝔗n$\mathfrak {T}_{n}$
Homotopical categories of spaces with monoid actions
Let $M$ be a monoid. We construct a family of homotopical category structures on the category of $M$-spaces. Moreover, we show that each of these homotopical categories is a Brown's category of
Signal Processing on the Permutahedron: Tight Spectral Frames for Ranked Data Analysis
Ranked data sets, where m judges/voters specify a preference ranking of n objects/candidates, are increasingly prevalent in contexts such as political elections, computer vision, recommender systems,
  • 2015


The characters of the symmetric inverse semigroup
  • W. Munn
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 1957
There are two natural analogues of the symmetric group on n symbols in the theory of semigroups, namely, the set of all mappings of a set of n symbols into itself, and the set of all partial
Fast Fourier transforms for the rook monoid
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 Fourier transforms, or
A natural partial order for semigroups
A partial order on a semigroup (S, ) is called natural if it is defined by means of the multiplication of S. It is shown that for any semigroup (S, ) the relation a < b iff a = xb = by, xa = a for
Matrix representations of semigroups
  • W. Munn
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 1957
In a previous paper, the author gave necessary and sufficient conditions for the algebra of a finite semigroup S over a field of suitable characteristic to be semisimple. When this algebra is
A Generalization of Spectral Analysis with Application to Ranked Data
An analog of the spectral analysis of time series is developed for data in general spaces. This is applied to data from an election in which 5738 people rank ordered five candidates. Group theoretic
The Representation Type of the Full Transforamtion Semigroup T4
T n be the semigroup of all transformations of a set of n elements and k a field of characteristic 0. According to Ponizovskii, the semigroup algebra kTn is of finite representation type if n≤ 3.
The algebraic theory of semigroups
This book, along with volume I, which appeared previously, presents a survey of the structure and representation theory of semi groups. Volume II goes more deeply than was possible in volume I into
The efficient computation of Fourier transforms on the symmetric group
This paper replaces the matrix multiplications in Clausen's algorithm with sums indexed by combinatorial objects that generalize Young tableaux, and writes the result in a form similar to Horner's rule.