A bound on partitioning clusters

zbMath1432.05114arXiv1702.00912MaRDI QIDQ2628261

Daniel M. Kane, Terence C. Tao

Publication date: 13 June 2017

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

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

zbMATH Keywords

Hamming cubeadditive energy

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Extremal set theory (05D05) Asymptotic enumeration (05A16) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (3)

Convolution estimates and number of disjoint partitions ⋮ Some remarks on the distribution of additive energy ⋮ On binomial sums, additive energies, and lazy random walks

Uses Software

• ASTRAL-II

Cites Work

• Unnamed Item
• Unnamed Item
• Sums in the grid
• On the weighted quartet consensus problem
• Logarithmic Sobolev inequalities for finite Markov chains
• Constructing Optimal Trees from Quartets
• Uniformly Bounded Representations and Harmonic Analysis of the 2 x 2 Real Unimodular Group

This page was built for publication: A bound on partitioning clusters