Upper bounds on chromatic number of $mathbb{e}^n$ in low dimensions

HIGHLIGHTS

  • What: Now the authors show that the packing √ radius of Λ is equal to 1.
  • Who: Andrii Arman et al. from the (UNIVERSITY) have published the Article: Upper bounds on chromatic number of E in low dimensions, in the Journal: (JOURNAL)
  • How: Once the authors have found a good sublattice Λ′ the authors take one of the vectors generating it and substitute it with other short non-forbidden nodes choosing one that minimizes the index of the resulting Λ′ while satisfying Λ′ ∩ F=∅.

SUMMARY

    The next result relies on the following fact: if . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?