Alejandro Erickson

activity

20102015

most citedHamiltonian Properties of DCell Networks

57 citations · 83 across the 8 of their papers we have counts for

collaborators

Showing math.COShow all

7 papers · 1 filter

math.CO2015★ 12 cited

Nested Recurrence Relations With Conolly-Like Solutions

Alejandro Erickson, Abraham Isgur, Bradley W. Jackson +2

A nondecreasing sequence of positive integers is $(α, β)$ -Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence i…

math.CO2014

Generating Tatami Coverings Efficiently

Alejandro Erickson, Frank Ruskey

We present two algorithms to list certain classes of monomino-domino coverings which conform to the \emph{tatami} restriction; no four tiles meet. Our methods exploit structural fe…

math.CO2013★ 2 cited

Enumerating maximal tatami mat coverings of square grids with $v$ vertical dominoes

Alejandro Erickson, Frank Ruskey

We enumerate a certain class of monomino-domino coverings of square grids, which conform to the \emph{tatami} restriction; no four tiles meet. Let $T_{n}$ be the set of mon…

math.CO2013

Tatami Maker: A combinatorially rich mechanical game board

Alejandro Erickson

Japanese tatami mats are often arranged so that no four mats meet. This local restriction imposes a rich combinatorial structure when applied to monomino-domino coverings of rectil…

math.CO2011

Monomer-dimer tatami tilings of square regions

Alejandro Erickson, Mark Schurch

We prove that the number of monomer-dimer tilings of an $n \times n$ square grid, with $m < n$ monomers in which no four tiles meet at any point is $m 2^{m} + (m + 1) 2^{m + 1}$ , when $m$ and $…

math.CO2011

Auspicious tatami mat arrangements

Alejandro Erickson, Frank Ruskey, Mark Schurch +1

An \emph{auspicious tatami mat arrangement} is a tiling of a rectilinear region with two types of tiles, $1 \times 2$ tiles (dimers) and $1 \times 1$ tiles (monomers). The tiles mu…