Michael E. Orrison
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Michael E. Orrison has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Karl-Dieter Crisman
Department of Mathematics and Computer Science Gordon College Wenham MA USA
2 shared publications - Matthew B. A. McDermott
Department of Biomedical Informatics, Columbia University, New York, NY, USA
2 shared publications - Michael Hansen
Rover, Seattle, USA
2 shared publications - Sarah Wolff
Denison University
2 shared publications - Aaron Meyers1 shared publication
- Alan Kappler1 shared publication
Latest Publications
- 1 October 2025
- Published by American Mathematical Society (AMS) in Notices of the American Mathematical Society
- Vol. 72 (09)
Voting on Relations Using Pairs Information
Rather than analyzing the attributes of voting procedures, we present a common framework within which to understand and juxtapose various methods. This framework allows us to draw surprising connections between disparate procedures presented in a wide range of papers spanning several decades.
- 1 October 2025
- Published by American Mathematical Society (AMS) in Notices of the American Mathematical Society
- Vol. 72 (09)
Voting on Relations Using Pairs Information
Rather than analyzing the attributes of voting procedures, we present a common framework within which to understand and juxtapose various methods. This framework allows us to draw surprising connections between disparate procedures presented in a wide range of papers spanning several decades.
- Open Access
Preference-restricted parking functions
A parking function is a function $π:[n]\to [n]$ whose $i$th-smallest output is at most $i,$ corresponding to a parking procedure for $n$ cars on a one-way street. We refine this concept by introducing preference-restricted parking functions, which are parking functions with codomain restricted to some $S\subseteq[n]$. Particular choices of $S$ yield new combinatorial interpretations of previous results about variant parking procedures, and new results too. In particular we consider prime parking functions, parking procedures with fewer spots than cars, and parking functions where each spot has space for multiple cars. We also use restricted parking functions to reprove Abel's binomial theorem.Open AccessPreference-restricted parking functions
A parking function is a function $π:[n]\to [n]$ whose $i$th-smallest output is at most $i,$ corresponding to a parking procedure for $n$ cars on a one-way street. We refine this concept by introducing preference-restricted parking functions, which are parking functions with codomain restricted to some $S\subseteq[n]$. Particular choices of $S$ yield new combinatorial interpretations of previous results about variant parking procedures, and new results too. In particular we consider prime parking functions, parking procedures with fewer spots than cars, and parking functions where each spot has space for multiple cars. We also use restricted parking functions to reprove Abel's binomial theorem. - 3 September 2021
- Published by Springer Nature in Journal of Fourier Analysis and Applications
- Vol. 27 (5) , 1-21
Computational Bounds for Doing Harmonic Analysis on Permutation Modules of Finite Groups
- 3 September 2021
- Published by Springer Nature in Journal of Fourier Analysis and Applications
- Vol. 27 (5) , 1-21
Computational Bounds for Doing Harmonic Analysis on Permutation Modules of Finite Groups
- Open Access
Computational Bounds for Doing Harmonic Analysis on Permutation Modules of Finite Groups
We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of permutation modules, and it uses the multiplicities of irreducible submodules within individual orbital spaces to express the resulting computational bounds. We conclude by showing that these bounds are surprisingly small when dealing with certain permutation modules arising from the action of the symmetric group on tabloids.
Open AccessComputational Bounds for Doing Harmonic Analysis on Permutation Modules of Finite Groups
We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of permutation modules, and it uses the multiplicities of irreducible submodules within individual orbital spaces to express the resulting computational bounds. We conclude by showing that these bounds are surprisingly small when dealing with certain permutation modules arising from the action of the symmetric group on tabloids.
- Open Access
Quantum Enhancements and Biquandle Brackets
We introduce a new class of quantum enhancements we call biquandle brackets, which are customized skein invariants for biquandle colored links.Quantum enhancements of biquandle counting invariants form a class of knot and link invariants that includes biquandle cocycle invariants and skein invariants such as the HOMFLY-PT polynomial as special cases, providing an explicit unification of these apparently unrelated types of invariants. We provide examples demonstrating that the new invariants are not determined by the biquandle counting invariant, the knot quandle, the knot group or the traditional skein invariants.
Open AccessQuantum Enhancements and Biquandle Brackets
We introduce a new class of quantum enhancements we call biquandle brackets, which are customized skein invariants for biquandle colored links.Quantum enhancements of biquandle counting invariants form a class of knot and link invariants that includes biquandle cocycle invariants and skein invariants such as the HOMFLY-PT polynomial as special cases, providing an explicit unification of these apparently unrelated types of invariants. We provide examples demonstrating that the new invariants are not determined by the biquandle counting invariant, the knot quandle, the knot group or the traditional skein invariants.
- Open Access
Representation Theory of the Symmetric Group in Voting Theory and Game Theory
This paper is a survey of some of the ways in which the representation theory of the symmetric group has been used in voting theory and game theory. In particular, we use permutation representations that arise from the action of the symmetric group on tabloids to describe, for example, a surprising relationship between the Borda count and Kemeny rule in voting. We also explain a powerful representation-theoretic approach to working with linear symmetric solution concepts in cooperative game theory. Along the way, we discuss new research questions that arise within and because of the representation-theoretic framework we are using.
Open AccessRepresentation Theory of the Symmetric Group in Voting Theory and Game Theory
This paper is a survey of some of the ways in which the representation theory of the symmetric group has been used in voting theory and game theory. In particular, we use permutation representations that arise from the action of the symmetric group on tabloids to describe, for example, a surprising relationship between the Borda count and Kemeny rule in voting. We also explain a powerful representation-theoretic approach to working with linear symmetric solution concepts in cooperative game theory. Along the way, we discuss new research questions that arise within and because of the representation-theoretic framework we are using.
- 14 September 2013
- Published by Springer Nature in Social Choice and Welfare
- Vol. 43 (1) , 11-27
Generalized Condorcet winners
- 14 September 2013
- Published by Springer Nature in Social Choice and Welfare
- Vol. 43 (1) , 11-27
Generalized Condorcet winners
- 29 June 2006
- Published by Springer Nature in Public Choice
- Vol. 128 (3) , 361-366
Dead Heat: The 2006 Public Choice Society Election
- 29 June 2006
- Published by Springer Nature in Public Choice
- Vol. 128 (3) , 361-366
Dead Heat: The 2006 Public Choice Society Election
- Open Access
- 7 January 2006
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 13 (1) , R9
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In this paper, we define the linear complexity of a graph to be the linear complexity of any one of its associated adjacency matrices. We then compute or give upper bounds for the linear complexity of several classes of graphs.
- 7 January 2006
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 13 (1) , R9
Open AccessThe Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In this paper, we define the linear complexity of a graph to be the linear complexity of any one of its associated adjacency matrices. We then compute or give upper bounds for the linear complexity of several classes of graphs.
- 1 January 2006
- Published by Walter de Gruyter GmbH in Forum Mathematicum
- Vol. 18 (3) , 419-425
Reflections acting efficiently on a building
We show how Radon transforms may be used to apply eciently the class sum of reflections in the finite general linear group GLn(Fq) to vectors in permutation modules arising from the action of GLn(Fq) on the building of type An 1(Fq).
- 1 January 2006
- Published by Walter de Gruyter GmbH in Forum Mathematicum
- Vol. 18 (3) , 419-425
Reflections acting efficiently on a building
We show how Radon transforms may be used to apply eciently the class sum of reflections in the finite general linear group GLn(Fq) to vectors in permutation modules arising from the action of GLn(Fq) on the building of type An 1(Fq).