11 citations · 14 across the 3 of their papers we have counts for
3 papers
cs.IT2021
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-…
math.CO2013★ 3 cited
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…
math.CO2013★ 11 cited
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…