IMPROVED RESULTS ON THE MERTENS CONJECTURE

被引：0

作者：

Saouter, Yannick ^{[1
]}

Te Riele, Herman ^{[2
]}

机构：

[1] Inst Telecom Brest, Bretagne, France

[2] CWI, NL-1009 AB Amsterdam, Netherlands

来源：

MATHEMATICS OF COMPUTATION | 2014年 / 83卷 / 285期

关键词：

DISPROOF;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this article, we study the Mertens conjecture. We revisit and improve the original constructive disproof of Janos Pintz. We obtain a new lower bound for the minimal counterexample and new numerical results for this conjecture.

引用

页码：421 / 433

页数：13

共 50 条

[21] Results on a Conjecture of Chen and Yi
Xiao-Min Li
Yan Liu
Hong-Xun Yi
Bulletin of the Malaysian Mathematical Sciences Society, 2021, 44 : 3043 - 3067
[22] Some Results on Berge’s Conjecture and Begin–End Conjecture
Lucas Ismaily Bezerra Freitas
Orlando Lee
Graphs and Combinatorics, 2022, 38
[23] An Improved Bound in Vizing's Conjecture
Zerbib, Shira
GRAPHS AND COMBINATORICS, 2019, 35 (06) : 1401 - 1404
[24] Improved Cauchy horizon stability conjecture
Phys Rev D, 12 (7898):
[25] Improved bound in the Benjamin and Lighthill conjecture
Department of Mathematics, Linköping University, Linköping
SE-581 83, Sweden
arXiv, 2020,
[26] An Improved Bound for the Linear Arboricity Conjecture
Richard Lang
Luke Postle
Combinatorica, 2023, 43 : 547 - 569
[27] Improved Bound for Hadwiger's Conjecture
Wang, Yan
GRAPHS AND COMBINATORICS, 2025, 41 (02)
[28] Improved bounds for Erdos' Matching Conjecture
Frankl, Peter
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2013, 120 (05) : 1068 - 1072
[29] An Improved Bound for the Linear Arboricity Conjecture
Lang, Richard
Postle, Luke
COMBINATORICA, 2023, 43 (03) : 547 - 569
[30] An Improved Bound in Vizing’s Conjecture
Shira Zerbib
Graphs and Combinatorics, 2019, 35 : 1401 - 1404

← 1 2 3 4 5 →