A rational distance set is a subset of the plane such that the distance between any two points is a rational number. We show, assuming Lang's conjecture, that the cardinalities of rational distance sets in general position are uniformly bounded, generalizing results of Solymosi-de Zeeuw, Makhul-Shaffaf, Shaffaf and Tao. In the process, we give a criterion for certain varieties with non-canonical singularities to be of general type.
We prove that a complete intersection of c very general hypersurfaces of degrees d1, . . . , dc ≥ 2 in N -dimensional complex projective space is not ruled (and therefore not rational) provided that c i=1 di ≥ 2 3 N + c + 1. To this end we consider a degeneration to positive characteristic, following Kollár. Our argument does not require a resolution of the singularities of the special fiber of the degeneration. It relies on a generalization of Kollár's "algebraic Morse lemma" that controls the dimensions of the second-order Thom-Boardman singularities of general sections of Frobenius pullbacks of vector bundles.1 In the context of Theorem 0.3, it seems natural to define the singularity of a section s ∈ Γ(X, F * X E) at a point x ∈ X to be the equivalence class of e-tuples of power series consisting of all images of s under k-linear isomorphismsinduced by choices of formal coordinates around x and of OX,x-bases for E ⊗ OX,x.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.