Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

From non Defectivity to Identifiability (1911.00780v1)

Published 2 Nov 2019 in math.AG

Abstract: A projective variety $X\subset\mathbb{P}N$ is $h$-identifiable if the generic element in its $h$-secant variety uniquely determines $h$ points on $X$. In this paper we propose an entirely new approach to study identifiability, connecting it to the notion of secant defect. In this way we are able to improve all known bounds on identifiability. In particular we give optimal bounds for some Segre and Segre-Veronese varieties and provide the first identifiability statements for Grassmann varieties.

Summary

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