English
Related papers

Related papers: On counterexamples to the Mertens conjecture

200 papers

In order to give a unified generalization of the BW inequality and the DDVV inequality, Lu and Wenzel proposed three Conjectures 1, 2, 3 and an open Question 1 in 2016. In this paper we discuss further these conjectures and put forward…

Differential Geometry · Mathematics 2020-02-11 Jianquan Ge , Fagui Li , Zhiqin Lu , Yi Zhou

We give a deterministic algorithm for solving the (1+eps)-approximate Closest Vector Problem (CVP) on any n dimensional lattice and any norm in 2^{O(n)}(1+1/eps)^n time and 2^n poly(n) space. Our algorithm builds on the lattice point…

Data Structures and Algorithms · Computer Science 2013-01-01 Daniel Dadush , Gabor Kun

The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…

Number Theory · Mathematics 2018-06-05 Bence Borda

We prove that the Laptev--Safronov conjecture (Comm. Math. Phys., 2009) is false in the range that is not covered by Frank's positive result (Bull. Lond. Math. Soc., 2011). The simple counterexample is adaptable to a large class of…

Spectral Theory · Mathematics 2022-11-30 Sabine Bögli , Jean-Claude Cuenin

We provide a counterexample to a lemma used in a recent tentative improvement of the the Pin-Frankl bound for synchronizing automata. This example naturally leads us to formulate an open question, whose answer could fix the line of proof,…

Formal Languages and Automata Theory · Computer Science 2014-12-03 François Gonze , Raphaël M. Jungers , A. N. Trahtman

Latent position models (LPMs) are a large and popular class of models for random graphs. However, fitting Bayesian LPMs is computationally challenging - computing the likelihood even once takes time that is quadratic in the number of…

Computation · Statistics 2026-05-29 Zonghao Li , Aaron Smith

In this paper, new relations between the derivatives of the Legendre polynomials are obtained, and by these relations, new upper bounds for the Legendre coefficients of differentiable functions are presented. These upper bounds are sharp…

Numerical Analysis · Mathematics 2022-07-28 M. Hamzehnejad , M. M. Hosseini , A. Salemi

We develop an algorithm for efficiently computing recursively defined functions on posets. We illustrate this algorithm by disproving conjectures about the game Subset Takeaway (Chomp on a hypercube) and computing the number of linear…

Combinatorics · Mathematics 2017-07-11 Andries E. Brouwer , J. Daniel Christensen

Consider a closed curve of length $2\pi$ with curvature $\kappa(s)$ and the Schr\"odinger operator $H$ with $\kappa^2$ as the potential term. Let $\lambda_\Gamma$ be the lowest eigenvalue of $H$. The Ovals Conjecture proposed by Benguria…

Mathematical Physics · Physics 2025-05-27 Helmut Linde

Using a recent verification of the Riemann hypothesis up to height $3\cdot 10^{12}$, we provide strong estimates on $\pi(x)$ and other prime counting functions for finite ranges of $x$. In particular, we get that…

Number Theory · Mathematics 2022-06-15 Daniel R. Johnston

We present a new lower bound on the number of contingency tables, improving upon and extending previous lower bounds by Barvinok and Gurvits. As an application, we obtain new lower bounds on the volumes of flow and transportation polytopes.…

Combinatorics · Mathematics 2021-02-16 Petter Brändén , Jonathan Leake , Igor Pak

The Betke-Henk-Wills conjecture provides an upper bound for the lattice point enumerator $G(K, \Lambda)$ of a convex body in terms of its successive minima. While the conjecture is established for orthogonal parallelotopes, its validity for…

Metric Geometry · Mathematics 2026-03-06 Chao Wang

In this note we provide a new, algebraic proof of the excessive Laurent phenomenon for mutations of potentials (in the sense of [Galkin S., Usnich A., Preprint IPMU 10-0100, 2010]) by introducing to this theory the analogue of the upper…

Representation Theory · Mathematics 2013-01-23 John Alexander Cruz Morales , Sergey Galkin

An explicit subconvex bound for the Riemann zeta function $\zeta(s)$ on the critical line $s=1/2+it$ is proved. Previous subconvex bounds relied on an incorrect version of the Kusmin-Landau lemma. After accounting for the needed correction…

Number Theory · Mathematics 2022-07-07 Ghaith A. Hiary , Dhir Patel , Andrew Yang

$ \newcommand{\R}{\mathbb{R}} \newcommand{\lat}{\mathcal{L}} $We prove a conjecture due to Dadush, showing that if $\lat \subset \R^n$ is a lattice such that $\det(\lat') \ge 1$ for all sublattices $\lat' \subseteq \lat$, then \[ \sum_{\vec…

Metric Geometry · Mathematics 2022-07-08 Oded Regev , Noah Stephens-Davidowitz

The paper provides new upper and lower bounds for the multivariate Laplace approximation under weak local assumptions. Their range of validity is also given. An application to an integral arising in the extension of the Dixon's identity is…

Classical Analysis and ODEs · Mathematics 2016-04-12 Piotr Majerski

We show an elementary method to have (finite time and asymptotic) computer assisted explicit upper bounds on convergence to equilibrium (decay of correlations) and escape rate for systems satisfying a Lasota Yorke inequality. The bounds are…

Dynamical Systems · Mathematics 2015-01-27 Stefano Galatolo , Isaia Nisoli , Benoît Saussol

In this paper, we introduce the zero divisor graph of a multiplicative lattice. We provide a counter example to Beck's conjecture for multiplicative lattices. Further, we prove that Beck's conjecture is true for reduced multiplicative…

Commutative Algebra · Mathematics 2013-10-18 Vinayak Joshi , Sachin Sarode

We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.

Artificial Intelligence · Computer Science 2025-11-04 Jovial Cheukam Ngouonou , Ramiz Gindullin , Claude-Guy Quimper , Nicolas Beldiceanu , Remi Douence

We first propose two conjectural estimates on Diophantine approximation of logarithms of algebraic numbers. Next we discuss the state of the art and we give further partial results on this topic.

Number Theory · Mathematics 2007-05-23 Michel Waldschmidt
‹ Prev 1 4 5 6 7 8 10 Next ›