Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 183 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 24 tok/s Pro
GPT-4o 97 tok/s Pro
Kimi K2 221 tok/s Pro
GPT OSS 120B 440 tok/s Pro
Claude Sonnet 4.5 38 tok/s Pro
2000 character limit reached

Typical ranks of random order-three tensors (2407.08371v1)

Published 11 Jul 2024 in math.AG

Abstract: In this paper we study typical ranks of real $m\times n \times \ell$ tensors. In the case $ (m-1)(n-1)+1 \leq \ell \leq mn$ the typical ranks are contained in ${\ell, \ell +1}$, and $\ell$ is always a typical rank. We provide a geometric proof of this fact. We express the probabilities of these ranks in terms of the probabilities of the numbers of intersection points of a random linear space with the Segre variety. In addition, we give some heuristics to understand how the probabilities of these ranks behave, based on asymptotic results on the average number of real points in a random linear slice of a Segre variety with a subspace of complementary dimension. The typical ranks of real $3\times 3\times 5$ tensors are $5$ and $6$. We link the rank probabilities of a $3\times 3 \times 5$ tensor with i.i.d.\ Gaussian entries to the probability of a random cubic surface in $\P3$ having real lines. As a consequence, we get a bound on the expected number of real lines on such a surface.

Citations (1)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.