Related papers: Arithmetic complexity revisited

In this paper, we prove a criterion for complexity in $g$-ary expansions of a rational fraction $a/b<1$ with gcd$(a,b)=1$. We prove that for any purely periodic proper fraction $a/b$ and all $j\geq 1$, each sequence of $j$ digits occurs in…

Let $E/\mathbb{Q}$ be an elliptic curve having multiplicative reduction at a prime $p$. Let $(g,h)$ be a pair of eigenforms of weight $1$ arising as the theta series of an imaginary quadratic field $K$, and assume that the triple-product…

Symmetry of geometrical figures is reflected in regularities of their algebraic invariants. Algebraic regularities are often preserved when the geometrical figure is topologically deformed. The most natural, intuitively simple but…

We represent the Euler alternating series (sometimes called the "Dirichlet eta function"), and generally $(b^s-b)\zeta(s)/b^s$ for $b>1$ an integer, in the half-plane $\Re s>0$, via series dominated by geometric series, with arbitrarily…

Hecke-Kiselman algebras $A_{\Theta}$, over a field $k$, associated to finite oriented graphs $\Theta$ are considered. It has been known that every such algebra is an automaton algebra in the sense of Ufranovskii. In particular, its…

We study the collection of first-order logical schemata all of whose instances are theorems of a given theory $T$; we call these the validities of $T$ ($\mathsf{V}(T)$). It is easy to see that if $T$ is a decidable theory, then…

We investigate the notion of complexity for finitely presented groups and the related notion of complexity for three-dimensional manifolds. We give two-sided estimates on the complexity of all the Milnor groups (the finite groups with free…

For any quantum algorithm given by a path in the space of unitary operators we define the computational complexity as the typical computational time associated with the path. This time is defined using a quantum time estimator associated…

We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…

Consider the elliptic curves given by $ E_{n,\theta}:\quad y^2=x^3+2s n x^2-(r^2-s^2) n^2 x $ where $0 < \theta< \pi$, $\cos(\theta)=s/r$ is rational with $0\leq |s| <r$ and $\gcd (r,s)=1$. These elliptic curves are related to the…

We study a class of algebras with non-Lie commutation relations whose symplectic leaves are surfaces of revolution: a cylinder or a torus. Over each of such surfaces we introduce a family of complex structures and Hilbert spaces of…

We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a non-elementary…

In this paper we define a regularized version of the analytic torsion for quotients of a symmetric space of non-positive curvature by arithmetic lattices. The definition is based on the study of the renormalized trace of the corresponding…

Let $E$ be a semistable elliptic curve over $\mathbb{Q}$. We prove that if $E$ has non-split multiplicative reduction at at least one odd prime or split multiplicative reduction at at least two odd primes and if the rank of $E(\mathbb{Q})$…

Given a local ring $(R,\mathfrak{m})$ and an elliptic curve $E(R/\mathfrak{m})$, we define elliptic loops as the points of $\mathbb{P}^2(R)$ projecting to $E$ under the canonical modulo-$\mathfrak{m}$ reduction, endowed with an operation…

We consider the geometrical addition law on the elliptic curve in Tate coordinates. It corresponds to the general formal group law over the ring of polynomials with integer coefficients of the parametra of the curve. We study the structure…

Let $\mathcal{A}$ denote a real, $n$-dimensional, unital, associative algebra.This paper provides an introductory exposition of calculus over $\mathcal{A}$. An $\mathcal{A}$-differentiable function is one for which the differential is…

We will find a lower bound on the recognition complexity of the theories that are nontrivial relative to some equivalence relation (this relation may be equality), namely, each of these theories is consistent with the formula, whose sense…

We classify elliptic curves over the rationals whose N\'eron model over the integers is semi-abelian, with good reduction at p=2, and whose Mordell--Weil group contains an element of order two that stays non-trivial at p=2. Furthermore, we…

The classification of elliptic curves E over the rationals Q is studied according to their torsion subgroups E_{tors}(Q) of rational points. Explicit criteria for the classification are given when E_{tors}(Q) are cyclic groups with even…