Nearly orthogonal sets over finite fields

DOI10.4230/LIPICS.SOCG.2024.39MaRDI QIDQ6895863zbMATH OpenFDO

Authors Dror Chawin, Ishay Haviv

Publication date 24 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2024.39

zbMATH Keywords

finite fieldsnearly orthogonal sets

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Hypergraphs (05C65) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites work

• Almost orthogonal subsets of vector spaces over finite fields
• Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate
• Construction of storage codes of rate approaching one on triangle-free graphs
• Constructive bounds for a Ramsey-type problem
• Cycles of nonzero elements in low rank matrices
• Forbidden Intersections
• Graphs and geometry
• High-Rate Storage Codes on Triangle-Free Graphs
• scientific article; zbMATH DE number 3745081 (Why is no real title available?)
• scientific article; zbMATH DE number 17660 (Why is no real title available?)
• scientific article; zbMATH DE number 1045540 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• Large sets of nearly orthogonal vectors
• On graphs and algebraic graphs that do not contain cycles of length 4
• On minrank and forbidden subgraphs
• On Subsets with Intersections of Even Cardinality
• On the complexity of approximating the independent set problem
• On the number of orthogonal systems in vector spaces over finite fields
• On the Shannon capacity of a graph
• Orthogonal representations over finite fields and the chromatic number of graphs
• Orthogonal sets of vectors over Zm
• Orthonormal representations of \(H\)-free graphs
• Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function
• Sets of vectors with many orthogonal pairs
• Some structural properties of low-rank matrices related to computational complexity
• The (generalized) orthogonality dimension of (generalized) Kneser graphs: bounds and applications
• The minimum semidefinite rank of a triangle-free graph

Cited in

(1)

• Larger nearly orthogonal sets over finite fields

This page was built for publication: 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 Q6895863)