A new upper bound for cancellative pairs

zbMath1391.05248arXiv1708.02833MaRDI QIDQ1753087

Barnabás Janzer

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.02833

zbMATH Keywords

binary multiplying channelcancellative pairssandglass conjecture

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• Unnamed Item
• Union-free hypergraphs and probability theory
• On the optimal structure of recovering set pairs in lattices: The sandglass conjecture
• New bounds on Simonyi's conjecture
• Cancellative pairs of families of sets
• A new construction for cancellative families of sets
• New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback
• Analysis of Deterministic Binary Interference Channels Via a General Outer Bound

This page was built for publication: A new upper bound for cancellative pairs