This paper finds and analyzes a formula for the total variation distance between iterations of riffle shuffles and iterations of "cut and then riffle shuffle". This allo...
It has recently been observed empirically that the number of FPL configurations with 3 sets of a, b and c nested arches equals the number of plane partitions in a box of size a
P. Di Francesco, Paul Zinn-Justin, Jean-Bernard Zu...
A positive list (list of positive integers) is protographic if its merger with all but finitely many positive graphic lists is graphic. Define the family Ps of s-protogaphic lists...
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
Abraham Flaxman, Aram Wettroth Harrow, Gregory B. ...
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
We construct smallest known trivalent graphs for girths 16 and 18. One construction uses voltage graphs, and the other coset enumeration techniques for group presentations. AMS Su...
We study the distribution of the statistics `number of fixed points' and `number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all th...