On a generalization of the Hadwiger-Nelson problem
From MaRDI portal
(Redirected from Publication:522309)
Abstract: For a field and a quadratic form defined on an -dimensional vector space over , let , called the quadratic graph associated to , be the graph with the vertex set where vertices form an edge if and only if . Quadratic graphs can be viewed as natural generalizations of the unit-distance graph featuring in the famous Hadwiger-Nelson problem. In the present paper, we will prove that for a local field of characteristic zero, the Borel chromatic number of is infinite if and only if represents zero non-trivially over . The proof employs a recent spectral bound for the Borel chromatic number of Cayley graphs, combined with an analysis of certain oscillatory integrals over local fields. As an application, we will also answer a variant of question 525 proposed in the 22nd British Combinatorics Conference 2009.
Recommendations
Cites work
- scientific article; zbMATH DE number 447275 (Why is no real title available?)
- scientific article; zbMATH DE number 1313469 (Why is no real title available?)
- scientific article; zbMATH DE number 1324223 (Why is no real title available?)
- scientific article; zbMATH DE number 1943977 (Why is no real title available?)
- scientific article; zbMATH DE number 3404329 (Why is no real title available?)
- scientific article; zbMATH DE number 46730 (Why is no real title available?)
- A model of set-theory in which every set of reals is Lebesgue measurable
- An introduction to \(p\)-adic fields, harmonic analysis and the representation theory of \(\text{SL}_2\)
- Axiom of choice and chromatic number: Examples on the plane
- Distances realized by sets covering the plane
- Fourier Analysis on Local Fields. (MN-15)
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
- Lower bounds for measurable chromatic numbers
- Measurable sets with excluded distances
- Research problems from the BCC22
- Special functions on locally compact fields
- Spectral bounds for the independence ratio and the chromatic number of an operator
- The Mathematical Coloring Book
- The clique numbers of regular graphs of matrix algebras are finite
- The realization of distances in measurable subsets covering R^ n.
- The total graph of a commutative ring
Cited in
(3)
This page was built for publication: On a generalization of the Hadwiger-Nelson problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522309)