Constrained versions of Sauer's Lemma

DOI10.1016/j.dam.2007.11.017zbMath1185.05012OpenAlexW2157161037WikidataQ124798536 ScholiaQ124798536MaRDI QIDQ948694

Joel Ratsaby

Publication date: 17 October 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.11.017

zbMATH Keywords

binary functionsinteger partitionsSauer's Lemma

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal width learning of binary functions
• Refinement of the upper bound of the constant in the central limit theorem
• \(\epsilon\)-nets and simplex range queries
• A trinomial analogue of Bailey's lemma and \(N=2\) superconformal invariance
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
• On the trace of finite sets
• The Vapnik-Chervonenkis dimension of a random graph
• Compound Poisson approximation: A user's guide
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• Normal Approximation
• Neural Network Learning
• An application of Fourier methods to the problem of sharpening the Berry-Esseen inequality
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Convergence of stochastic processes

This page was built for publication: Constrained versions of Sauer's Lemma