A Low-Depth Monotone Function that is not an Approximate Junta
  We provide an example of a monotone Boolean function on the hypercube given by a low depth decision tree that is not well approximated by any k-junta for small k. 
Daniel M. Kane
cs.DM