Related papers: A proof of Dejean's conjecture

We show that for a sequence of random graphs Brouwer's conjecture holds true with probability tending to one as the number of vertices tends to infinity. Surprisingly, it was found that a similar statement holds true for weighted graphs…

We show that any n-vertex complete graph with edges colored with three colors contains a set of at most four vertices such that the number of the neighbors of these vertices in one of the colors is at least 2n/3. The previous best value,…

We prove that the union-closed sets conjecture is true for separating union-closed families $\mathcal{A}$ with $|\mathcal{A}| \leq 2\left(m+\frac{m}{\log_2(m)-\log_2\log_2(m)}\right)$ where $m$ denotes the number of elements in…

The Wiegold conjecture holds for the small Ree groups for $k$-tuples where $k \geq 5$.

It is well known that the following Collatz Conjecture is one of the unsolved problems in mathematics. Collatz Conjecture: For any positive integer $n>1$, the following recursive algorithm will convergent to 1 by a finite number of steps.…

A remarkable conjecture of Feige (2006) asserts that for any collection of $n$ independent non-negative random variables $X_1, X_2, \dots, X_n$, each with expectation at most $1$, $$ \mathbb{P}(X < \mathbb{E}[X] + 1) \geq \frac{1}{e}, $$…

We prove the validity of the strong version of the union of uniform closed balls conjecture, formulated in 2011 as [4, Conjecture 2.5], in the plane.

In this paper, we give a survey of the recent develpoments of the DDVV conjecture.

In this paper, we obtained an equivalent proposition of Brennan`s conjecture. And given two lower bound estimation of the conjecture one of them connected with Schwarzian derivative. The present study also verified the correctness of the…

New cases of the multiplicity conjecture are considered.

We give a reduction of Donovan's conjecture for abelian groups to a similar statement for quasisimple groups. Consequently we show that Donovan's conjecture holds for abelian $2$-groups.

We prove Simon's conjecture for 3-manifolds.

Extending upon our previous work, we verify the Jones Unknot Conjecture for all knots up to $24$ crossings. We describe the method of our approach and analyze the growth of the computational complexity of its different components.

It is known that the Scholz conjecture on addition chains is true for all integers $n$ with $\ell(2n) = \ell(n)+1$. There exists infinitely many integers with $\ell(2n) \leq \ell(n)$ and we don't know if the conjecture still holds for them.…

We show that the Jacobian conjecture of the two dimensional case is true.

The Jones unknot conjecture states that the Jones polynomial distinguishes the unknot from nontrivial knots. We prove it for knots up to 23 crossings.

Inspired by the recent pioneering work, dubbed "The Ramanujan Machine" by Raayoni et al. (arXiv:1907.00205), we (automatically) [rigorously] prove some of their conjectures regarding the exact values of some specific infinite continued…

In this note, we establish the validity of a conjecture recently proposed in Mathematics Magazine and connect it to the existing interesting results

We settle in the affirmative the Graham-Sloane conjecture.

We prove that the lonely runner conjecture holds for eight runners. Our proof relies on a computer verification and on recent results that allow bounding the size of a minimal counterexample. We note that our approach also applies to the…