English
Related papers

Related papers: Properties of counterexample to Robin hypothesis

200 papers

In this note, we prove that for all $x \in (0 , 1)$, we have: $$ \log\Gamma(x) = \frac{1}{2} \log\pi + \pi \boldsymbol{\eta} \left(\frac{1}{2} - x\right) - \frac{1}{2} \log\sin(\pi x) + \frac{1}{\pi} \sum_{n = 1}^{\infty} \frac{\log n}{n}…

Number Theory · Mathematics 2013-12-30 Bakir Farhi

Let $\sigma(n)$ denote the sum of the positive divisors of $n$. We say that $n$ is perfect if $\sigma(n) = 2 n$. Currently there are no known odd perfect numbers. It is known that if an odd perfect number exists, then it must be of the form…

Number Theory · Mathematics 2007-05-23 Kevin G. Hare

Assume that a convergent series of real numbers $\sum\limits_{n=1}^\infty a_n$ has the property that there exists a set $A\subseteq \N$ such that the series $\sum\limits_{n \in A} a_n$ is conditionally convergent. We prove that for a given…

Functional Analysis · Mathematics 2020-08-11 Artur Bartoszewicz , Włodzimierz Fechner , Aleksandra Świątczak , Agnieszka Widz

An involution is a permutation that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathbf{N}_{n}(\sigma)$ denote the number of ways to write $\sigma$ as a product of two involutions of $[n].$ If we endow the symmetric…

Combinatorics · Mathematics 2015-08-19 Charles Burnette , Eric Schmutz

We prove the so-called inverse conjecture for the Gowers U^{s+1}-norm in the case s = 3 (the cases s < 3 being established in previous literature). That is, we establish that if f : [N] -> C is a function with |f(n)| <= 1 for all n and || f…

Number Theory · Mathematics 2012-01-04 Ben Green , Terence Tao , Tamar Ziegler

Let $\mathcal{B} = (B_1,\ldots, B_h)$ be an $h$-tuple of sets of positive integers. Let $g_{\mathcal{B} }(n)$ count the number of representations of $n$ in the form $n = b_1\cdots b_h$, where $b_i \in B_i$ for all $i \in \{1,\ldots, h\}$.…

Number Theory · Mathematics 2022-05-03 Melvyn B. Nathanson

We prove that there are infinitely many $n$ such that $\omega(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao-Ter\"{a}v\"{a}inen (2025), who has $O(k)$ in place of $O(\log k)$. As corollaries, we make progress…

Number Theory · Mathematics 2026-04-17 Cheuk Fung Lau

An involution is a bijection that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathsf{invol}(\sigma)$ denote the number of ways $\sigma$ can be expressed as a composition of two involutions of $[n].$ We prove that the…

Combinatorics · Mathematics 2025-08-22 Charles Burnette

For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $bc(G) \leq n…

Combinatorics · Mathematics 2014-09-23 Noga Alon , Tom Bohman , Hao Huang

The infinitude is established of the set ${\bf U_1}$ of positive integers $N>5$ such that $G(N)\le \min(G(N/q), G(Np))$ where $q, p$ are primes, $q\ | N$ and $G(N):=\frac{\sigma(N)}{N\log \log N}$ stands for Gronwall number, $\sigma(N)$…

Number Theory · Mathematics 2018-10-31 Gennadiy Kalyabin

The graph $G_\sigma$ is obtained from graph $G$ by attaching self loops on $\sigma$ vertices. The energy $ E(G_\sigma)$ of the graph $G_\sigma$ with order $n$ and eigenvalues $\lambda_1,\lambda_2,\dots,\lambda_n$ is defined as $…

Combinatorics · Mathematics 2026-04-22 Kalpesh M. Popat , Kunal R. Shingala

Khabibullin's conjecture for integral inequalities has two numeric parameters $n$ and $\alpha$ in its statement, $n$ being a positive integer and $\alpha$ being a positive real number. This conjecture is already proved in the case where…

Classical Analysis and ODEs · Mathematics 2011-06-08 Ruslan Sharipov

Let $p_n$ denote the $n$th prime and $g_n:=p_{n+1}-p_n$ the $n$th prime gap. We demonstrate the existence of infinitely many values of $n$ for which $g_n>g_{n+1}>\cdots>g_{n+m}$ with $m\gg \log\log\log n$ and similarly for the reversed…

Number Theory · Mathematics 2016-04-12 D. K. L. Shiu

Let $G$ be a $d$-regular graph $G$ on $n$ vertices. Suppose that the adjacency matrix of $G$ is such that the eigenvalue $\lambda$ which is second largest in absolute value satisfies $\lambda=o(d)$. Let $G_p$ with $p=\frac{\alpha}{d}$ be…

Combinatorics · Mathematics 2016-05-25 Alan Frieze , Michael Krivelevich , Ryan R. Martin

We obtain global explicit numerical bounds, with best possible constants, for the differences $\frac{1}{n}\sum_{k\leq n}\omega(k)-\log\log n$ and$ \frac{1}{n}\sum_{k\leq n}\Omega(k)-\log\log n$, where $\omega(k)$ and $\Omega(k)$ refer to…

Number Theory · Mathematics 2023-05-16 Mehdi Hassani

Let $G(k)$ denote the least number $s$ having the property that every sufficiently large natural number is the sum of at most $s$ positive integral $k$-th powers. Then for all $k\in \mathbb N$, one has \[ G(k)\le \lceil k(\log…

Number Theory · Mathematics 2022-11-21 Joerg Bruedern , Trevor D. Wooley

In this paper, we improve the results in the author's previous paper \cite{Usu22}, which deals with the quantitative problem on Littlewood's conjecture. We show that, for any $0<\gamma<1$, any $(\alpha,\beta)\in\mathbb{R}^2$ except on a set…

Number Theory · Mathematics 2024-04-23 Shunsuke Usuki

Let $\Psi(n):=n\prod_{p | n}(1+\frac{1}{p})$ denote the Dedekind $\Psi$ function. Define, for $n\ge 3,$ the ratio $R(n):=\frac{\Psi(n)}{n\log\log n}.$ We prove unconditionally that $R(n)< e^\gamma$ for $n\ge 31.$ Let $N_n=2...p_n$ be the…

Number Theory · Mathematics 2011-08-25 Patrick Solé , Michel Planat

We prove that there are infinitely many integers $n$ such that $n$ and $n+1$ have the same number of distinct prime divisors.

Number Theory · Mathematics 2011-05-10 Jan-Christoph Schlage-Puchta

If R is a local ring of dimension n, of a smooth complex variety, and if I is a zero dimensional ideal in R, then we prove that e(I)\geq n^n/lc(I)^n. Here e(I) is the Samuel multiplicity along I, and lc(I) is the log canonical threshold of…

Algebraic Geometry · Mathematics 2007-05-23 Tommaso de Fernex , Lawrence Ein , Mircea Mustata