activity
20072025
most citedN-person envy-free chore division

9 citations · 31 across the 8 of their papers we have counts for

collaborators

8 papers

cs.CR2025

AI Bill of Materials and Beyond: Systematizing Security Assurance through the AI Risk Scanning (AIRS) Framework

Samuel Nathanson, Alexander Lee, Catherine Chen Kieffer +7

Assurance for artificial intelligence (AI) systems remains fragmented across software supply-chain security, adversarial machine learning, and governance documentation. Existing tr…

math.HO2009★ 5 cited

Unshackling Linear Algebra from Linear Notation

Elisha Peterson

This paper provides an introduction to trace diagrams at a level suitable for advanced undergraduates. Trace diagrams are a non-traditional notation for linear algebra. Vectors are…

math.CO2009★ 9 cited

N-person envy-free chore division

Elisha Peterson, Francis Edward Su

In contrast to the classical cake-cutting problem (how to fairly divide a desirable object), "chore division" is the problem of how to divide an undesirable object. We develop the…

cs.GT2009★ 3 cited

Cooperation in Subset Team Games: Altruism and Selfishness

Elisha Peterson

This paper extends the theory of subset team games, a generalization of cooperative game theory requiring a payoff function that is defined for all subsets of players. This subset…

math.RA2009★ 8 cited

On A Diagrammatic Proof of the Cayley-Hamilton Theorem

Elisha Peterson

This note concerns a one-line diagrammatic proof of the Cayley-Hamilton Theorem. We discuss the proof's implications regarding the "core truth" of the theorem, and provide a genera…

math.QA2009★ 1 cited

Computing SL(2,C) Central Functions with Spin Networks

Sean Lawton, Elisha Peterson

Let G=SL(2,C) and F_r be a rank r free group. Given an admissible weight in N^{3r-3}, there exists a class function defined on Hom(F_r,G) called a central function. We show that th…