2 papers
math.CO2018
An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean Function
John Chiarelli, Pooya Hatami, Michael Saks
We prove that there is a constant such that every Boolean function of degree at most (as a polynomial over ) is a -junta, i.e. it depends…
math.CO2017
Counting Permutations that Avoid Many Patterns
Yonah Biers-Ariel, Haripriya Chakraborty, John Chiarelli +8
This paper presents a collection of experimental results regarding permutation pattern avoidance, focusing on cases where there are "many" patterns to be avoided.