Related papers: Dejean's conjecture holds for n>=27
We prove that Ma\~n\'e's conjecture, as stated in {\em Lagrangian flows: the dynamics of globally minimizing orbits}, Bol. Soc. Brasil. Mat. (N.S.) 28 (1997), no. 2, 141--153, contains another conjecture of Ma\~n\'e, stated in {\em Generic…
In this article we present set of infinite natural numbers which satisfies the conjecture $3n+1$.
We construct solutions to the SQG equation that fail to conserve the Hamiltonian while having the maximal allowable regularity for this property to hold. This result solves the generalized Onsager conjecture on the threshold regularity for…
We discuss conjectures related to the following two conjectures: (1) for each complex numbers x_1,...,x_n there exist rationals y_1,...,y_n \in [-2^{n-1},2^{n-1}] such that \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in…
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…
In this paper, we show that any proof of the Collatz 3n+1 Conjecture must have an infinite number of lines; therefore, no formal proof is possible.
We provide new sufficient conditions under which Ryser's conjecture holds.
The "Modularity Conjecture" is the assertion that the join of two nonmodular varieties is nonmodular. We establish the veracity of this conjecture for the case of linear idempotent varieties. We also establish analogous results concerning…
The Index Conjecture in zero-sum theory states that when $n$ is coprime to $6$ and $k$ equals $4$, every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While other values of $(k,n)$ have been studied thoroughly in the…
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…
The Collatz conjecture, also known as the 3n+1 problem, is one of the most popular open problems in number theory. In this note, an algorithm for the verification of the Collatz conjecture is presented that works on a standard PC for…
In this paper we present an explicit counterexample of degree $n=7$, which shows that the conjecture proposed by Li et al. \cite{Li2013} regarding the first derivative bounds for rational B\'ezier curves is generally false. We further…
In this paper, we find a bound for the number of the positive solutions to the titled equation, improving a result of Togb\'e. As a consequence, we prove a conjecture of Togb\'e in a few cases.
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…
In this paper, we use a variety of classical and new research methods for ternary exponential Diophantine equations and extensive use of computer calculations to study the conjecture of R. Scott and R. Styer which asserts that for any fixed…
In this paper we prove the probabilistic continuous complexity conjecture. In continuous complexity theory, this states that the complexity of solving a continuous problem with probability approaching 1 converges (in this limit) to the…
We prove the joints conjecture, showing that for any $N$ lines in ${\Bbb R}^3$, there are at most $O(N^{{3 \over 2}})$ points at which 3 lines intersect non-coplanarly. We also prove a conjecture of Bourgain showing that given $N^2$ lines…
The Levin conjecture was proposed by Levin in 1962 which conjectures the solvability of any group equation with coefficients in a torsion free group. The Levin conjecture is recently shown to hold for group equations of length seven by…
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}, $$…
Using Easton collapses, we give a simplified construction of a model in which Chang's Conjecture for triples holds.