skip to main content
research-article

Monotone Properties of k-Uniform Hypergraphs Are Weakly Evasive

Published:26 April 2019Publication History
Skip Abstract Section

Abstract

A Boolean function in n variables is weakly evasive if its decision-tree complexity is Ω(n). By k-graphs, we mean k-uniform hypergraphs. A k-graph property on v vertices is a Boolean function on n = vk variables corresponding to the k-subsets of a v-set that is invariant under the v! permutations of the v-set (isomorphisms of k-graphs).

In 1976, Rivest and Vuillemin proved that all nonconstant monotone graph properties (k = 2) are weakly evasive, confirming a conjecture of Aanderaa and Rosenberg in 1973. Then, in 2013, Kulkarni, Qiao, and Sun (KQS) proved the analogous result for 3-graphs. We extend these results to k-graphs for every fixed k. From this, we show that monotone Boolean functions invariant under the action of a large primitive group are weakly evasive.

Although KQS employ the powerful topological approach of Kahn et al. in 1984 combined with heavy number theory, our argument is elementary and self-contained (modulo some basic group theory). Inspired by the outline of the KQS approach, we formalize the general framework of “orbit augmentation sequences” of sets with group actions. We show that a parameter of such sequences, called the spacing, is a lower bound on the decision-tree complexity for any nontrivial monotone property that is Γ-invariant for all groups Γ involved in the orbit augmentation sequence, assuming all those groups are p-groups. We develop operations on such sequences such as composition and direct product that will provide helpful machinery for our applications. We apply this general technique to k-graphs via certain liftings of k-graphs with wreath product action of p-groups.

References

  1. László Babai, Anandam Banerjee, Raghav Kulkarni, and Vipul Naik. 2010. Evasiveness and the distribution of prime numbers. In STACS 2010: 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Vol. 5. Schloss Dagstuhl, Leibniz-Zentrum fuer Informatik, Wadern, 71--82.Google ScholarGoogle Scholar
  2. Peter J. Cameron. 1981. Finite permutation groups and finite simple groups. Bulletin of the London Mathematical Society 13, 1 (1981), 1--22.Google ScholarGoogle ScholarCross RefCross Ref
  3. Amit Chakrabarti, Subhash Khot, and Yaoyun Shi. 2002. Evasiveness of subgraph containment and related properties. SIAM Journal on Computing 31, 3 (March 2002), 866--875. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Suixiang Gao and Guohui Lin. 2000. Decision tree complexity of graph properties with dimension at most 5. Journal of Computer Science and Technology 15, 5 (2000), 416--422. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Marc Hellmuth, Lydia Ostermeier, and Peter F. Stadler. 2012. A survey on hypergraph products. Mathematics in Computer Science 6, 1 (2012), 1--32.Google ScholarGoogle ScholarCross RefCross Ref
  6. Jeff Kahn, Michael Saks, and Dean Sturtevant. 1984. A topological approach to evasiveness. Combinatorica 4, 4 (1984), 297--306.Google ScholarGoogle ScholarCross RefCross Ref
  7. Daniel J. Kleitman and David J. Kwiatkowski. 1980. Further results on the Aanderaa-Rosenberg conjecture. Journal of Combinatorial Theory, Series B 28, 1 (1980), 85--95.Google ScholarGoogle ScholarCross RefCross Ref
  8. Raghav Kulkarni. 2013. Evasiveness through a circuit lens. In Proceedings of the Conference on Innovations in Theoretical Computer Science (ITCS’13). 139--144. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Raghav Kulkarni, Youming Qiao, and Xiaoming Sun. 2013. Any monotone property of 3-uniform hypergraphs is weakly evasive. In Theory and Applications of Models of Computation. Lecture Notes in Computer Science, Vol. 7876. Springer, 224--235.Google ScholarGoogle Scholar
  10. Robert Oliver. 1975. Fixed-point sets of group actions on finite acyclic complexes. Commentarii Mathematici Helvetici 50 (1975), 155--177.Google ScholarGoogle ScholarCross RefCross Ref
  11. Ronald L. Rivest and Jean Vuillemin. 1976/77. On recognizing graph properties from adjacency matrices. Theoretical Computer Science 3, 3 (1976/77), 371--384.Google ScholarGoogle Scholar
  12. Joseph J. Rotman. 1995. An Introduction to the Theory of Groups. Springer-Verlag, New York, NY.Google ScholarGoogle Scholar
  13. Eberhard Triesch. 1996. On the recognition complexity of some graph properties. Combinatorica 16, 2 (1996), 259--268.Google ScholarGoogle ScholarCross RefCross Ref
  14. Ivan Matveevich Vinogradov. 1937. The Method of Trigonometrical Sums in the Theory of Numbers (Russian). Steklov Institute of Mathematics.Google ScholarGoogle Scholar
  15. Andrew Chi-Chih Yao. 1988. Monotone bipartite graph properties are evasive. SIAM Journal on Computing 17, 3 (June 1988), 517--520. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Monotone Properties of k-Uniform Hypergraphs Are Weakly Evasive

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Article Metrics

        • Downloads (Last 12 months)9
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format .

      View HTML Format
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!