L_p regular sparse hypergraphs: box norms

DOI10.4064/FM656-10-2018zbMATH Open1433.05237arXiv1510.07140OpenAlexW2990673520MaRDI QIDQ5207333FDOQ5207333

Authors: Pandelis Dodos, Vassilis Kanellopoulos, Thodoris Karageorgos 

Publication date: 19 December 2019

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Abstract: We consider some variants of the Gowers box norms, introduced by Hatami, and show their relevance in the context of sparse hypergraphs. Our main results are the following. Firstly, we prove a generalized von Neumann theorem for $L_p$ graphons. Secondly, we give natural examples of pseudorandom families, that is, sparse weighted uniform hypergraphs which satisfy relative versions of the counting and removal lemmas.

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

Recommendations

• $L_p$ regular sparse hypergraphs
• A counting lemma for sparse pseudorandom hypergraphs
• An analytic approach to sparse hypergraphs: hypergraph removal
• Extremal results in sparse pseudorandom graphs
• A sparse regular approximation lemma

zbMATH Keywords

\(L_p\) graphonsGowers box norms

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42) Hypergraphs (05C65) Geometry and structure of normed linear spaces (46B20) Classical Banach spaces in the general theory (46B25)

Cited In (4)

• On graph norms for complex‐valued functions
• An algorithmic regularity lemma for \(L_p\) regular sparse matrices
• $L_p$ regular sparse hypergraphs
• Uniformity norms, their weaker versions, and applications

This page was built for publication: \(L_p\) regular sparse hypergraphs: box norms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207333)