activity
20032018
most citedThe peak algebra and the descent algebras of types B and D

56 citations · 75 across the 12 of their papers we have counts for

collaborators

13 papers

math.CO2018

Algebraic Voting Theory & Representations of

Hélène Barcelo, Megan Bernstein, Sarah Bockting-Conrad +3

We consider the problem of selecting an -member committee made up of one of candidates from each of distinct departments. Using an algebraic approach, we analyze positio…

math.CO2017

Fair division with multiple pieces

Kathryn Nyman, Francis Edward Su, Shira Zerbib

Given a set of players we consider problems concerning envy-free allocation of collections of pieces from a given set of goods or chores. We show that if and each…

math.CO2015★ 2 cited

Discrete Envy-free Division of Necklaces and Maps

Roberto Barrera, Kathryn Nyman, Amanda Ruiz +2

We study the discrete variation of the classical cake-cutting problem where n players divide a 1-dimensional cake with exactly (n-1) cuts, replacing the continuous, infinitely divi…

math.CO2013

Double-interval societies

Maria Klawe, Kathryn L. Nyman, Jacob N. Scott +1

Consider a society of voters, each of whom specify an approval set over a linear political spectrum. We examine double-interval societies, in which each person's approval set is re…

math.CO2011

Properties of Generalized Derangement Graphs

Hannah Jackson, Kathryn Nyman, Les Reid

A permutation sigma in Sn is a k-derangement if for any subset X = {a1, . . ., ak} \subseteq [n], {sigma(a1), . . ., sigma(ak)} is not equal to X. One can form the k-derangement gr…

math.CO2011★ 1 cited

Weighted pebbling numbers on graphs

Stephanie Jones, Joshua D. Laison, Cameron McLeman +1

We expand the theory of pebbling to graphs with weighted edges. In a weighted pebbling game, one player distributes a set amount of weight on the edges of a graph and his opponent…