Zobrazeno 1 - 10
of 215
pro vyhledávání: '"Propp, James"'
Defant, Li, Propp, and Young recently resolved two enumerative conjectures of Propp concerning the tilings of regions in the hexagonal grid called benzels using two types of prototiles called stones and bones (with varying constraints on allowed orie
Externí odkaz:
http://arxiv.org/abs/2403.07663
Propp recently introduced regions in the hexagonal grid called benzels and stated several enumerative conjectures about the tilings of benzels using two types of prototiles called stones and bones. We resolve two of his conjectures and prove some add
Externí odkaz:
http://arxiv.org/abs/2209.05717
Autor:
Propp, James
In the past three decades, the study of rhombus tilings and domino tilings of various plane regions has been a thriving subfield of enumerative combinatorics. Physicists classify such work as the study of dimer covers of finite graphs. In this articl
Externí odkaz:
http://arxiv.org/abs/2206.06472
Autor:
Kim, Jesse, Propp, James
Conway and Lagarias showed that certain roughly triangular regions in the hexagonal grid cannot be tiled by shapes Thurston later dubbed tribones. Here we study a two-parameter family of roughly hexagonal regions in the hexagonal grid and show that a
Externí odkaz:
http://arxiv.org/abs/2206.04223
Autor:
Propp, James
Publikováno v:
Published in Integers volume 23 (2023), article #A30: https://math.colgate.edu/~integers/x30/x30.pdf
For various sets of tiles, we count the ways to tile an Aztec diamond of order $n$ using tiles from that set. The resulting function $f(n)$ often has interesting behavior when one looks at $n$ and $f(n)$ modulo powers of 2.
Comment: Note: The pr
Comment: Note: The pr
Externí odkaz:
http://arxiv.org/abs/2204.00158
Publikováno v:
Combinatorial Theory, 3(2), 2023
The rowmotion operator acting on the set of order ideals of a finite poset has been the focus of a significant amount of recent research. One of the major goals has been to exhibit homomesies: statistics that have the same average along every orbit o
Externí odkaz:
http://arxiv.org/abs/2108.13227
Autor:
Propp, James
This article proposes a framework for the study of periodic maps $T$ from a (typically finite) set $X$ to itself when the set $X$ is equipped with one or more real- or complex-valued functions. The main idea, inspired by the time-evolution operator c
Externí odkaz:
http://arxiv.org/abs/2105.11568
Autor:
Li, Rupert, Propp, James
We introduce a deterministic analogue of Markov chains that we call the hunger game. Like rotor-routing, the hunger game deterministically mimics the behavior of both recurrent Markov chains and absorbing Markov chains. In the case of recurrent Marko
Externí odkaz:
http://arxiv.org/abs/2102.00346
Autor:
Defant, Colin, Propp, James
Publikováno v:
Electronic Journal of Combinatorics, 27 (2020)
Given a finite set $X$ and a function $f:X\to X$, we define the degree of noninvertibility of $f$ to be $\displaystyle\text{deg}(f)=\frac{1}{|X|}\sum_{x\in X}|f^{-1}(f(x))|$. This is a natural measure of how far the function $f$ is from being bijecti
Externí odkaz:
http://arxiv.org/abs/2002.07144
Autor:
Abrams, Aaron, Landau, Henry, Landau, Zeph, Pommersheim, Jamie, Propp, James, Russell, Alexander
Every set of natural numbers determines a generating function convergent for $q \in (-1,1)$ whose behavior as $q \rightarrow 1^-$ determines a germ. These germs admit a natural partial ordering that can be used to compare sets of natural numbers in a
Externí odkaz:
http://arxiv.org/abs/1807.06495