Annales de l’Institut Henri Poincaré D


Full-Text PDF (202 KB) | List online-first AIHPD articles | AIHPD summary
Published online first: 2018-02-09
DOI: 10.4171/AIHPD/51

Perfect and separating hash families: new bounds via the algorithmic cluster expansion local lemma

Aldo Procacci[1] and Remy Sanchis[2]

(1) Universidade Federal de Minas Gerais, Belo Horizonte, Brazil
(2) Universidade Federal de Minas Gerais, Belo Horizonte, Brazil

We present new lower bounds for the size of perfect and separating hash families ensuring their existence. Such new bounds are based on the algorithmic cluster expansion improved version of the Lovász local lemma, which also implies that the Moser–Tardos algorithm finds such hash families in polynomial time.

Keywords: Hash families, algorithmic Lovász local lemma, hard-core lattice gas

Procacci Aldo, Sanchis Remy: Perfect and separating hash families: new bounds via the algorithmic cluster expansion local lemma. Ann. Inst. Henri Poincaré Comb. Phys. Interact. Electronically published on February 9, 2018. doi: 10.4171/AIHPD/51 (to appear in print)