Related papers: Arithmetic complexity revisited

Let $\Theta$ be a finite alphabet. We consider a bundle of measure preserving transformations $(T_{\theta})_{\theta \in \Theta}$ acting on a probability space $(X,\mu)$, which are chosen randomly according to an ergodic stochastic process…

We consider results for the master integrals of the kite family, given in terms of ELi-functions which are power series in the nome $q$ of an elliptic curve. The analytic continuation of these results beyond the Euclidean region is reduced…

We classify the computability-theoretic complexity of two index sets of classes of first-order theories: We show that the property of being an $\aleph_0$-categorical theory is $\Pi^0_3$-complete; and the property of being an Ehrenfeucht…

Given a first-order theory $T$ formulated in the usual language of first-order arithmetic, we say that $T$ is of *restricted complexity* if there is some natural number $n$ and some set $\mathcal A$ of $\Sigma_n$-sentences such that $T$ can…

While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…

Computational complexity is examined using the principle of increasing entropy. To consider computation as a physical process from an initial instance to the final acceptance is motivated because many natural processes have been recognized…

By Mazur's Torsion Theorem, there are fourteen possibilities for the non-trivial torsion subgroup $T$ of a rational elliptic curve. For each $T$, such that $E$ may have additive reduction at a prime $p$, we consider a parameterized family…

The complexity of a module is the rate of growth of the minimal projective resolution of the module while the $z$-complexity is the rate of growth of the number of indecomposable summands at each step in the resolution. Let…

Complexity rank for $C^*$-algebras was introduced by the second author and Yu for applications towards the UCT: very roughly, this rank is at most $n$ if you can repeatedly cut the $C^*$-algebra in half at most $n$ times, and end up with…

Let $\mathcal{C}$ be a plane curve given by an equation $f(x,y)=0$ with $f\in K[x][y]$ a monic squarefree polynomial. We study the problem of computing an integral basis of the algebraic function field $K(\mathcal{C})$ and give new…

We consider a certain convolution semigroup $\Theta$ of probability distributions on the group $\mathbb{R}\times \mathbb{Z}(2)$, where $\mathbb{R}$ is the group of real numbers and $\mathbb{Z}(2)$ is the additive group of the integers…

It is conjectured that in the geometric formulation of quantum computing, one can study quantum complexity through classical entropy of statistical ensembles established non-relativistically in the group manifold of unitary operators. The…

Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related…

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

We study the $2$-Selmer ranks of elliptic curves. We prove that for an arbitrary elliptic curve $E$ over an arbitrary number field $K$, if the set $A_E$ of 2-Selmer ranks of quadratic twists of $E$ contains an integer $c$, it contains all…

For each prime $p$, we show that there exist geometrically simple abelian varieties $A/\mathbb Q$ with non-trivial $p$-torsion in their Tate-Shafarevich groups. Specifically, for any prime $N\equiv 1 \pmod{p}$, let $A_f$ be an optimal…

Let $A$ be an abelian variety defined over a number field $K$, the number of torsion points rational over a finite extension $L$ is bounded polynomially in terms of the degree $[L:K]$. We formulate a question suggesting the optimal exponent…

We introduce some classical complexity-theoretic techniques to Parameterized Complexity. First, we study relativization for the machine models that were used by Chen, Flum, and Grohe (2005) to characterize a number of parameterized…

For every odd prime $p$, we exhibit families of irreducible Artin representations $\tau$ with the property that for every elliptic curve $E$ the order of the zero of the twisted $L$-function $L(E,\tau,s)$ at $s\!=\!1$ must be a…

We give practical, efficient algorithms that automatically determine the asymptotic distributed round complexity of a given locally checkable graph problem in the $[\Theta(\log n), \Theta(n)]$ region, in two settings. We present one…