Embedding bipartite distance graphs under Hamming metric in finite fields

DOI10.1016/j.jcta.2023.105765zbMath1521.05126OpenAlexW4367309038MaRDI QIDQ6162866

Gennian Ge, Wenjun Yu, Zixiang Xu

Publication date: 26 June 2023

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2023.105765

zbMATH Keywords

finite fieldHamming distanceTurán numberdependent random choiceDelsarte's inequality

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite chains inside thin subsets of \(\mathbb{R}^d\)
• Pinned distance sets, \(k\)-simplices, Wolff's exponent in finite fields and sum-product estimates
• The generalized Erdős-Falconer distance problems in vector spaces over finite fields
• A group-theoretic viewpoint on Erdös-Falconer problems and the Mattila integral
• Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances
• Hausdorff dimension and distance sets
• On necklaces inside thin subsets of \(\mathbb{R}^d\)
• Group actions and geometric combinatorics in \(\mathbb{F}_{q}^{d}\)
• Lower bounds on the independence number in terms of the degrees
• On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
• A new proof of several inequalities on codes and sets
• Flattening rank and its combinatorial applications
• Extension theorems and a connection to the Erdős-Falconer distance problem over finite fields
• On Falconer's distance set problem in the plane
• Sharp \(L^2\) estimates of the Schrödinger maximal function in higher dimensions
• Equilateral triangles in subsets of \(\mathbb{R}^d\) of large Hausdorff dimension
• A sharp exponent on sum of distance sets over finite fields
• The Difference Between Consecutive Primes, II
• LONG PATHS IN THE DISTANCE GRAPH OVER LARGE SUBSETS OF VECTOR SPACES OVER FINITE FIELDS
• Dependent random choice
• On maximal paths and circuits of graphs
• Erdös distance problem in vector spaces over finite fields
• On the Hausdorff dimensions of distance sets
• The analog of the Erdös distance problem in finite fields
• On kaleidoscopic pseudo-randomness of finite Euclidean graphs
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• Embedding distance graphs in finite field vector spaces
• Erdös--Falconer Distance Problem under Hamming Metric in Vector Spaces over Finite Fields
• The Erdös–Falconer Distance Problem, Exponential Sums, and Fourier Analytic Approach to Incidence Theorems in Vector Spaces over Finite Fields
• Vinogradov's theorem with almost equal summands
• What is Falconer's Conjecture?
• On a problem of K. Zarankiewicz
• On the structure of linear graphs
• Weighted restriction estimates and application to Falconer distance set problem
• On the pinned distances problem in positive characteristic

This page was built for publication: Embedding bipartite distance graphs under Hamming metric in finite fields