most citedA bijection between noncrossing and nonnesting partitions for classical reflection groups

3 citations · 3 across the 2 of their papers we have counts for

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2011

Lattice games without rational strategies

Alex Fink

We show that the lattice games of Guo and Miller support universal computation, disproving their conjecture that all lattice games have rational strategies. We also state an explic…

math.CO2008★ 3 cited

A bijection between noncrossing and nonnesting partitions for classical reflection groups

Alex Fink, Benjamin Iriarte Giraldo

We present an elementary type preserving bijection between noncrossing and nonnesting partitions for all classical reflection groups, answering a question of Athanasiadis.