Fuglede's conjecture

From testwiki
Jump to navigation Jump to search

Template:Short description Fuglede's conjecture is a problem in mathematics proposed by Bent Fuglede in 1974, and resolved in the negative for most dimensions by Terence Tao in 2004. It states that every domain of ℝd (i.e. subset of ℝd with positive finite Lebesgue measure) is a spectral set if and only if it tiles ℝd by translation.[1]

Spectral sets and translational tiles

Spectral sets in ℝd

A set Ω ⊂ ℝd with positive finite Lebesgue measure is said to be a spectral set if there exists a Λ ⊂ ℝd such that {e2πi⟨λ,⋅⟩}λ∈Λ is an orthogonal basis of L2(Ω). The set Λ is then said to be a spectrum of Ω and (Ω,Λ) is called a spectral pair.

Translational tiles of ℝd

A set Ω⊂ℝd is said to tile ℝd by translation (i.e. Ω is a translational tile) if there exist a discrete set T such that ⋃t∈T(Ω+t)=ℝd and (Ω+t)∩(Ω+t′) has Lebesgue measure zero for all t≠t′ in T.[2]

Partial results

  • Fuglede proved in 1974 that the conjecture holds if Ω is a fundamental domain of a lattice.
  • In 2003, Alex Iosevich, Nets Katz and Terence Tao proved that the conjecture holds if Ω is a convex planar domain.[3]
  • In 2004, Terence Tao showed that the conjecture is false on ℝd for d≥5.[4] It was later shown by Bálint Farkas, Mihail N. Kolounzakis, Máté Matolcsi and Péter Móra that the conjecture is also false for d=3 and 4.[5][6][7][8] However, the conjecture remains unknown for d=1,2.
  • In 2015, Alex Iosevich, Azita Mayeli and Jonathan Pakianathan showed that an extension of the conjecture holds in ℤp×ℤp, where ℤp is the cyclic group of order p.[9]
  • In 2017, Rachel Greenfeld and Nir Lev proved the conjecture for convex polytopes in ℝ3.[10]
  • In 2019, Nir Lev and Máté Matolcsi settled the conjecture for convex domains affirmatively in all dimensions.[11]

References