Related papers: Dejean's conjecture holds for n >= 30

In this short note, we will show that the metric of Deligne's pairing is continous.

Let $q\geq 2$ and denote by $s_q$ the sum-of-digits function in base $q$. For $j=0,1,...,q-1$ consider $$# \{0 \le n < N : \;\;s_q(2n) \equiv j \pmod q \}.$$ In 1983, F. M. Dekking conjectured that this quantity is greater than $N/q$ and,…

In this paper we discuss some variations of Nagata's conjecture on linear systems of plane curves. The most relevant concerns non-effectivity (hence nefness) of certain rays, which we call \emph{good rays}, in the Mori cone of the blow-up…

Let $X$ be a finite collection of sets. We count the number of ways a disjoint union of $n-1$ subsets in $X$ is a set in $X$, and estimate this number from above by $|X|^{c(n)}$ where $$ c(n)=\left(1-\frac{(n-1)\ln (n-1)}{n\ln n}…

We develop techniques to deal with monotonicity of sequences z_{n+1}/z_n and \sqrt[n]{z_n}. A series of conjectures of Zhi-Wei Sun and of Amdeberhan et al. are verified in certain unified approaches.

A graph $G=(V(G), E(G))$ is supereulerian if it has a spanning Eulerian subgraph. Let $\ell(G)$ be the maximum number of edges of spanning Eulerian subgraphs of a supereulerian graph $G$. In $1996$, Catlin conjectured that if $G$ is a…

The Total Colouring Conjecture suggests that $\Delta+3$ colours ought to suffice in order to provide a proper total colouring of every graph $G$ with maximum degree $\Delta$. Thus far this has been confirmed up to an additive constant…

Update: The Cosmetic Surgery Conjecture modulo finitely many Dehn-filling coefficients has been a well-known classical result, so the first main result of this paper is not new. (But the author was initially unaware of this fact, and the…

We prove that the partition function $p(n)$ is log-concave for all $n>25$. We then extend the results to resolve two related conjectures by Chen. The proofs are based on Lehmer's estimates on the remainders of the Hardy--Ramanujan and the…

Haj\'os' conjecture states that an Eulerian graph of order n can be decomposed into at most (n-1)/2 edge-disjoint cycles. We describe preprocessing steps, heuristics and integer programming techniques that enable us to verify Haj\'os'…

We prove a number of conjectures [arXiv:2005.04066] recently stated by P. Barry, related to the paperfolding sequence and the Rueppel sequence.

We prove a strengthened form of a conjecture of Sun on a determinant attached to a binary quadratic form. Let $n>3$ and let $c,d\in\Z$. If $n$ is composite, then \[ \det\big[(i^2+cij+dj^2)^{n-2}\big]_{0\leq i,j\leq n-1}\equiv 0\pmod {n^2}…

The illumination conjecture asserts that any convex body in $n$-dimensional Euclidean space can be illuminated by at most $2^n$ external light sources or parallel beams of light. Despite recent progress on the illumination conjecture, it…

Zhi-Wei Sun conjectures if k congruence classes are disjoint, then two of the moduli have greatest common divisor at least as large as k. We prove this conjecture for k strictly less than 21.

Let $\sigma(x)$ be the sum of the divisors of $x$. If $N$ is odd and $\sigma(N) = 2N$, then the odd perfect number $N$ is said to be given in Eulerian form if $N = {q^k}{n^2}$ where $q$ is prime with $q \equiv k \equiv 1 \pmod 4$ and…

In this paper we prove Conjecture \ref{conj1} for a set of representations of the group $GL_n({\bf A})$. This Conjecture is stated in complete generality as Conjecture 1 in \cite{G2}, and here we prove it for various cases. See Conjecture…

The article provides a counterexample to a conjecture by Blocki-Zwonek.

We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…

The well-known $abc$-conjecture concerns triples $(a,b,c)$ of non-zero integers that are coprime and satisfy ${a+b+c=0}$. The strong $n$-conjecture is a generalisation to $n$ summands where integer solutions of the equation ${a_1 + \ldots +…

Let $S_n^{(2)}$ denote the iterated partial sums. That is, $S_n^{(2)}=S_1+S_2+ ... +S_n$, where $S_i=X_1+X_2+ ... s+X_i$. Assuming $X_1, X_2,....,X_n$ are integrable, zero-mean, i.i.d. random variables, we show that the persistence…