activity
20152025
most citedA shuffling theorem for lozenge tilings of doubly-dented hexagons

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

collaborators

12 papers

math.CO2025

Sign games on graphs

Liz Blum, Lily Brustkern, Rosetta Hawkins +2

We define the Sign Game as a two-player game played on a simple undirected mathematical graph . The players alternate turns, assigning vertices of either or , and ed…

math.CO2020★ 3 cited

Tiling generating functions of halved hexagons and quartered hexagons

Tri Lai, Ranjan Rohatgi

We prove exact product formulas for the tiling generating functions of various halved hexagons and quartered hexagons with defects on boundary. Our results generalize the previous…

math.GM2019★ 1 cited

Total Difference Chromatic Numbers of Graphs

Ranjan Rohatgi, Yufei Zhang

Inspired by graceful labelings and total labelings of graphs, we introduce the idea of total difference labelings. A -total labeling of a graph is an assignment of disti…

math.CO2019

Tilings of hexagons with a removed triad of bowties

Mihai Ciucu, Tri Lai, Ranjan Rohatgi

In this paper we consider arbitrary hexagons on the triangular lattice with three arbitrary bowtie-shaped holes, whose centers form an equilateral triangle. The number of lozenge t…

math.AT2019

Connectivity at Infinity for the Braid Group of a Complete Bipartite Graph

Kristen Mazur, Jon McCammond, John Meier +1

The graph braid group of a complete bipartite graph is the fundamental group of a configuration space of points on the graph, which is a CAT(0) cube complex. We combine an analysis…

math.CO2019★ 9 cited

A shuffling theorem for lozenge tilings of doubly-dented hexagons

Tri Lai, Ranjan Rohatgi

MacMahon's theorem on plane partitions yields a simple product formula for tiling number of a hexagon, and Cohn, Larsen and Propp's theorem provides an explicit enumeration for til…