Searcharxiv⌕ Search

arXiv subjects

Abhijit S. Mudigonda

Publications and source records attributed to Abhijit S. Mudigonda.

2 recordsLinked to original sources

Quadratic Fields Admitting Elliptic Curves with Rational $j$-Invariant and Good Reduction Everywhere

Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg x\log^{-1/2}(x)$. In this paper, we assume the $abc$-conjecture to show the sharp asymptotic $\sim cx\log^{-1/2}(x)$ for this number, obtaining formulae for $c$ in both the real and imaginary cases. Our method has three ingredients: (1) We make progress towards a conjecture of Granville: Given a fixed elliptic curve $E/\mathbb{Q}$ with short Weierstrass equation $y^2 = f(x)$ for reducible $f \in \mathbb{Z}[x]$, we show that the number of integers $d$, $|d| \leq D$, for which the quadratic twist $dy^2 = f(x)$ has an integral non-$2$-torsion point is at most $D^{2/3+o(1)}$, assuming the $abc$-conjecture. (2) We apply the Selberg--Delange method to obtain a Tauberian theorem which allows us to count integers satisfying certain congruences while also being divisible only by certain primes. (3) We show that for a polynomially sparse subset of the natural numbers, the number of pairs of elements with least common multiple at most $x$ is $O(x^{1-ε})$ for some $ε> 0$. We also exhibit a matching lower bound. If instead of the $abc$-conjecture we assume a particular tail bound, we can prove all the aforementioned results and that the coefficient $c$ above is greater in the real quadratic case than in the imaginary quadratic case, in agreement with an experimentally observed bias.

math.NT↗

Time-Space Lower Bounds for Simulating Proof Systems with Quantum and Randomized Verifiers

A line of work initiated by Fortnow in 1997 has proven model-independent time-space lower bounds for the $\mathsf{SAT}$ problem and related problems within the polynomial-time hierarchy. For example, for the $\mathsf{SAT}$ problem, the state-of-the-art is that the problem cannot be solved by random-access machines in $n^c$ time and $n^{o(1)}$ space simultaneously for $c < 2\cos(\fracπ{7}) \approx 1.801$. We extend this lower bound approach to the quantum and randomized domains. Combining Grover's algorithm with components from $\mathsf{SAT}$ time-space lower bounds, we show that there are problems verifiable in $O(n)$ time with quantum Merlin-Arthur protocols that cannot be solved in $n^c$ time and $n^{o(1)}$ space simultaneously for $c < \frac{3+\sqrt{3}}{2} \approx 2.366$, a super-quadratic time lower bound. This result and the prior work on $\mathsf{SAT}$ can both be viewed as consequences of a more general formula for time lower bounds against small-space algorithms, whose asymptotics we study in full. We also show lower bounds against randomized algorithms: there are problems verifiable in $O(n)$ time with (classical) Merlin-Arthur protocols that cannot be solved in $n^c$ randomized time and $n^{o(1)}$ space simultaneously for $c < 1.465$, improving a result of Diehl. For quantum Merlin-Arthur protocols, the lower bound in this setting can be improved to $c < 1.5$.

cs.CC↗