activity
20052026
most citedA combinatorial model for computing volumes of flow polytopes

17 citations · 60 across the 22 of their papers we have counts for

collaborators

26 papers

math.NT2026

Densities of arithmetic Hecke triangle group orbits

Samantha Fairchild, Christopher R. H. Hanusa

We give new proofs computing the asymptotic densities for orbits of the arithmetic Hecke triangle groups when and . We use elementary number theory techniques alon…

math.CO2025

Permutation Flows I: Triangulations of Flow Polytopes (Research Announcement)

Rafael S. González D'León, Christopher R. H. Hanusa, Martha Yip

We introduce a new broadly unifying family of combinatorial objects, which we call permutation flows, associated to an acyclic directed graph together with a framing . This…

math.CO2024★ 1 cited

A Triangulation of the Flow Polytope of the Zigzag Graph

Rachel Brunner, Christopher R. H. Hanusa

We show that the dual graph of the triangulation of the flow polytope of the zigzag graph adorned with the length-reverse-length framing is a subgraph of a grid graph. Through Mész…

cs.OH2024★ 1 cited

Applying the Iterative Development Process: The Creation of Fractal Emergence

Christopher R. H. Hanusa, Eric Vergo

The iterative development process is a framework used to design products and applications across a wide range of domains. It centers around building prototypes, testing them, and u…

math.HO2022

Encouraging student creativity in mathematics through 3D design and 3D printing

Christopher R. H. Hanusa

This is a case study of teaching 3D design and 3D printing in a project-based computing course for undergraduate math majors. This article discusses content organization, implement…

math.CO2021

Column convex matrices, -cyclic orders, and flow polytopes

Rafael S. González D'León, Christopher R. H. Hanusa, Alejandro H. Morales +1

We study polytopes defined by inequalities of the form for and nonnegative where the inequalities can be reordered into a matrix…

math.CO2020★ 4 cited

Kostant's partition function and magic multiplex juggling sequences

Carolina Benedetti, Christopher R. H. Hanusa, Pamela E. Harris +2

Kostant's partition function is a vector partition function that counts the number of ways one can express a weight of a Lie algebra as a nonnegative integral linear…

math.CO2019

A q-queens problem. VII. Combinatorial types of nonattacking chess riders

Christopher R. H. Hanusa, Thomas Zaslavsky

On a convex polygonal chessboard, the number of combinatorial types of nonattacking configuration of three identical chess riders with moves, such as queens, bishops, or nightr…

math.CO2019

A billiards-like dynamical system for attacking chess pieces

Christopher R. H. Hanusa, Arvind V. Mahankali

We apply a one-dimensional discrete dynamical system originally considered by Arnol'd reminiscent of mathematical billiards to the study of two-move riders, a type of fairy chess p…

math.CO2018★ 1 cited

A -Queens Problem. IV. Attacking Configurations and Their Denominators

Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky

In Parts I-III we showed that the number of ways to place nonattacking queens or similar chess pieces on an chessboard is a quasipolynomial function of whose co…

math.CO2018★ 17 cited

A combinatorial model for computing volumes of flow polytopes

Carolina Benedetti, Rafael S. González D'León, Christopher R. H. Hanusa +4

We introduce new families of combinatorial objects whose enumeration computes volumes of flow polytopes. These objects provide an interpretation, based on parking functions, of Bal…

math.CO2017

Lecture hall partitions and the affine hyperoctahedral group

Christopher R. H. Hanusa, Carla D. Savage

In 1997 Bousquet-Mélou and Eriksson introduced lecture hall partitions as the inversion vectors of elements of the parabolic quotient . We provide a new view of th…

math.CO2016★ 2 cited

A -Queens Problem. V. Some of Our Favorite Pieces: Queens, Bishops, Rooks, and Nightriders

Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky

Parts I-IV showed that the number of ways to place nonattacking queens or similar chess pieces on an chessboard is a quasipolynomial function of whose coefficie…

math.CO2015

Combinatorics of the zeta map on rational Dyck paths

Cesar Ceballos, Tom Denton, Christopher R. H. Hanusa

An -Dyck path is a lattice path from to that stays above the line . The zeta map is a curious rule that maps the set of -Dyck path…

math.CO2014★ 8 cited

A -Queens Problem. III. Nonattacking Partial Queens

Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky

We apply our geometrical theory for counting placements of nonattacking on an chessboard, from Parts~I and II, to partial queens: that is, chess pieces with any com…

math.CO2014★ 13 cited

A -Queens Problem. II. The Square Board

Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky

We apply to the chessboard the counting theory from Part I for nonattacking placements of chess pieces with unbounded straight-line moves, such as the queen. Part I sho…

math.CO2013★ 8 cited

Results and conjectures on simultaneous core partitions

Drew Armstrong, Christopher R. H. Hanusa, Brant C. Jones

An n-core partition is an integer partition whose Young diagram contains no hook lengths equal to n. We consider partitions that are simultaneously a-core and b-core for two relati…

math.CO2013★ 1 cited

A -Queens Problem. I. General Theory

Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky

By means of the Ehrhart theory of inside-out polytopes we establish a general counting theory for nonattacking placements of chess pieces with unbounded straight-line moves, such a…

math.CO2012

Solving multivariate functional equations

Michael Chon, Christopher R. H. Hanusa, Amy Lee

This paper presents a new method to solve functional equations of multivariate generating functions, such as giving…

math.NT2012

The number of self-conjugate core partitions

Christopher R. H. Hanusa, Rishi Nath

A conjecture on the monotonicity of t-core partitions in an article of Stanton [Open positivity conjectures for integer partitions, Trends Math., 2:19-25, 1999] has been the cataly…

math.CO2011★ 3 cited

Nonattacking Queens in a Rectangular Strip

Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky

The function that counts the number of ways to place nonattacking identical chess or fairy chess pieces in a rectangular strip of fixed height and variable width, as a function of…

math.CO2011

Abacus models for parabolic quotients of affine Weyl groups

Christopher R. H. Hanusa, Brant C. Jones

We introduce abacus diagrams that describe minimal length coset representatives in affine Weyl groups of types B, C, and D. These abacus diagrams use a realization of the affine We…

math.CO2009★ 1 cited

The enumeration of fully commutative affine permutations

Christopher R. H. Hanusa, Brant C. Jones

We give a generating function for the fully commutative affine permutations enumerated by rank and Coxeter length, extending formulas due to Stembridge and Barcucci--Del Lungo--Per…

math.CO2008

Determinants in the Kronecker product of matrices: The incidence matrix of a complete graph

Christopher R. H. Hanusa, Thomas Zaslavsky

We investigate the least common multiple of all subdeterminants, lcmd(A x B), of a Kronecker product of matrices, of which one is an integral matrix A with two columns and the othe…