11 citations · 14 across the 7 of their papers we have counts for
7 papers
The Latin Tableau Conjecture
Timothy Y. Chow, Mark G. Tiefenbruck
A Latin tableau of shape and type is a Young diagram of shape in which each box contains a single positive integer, with no repeated integers in any row or column, and…
Using Colors and Sketches to Count Subgraphs in a Streaming Graph
Shirin Handjani, Douglas Jungreis, Mark Tiefenbruck
Suppose we wish to estimate , the number of copies of some small graph in a large streaming graph . There are many algorithms for this task when is a triangle, but…
The Covering Radius of the Reed-Muller Code in
Randall Dougherty, R. Daniel Mauldin, Mark Tiefenbruck
We present methods for computing the distance from a Boolean polynomial on variables of degree (i.e., a member of the Reed-Muller code ) to the space of lower-…
On Levine's notorious hat puzzle
Joe Buhler, Chris Freiling, Ron Graham +5
The Levine hat game requires players, each wearing an infinite random stack of black and white hats, to guess the location of a black hat on their own head seeing only the hats…
Quadrant marked mesh patterns in 132-avoiding permutations III
Sergey Kitaev, Jeffrey Remmel, Mark Tiefenbruck
Given a permutation $\sg = \sg_1 \ldots \sg_n$ in the symmetric group , we say that $\sg_i$ matches the marked mesh pattern in $\sg$ if there are at least p…
Quadrant marked mesh patterns in 132-avoiding permutations II
Sergey Kitaev, Jeffrey Remmel, Mark Tiefenbruck
Given a permutation $\sg = \sg_1...\sg_n$ in the symmetric group , we say that $\sg_i$ matches the marked mesh pattern in $\sg$ if there are at least points…
Quadrant marked mesh patterns in 132-avoiding permutations I
Sergey Kitaev, Jeffrey Remmel, Mark Tiefenbruck
This paper is a continuation of the systematic study of the distributions of quadrant marked mesh patterns initiated in [6]. Given a permutation $\sg = \sg_1 ... \sg_n$ in the symm…