Limits of Boolean functions on \(\mathbb{F}_p^n\)

zbMath1364.11152arXiv1308.4108MaRDI QIDQ463037

Hamed Hatami, Pooya Hatami, James Hirst

Publication date: 23 October 2014

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

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

zbMATH Keywords

limit theoryhigher order Fourier analysis

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Boolean functions (06E30) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (1)

Semantic limits of dense combinatorial objects

Cites Work

• The inverse conjecture for the Gowers norm over finite fields in low characteristic
• Limits of dense graph sequences
• Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
• Every locally characterized affine-invariant property is testable
• The true complexity of a system of linear equations
• Unnamed Item

This page was built for publication: Limits of Boolean functions on \(\mathbb{F}_p^n\)