Related papers: Counting rational points and lower bounds for Galo…

We present some new lower bound estimates for certain numbers in Laver table theory and introduce several related structures of interest.

We present new bounds for the numerical radius of bounded linear operators and $2\times 2$ operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new…

We give explicit uniform bounds for several quantities relevant to the study of Galois representations attached to elliptic curves $E/\mathbb Q$. We consider in particular the subgroup of scalars in the image of Galois, the first Galois…

This paper introduces the notion of a Galois point for a finite graph, using the theory of linear systems of divisors for graphs discovered by Baker and Norine. We present a new characterization of complete graphs in terms of Galois points.

Let $S$ be a Shimura variety and let $h$ be a Weil height function on $S$. We conjecture that the heights of special points in $S$ are discriminant negligible. Assuming this conjecture to be true, we prove that the sizes of the Galois…

We prove quantitative versions of Borel and Harish-Chandra's theorems on reduction theory for arithmetic groups. Firstly, we obtain polynomial bounds on the lengths of reduced integral vectors in any rational representation of a reductive…

In this article a new upper bounds for the multiple trigonometrical integrals are found. The method of the work based on a new method of estimation for the areas of algebraic surfaces.

In this paper we introduce a method to obtain algebraic information using arithmetic one in the study of tori and their principal homogeneous spaces. In particular, using some results of the authors with Tingyu Lee, we determine the…

The distribution of degree $d$ points on curves is well understood, especially for low degrees. We refine this study to include information on the Galois group in the simplest interesting case: $d = 3$. For curves of genus at least 5, we…

In this note we investigate the problem of existence of a torsor structure for Galois covers of (formal) schemes over a complete discrete valuation ring of residue characteristic $p>0$ in the case of abelian Galois groups of type…

In this paper we study the reduction of Galois covers of curves, from characteristic 0 to characteristic p. The starting point is a is a recent result of Raynaud which gives a criterion for good reduction for covers of the projective line…

A fundamental problem in arithmetic geometry is to determine the image of the mod $N$ Galois representation for all elliptic curves over $\mathbb{Q}$ and integers $N \geq 1$. For a given subgroup $G \le…

In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…

For prime $p$ and small $n$, Jones and Roberts have developed a database recording invariants for $p$-adic extensions of degree $n$. We contributed to this database by computing the Galois slope content, Galois mean slope, and inertia…

We announce numerous new results in the theory of orthogonal polynomials on the unit circle.

In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnegative as well as to have a sum of binomial squares…

We use an invariant-theoretic method to compute certain twists of the modular curves X(n) for n=7,9,11. Searching for rational points on these twists enables us to find non-trivial pairs of n-congruent elliptic curves over Q, i.e. pairs of…

This is a guide to the construction of nonlinear number fields, which includes new points not found in our earlier article ``Geometric Galois theory, nonlinear number fields and a Galois group interpretation of the idele class group''.

This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining…

We prove a uniform generalized gaussian bound for the powers of a discrete convolution operator in one space dimension. Our bound is derived under the assumption that the Fourier transform of the coefficients of the convolution operator is…