Searcharxiv⌕ Search

arXiv subjects

X. W. C. Faber

Publications and source records attributed to X. W. C. Faber.

5 recordsLinked to original sources

The Geometric Bogomolov Conjecture for Small Genus Curves

The Bogomolov Conjecture is a finiteness statement about algebraic points of small height on a smooth complete curve defined over a global field. We verify an effective form of the Bogomolov Conjecture for all curves of genus at most 4 defined over a function field of characteristic zero. We recover the known result for genus 2 curves and in many cases improve upon the known bound for genus 3 curves. For many curves of genus 4 with bad reduction, the conjecture was previously unproved.

math.NT↗

Equidistribution of Dynamically Small Subvarieties over the Function Field of a Curve

For a projective variety X defined over a field K, there is a special class of self-morphisms of X called algebraic dynamical systems. In this paper we take K to be the function field of a smooth curve and prove that at each place of K, subvarieties of X of dynamically small height are equidistributed on the associated Berkovich analytic space. We carefully develop all of the arithmetic intersection theory needed to state and prove this theorem, and we present several applications on the non-Zariski density of preperiodic points and of points of small height in field extensions of bounded degree.

math.NT↗

On the Finite Field Kakeya Problem in Two Dimensions

A two-dimensional Besicovitch set over a finite field is a subset of the finite plane containing a line in each direction. In this paper, we conjecture a sharp lower bound for the size of such a subset and prove some results toward this conjecture.

math.NT↗

Spectral Convergence of the Discrete Laplacian on Models of a Metrized Graph

A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become uniformly distributed on the metrized graph, then the i-th largest eigenvalue of the Laplacian matrices of these combinatorial graphs converges to the i-th largest eigenvalue of the continuous Laplacian operator on the metrized graph upon suitable scaling. The eigenvectors of these matrices can be viewed as functions on the metrized graph by linear interpolation. These interpolated functions form a normal family, any convergent subsequence of which limits to an eigenfunction of the continuous Laplacian operator on the metrized graph.

math.CA↗