Multipartite nearly orthogonal sets over finite fields

DOI10.1007/S00454-026-00858-2MaRDI QIDQ7363893zbMATH OpenFDO

Authors Rajko Nenadov, Lander Verlinde

Publication date 1 October 2026

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00454-026-00858-2

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Hypergraphs (05C65) Ramsey theory (05D10) Inverse problems of additive number theory, including sumsets (11P70)

Cites work

• Extremal results in sparse pseudorandom graphs
• Forbidden Intersections
• scientific article; zbMATH DE number 17660 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• Hypergraph containers
• Independent sets in hypergraphs
• Large sets of nearly orthogonal vectors
• Larger nearly orthogonal sets over finite fields
• Nearly orthogonal sets over finite fields
• On the number of orthogonal systems in vector spaces over finite fields
• Orthonormal representations of \(H\)-free graphs
• Pseudo-random graphs
• Sets of vectors with many orthogonal pairs
• Sharp bounds for some multicolour Ramsey numbers
• Short proof of the hypergraph container theorem
• Some structural properties of low-rank matrices related to computational complexity
• The (generalized) orthogonality dimension of (generalized) Kneser graphs: bounds and applications
• The method of hypergraph containers
• The probabilistic method
• The Typical Approximate Structure of Sets with Bounded Sumset

This page was built for publication: Multipartite nearly orthogonal sets over finite fields

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