中文
相关论文

相关论文: Boyd's conjecture

200 篇论文

Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.

The twisted $T$-adic exponential sum associated to a polynomial in one variable is studied. An explicit arithmetic polygon in terms of the highest two exponents of the polynomial is proved to be a lower bound of the Newton polygon of the…

数论 · 数学 2015-05-14 Chunlei Liu , Wenxin Liu

The Bateman--Horn Conjecture predicts how often an irreducible polynomial $f(x) \in \mathbb{Z}[x]$ assumes prime values. We demonstrate that with sufficient averaging in the coefficients of $f$ (viz. exponential in the size of the inputs),…

数论 · 数学 2025-12-04 Noah Kravitz , Katharine Woo , Max Wenqiang Xu

We prove optimal bounds for the convergence rate of ordinal embedding (also known as non-metric multidimensional scaling) in the 1-dimensional case. The examples witnessing optimality of our bounds arise from a result in additive number…

统计理论 · 数学 2019-05-01 Jordan S. Ellenberg , Lalit Jain

For each $n=0,1,2,\ldots$, the central trinomial coefficient $T_n$ is the coefficient of $x^n$ in the expansion of $(x^2+x+1)^n$. Let $p>3$ be a prime, and let $n$ be any positive integer. In 2016, the second author conjectured that the…

数论 · 数学 2026-03-16 Hao Pan , Zhi-Wei Sun

For any $\epsilon>0$, there exists $q_0(\epsilon)$ such for any $q\ge q_0(\epsilon)$ and any invertible residue class $a$ modulo $q$, there exists a natural number that is congruent to $a$ modulo $q$ and that is the product of exactly three…

Let $\mathrm{ex}(n,s)$ denote the maximum number of edges in a triangle-free graph on $n$ vertices which contains no independent sets larger than $s$. The behaviour of $\mathrm{ex}(n,s)$ was first studied by Andr\'asfai, who conjectured…

组合数学 · 数学 2024-12-31 Tomasz Łuczak , Joanna Polcyn , Christian Reiher

We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions…

数论 · 数学 2007-05-23 Moubariz Z. Garaev , Florian Luca , Igor E. Shparlinski

We prove specific biases in the number of occurrences of parts belonging to two different residue classes $a$ and $b$, modulo a fixed non-negative integer $m$, for the sets of unrestricted partitions, partitions into distinct parts, and…

组合数学 · 数学 2025-02-03 Michael J. Schlosser , Nian Hong Zhou

Let $\lambda$ be the Liouville function, defined as $\lambda(n) := (-1)^{\Omega(n)}$ where $\Omega(n)$ is the number of prime factors of $n$ with multiplicity. In 2021, Helfgott and Radziwi{\l}{\l} proved that $$\sum_{n\leq x} \frac{1}{n}…

数论 · 数学 2025-12-02 Cédric Pilatte

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…

数论 · 数学 2019-02-12 Gareth Boxall , Gareth Jones , Harry Schmidt

It has been known since Erdos that the sum of $1/(n\log n)$ over numbers $n$ with exactly $k$ prime factors (with repetition) is bounded as $k$ varies. We prove that as $k$ tends to infinity, this sum tends to 1. Banks and Martin have…

数论 · 数学 2020-03-03 Jared Duker Lichtman

Consider the braid group $B_3=< a,b| aba=bab>$ and the nearest neighbor random walk defined by a probability $\nu$ with support $\{a,a^{-1},b,b^{-1}\}$. The rate of escape of the walk is explicitly expressed in function of the unique…

概率论 · 数学 2016-08-14 Jean Mairesse , Frédéric Mathéus

The Collatz Conjecture (also known as the 3x+1 Problem) proposes that the following algorithm will, after a certain number of iterations, always yield the number 1: given a natural number, multiply by three and add one if the number is odd,…

数论 · 数学 2020-01-28 Matt Hohertz , Bahman Kalantari

Riffaut (2019) conjectured that a singular modulus of degree $h\ge 3$ cannot be a root of a trinomial with rational coefficients. We show that this conjecture follows from the GRH, and obtain partial unconditional results.

数论 · 数学 2021-08-30 Yuri Bilu , Florian Luca , Amalia Pizarro-Madariaga

Prunescu and Sauras-Altuzarra showed that all C-recursive sequences of natural numbers have an arithmetic div-mod representation that can be derived from their generating function. This representation consists of computing the quotient of…

数论 · 数学 2025-02-25 Mihai Prunescu , Joseph M. Shunia

The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the…

数论 · 数学 2025-11-25 Chenghui Ren

The volume conjecture and its generalization state that the series of certain evaluations of the colored Jones polynomials of a knot would grow exponentially and its growth rate would be related to the volume of a three-manifold obtained by…

几何拓扑 · 数学 2007-10-07 Hitoshi Murakami

The standard period-index conjecture for the Brauer group of a field of transcendence degree 2 over a $p$-adic field predicts that the index divides the cube of the period. Using Gabber's theory of prime-to-$\ell$ alterations and the…

代数几何 · 数学 2020-08-03 Benjamin Antieau , Asher Auel , Colin Ingalls , Daniel Krashen , Max Lieblich

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} =…

群论 · 数学 2007-05-23 D. Goldfeld , A. Lubotzky , L. Pyber