Search arXivSearch

arXiv · 2509.22333

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

Abstract

We prove that in any $\mathbb{Z}^n$-periodic triangulation of $\mathbb{R}^n$ the number of $\mathbb{Z}^n$-orbits of $n$-dimensional simplices is at least the tensor rank of the $n$th determinant tensor. The latter is known to be at least $\frac{n^{n-1}}{(n-1)!}$, which is approximately $\frac{e^n}{\sqrt{2πn}}$ for large $n$. 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 $X$ is a simplicial cell complex with cohomological classes $α_i\in H^{d_i}(X;\mathbb{Z}_2)$ satisfying \[ α_1 \smile α_2 \smile \ldots \smile α_n \neq 0, \] then $X$ has at least $2^n$ simplices of dimension $d_1+d_2+\ldots+d_n$. In particular, a simplicial cell complex homeomorphic to $\mathbb{R} P^n$, $\mathbb{C} P^n$, or $(S^2)^n$, has at least $2^n$ 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 $\mathbb{R}^n/\mathbb{Z}^n$ with $n+1$ and $2^{n+1}-1$ vertices, resp. Triangulations with this many vertices were described before and no smaller triangulation is known.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergey Avvakumov, Roman Karasev. 2025-09-26. Tensor rank of the determinant and periodic triangulations of $\mathbb{R}^n$. https://arxiv.org/abs/2509.22333

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO