Avoiding right angles and certain Hamming distances
From MaRDI portal
Publication:6051134
DOI10.1016/j.laa.2023.07.028arXiv2012.08232OpenAlexW3111797381MaRDI QIDQ6051134
Dávid Matolcsi, Péter Pál Pach, Jakab Schrettner, Balázs Bursics
Publication date: 19 September 2023
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.08232
Other combinatorial number theory (11B75) Multilinear algebra, tensor calculus (15A69) Arithmetic combinatorics; higher degree uniformity (11B30)
Cites Work
- Unnamed Item
- How large dimension guarantees a given angle?
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- On a packing and covering problem
- Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances
- Families of finite sets in which no set is covered by the union of two others
- An upper bound for the cardinality of an s-distance subset in real euclidean space
- On a problem of Erdős on fractal combinatorial geometry
- On t-designs
- Occurrence of right angles in vector spaces over finite fields
- A new proof of several inequalities on codes and sets
- The partition rank of a tensor and \(k\)-right corners in \(\mathbb{F}_q^n\)
- Four fundamental parameters of a code and their combinatorial significance
This page was built for publication: Avoiding right angles and certain Hamming distances
