English
Related papers

Related papers: New bounds in R.S. Lehman's estimates for the diff…

200 papers

Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{\lambda\mid\lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…

Combinatorics · Mathematics 2025-08-08 Vesa Kaarnioja , André-Alexander Zepernick

This paper studies the cardinality of codes correcting insertions and deletions. We give improved upper and lower bounds on code size. Our upper bound is obtained by utilizing the asymmetric property of list decoding for insertions and…

Information Theory · Computer Science 2023-12-14 Kenji Yasunaga

In this note, we consider Szemer\'{e}di's theorem on $k$-term arithmetic progressions over finite fields $\mathbb{F}_p^n$, where the allowed set $S$ of common differences in these progressions is chosen randomly of fixed size. Combining a…

Number Theory · Mathematics 2025-08-05 Jason Zheng

The sign-constrained Stiefel manifold in $\mathbb{R}^{n\times r}$ is a segment of the Stiefel manifold with fixed signs (nonnegative or nonpositive) for some columns of the matrices. It includes the nonnegative Stiefel manifold as a special…

Optimization and Control · Mathematics 2024-05-21 Xiaojun Chen , Yifan He , Zaikun Zhang

For a fixed unit vector a=(a_1,a_2,...,a_n) in S^{n-1}, i.e. sum_{i=1}^n a_i^2=1, we consider the 2^n sign vectors epsilon=(epsilon_1,epsilon_2,...,epsilon_n) in {-1,1}^n and the corresponding scalar products a.epsilon=sum_{i=1}^n a_i…

Probability · Mathematics 2012-10-04 Harrie Hendriks , Martien C. A. van Zuijlen

Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…

Computational Geometry · Computer Science 2025-03-10 Justin Dallant

We study the number of degree $n$ number fields with discriminant bounded by $X$. In this article, we improve an upper bound due to Schmidt on the number of such fields that was previously the best known upper bound for $6 \leq n \leq 94$.

For relatively prime positive integers $u_0$ and $r$ and for $0\le k\le n$, define $u_k:=u_0+kr$. Let $L_n:={\rm lcm}(u_0, u_1, ..., u_n)$ and let $a, l\ge 2$ be any integers. In this paper, we show that, for integers $\alpha \geq a$ and…

Number Theory · Mathematics 2013-11-05 Rongjun Wu , Qianrong Tan , Shaofang Hong

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

Number Theory · Mathematics 2018-11-29 Michael A. Bennett , Greg Martin , Kevin O'Bryant , Andrew Rechnitzer

The results of the computer investigation of the sign changes of the difference between the number of twin primes $\pi_2(x)$ and the Hardy--Littlewood conjecture $c_2\Li_2(x)$ are reported. It turns out that $\pi_2(x) - c_2\Li_2(x)$ changes…

Number Theory · Mathematics 2008-01-15 Marek Wolf

Let $n$ be a positive integer and $\xi$ a transcendental real number. We are interested in bounding from above the uniform exponent of polynomial approximation $\widehat{\omega}_n(\xi)$. Davenport and Schmidt's original 1969 inequality…

Number Theory · Mathematics 2024-05-14 Anthony Poëls

For any large prime $q$, $x \leq 1$ and any real $k\geq 2$, we prove a lower bound for the following $2k$-th moment \begin{equation*} \sum_{\substack{\chi \in X_q^*}} \Big| \sum_{n\leq x} \chi(n)\lambda(n)\Big|^{2k}, \end{equation*} where…

Number Theory · Mathematics 2025-11-05 Peng Gao , Liangyi Zhao

We develop new tools leading, for each integer $n\ge 4$, to a significantly improved upper bound for the uniform exponent of rational approximation $\widehat{\lambda}_n(\xi)$ to successive powers $1,\xi,\dots,\xi^n$ of a given real…

Number Theory · Mathematics 2022-06-06 Anthony Poëls , Damien Roy

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

In his 2005 paper, S.T. Smith proposed an intrinsic Cram\'er-Rao bound on the variance of estimators of a parameter defined on a Riemannian manifold. In the present technical note, we consider the special case where the parameter lives in a…

Systems and Control · Computer Science 2015-09-17 Silvère Bonnabel , Axel Barrau

We derive the first finite-time logarithmic Bayes regret upper bounds for Bayesian bandits. In a multi-armed bandit, we obtain $O(c_\Delta \log n)$ and $O(c_h \log^2 n)$ upper bounds for an upper confidence bound algorithm, where $c_h$ and…

Machine Learning · Computer Science 2024-01-23 Alexia Atsidakou , Branislav Kveton , Sumeet Katariya , Constantine Caramanis , Sujay Sanghavi

This paper improves the bound on $|S(T)|$. The main result is to show that $|S(T)|\leq 0.111\log T + 0.275\log\log T + 2.450$, which is valid for all $T\geq e$.

Number Theory · Mathematics 2013-10-10 T. S. Trudgian

Building on work in \cite{AB24} on the Riemann zeta function at height $T$ off the critical line, we prove an unconditional lower bound on the critical line for real large deviations of the order $V\sim\alpha\log\log T$ for any $\alpha>0.$…

Number Theory · Mathematics 2026-03-03 Louis-Pierre Arguin , Nathan Creighton

This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…

Number Theory · Mathematics 2016-12-12 Youness Lamzouri , Xiannan Li , Kannan Soundararajan

This paper uses concepts introduced by Fiorilli and Martin to develop a more accurate remainder term in calculations of the distribution of primes in residue classes. Using it in Rubinstein and Sarnak's method estimates the limiting…

Number Theory · Mathematics 2013-01-09 Colin Myerscough