Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 85 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 37 tok/s
GPT-5 High 37 tok/s Pro
GPT-4o 100 tok/s
GPT OSS 120B 473 tok/s Pro
Kimi K2 240 tok/s Pro
2000 character limit reached

Projective Variety Recovery from Unknown Linear Projections (2504.16771v1)

Published 23 Apr 2025 in math.AG and cs.SC

Abstract: We study how a smooth irreducible algebraic variety $X$ of dimension $n$ embedded in $\mathbb{C} \mathbb{P}{m}$ (with $m \geq n+2$), which degree is $d$, can be recovered using two projections from unknown points onto unknown hyperplanes. The centers and the hyperplanes of projection are unknown: the only input is the defining equations of each projected varieties. We show how both the projection operators and the variety in $\mathbb{C} \mathbb{P}{m}$ can be recovered modulo some action of the group of projective transformations of $\mathbb{C} \mathbb{P}{m}$. This configuration generalizes results obtained in the context of curves embedded in $\mathbb{C} \mathbb{P}3$ and results concerning surfaces embedded in $\mathbb{C} \mathbb{P}4$. We show how in a generic situation, a characteristic matrix of the pair of projections can be recovered. In the process we address dimensional issues and as a result establish a necessary condition, as well as a sufficient condition to compute this characteristic matrix up to a finite-fold ambiguity. These conditions are expressed as minimal values of the degree of the dual variety. Then we use this matrix to recover the class of the couple of projections and as a consequence to recover the variety. For a generic situation, two projections define a variety with two irreducible components. One component has degree $d(d-1)$ and the other has degree $d$, being the original variety.

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

Collections

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

Summary

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

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

Follow-up Questions

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

Authors (1)