Related papers: Arithmetic complexity revisited
The continued fraction expansion of an irrational number $\alpha$ is eventually periodic if and only if $\alpha$ is a quadratic irrationality. However, very little is known regarding the size of the partial quotients of algebraic real…
The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are…
Algebraic Combinatorics originated in Algebra and Representation Theory, studying their discrete objects and integral quantities via combinatorial methods which have since developed independent and self-contained lives and brought us some…
It is proved that the rank of elliptic curves with complex multiplication introduced by B. H. Gross is one less an arithmetic complexity of the corresponding noncommutative tori with real multiplication.
Let $\mathbb{F}_r$ be a finite field of characteristic $p>3$. For any power $q$ of $p$, consider the elliptic curve $E=E_{q,r}$ defined by $y^2=x^3 + t^q -t$ over $K=\mathbb{F}_r(t)$. We describe several arithmetic invariants of $E$ such as…
Zaremba's Conjecture concerns the formation of continued fractions with partial quotients restricted to a given alphabet. In order to answer the numerous questions that arrive from this conjecture, it is best to consider a semi-group, often…
We study elliptic curves of the form $x^3+y^3=2p$ and $x^3+y^3=2p^2$ where $p$ is any odd prime satisfying $p\equiv 2\bmod 9$ or $p\equiv 5\bmod 9$. We first show that the $3$-part of the Birch-Swinnerton-Dyer conjecture holds for these…
We find new examples of complex surfaces with countably many non-isomorphic algebraic structures. Here is one such example: take an elliptic curve $E$ in $\mathbb P^2$ and blow up nine general points on $E$. Then the complement $M$ of the…
In this paper, we give explicit equations for homogeneous spaces corresponding to a rational isogeny of degree $3$. An explicit set of elliptic curves with elements of order $3$ in their Tate-Shafarevich group is constructed. Combining this…
This paper is devoted to study multiplicity and regularity as well as to present some classifications of complex analytic sets. We present an equivalence for complex analytical sets, namely blow-spherical equivalence and we receive several…
In this paper, we consider the relation between the simplest types of arithmetic theta series, those associated to the cycles on the moduli space $\Cal C$ of elliptic curves with CM by the ring of integers $\OK$ in an imaginary quadratic…
We define a measure of "complexity" of a braid which is natural with respect to both an algebraic and a geometric point of view. Algebraically, we modify the standard notion of the length of a braid by introducing generators $\Delta\_{ij}$,…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
An arithmetic formula is an expression involving only the constant $1$, and the binary operations of addition and multiplication, with multiplication by $1$ not allowed. We obtain an asymptotic formula for the number of arithmetic formulas…
An expression is any mathematical formula that contains certain formal variables and operations to be executed in a specified order. In computer science, it is usually convenient to represent each expression in the form of an expression…
We show that the number of copies of ${\Bbb Q}_p/{\Bbb Z}_p$ in the Tate-Shafarevich group of an elliptic curve $E$ over ${\Bbb Q}$ with complex multipication, is at most $2p - g$, where $g$ is the rank of $E({\Bbb Q})$, and for all…
Cremona, Mazur, and others have studied what they call visibility of elements of Shafarevich-Tate groups of elliptic curves. The analogue for an abelian number field $K$ is capitulation of ideal classes of $K$ in the minimal cyclotomic…
In this article, we investigate the arithmetical hierarchy from the perspective of realizability theory. An experimental observation in classical computability theory is that the notion of degrees of unsolvability for natural arithmetical…
We say that the order of an algebraic number $A$ is the minimum of positive integers $k$ such that $A^k$ is rational. In this paper, we show that the number of algebraic numbers $A$ with order $k$ such that \[ A,\ A^A,\ A^{A^A},\ \ldots \]…
This article concerns the computational complexity of a fundamental problem in number theory: counting points on curves and surfaces over finite fields. There is no subexponential-time algorithm known and it is unclear if it can be…