arXiv subjects

Fernando Trejos Suárez

Publications and source records attributed to Fernando Trejos Suárez.

5 recordsLinked to original sources

arXiv2026

On Modified Diagonal Cycles and the Beauville Decomposition of the Ceresa Cycle

Let $C$ be a curve of genus $g \geq 2$, and let $J$ be its Jacobian. The choice of a degree 1 divisor $e$ on $C$ gives an embedding of $C$ into $J$; we denote by $[C]_{}^{e}\in \mathrm{CH}\left( J;\mathbb{Q} \right) $ the class in the Chow group of $J$ defined by its image. It is known that the vanishing of the Ceresa cycle $\mathrm{Cer}(C,e):=[C]^{e} - [-1]_* [C]^e$ is equivalent to both the vanishing of the 1st Beauville component $[C]_{(1)}^e$ and the vanishing of the 3rd Gross--Kudla--Schoen modified diagonal cycle $Γ^3(C,e) \in \mathrm{CH}(C^3;\mathbb{Q})$. We extend this result to show that the vanishing of the $s$-th Beauville component $[C]^e_{(s)}$ for $s \geq 1$ is equivalent to the vanishing of the $(s+2)$-nd modified diagonal cycle $Γ^{s + 2}(C, e) \in \mathrm{CH}(C^{s+2};\mathbb{Q})$. Moreover, we establish "successive vanishing" results for these cycles. We apply our results to study the rational (non)-triviality of $[C]^{e}_{(s)}$ in the special case $s = 2$. Finally in the $s=1$ case, we show an integral refinement to the original statement, relating the order of torsion of $\mathrm{Cer}(C,e) \in \mathrm{CH}(J;\mathbb{Z})$ to that of $Γ^3(C,e) \in \mathrm{CH}(C^3;\mathbb{Z})$.

math.AG↗

arXiv2022

An unconditional explicit bound on the error term in the Sato-Tate conjecture

Let $f(z) = \sum_{n=1}^\infty a_f(n)q^n$ be a holomorphic cuspidal newform with even integral weight $k\geq 2$, level $N$, trivial nebentypus, and no complex multiplication (CM). For all primes $p$, we may define $θ_p\in [0,π]$ such that $a_f(p) = 2p^{(k-1)/2}\cos θ_p$. The Sato-Tate conjecture states that the angles $θ_p$ are equidistributed with respect to the probability measure $μ_{\textrm{ST}}(I) = \frac{2}π\int_I \sin^2 θ\; dθ$, where $I\subseteq [0,π]$. Using recent results on the automorphy of symmetric-power $L$-functions due to Newton and Thorne, we explicitly bound the error term in the Sato-Tate conjecture when $f$ corresponds to an elliptic curve over $\mathbb{Q}$ of arbitrary conductor or when $f$ has squarefree level. In these cases, if $π_{f,I}(x) := \#\{ p \leq x : p \nmid N, θ_p\in I\}$, and $π(x) := \# \{ p \leq x \}$, we prove the following bound: $$\left| \frac{π_{f,I}(x)}{π(x)} - μ_{\textrm{ST}}(I)\right| \leq 58.1\frac{\log((k-1)N \log{x})}{\sqrt{\log{x}}} \qquad \text{for} \quad x \geq 3.$$ As an application, we give an explicit bound for the number of primes up to $x$ that violate the Atkin-Serre conjecture for $f$.

math.NT↗

arXiv2021

Completeness of Positive Linear Recurrence Sequences

A sequence of positive integers is complete if every positive integer is a sum of distinct terms. A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with nonnegative coefficients of the form $H_{n+1} = c_1 H_n + \cdots + c_L H_{n-L+1}$ and a particular set of initial conditions. We seek to classify various PLRS's by completeness. With results on how completeness is affected by modifying the recurrence coefficients of a PLRS, we completely characterize completeness of several families of PLRS's as well as conjecturing criteria for more general families. Our primary method is applying Brown's criterion, which says that an increasing sequence $\{H_n\}_{n = 1}^{\infty}$ is complete if and only if $H_1 = 1$ and $H_{n + 1} \leq 1 + \sum_{i = 1}^n H_i$. %A survey of these results can be found in \cite{BHLLMT}. Finally, we adopt previous analytic work on PLRS's to find a more efficient way to check completeness. Specifically, the characteristic polynomial of any PLRS has exactly one positive root; by bounding the size of this root, the majority of sequences may be classified as complete or incomplete. Additionally, we show there exists an indeterminate region where the principal root does not reveal any information on completeness. We have conjectured precise bounds for this region.

math.CO↗

arXiv2021

Tinkering with Lattices: A New Take on the Erdős Distance Problem

The Erdős distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $Θ(N/\sqrt{\log(N)})$ distinct distances, the lower bound for a set of $N$ points (Erdős, 1946). The only previous non-asymptotic work related to the Erdős distance problem that has been done was for $N \leq 13$. We take a new non-asymptotic approach to this problem in a model case, studying the distance distribution, or in other words, the plot of frequencies of each distance of the $N\times N$ integer lattice. In order to fully characterize this distribution, we adapt previous number-theoretic results from Fermat and Erdős in order to relate the frequency of a given distance on the lattice to the sum-of-squares formula. We study the distance distributions of all the lattice's possible subsets; although this is a restricted case, the structure of the integer lattice allows for the existence of subsets which can be chosen so that their distance distributions have certain properties, such as emulating the distribution of randomly distributed sets of points for certain small subsets, or emulating that of the larger lattice itself. We define an error which compares the distance distribution of a subset with that of the full lattice. The structure of the integer lattice allows us to take subsets with certain geometric properties in order to maximize error; we show these geometric constructions explicitly. Further, we calculate explicit upper bounds for the error when the number of points in the subset is $4$, $5$, $9$ or $\left \lceil N^2/2\right\rceil$ and prove a lower bound in cases with a small number of points.

math.NT↗

arXiv2020

An Introduction to Completeness of Positive Linear Recurrence Sequences

A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with positive coefficients and a particular set of initial conditions. A sequence of positive integers is \emph{complete} if every positive integer is a sum of distinct terms of the sequence. One consequence of Zeckendorf's theorem is that the sequence of Fibonacci numbers is complete. Previous work has established a generalized Zeckendorf's theorem for all PLRS's. We consider PLRS's and want to classify them as complete or not. We study how completeness is affected by modifying the recurrence coefficients of a PLRS. Then, we determine in many cases which sequences generated by coefficients of the forms $[1, \ldots, 1, 0, \ldots, 0, N]$ are complete. Further, we conjecture bounds for other maximal last coefficients in complete sequences in other families of PLRS's. Our primary method is applying Brown's criterion, which says that an increasing sequence $\{H_n\}_{n = 1}^{\infty}$ is complete if and only if $H_1 = 1$ and $H_{n + 1} \leq 1 + \sum_{i = 1}^n H_i$. This paper is an introduction to the topic that is explored further in Completeness of Positive Linear Recurrence Sequences arXiv:2010.01655.

math.CO↗