Related papers: Simultaneous Arithmetic Progressions on Algebraic …

Given a set $S$ of elements in a number field $k$, we discuss the existence of planar algebraic curves over $k$ which possess rational points whose $x$-coordinates are exactly the elements of $S$. If the size $|S|$ of $S$ is either $4,5$,…

In this paper we give an upper bound for the number of integral points on an elliptic curve E over F_q[T] in terms of its conductor N and q. We proceed by applying the lower bounds for the canonical height that are analogous to those given…

It is known that if a subset of $\mathbb{R}$ has positive Lebesgue measure, then it contains arbitrarily long finite arithmetic progressions. We prove that this result does not extend to infinite arithmetic progressions in the following…

We study the number of connected graphs with $n$ vertices that cannot be written as the cartesian product of two graphs with fewer vertices. We give an upper bound which implies that for large $n$ almost all graphs are both connected and…

In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…

This paper establishes a constructive link between the first slope of Artin-Schreier curves X_f: y^p-y=f(x) and the p-adic weight of the support of f(x). If the maximal p-adic weight element v in Supp(f) is unique, we show that the first…

We find upper bounds that are sharp for the number of $k$th powers inside arbitrary arithmetic progressions whose step has $O(1)$ many divisors.

We describe a method for bounding the rank of an elliptic curve under the assumptions of the Birch and Swinnerton-Dyer conjecture and the generalized Riemann hypothesis. As an example, we compute, under these conjectures, exact upper bounds…

We consider multiply periodic functions, sometimes called Abelian functions, defined with respect to the period matrices associated with classes of algebraic curves. We realise them as generalisations of the Weierstras P-function using two…

We formulate an adiabatic theorem adapted to models that present an instantaneous eigenvalue experiencing an infinite number of crossings with the rest of the spectrum. We give an upper bound on the leading correction terms with respect to…

Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…

We show that if F is the rational numbers or a multiquadratic number field, p is 2,3, or 5, and K/F is a Galois extension of degree a power of p, then for elliptic curves E/Q ordered by height, the average dimension of the p-Selmer groups…

Let E/k be an elliptic curve over a number field. We obtain some quantitative refinements of results of Hindry-Silverman, giving an upper bound for the number of k-rational torsion points, and a lower bound for the canonical height of…

We show that the infinite staircases which arise in the ellipsoid embedding functions of rigid del Pezzo surfaces (with their monotone symplectic forms) can be entirely explained in terms of rational sesquicuspidal symplectic curves.…

Quantum computers can sometimes exponentially outperform classical ones, but only for problems with sufficient structure. While it is well known that query problems with full permutation symmetry can have at most polynomial quantum speedup…

For each $n\in N ^{\ast }$, we write $s_{n}=\left( 1,\ldots ,1,0\right) $ with $n$ times $1$. For each $a \in N$, we consider the binary representation $\left( a_{i}\right) _{i\in -N }$ of $a$ with $a_{i}=0$ for nearly each $i$; we denote…

We give an algorithm to compute the stable lengths of pseudo-Anosovs on the curve graph, answering a question of Bowditch. We also give a procedure to compute all invariant tight geodesic axes of pseudo-Anosovs. Along the way we show that…

In 1975 Szemer\'edi proved that a set of integers of positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman showed in 1996 that the common difference of the arithmetic progression can be a square, a…

The paper provides bounds for the ropelength of a link in terms of the crossing numbers of its split components. As in earlier papers, the bounds grow with the square of the crossing number; however, the constant involved is a substantial…

We obtain a sharp upper bound for the length of arbitrary non-associative algebra and present an example demonstrating the sharpness of our bound. To show this we introduce a new method of characteristic sequences based on linear algebra…