Related papers: On the Least counterexample to Robin hypothesis

Let $G$ be a graph and $\Gamma$ a finite abelian group. The zero-sum Ramsey number of $G$ over $\Gamma$, denoted by $R(G, \Gamma)$, is the smallest positive integer $t$ (if it exists) such that any edge-colouring $c:E(K_t)\to\Gamma$…

This paper investigates the relationship between the Riemann hypothesis and the statement $\forall n, ~g(n) \le e^{\sqrt{p_n}}$, where $g(n)$ is the maximum order of an element of $S_n$, the symmetric group on $n$ elements, and $p_n$ is the…

Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…

Chaining techniques show that if X is an isotropic log-concave random vector in R^n and Gamma is a standard Gaussian vector then E |X| < C n^{1/4} E |Gamma| for any norm |*|, where C is a universal constant. Using a completely different…

We show that, for any $r\geq 1$, if $g_1,\ldots,g_r$ are distinct coprime integers, sufficiently large depending only on $r$, then for any $\epsilon>0$ there are infinitely many integers $n$ such that all but $\epsilon \log n$ of the digits…

The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…

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…

By modifying Beukers' proof of Apery's theorem that zeta(3) is irrational, we derive criteria for irrationality of Euler's constant, gamma. For n > 0, we define a double integral I(n) and a positive integer S(n), and prove that if d(n) =…

Let $ \mathbb{Q}\mathcal{E}_{\mathbb{Z}} $ be the set of power sums whose characteristic roots belong to $ \mathbb{Z} $ and whose coefficients belong to $ \mathbb{Q} $, i.e. $ G : \mathbb{N} \rightarrow \mathbb{Q} $ satisfies…

In this article, we investigate the existence and multiplicity of solutions to the Robin problem \begin{equation*} \begin{cases} -\Delta u = \lambda f(u) & \text{in } \Omega, \frac{\partial u}{\partial \nu} + \gamma u=0 & \text{on }…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind(S)$ of $S$ is defined to be the…

Define $||n||$ to be the \emph{complexity} of $n$, which is the smallest number of $1$s needed to write $n$ using an arbitrary combination of addition and multiplication. John Selfridge showed that $||n|| \geq 3\log_3 n$ for all $n$.…

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the minimum number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We find lower bounds linear in $n$ for…

We prove that if $\Sigma$ is a closed surface of genus at least 3 and $G$ is a split real semisimple Lie group of rank at least $3$ acting faithfully by isometries on a symmetric space $N$, then there exists a Hitchin representation…

Let $g(n)$ be the largest positive integer $k$ such that there are distinct primes $p_i$ for $1\leq i\leq k$ so that $p_i |n+i$. This function is related to a celebrated conjecture of C.A. Grimm. We establish upper and lower bounds for…

We use a coin flipping model for the random partition and Chebyshev's inequality to prove the lower bound $\lim \frac{\log p(n)}{\sqrt{n}} \ge C$ for the number of partitions $p(n)$ of $n$, where $C$ is an explicit constant.

Following earlier results of Sondow, we propose another criterion of irrationality for Euler's constant $\gamma$. It involves similar linear combinations of logarithm numbers $L\_{n,m}$. To prove that $\gamma$ is irrational, it suffices to…

An equivalence graph is a disjoint union of cliques, and the equivalence number $\mathit{eq}(G)$ of a graph $G$ is the minimum number of equivalence subgraphs needed to cover the edges of $G$. We consider the equivalence number of a line…

For a non-cyclic finite group $G$, let $\gamma(G)$ denote the smallest number of conjugacy classes of proper subgroups of $G$ needed to cover $G$. Bubboloni, Praeger and Spiga, motivated by questions in number theory, have recently…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…