Related papers: From the Ideal Theorem to the class number

In this paper we prove explicit upper and lower bounds for the error term in the Riemann-von Mangoldt type formula for the number of zeros inside the critical strip. Furthermore, we also give examples of the bounds.

Several results are obtained concerning the function $\Delta_k(x)$, which represents the error term in the general Dirichlet divisor problem. These include the estimates for the integral of this function, as well as for the corresponding…

Assuming Generalized Riemann's Hypothesis, Bach proved that the class group $\mathcal C\!\ell_{\mathbf K}$ of a number field ${\mathbf K}$ may be generated using prime ideals whose norm is bounded by $12\log^2\Delta_{\mathbf K}$, and by…

The growth of Hilbert coefficients for powers of ideals are studied. For a graded ideal $I$ in the polynomial ring $S=K[x_1,...,x_n]$ and a finitely generated graded $S$-module, the Hilbert coefficients $e_i(M/I^kM)$ are polynomial…

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the…

We derive an explicit $k-$dependence in $W^{m,p}$ error estimates for $P_k$ Lagrange finite elements. Two laws of probability are established to measure the relative accuracy between $P_{k_1}$ and $P_{k_2}$ finite elements ($k_1 < k_2$) in…

We study the function $\Delta_k(x):=\sum_{n\leq x} d_k(n) - \mbox{Res}_{s=1} ( \zeta^k(s) x^s/s )$, where $k\geq 3$ is an integer, $d_k(n)$ is the $k$-fold divisor function, and $\zeta(s)$ is the Riemann zeta-function. For a large parameter…

One of the hard optimization problems that has a semi-definite relaxation with quantitative bound on the approximation error is the maximization of a convex quadratic form on the hypercube. The relaxation not only yields an upper bound on…

Linear fixed point equations in Hilbert spaces arise in a variety of settings, including reinforcement learning, and computational methods for solving differential and integral equations. We study methods that use a collection of random…

We consider the problem of online multiclass U-calibration, where a forecaster aims to make sequential distributional predictions over $K$ classes with low U-calibration error, that is, low regret with respect to all bounded proper losses…

Let $K\subset\mathbb R^d$ be a compact subset equipped with a $\delta$-Ahlfors regular measure $\mu$. For any $\tau>1/d$ and any ``inhomogeneous'' vector $\boldsymbol{\theta}\in\mathbb R^d$, let $W_d(\psi_\tau,\boldsymbol{\theta})$ denote…

Let I be an ideal of height two in R=k[x_0,x_1] generated by forms of the same degree, and let K be the ideal of defining equations of the Rees algebra of I. Suppose that the second largest column degree in the syzygy matrix of I is e. We…

We consider the Tur\'an-type problem of bounding the size of a set $M \subseteq \mathbb{F}_2^n$ that does not contain a linear copy of a given fixed set $N \subseteq \mathbb{F}_2^k$, where $n$ is large compared to $k$. An Erd\H{o}s-Stone…

Uniform deviation bounds limit the difference between a model's expected loss and its loss on an empirical sample uniformly for all models in a learning problem. As such, they are a critical component to empirical risk minimization. In this…

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…

We prove a new lower bound on the algorithmic information content of points lying on a line in $\mathbb{R}^n$. More precisely, we show that a typical point $z$ on any line $\ell$ satisfies \begin{equation*} K_r(z)\geq \frac{K_r(\ell)}{2} +…

A mathematical analysis is presented for a class of interior penalty (IP) discontinuous Galerkin approximations of elliptic boundary value problems. In the framework of the present theory one can derive some overpenalized IP bilinear forms…

Let $k\ge2$ be an integer. A natural number $n$ is called $k$-perfect if $\sigma(n)=kn.$ For any integer $r\ge1$ we prove that the number of odd $k$-perfect numbers with at most $r$ distinct prime factors is bounded by $k4^{r^3}$.

Motivated by the works of Erd\"os, Pomerance, Wolke and Harman on the sum-of-divisor function $\sigma(n)$, we study the distribution of a special class of natural numbers closely related to (multiply) perfect numbers which we term…

Many statistical applications, such as the Principal Component Analysis, matrix completion, tensor regression and many others, rely on accurate estimation of leading eigenvectors of a matrix. The Davis-Kahan theorem is known to be…