English
Related papers

Related papers: A disproof of Hooley's conjecture

200 papers

For g,n coprime integers, let l_g(n) denote the multiplicative order of g modulo n. Motivated by a conjecture of Arnold, we study the average of l_g(n) as n <= x ranges over integers coprime to g, and x tending to infinity. Assuming the…

Number Theory · Mathematics 2011-08-29 Par Kurlberg , Carl Pomerance

We derive an asymptotic lower bound on the Shannon entropy $H$ of sums of $N$ arbitrary iid discrete random variables. The derived bound $H \geq \frac{r(X)}{2}\log(N) + {\it cst}$ is given in terms of the incommensurability rank $r(X)$ of…

Information Theory · Computer Science 2025-08-08 Riccardo Castellano , Pavel Sekatski

Let $A$ be an abelian variety defined over $\mathbb{Q}$ and of dimension $g$. Assume that, for each sufficiently large prime $\ell$, $A$ has a surjective residual modulo $\ell$ Galois representation. For $t\in \mathbb{Z}$ and $x>0$, denote…

Number Theory · Mathematics 2026-04-21 Alina Carmen Cojocaru , Tian Wang

Fix distinct primes $p$ and $q$ and let $E$ be an elliptic curve defined over a number field $K$. The $(p,q)$-entanglement type of $E$ over $K$ is the isomorphism class of the group $\operatorname{Gal}(K(E[p])\cap K(E[q])/K)$. The size of…

Number Theory · Mathematics 2025-01-29 Tori Day , Rylan Gajek-Leonard

Let $N$ be a sufficiently large, odd integer. We prove an asymptotic formula for the number of representations of $N$ as the sum of three primes, one of which is smaller than a given $U$. By inserting the currently best zero-density…

Number Theory · Mathematics 2026-05-20 Michael Harm

Let $P(a,q)$ be the least prime in the arithmetic progression $\{n\equiv a(mod\ q)\}$. In this note, when $q$ has bounded cubic part and $(a,q)=1$, we combine the Heath-Brown's method and the Burgess's bounds for L-functions to obtain $…

Number Theory · Mathematics 2010-10-19 Zaizhao Meng

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

Number Theory · Mathematics 2021-01-01 Adam J. Harper

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. Suppose that $a$ and $q$ are positive integers satisfying $(a,q)=1$. Denote by $\mathcal{P}_2(a,q)$ the least almost-prime…

Number Theory · Mathematics 2021-07-20 Jinjiang Li , Min Zhang , Yingchun Cai

We show that the greatest prime factor of $n^2+h$ is at least $n^{1.312}$ infinitely often. This gives an unconditional proof for the range previously known under the Selberg eigenvalue conjecture. Furthermore, we get uniformity in $h \leq…

Number Theory · Mathematics 2025-06-02 Lasse Grimmelt , Jori Merikoski

Let p be a prime number. Let G be a finite abelian p-group of exponent n (written additively) and A be a non-empty subset of $]n[:= \{1,2,..., n\}$ such that elements of A are incongruent modulo p and non-zero modulo p. Let $k \geq…

Number Theory · Mathematics 2007-07-16 R Thangadurai

Let $\|n\|$ stand for the integer complexity of the number $n$, i.e. for the least number of $1$'s needed to write $n$ using arbitrary many additions, multiplications, and parentheses. The two-sided inequality $3\log_3 n\leq\|n\|\leq…

Number Theory · Mathematics 2026-05-01 Sergei Konyagin , Kristina Oganesyan

This paper extends the work of Gottlob, Lee, and Valiant (PODS 2009)[GLV], and considers worst-case bounds for the size of the result Q(D) of a conjunctive query Q to a database D given an arbitrary set of functional dependencies. The…

Databases · Computer Science 2009-12-12 Gregory Valiant , Paul Valiant

Let $\Gamma$ denote the modular group $SL(2,\Bbb Z)$ and $C_n(\Gamma)$ the number of congruence subgroups of $\Gamma$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log C_n(\Gamma)}{(\log n)^2/\log\log n} =…

Group Theory · Mathematics 2007-05-23 D. Goldfeld , A. Lubotzky , L. Pyber

We derive, for all prime moduli p except those in a very thin set, an upper bound for the least prime primitive root (mod p) of order of magnitude a constant power of log p. The improvement over previous results, where the upper bound was…

Number Theory · Mathematics 2007-05-23 Greg Martin

Cilleruelo conjectured that if $f\in\mathbb{Z}[x]$ is an irreducible polynomial of degree $d\ge 2$ then, $\log \operatorname{lcm} \{f(n)\mid n<x\} \sim (d-1)x\log x.$ In this article, we investigate the analogue of prime arguments, namely,…

Number Theory · Mathematics 2022-02-01 Ayan Nath , Abhishek Jha

Given an elliptic curve $E$ over a finite field $\F_q$ of $q$ elements, we say that an odd prime $\ell \nmid q$ is an Elkies prime for $E$ if $t_E^2 - 4q$ is a quadratic residue modulo $\ell$, where $t_E = q+1 - #E(\F_q)$ and $#E(\F_q)$ is…

Number Theory · Mathematics 2013-01-03 Igor Shparlinski

We provide, on the Birch and Swinnerton-Dyer conjecture, an explicit upper bound for the rank of the Mordell-Weil group of the Jacobian of the modular curve X_0(q) for q prime large enough, namely rank J_0(q)< 6.5 dim J_0(q). The file…

Number Theory · Mathematics 2007-05-23 Emmanuel Kowalski , Philippe Michel

The open subvariety $\overline{M}_g^{\leq k}$ of $\overline{M}_g$ parametrizes stable curves of genus $g$ having at most $k$ rational components. By the work of Looijenga, one expects that the cohomological excess of $\overline{M}_g^{\leq…

Algebraic Geometry · Mathematics 2017-10-31 Chitrabhanu Chaudhuri

In 2016, Dummit, Granville, and Kisilevsky showed that the proportion of semiprimes (products of two primes) not exceeding a given $x$, whose factors are congruent to $3$ modulo $4$, is more than a quarter when $x$ is sufficiently large.…

Number Theory · Mathematics 2025-09-03 Nikola Gyulev , Miroslav Marinov

Proving the ``expectation-threshold'' conjecture of Kahn and Kalai, we show that for any increasing property $\mathcal{F}$ on a finite set $X$, $$p_c(\mathcal{F})=O(q(\mathcal{F})\log \ell(\mathcal{F})),$$ where $p_c(\mathcal{F})$ and…

Combinatorics · Mathematics 2023-04-14 Jinyoung Park , Huy Tuan Pham
‹ Prev 1 8 9 10 Next ›