Tagging - 2022-08-09

8

Q: How many lattices does it take to cover a regular $n$-gon?

Given some positive integer $n\ge 3$, we can ask how many 2-dimensional lattices $L_1,\ldots,L_k$ are required such that their disjoint union contains all vertices of a regular $n$-gon. (We don't require that the lattices be centered at the origin.) When $n=3,4,6$, the polygon is a lattice polygo...

in Pearl Dive, 11 mins ago, by Martin Sleziak

@JyrkiLahtonen Would maybe integer-lattices be a suitable tag? What about discrete-geometry?

in Pearl Dive, 11 mins ago, by Martin Sleziak

Since the question was bumped by the bounty, perhaps it is a good opportunity to improve tagging.

in Pearl Dive, 11 mins ago, by Martin Sleziak

I'd guess polygons could be added, if nothing else.

in Pearl Dive, 7 mins ago, by Jyrki Lahtonen

Thanks for the suggestion @MartinSleziak. I added a few tags, feel free to add whatever you think fits. I don't think oeis is a very useful tag here.

8

Q: How many lattices does it take to cover a regular $n$-gon?

Given some positive integer $n\ge 3$, we can ask how many 2-dimensional lattices $L_1,\ldots,L_k$ are required such that their disjoint union contains all vertices of a regular $n$-gon. (We don't require that the lattices be centered at the origin.) When $n=3,4,6$, the polygon is a lattice polygo...

geometry polygons roots-of-unity integer-lattices oeis

Transcript for

$Mathematics$ Tagging