arXiv subjects
Publications and source records attributed to Nicholas Triantafillou.
On a projective variety defined over a global field, any Brauer--Manin obstruction to the existence of rational points is captured by a finite subgroup of the Brauer group. We show that this subgroup can require arbitrarily many generators.
Conventional inversion of the discrete Fourier transform (DFT) requires all DFT coefficients to be known. When the DFT coefficients of a rasterized image (represented as a matrix) are known only within a pass band, the original matrix cannot be uniquely recovered. In many cases of practical importance, the matrix is binary and its elements can be reduced to either 0 or 1. This is the case, for example, for the commonly used QR codes. The {\it a priori} information that the matrix is binary can compensate for the missing high-frequency DFT coefficients and restore uniqueness of image recovery. This paper addresses, both theoretically and numerically, the problem of recovery of blurred images without any known structure whose high-frequency DFT coefficients have been irreversibly lost by utilizing the binarity constraint. We investigate theoretically the smallest band limit for which unique recovery of a generic binary matrix is still possible. Uniqueness results are proved for images of sizes $N_1 \times N_2$, $N_1 \times N_1$, and $N_1^α\times N_1^α$, where $N_1 \neq N_2$ are prime numbers and $α>1$ an integer. Inversion algorithms are proposed for recovering the matrix from its band-limited (blurred) version. The algorithms combine integer linear programming methods with lattice basis reduction techniques and significantly outperform naive implementations. The algorithm efficiently and reliably reconstructs severely blurred $29 \times 29$ binary matrices with only $11\times 11 = 121$ DFT coefficients.
We study the $n^{\rm th}$ centered moments of the $1$-level density for the low-lying zeros of $L$-functions attached to holomorphic cuspidal newforms of large prime level and fixed weight. Assuming the Generalized Riemann Hypotheses, we compute this statistic for any $n\ge 1$ and for all test functions whose Fourier transforms are supported in $\left(-2/n, \, 2/n\right)$. This is believed to be the natural limit of the current technology. Our work significantly extends beyond the trivial range $(-1/n, \, 1/n)$ and surpasses the previous record of $(-1/(n-1),\, 1/(n-1))$ whenever $n>2$. The Katz-Sarnak philosophy predicts that the aforementioned statistic can be modeled by the corresponding statistic for the eigenvalues of random orthogonal matrices. We prove that this is the case for test functions with Fourier support contained in $(-2/n,\, 2/n)$. The main technical innovation is a tractable vantage to evaluate the combinatorial zoo of terms, similar to the work of Conrey-Snaith and Mason-Snaith. As an application, our work provides better bounds on the order of vanishing at the central point for the $L$-functions in our family.
Let $p$ be a prime, let $r$ and $q$ be powers of $p$, and let $a$ and $b$ be relatively prime integers not divisible by $p$. Let $C/\mathbb F_{r}(t)$ be the superelliptic curve with affine equation $y^b+x^a=t^q-t$. Let $J$ be the Jacobian of $C$. By work of Pries--Ulmer, $J$ satisfies the Birch and Swinnerton-Dyer conjecture (BSD). Generalizing work of Griffon--Ulmer, we compute the $L$-function of $J$ in terms of certain Gauss sums. In addition, we estimate several arithmetic invariants of $J$ appearing in BSD, including the rank of the Mordell--Weil group $J(\mathbb F_{r}(t))$, the Faltings height of $J$, and the Tamagawa numbers of $J$ in terms of the parameters $a,b,q$. For any $p$ and $r$, we show that for certain $a$ and $b$ depending only on $p$ and $r$, these Jacobians provide new examples of families of simple abelian varieties of fixed dimension and with unbounded analytic and algebraic rank as $q$ varies through powers of $p$. Under a different set of criteria on $a$ and $b$, we prove that the order of the Tate--Shafarevich group of $J$ grows quasilinearly in $q$ as $q \to \infty.$
Given a smooth, proper, geometrically integral curve $X$ of genus $g$ with Jacobian $J$ over a number field $K$, Chabauty's method is a $p$-adic technique to bound $\# X(K)$ when $\mathrm{rank}\ J(K) < g$. We study limitations of a variant called `Restriction of Scalars Chabauty' (RoS Chabauty). RoS Chabauty typically bounds $\# X(K)$ when $\mathrm{rank}\ J(K) \leq [K:\mathbb{Q}] (g - 1)$, but fails in the presence of a subgroup obstruction, a high-rank subgroup scheme of $\mathrm{Res}_{K/\mathbb{Q}} J$ which intersects the image of $\mathrm{Res}_{K/\mathbb{Q}} X$ in higher-than-expected dimension. We define BCP obstructions, which are certain subgroup obstructions arising from the geometry of $X$. BCP obstructions explain all known examples where RoS Chabauty fails to bound $\# X(K)$. We also extend RoS Chabauty to compute $S$-integral points on affine curves. Suppose $K$ does not contain a CM-subfield. We present a $p$-adic algorithm which conjecturally computes solutions to the $S$-unit equation $x+y = 1$ for $x,y \in \mathcal{O}_{K,S}^{\times}$ by using RoS Chabauty to compute $S$-integral points on certain genus $0$ affine curves. As evidence the algorithm succeeds, we prove that all but one of these curves have no subgroup obstructions and that the remaining curve has no BCP obstructions to RoS Chabauty. In contrast, under a generalized Leopoldt conjecture, we prove that analogous methods using classical Chabauty cannot bound solutions to the $S$-unit equation when $[K:\mathbb Q] \geq 3$ and $K$ is not totally real.
We obtain new restrictions on the linear programming bound for sphere packing, by optimizing over spaces of modular forms to produce feasible points in the dual linear program. In contrast to the situation in dimensions 8 and 24, where the linear programming bound is sharp, we show that it comes nowhere near the best packing densities known in dimensions 12, 16, 20, 28, and 32. More generally, we provide a systematic technique for proving separations of this sort.
Let $K$ be a number field with ring of integers $\mathcal O_{K}$. We prove that if $3$ does not divide $ [K:\mathbb Q]$ and $3$ splits completely in $K$, then the unit equation has no solutions in $K$. In other words, there are no $x, y \in \mathcal O_{K}^{\times}$ with $x + y = 1$. Our elementary $p$-adic proof is inspired by the Skolem-Chabauty-Coleman method applied to the restriction of scalars of the projective line minus three points. Applying this result to a problem in arithmetic dynamics, we show that if $f \in \mathcal O_{K}[x]$ has a finite cyclic orbit in $\mathcal O_{K}$ of length $n$ then $n \in \{1, 2, 4\}$.
We give an introductory account of two recent approaches towards an effective proof of the Mordell conjecture, due to Lawrence--Venkatesh and Kim. The latter method, which is usually called the method of Chabauty--Kim or non-abelian Chabauty in the literature, has the advantage that in some cases it has been turned into an effective method to determine the set of rational points on a curve, and we illustrate this by presenting three new examples of modular curves where this set can be determined.
We describe an algorithm to compute the zeta function of a cyclic cover of the projective line over a finite field of characteristic $p$ that runs in time $p^{1/2 + o(1)}$. We confirm its practicality and effectiveness by reporting on the performance of our SageMath implementation on a range of examples. The algorithm relies on Gonçalves's generalization of Kedlaya's algorithm for cyclic covers, and Harvey's work on Kedlaya's algorithm for large characteristic.
In this paper, we present efficient algorithms for computing the number of points and the order of the Jacobian group of a superelliptic curve over finite fields of prime order p. Our method employs the Hasse-Weil bounds in conjunction with the Hasse-Witt matrix for superelliptic curves, whose entries we express in terms of multinomial coefficients. We present a fast algorithm for counting points on specific trinomial superelliptic curves and a slower, more general method for all superelliptic curves. For the first case, we reduce the problem of simplifying the entries of the Hasse-Witt matrix modulo p to a problem of solving quadratic Diophantine equations. For the second case, we extend Bostan et al.'s method for hyperelliptic curves to general superelliptic curves. We believe the methods we describe are asymptotically the most efficient known point-counting algorithms for certain families of trinomial superelliptic curves.
The limiting distribution of eigenvalues of N x N random matrices has many applications. One of the most studied ensembles are real symmetric matrices with independent entries iidrv; the limiting rescaled spectral measure (LRSM) $\widetildeμ$ is the semi-circle. Studies have determined the LRSMs for many structured ensembles, such as Toeplitz and circulant matrices. These have very different behavior; the LRSM for both have unbounded support. Given a structured ensemble such that (i) each random variable occurs o(N) times in each row and (ii) the LRSM exists, we introduce a parameter to continuously interpolate between these behaviors. We fix a p in [1/2, 1] and study the ensemble of signed structured matrices by multiplying the (i,j)-th and (j,i)-th entries of a matrix by a randomly chosen epsilon_ij in {1, -1}, with Prob(epsilon_ij = 1) = p (i.e., the Hadamard product). For p = 1/2 we prove that the limiting signed rescaled spectral measure is the semi-circle. For all other p, the limiting measure has bounded (resp., unbounded) support if $\widetildeμ$ has bounded (resp., unbounded) support, and converges to $\widetildeμ$ as p -> 1. Notably, these results hold for Toeplitz and circulant matrix ensembles. The proofs are by the Method of Moments. The analysis involves the pairings of 2k vertices on a circle. The contribution of each in the signed case is weighted by a factor depending on p and the number of vertices involved in at least one crossing. These numbers appear in combinatorics and knot theory. The number of configurations with no vertices involved in a crossing is well-studied, and are the Catalan numbers. We prove similar formulas for configurations with up to 10 vertices in at least one crossing. We derive a closed-form expression for the expected value and determine the asymptotics for the variance for the number of vertices in at least one crossing.
A subset A of {0,1,...,n} is said to be a 2-additive basis for {1,2,...,n} if each j in {1,2,...,n} can be written as j=x+y, x,y in A, x<=y. If we pick each integer in {0,1,...,n} independently with probability p=p_n tending to 0, thus getting a random set A, what is the probability that we have obtained a 2-additive basis? We address this question when the target sum-set is [(1-alpha)n,(1+alpha)n] (or equivalently [alpha n, (2-alpha) n]) for some 0<alpha<1. Under either model, the Stein-Chen method of Poisson approximation is used, in conjunction with Janson's inequalities, to tease out a very sharp threshold for the emergence of a 2-additive basis. Generalizations to k-additive bases are then given.