Searcharxiv⌕ Search

arXiv subjects

James Propp

Publications and source records attributed to James Propp.

At least 19 recordsLinked to original sources

Dimers, filters, and $q$-deformed real numbers

This article associates to each positive real number $x$ a dimer model on a snake graph with activity parameter $q>0$ whose structure is determined by the continued fraction expansion of $x$. When $x$ is rational, the model is finite and gives rise to a probability measure $μ_{x,q}$ on perfect matchings. For irrational $x$, the model is infinite, and $μ_{x,q}$ is defined as a limit over rational approximations to $x$; the main technical result of the paper shows that this limit is well defined and independent of the choice of rational approximants. $[[x]]_q$ denotes the odds that a $μ_{x,q}$-random perfect matching includes a distinguished edge. When $x$ is rational, $[[x]]_q = q\:[x]_q$, where $[x]_q$ is the algebraic $q$-deformation introduced by Morier-Genoud and Ovsienko. This agreement, together with evidence from the irrational case, suggests a close connection between the probabilistic and algebraic constructions.

math.PR↗

Random Domino Tilings and the Arctic Circle Theorem

In this article we study domino tilings of a family of finite regions called Aztec diamonds. Every such tiling determines a partition of the Aztec diamond into five sub-regions; in the four outer sub-regions, every tile lines up with nearby tiles, while in the fifth, central sub-region, differently-oriented tiles co-exist side by side. We show that when n is sufficiently large, the shape of the central sub-region becomes arbitrarily close to a perfect circle of radius n/sqrt(2) for all but a negligible proportion of the tilings. Our proof uses techniques from the theory of interacting particle systems. In particular, we prove and make use of a classification of the stationary behaviors of a totally asymmetric one-dimensional exclusion process in discrete time.

math.CO↗

Grid designs

We define a grid graph $G$ as a Cartesian product of path-graphs $P_n$ or cycle-graphs $C_n$ as shown in Figure 1, and we ask, when can the edge set of a complete graph be expressed as a disjoint union of graphs isomorphic to $G$? That is, we are asking for which grid graphs a $G$-design exists, where a $G$-design is defined as a decomposition of a complete graph into edge-disjoint subgraphs isomorphic to $G$. We show that when $n$ is an odd prime or the square of an odd prime, the toroidal grid-graph $G = C_n \square C_n$ admits a $G$-design. In the less symmetrical case of products of path-graphs, we prove that $G = P_3 \square P_3$ does not admit a $G$-design but that $G = P_4 \square P_4$ does. This last result is the special case that motivated the present paper: a $P_4 \square P_4$-design corresponds to a way of successively scrambling a Connections puzzle so that each pair of words occurs adjacently exactly once. Our constructions use the arithmetic of finite fields.

math.CO↗

Intersection statistics for antichains in minuscule posets

For a finite poset $P$, we study the expected size of the intersection of two independent uniformly random antichains. Equivalently, we evaluate the sum of $|A\cap A'|$ over all ordered pairs of antichains. For general posets this statistic appears to have little structure, but for the classical minuscule posets with uniform combinatorial models it admits closed-form expressions. Though the proofs are elementary and combinatorial, the resulting formulas admit a natural interpretation in terms of weight diagrams of minuscule representations.

math.CO↗

Whirling injections, surjections, and other functions between finite sets

This paper analyzes a certain action called "whirling" that can be defined on any family of functions between two finite sets equipped with a linear (or cyclic) ordering. Many maps of interest in dynamical algebraic combinatorics, such as rowmotion of order ideals, can be represented as a composition of "toggling" involutions, each of which modifies its object only locally. Similarly whirling is made up of locally-acting whirling maps which directly generalize toggles, but cycle through more than two possible outputs. In this first paper on whirling, we consider it as a map on subfamilies of functions between finite sets. For whirling acting on the set of injections or the set of surjections, we prove that within each whirling orbit, any two elements of the codomain appear as outputs of functions the same number of times. This result can be stated in terms of the homomesy phenomenon, which occurs when a statistic has the same average across every orbit. We further explore homomesy results and conjectures for whirling on restricted-growth words, which correspond to set partitions. These results extend the collection of combinatorial objects for which we have interesting dynamics and homomesy, and open the door to considering whirling in other contexts.

math.CO↗

Lattice structure for orientations of graphs

In 1986, Oliver Pretzel studied the set of orientations of a connected finite graph $G$ and showed that any two such orientations having the same flow-difference around all closed loops can be obtained from one another by a succession of local moves of a simple type. Here I show that the set of orientations of $G$ having the same flow-differences around all closed loops can be given the structure of a distributive lattice. When the graph is drawn on the plane, a dual version of the construction puts a distributive lattice structure on the set of orientations of $G$ having the same indegrees at all vertices. In both settings, adjacent lattice-elements are related by simple local moves. This construction unifies earlier, similar constructions in combinatorics and statistical mechanics. It also gives rise to an interesting lattice structure on spanning trees. This article is an updated version of a preprint originally distributed in 1993.

math.CO↗

Hyperbinary partitions and q-deformed rationals

A hyperbinary partition of the nonnegative integer n is a partition where every part is a power of 2 and every part appears at most twice. We give three applications of the length generating function for such partitions, denoted by h_q(n). Morier-Genoud and Ovsienko defined the q-analogue of a rational number [r/s]_q in various ways, most of which depend directly or indirectly on the continued fraction expansion of r/s. As our first application we show that [r/s]_q = q h_q(n-1)/h_q(n) where r/s occurs as the nth entry in the Calkin-Wilf enumeration of the non-negative rationals. Next we consider fence posets which are those which can be obtained from a sequence of chains by alternately pasting together maxima and minima. For every n we show there is a fence poset F(n) whose lattice of order ideals is isomorphic to the poset of hyperbinary partitions of n ordered by refinement. For our last application, Morier-Genoud and Ovsienko also showed that [r/s]_q can be computed by taking products of certain matrices which are q-analogues of the standard generators for the special linear group SL(2,R). We express the entries of these products in terms of the polynomials h_q(n).

math.CO↗

Tilings of Benzels via Generalized Compression

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 orientations of the tiles). Their primary tool, a bijection called compression that converts certain $k$-ribbon tilings to $(k-1)$-ribbon tilings, allowed them to reduce their problems to the enumeration of dimers (i.e., perfect matchings) of certain graphs. We present a generalized version of compression that no longer relies on the perspective of partitions and skew shapes. Using this strengthened tool, we resolve three more of Propp's conjectures and recast several others as problems about perfect matchings.

math.CO↗

Trimer covers in the triangular grid: twenty mostly open problems

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 article we move beyond dimer covers to trimer covers, introducing plane regions called benzels that play a role analogous to hexagons for rhombus tilings and Aztec diamonds for domino tilings, inasmuch as one finds many (so far mostly conjectural) exact formulas governing the number of tilings.

math.CO↗

A pentagonal number theorem for tribone tilings

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 tiling by tribones exists if and only if the two parameters associated with the region are the paired pentagonal numbers $k(3k \pm 1)/2$.

math.CO↗

Homomesy via Toggleability Statistics

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 of the action. We systematize a technique for proving that various statistics of interest are homomesic by writing these statistics as linear combinations of "toggleability statistics" (originally introduced by Striker) plus a constant. We show that this technique recaptures most of the known homomesies for the posets on which rowmotion has been most studied. We also show that the technique continues to work in modified contexts. For instance, this technique also yields homomesies for the piecewise-linear and birational extensions of rowmotion; furthermore, we introduce a $q$-analogue of rowmotion and show that the technique yields homomesies for "$q$-rowmotion" as well.

math.CO↗

Tilings of Benzels via the Abacus Bijection

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 additional results that he left tacit. In order to solve these problems, we first transfer benzels into the square grid. One of our primary tools, which we combine with several new ideas, is a bijection (rediscovered by Stanton and White and often attributed to them although it is considerably older) between $k$-ribbon tableaux of certain skew shapes and certain $k$-tuples of Young tableaux.

math.CO↗

A Greedy Chip-firing Game

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 Markov chains with finitely many states, hunger game simulation concentrates around the stationary distribution with discrepancy falling off like $N^{-1}$, where $N$ is the number of simulation steps; in the case of absorbing Markov chains with finitely many states, hunger game simulation also exhibits concentration for hitting measures and expected hitting times with discrepancy falling off like $N^{-1}$ rather than $N^{-1/2}$. When transition probabilities in a finite Markov chain are rational, the game is eventually periodic; the period seems to be the same for all initial configurations and the basin of attraction appears to tile the configuration space (the set of hunger vectors) by translation, but we have not proved this.

math.PR↗

A spectral theory for combinatorial dynamics

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 construction from ergodic theory, is the introduction of a vector space that contains the given functions and is closed under composition with $T$, along with a time-evolution operator on that vector space. I show that the invariant functions and 0-mesic functions span complementary subspaces associated respectively with the eigenvalue 1 and the other eigenvalues. Alongside other examples, I give an explicit description of the spectrum of the evolution operator when $X$ is the set of $k$-element multisets with elements in $\{0,1,\dots,n-1\}$, $T$ increments each element of a multiset by 1 mod $n$, and $g_i: X \rightarrow \mathbb{R}$ (with $1 \leq i \leq k$) maps a multiset to its $i$th smallest element.

math.CO↗

Quantifying Noninvertibility in Discrete Dynamical Systems

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 bijective. We compute the degrees of noninvertibility of some specific discrete dynamical systems, including the Carolina solitaire map, iterates of the bubble sort map acting on permutations, bubble sort acting on multiset permutations, and a map that we call "nibble sort." We also obtain estimates for the degrees of noninvertibility of West's stack-sorting map and the Bulgarian solitaire map. We then turn our attention to arbitrary functions and their iterates. In order to compare the degree of noninvertibility of an arbitrary function $f:X\to X$ with that of its iterate $f^k$, we prove that \[\max_{\substack{f:X\to X\\ |X|=n}}\frac{\text{deg}(f^k)}{\text{deg}(f)^γ}=Θ(n^{1-1/2^{k-1}})\] for every real number $γ\geq 2-1/2^{k-1}$. We end with several conjectures and open problems.

math.CO↗

Combinatorial, piecewise-linear, and birational homomesy for products of two chains

This article illustrates the dynamical concept of $homomesy$ in three kinds of dynamical systems -- combinatorial, piecewise-linear, and birational -- and shows the relationship between these three settings. In particular, we show how the rowmotion and promotion operations of Striker and Williams can be lifted to (continuous) piecewise-linear operations on the order polytope of Stanley, and then lifted to birational operations on the positive orthant in $\mathbb{R}^{|P|}$ and indeed to a dense subset of $\mathbb{C}^{|P|}$. When the poset $P$ is a product of a chain of length $a$ and a chain of length $b$, these lifted operations have order $a+b$, and exhibit the homomesy phenomenon: the time-averages of various quantities are the same in all orbits. One important tool is a concrete realization of the conjugacy between rowmotion and promotion found by Striker and Williams; this $recombination$ $map$ allows us to use homomesy for promotion to deduce homomesy for rowmotion. NOTE: An earlier draft showed that Stanley's transfer map between the order polytope and the chain polytope arises as the tropicalization of an analogous map in the bilinear realm; in 2020 we removed this material for the sake of brevity, especially after Joseph and Roby generalized our proof to the noncommutative realm (see arXiv:1909.09658v3). Readers who nonetheless wish to see our proof can find the September 2018 draft of this preprint through the arXiv.

math.CO↗

Germ order for one-dimensional packings

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 manner that generalizes both cardinality of finite sets and density of infinite sets. For any finite set $D$ of positive integers, call a set $S$ "$D$-avoiding" if no two elements of $S$ differ by an element of $D$. We study the problem of determining, for fixed $D$, all $D$-avoiding sets that are maximal in the germ order. In many cases, we can show that there is exactly one such set. We apply this to the study of one-dimensional packing problems.

math.CO↗