Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints

DOI10.1137/S0895480102419767zbMath1055.05108OpenAlexW1999047644MaRDI QIDQ4652611

Ron M. Roth, Erik Ordentlich

Publication date: 28 February 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480102419767

zbMATH Keywords

Hamming graphsregular hypergraphsrunlength-limited constraintsmultidimensional constraints

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coding theorems (Shannon theory) (94A24)

Related Items

Graphs, partitions and Fibonacci numbers ⋮ On the number of independent sets in simple hypergraphs ⋮ On independence and entropy for high-dimensional isotropic subshifts ⋮ Independence entropy of \(\mathbb{Z}^{d}\)-shift spaces ⋮ Bounds on threshold probabilities for coloring properties of random hypergraphs ⋮ On the number of independent sets in uniform, regular, linear hypergraphs ⋮ On the weak chromatic number of random hypergraphs ⋮ Number of \(A + B \neq C\) solutions in abelian groups and application to counting independent sets in hypergraphs