Papers
Topics
Authors
Recent
Search
2000 character limit reached

Tensor rank of the determinant and periodic triangulations of Rn\mathbb{R}^n

Published 26 Sep 2025 in math.CO and math.GT | (2509.22333v1)

Abstract: We prove that in any Z<sup>n\mathbb{Z}<sup>n-periodic triangulation of R<sup>n\mathbb{R}<sup>n the number of Z<sup>n\mathbb{Z}<sup>n-orbits of nn-dimensional simplices is at least the tensor rank of the nnth determinant tensor. The latter is known to be at least n<sup>n−1(n−1)!\frac{n<sup>{n-1}}{(n-1)!}, which is approximately e<sup>n2π</sup>n\frac{e<sup>n}{\sqrt{2\pi</sup> n}} for large nn. The triangulation is not assumed to be geometric, meaning that its simplices can be ``curved''. We also provide lower bounds for general spaces. A simplicial cell complex is a CW-complex glued out of simplices with the attaching maps being simplicial embeddings; this notion generalizes simplicial complexes. We prove that if XX is a simplicial cell complex with cohomological classes αi∈H<sup>di(X;Z2)\alpha_i\in H<sup>{d_i}(X;\mathbb{Z}_2) satisfying [ \alpha_1 \smile \alpha_2 \smile \ldots \smile \alpha_n \neq 0, ] then XX has at least $2n$ simplices of dimension d1+d2+…+dnd_1+d_2+\ldots+d_n. In particular, a simplicial cell complex homeomorphic to RP<sup>n\mathbb{R} P<sup>n, CP<sup>n\mathbb{C} P<sup>n, or (S<sup>2)<sup>n(S<sup>2)<sup>n, has at least $2n$ top-dimensional simplices. A crystallization of a manifold is a simplicial cell complex homeomorphic to this manifold and having the least possible number of vertices. We give a short explicit construction of a crystallization and a triangulation of R<sup>n/Z<sup>n\mathbb{R}<sup>n/\mathbb{Z}<sup>n with n+1n+1 and 2<sup>n+1−12<sup>{n+1}-1 vertices, resp. Triangulations with this many vertices were described before and no smaller triangulation is known.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.