Abstract
In 2003 Ahlswede, Khachatrian, Mauduit and Sárközy introduced the notion of family complexity of binary sequences, and in 2006 Ahlswede, Mauduit and Sárközy extended this definition to sequences of k symbols. Since that several further related papers have been published on this subject. In this paper our main goal is to present a survey of all these papers. We will also answer a question of Csiszár and Gách on the connection of family complexity and VC-dimension.
Keywords
Research partially supported by Hungarian National Foundation for Scientific Research, grants K72731 and K100291, and the Agence Nationale de La Recherche, grant ANR-10-BLAN 0103 MUNUM.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahlswede, R.: Coloring hypergraphs: a new approach to multi-user source coding, Part I. J. Combinatorics, Information and System Sciences 4, 76–115 (1979); Part II, J. Combinatorics, Information and System Sciences 5, 220–268 (1980)
Ahlswede, R., Khachatrian, L.H., Mauduit, C., Sárközy, A.: A complexity measure for families of binary sequences. Period. Math. Hungar. 46, 107–118 (2003)
Ahlswede, R., Mauduit, C., Sárközy, A.: Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II. In: Ahlswede, R., Bäumer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 308–325. Springer, Heidelberg (2006)
Alon, N., Spencer, J.H.: The Probabilistic Method, 3rd edn. Wiley, Hoboken (2008)
Csiszár, I., Körner, J.: Information Theory, Coding Theorems for Discrete Memoryless Systems. Academic Press, New York (1981)
Dartyge, C., Sárközy, A.: On pseudo-random subsets of the set of integers not exceeding N. Periodica Math. Hungar. 54, 183–200 (2007)
Dartyge, C., Mosaki, E., Sárközy, A.: On large families of subsets of the set of the integers not exceeding N. Ramanujan J. 18, 209–229 (2009)
Folláth, J.: Construction of pseudorandom binary sequences using additive characters over GF(2k) I. Periodica Math. Hungar. 57, 73–81 (2008)
Folláth, J.: Construction of pseudorandom binary sequences using additive characters over GF(2k) II. Periodica Math. Hungar. 60, 127–135 (2010)
Goubin, L., Mauduit, C., Sárközy, A.: Construction of large families of pseudorandom binary sequences. J. Number Theory 106, 56–69 (2004)
Gyarmati, K.: On a family of pseudorandom binary sequences. Periodica Math. Hungar. 49, 45–63 (2004)
Gyarmati, K.: On the complexity of a family related to the Legendre symbol. Periodica Math. Hungar. 58, 209–215 (2009)
Gyarmati, K., Mauduit, C., Sárközy, A.: Measures of pseudorandomness of families of binary lattices I (Definitions, a construction using quadratic characters). Publ. Math. Debrecen (to appear)
Gyarmati, K., Mauduit, C., Sárközy, A.: Measures of pseudorandomness of families of binary lattices II (A further construction). Publ. Math. Debrecen (to appear)
Gyarmati, K., Sárközy, A., Stewart, C.L.: On Legendre symbol lattices. Unif. Distrib. Theory 4, 81–95 (2009)
Haussler, H., Welzl, E.: ε-nets and simplex range queries. Discrete Comp. Geom. 2, 127–151 (1987)
Hubert, P., Mauduit, C., Sárközy, A.: On pseudorandom binary lattices. Acta Arith. 125, 51–62 (2006)
Mauduit, C., Sárközy, A.: On finite pseudorandom binary sequences I, Measure of pseudorandomness, the Legendre symbol. Acta Arith. 82, 365–377 (1997)
Mauduit, C., Sárközy, A.: On finite pseudorandom sequences of k symbols. Indag. Mathem. 13, 89–101 (2002)
Mauduit, C., Sárközy, A.: On large families of pseudorandom binary lattices. Unif. Distrib. Theory 2, 23–37 (2007)
Sauer, N.: On the density of families of sets. J. Combin. Theory, Ser. A 13, 145–147 (1972)
Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16, 264–280 (1971)
Weil, A.: Sur les courbes algébriques et les variétés qui s’en déduisent, Act. Sci. Ind., 1041, Hermann, Paris (1948)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mauduit, C., Sárközy, A. (2013). Family Complexity and VC-Dimension. In: Aydinian, H., Cicalese, F., Deppe, C. (eds) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science, vol 7777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36899-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-36899-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36898-1
Online ISBN: 978-3-642-36899-8
eBook Packages: Computer ScienceComputer Science (R0)