Partitioning multi-dimensional sets in a small number of ``uniform parts

DOI10.1016/J.EJC.2005.08.002zbMATH Open1106.94012OpenAlexW2050280202WikidataQ57349768 ScholiaQ57349768MaRDI QIDQ854815FDOQ854815

Authors: Ilan Newman, A. Shen, Noga Alon, Gábor Tardos, Nikolai K. Vereshchagin 

Publication date: 7 December 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2005.08.002

Recommendations

• Graphs that Split Entropies
• Entropy, independent sets and antichains: A new approach to Dedekind's problem
• An entropy approach to the hard-core model on bipartite graphs
• On Extremal Set Partitions in Cartesian Product Spaces
• Projections, entropy and sumsets

zbMATH Keywords

bipartite graphsinformation inequalities for Shannon entropy

Mathematics Subject Classification ID

Applications of graph theory (05C90) Measures of information, entropy (94A17) Partitions of sets (05A18) Combinatorial aspects of partitions of integers (05A17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• On characterization of entropy function via information inequalities
• A new class of non-Shannon-type inequalities for entropies
• Combinatorial interpretation of Kolmogorov complexity
• A combinatorial approach to information inequalities

Cited In (6)

• Partitioning sets of triples into small planes
• Kolmogorov complexity as a language
• On the Existence of Immigration Proof Partition into Countries in Multidimensional Space
• Partition bounded sets into sets having smaller diameters
• It's all a matter of degree. Using degree information to optimize multiway joins
• Title not available (Why is that?)

This page was built for publication: Partitioning multi-dimensional sets in a small number of ``uniform parts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854815)