Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem

From MaRDI portal
Publication:3978704

DOI10.1137/0404025zbMath0736.05008OpenAlexW2086915432MaRDI QIDQ3978704

A. B. Stephens, Louis W. Shapiro

Publication date: 25 June 1992

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0404025



Related Items

A combinatorial bijection on di-sk trees, Uniform generation of a Schröder tree, Pattern matching for permutations, Generating trees and the Catalan and Schröder numbers, The Brownian limit of separable permutations, Perfect matchings of cellular graphs, On slowly percolating sets of minimal size in bootstrap percolation, The infinite limit of separable permutations, The skew Brownian permuton: A new universality class for random constrained permutations, Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three, On the running time of hypergraph bootstrap percolation, A cube dismantling problem related to bootstrap percolation, Simple permutations and algebraic generating functions, Analytic combinatorics of coordination numbers of cubic lattices, Separable \(d\)-permutations and guillotine partitions, Bijective proofs of recurrences involving two Schröder triangles, Unnamed Item, Separable elements and splittings of Weyl groups, Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths, Restricted permutations, A history and a survey of lattice path enumeration, A bijection between permutations and floorplans, and its applications, On the number of rectangulations of a planar point set, Permutations of a multiset avoiding permutations of length 3, Separable elements in Weyl groups, On two unimodal descent polynomials, Unnamed Item, Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences, On the Brownian separable permuton, Permutations, parenthesis words, and Schröder numbers, Unknotted cycles, Enumerative aspects of certain subclasses of perfect graphs, Equipopularity classes in the separable permutations, The feasible regions for consecutive patterns of pattern-avoiding permutations