Related papers: Constraints on counterexamples to the Casas-Alvero…
In this ``experimental'' research, we use known topological recursion relations in genera-zero, -one, and -two to compute the n-point descendant Gromov-Witten invariants of P^1 for arbitrary degrees and low values of n. The results are…
In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…
This paper presents a possible link between Cages and Expander Graphs by introducing three interconnected variants of the Bermond and Bollob\'as Conjecture, originally formulated in 1981 within the context of the Degree/Diameter Problem. We…
Additive combinatorics asks for lower bounds on sumsets and restricted sumsets over finite fields. Central examples are the Cauchy-Davenport theorem and the Erd\H{o}s-Heilbronn conjecture. In this note, we develop Das's linear algebraic…
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…
Let $\lambda(m)$ be the $m$th coefficient of a modular form $f(z)=\sum_{m\geq 1} \lambda(m)q^m$ of weight $k\geq 4$, let $p^n$ be a prime power, and let $\varepsilon>0$ be a small number. An approximate of the Atkin-Serre conjecture on the…
We indicate that an argument of da Costa and Doria in fact proves P=NP. This observation makes their argument appear dubious. We isolate a weak version of one of their lemmas which would already prove P=NP. We point out that even this weak…
Hadwiger's Conjecture states that every graph with chromatic number $k$ contains a complete graph on $k$ vertices as a minor. This conjecture is a tremendous strengthening of the Four-Colour Theorem and is regarded as one of the most…
In this paper we develop Host--Kra and inverse Gowers theory for abelian groups of bounded exponent. We show that the Host--Kra factors $Z^{\leq k}(\mathrm{X})$ associated with actions of such groups admit extensions with the structure of…
In this article we prove three main theorems: (1) guessing models are internally unbounded, (2) for any regular cardinal $\kappa \ge \omega_2$, $\textsf{ISP}(\kappa)$ implies that $\textsf{SCH}$ holds above $\kappa$, and (3) forcing posets…
A value of a CSP instance is typically defined as a fraction of constraints that can be simultaneously met. We propose an alternative definition of a value of an instance and show that, for purely combinatorial reasons, a value of an…
Borodin and Kostochka conjectured that every graph $G$ with maximum degree $\Delta \ge 9$ satisfies $\chi \le \max\{\omega, \Delta-1\}$. We carry out an in-depth study of minimum counterexamples to the Borodin-Kostochka conjecture. Our main…
Enrico Bombieri proved that the ABC Conjecture implies Roth's theorem in 1994. This paper concerns the other direction. In making use of Bombieri's and Van der Poorten's explicit formula for the coefficients of the regular continued…
In 2017, Geordie Williamson proved the existence of counterexamples to James's conjecture on the decomposition matrices of symmetric groups and their Hecke algebras. The smallest counterexample detectable by Williamson's method occurs in…
We study strong approximation for some algebraic varieties over which are defined using norm forms over the rationals. This allows us to confirm a special case of a conjecture due to Harpaz and Wittenberg.
In his 2008 thesis, Tateno claimed a counterexample to the Bonato-Tardif conjecture regarding the number of equimorphy classes of trees. In this paper we revisit Tateno's unpublished ideas to provide a rigorous exposition, constructing…
The Cram\'er-Granville conjecture is an upper bound on prime gaps, $g_n = p_{n+1} - p_n < \cCramer \, \log^2 p_n$ for some constant $\cCramer \geq 1$. Using a formula of Selberg, we first prove the weaker summed version: $\sum_{n=1}^N g_n <…
We continue with the investigation began in "The Dixmier conjecture and the shape of possible counterexamples". In that paper we introduced the notion of an irreducible pair (P,Q) as the image of the pair (X,Y) of the canonical generators…
The famous Posa conjecture states that every graph of minimum degree at least 2n/3 contains the square of a Hamilton cycle. This has been proved for large n by Koml\'os, Sark\"ozy and Szemer\'edi. Here we prove that if p > n^{-1/2+\eps},…
We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)