Related papers: Properties of counterexample to Robin hypothesis

We provide new, elementary proofs that Robin's inequality and the Lagarias inequality hold for almost every number, including all numbers not divisible by one of the prime numbers $2$, $3$, $5$; all primorials; given $k$ a natural number,…

We prove that the Robin ground state and the Robin torsion function are respectively log-concave and $\frac{1}{2}$-concave on an uniformly convex domain $\Omega\subset \mathbb{R}^N$ of class $\mathcal{C}^m$, with $[m -\frac{ N}{2}]\geq 4$,…

Assuming the Generalized Riemann Hypothesis, the authors study when a character sum over all n <= x is o(x); they show that this holds if log x / log log q -> infinity and q -> infinity (q is the size of the finite field).

We consider a parametric semilinear Robin problem driven by the Laplacian plus an indefinite potential. The reaction term involves competing nonlinearities. More precisely, it is the sum of a parametric sublinear (concave) term and a…

We prove Gamma conjecture I for all flag varieties by following a strategy proposed by Galkin and Iritani. The main new ingredient is showing that the totally positive part of the Rietsch mirror is mirror to the $\widehat{\Gamma}$-class and…

Let $\Lambda = \mathrm{SL}_2(\Bbb Z)$ be the modular group and let $c_n(\Lambda)$ be the number of congruence subgroups of $\Lambda$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log c_n(\Lambda)}{(\log n)^2/\log\log…

We call $n$ a cyclic number if every group of order $n$ is cyclic. It is implicit in work of Dickson, and explicit in work of Szele, that $n$ is cyclic precisely when $\gcd(n,\phi(n))=1$. With $C(x)$ denoting the count of cyclic $n\le x$,…

We prove some results concerning the distribution of primes on the Riemann hypothesis. First, we prove the explicit result that there exists a prime in the interval $(x-\frac{4}{\pi} \sqrt{x} \log x,x]$ for all $x \geq 2$; this improves a…

In the decimal numeral system, we prove that the well-known Graham's number, $G := \! ^{n}3$ (i.e., $3^{3^{\cdot^{\cdot^{\cdot^{3}}}}}$ ($n$ times)), and any base $3$ tetration whose hyperexponent is larger than $n$ share the same…

Let $\chi$ be an irreducible character of a finite group $G$. A. R. Miller conjectured that the proportion of elements $g\in G$ such that $\chi(g)$ is zero or a root of unity is at least 1/2. We construct a character of a perfect group of…

The Landau function $g(n)$ is the maximal order of an element of the symmetric group of degree $n$; it is also the largest product of powers of primes whose sum is $\le n$. The main result of this article is that the property " For all $n >…

It is well known that $li(x)>\pi(x)$ (i) up to the (very large) Skewes' number $x_1 \sim 1.40 \times 10^{316}$ \cite{Bays00}. But, according to a Littlewood's theorem, there exist infinitely many $x$ that violate the inequality, due to the…

In a 1977 paper, Steffens identified an elegant criterion for determining when a countable graph has a perfect matching. In this paper, we will investigate the proof-theoretic strength of this result and related theorems. We show that a…

Much progress has been made on the problem of calculating $g(n)$ for various classes of integers $n$, where $g$ is the group-counting function. We approach the inverse problem of solving the equations $g(n) = 6$ and $g(n) = 7$ in $n$. The…

In a recent work [JNT \textbf{129}, 2154 (2009)], Gun and co-workers have claimed that the number $\,\log{\Gamma(x)} + \log{\Gamma(1-x)}\,$, $x$ being a rational number between $0$ and $1$, is transcendental with at most \emph{one} possible…

For a positive integer t>1, an integer N is called t-free if the exponent of any prime factor of N is less than t. Some works shown if N is t-free, then N satisfies Robin's inequality, for t=5, 7, 11, 16. This article shows that the…

We provide an historical account of equivalent conditions for the Riemann Hypothesis arising from the work of Ramanujan and, later, Guy Robin on generalized highly composite numbers. The first part of the paper is on the mathematical…

Answering a question of Jiang and Polyanskii as well as Jiang, Tidor, Yao, Zhang, and Zhao, we show the existence of infinitely many angles $\theta$ for which the maximum number of lines in $\mathbb R^n$ meeting at the origin with pairwise…

Let $f(n)$ be the number of distinct exponents in the prime factorization of the natural number $n$. We prove some results about the distribution of $f(n)$. In particular, for any positive integer $k$, we obtain that $$ \#\{n \leq x : f(n)…

For a given integer $m$ and any residue $a \pmod{m}$ that can be written as a sum of 3 squares modulo $m$, we show the existence of infinitely many integers $n \equiv a \pmod{m}$ such that the number of representations of $n$ as a sum of…