Related papers: A Proof of Willcocks's Conjecture

Let $p$ and $q$ be positive integers. The $(p, q)$-leaper $L$ is a generalised knight which leaps $p$ units away along one coordinate axis and $q$ units away along the other. Consider a free $L$, meaning that $p + q$ is odd and $p$ and $q$…

A $(p, q)$-leaper is a fairy chess piece that, from a square $a$, can move to any of the squares $a + (\pm p, \pm q)$ or $a + (\pm q, \pm p)$. Let $L$ be a $(p, q)$-leaper with $p + q$ odd and $C$ a cycle of $L$ within a $(p + q) \times (p…

Watkins's conjecture suggests that for an elliptic curve $E/\mathbb{Q}$, the rank of the group $E(\mathbb{Q})$ of rational points is bounded above by $\nu_2 (m_E)$, where $m_E$ is the modular degree associated with $E$. It is known that…

Building on the results of our previous work on Euclidean leaper tours, considering all integers $k>1$ and $h>0$, we study the existence of Hamiltonian cycles in the vertex set $C(2,k):=\{0,1\}^k$ of the $k$-dimensional hypercube when the…

Watkins' conjecture asserts that the rank of an elliptic curve is upper bounded by the $2$-adic valuation of its modular degree. We show that this conjecture is satisfied when $E$ is any quadratic twist of an elliptic curve with rational…

We prove that the homotopy class of a Morin mapping f: P^p --> Q^q with p-q odd contains a cusp mapping. This affirmatively solves a strengthened version of the Chess conjecture [DS Chess, A note on the classes [S_1^k(f)], Proc. Symp. Pure…

A well-known conjecture asserts that there are infinitely many primes $p$ for which $p - 1$ is a perfect square. We obtain upper and lower bounds of matching order on the number of pairs of distinct primes $p,q \le x$ for which $(p - 1)(q -…

A leaper is a chess piece which generalises the knight. Given $n$ and a $(p, q)$-leaper $L$, we study the greatest $m$ such that the $m \times m$ grid graph can be embedded into the $n \times n$ leaper graph of $L$. We can assume that $p$…

Watkins conjectured that for an elliptic curve $E$ over $\mathbb{Q}$ of Mordell-Weil rank $r$, the modular degree of $E$ is divisible by $2^r$. If $E$ has non-trivial rational $2$-torsion, we prove the conjecture for all the quadratic…

In 2002 Watkins conjectured that given an elliptic curve defined over $\mathbb{Q}$, its Mordell-Weil rank is at most the $2$-adic valuation of its modular degree. We consider the analogous problem over function fields of positive…

Let $1\leq a<q$ be a pair of small integers such that $\gcd(a,q)=1$ and let $x>1$ be a large number. This note discusses the existence of a short sequence of primes $p\equiv a\bmod q$ between two squares $x^2$ and $(x+1)^2$.

We prove a $p$-converse theorem for elliptic curves $E/\mathbb{Q}$ with complex multiplication by the ring of integers $\mathcal{O}_K$ of an imaginary quadratic field $K$ in which $p$ is ramified. Namely, letting $r_p =…

P. J. Kelly conjectured in 1968 that every diregular tournament on (2n+1) points can be decomposed in directed Hamilton circuits [1]. We define so called leading diregular tournament on (2n+1) points and show that it can be decomposed in…

In 1981 Jackson showed that the diregular bipartite tournament (a complete bipartite graph whose edges are oriented so that every vertex has the same in- and outdegree) contains a Hamilton cycle, and conjectured that in fact the edge set of…

We prove a strengthening of the "reciprocity conjecture" of Khare and Wintenberger. The input to the original conjecture is an odd prime p, a CM number field F containing the pth roots of unity, and a pair of primes of the maximal totally…

Alphatrion conjectured that it is possible to label the vertices of an $n$-dimensional hypercube with distinct positive integers such that for every Hamiltonian path $a_1, \dots, a_{2^n},$ we have $a_i + a_{i+1}$ prime for all $i.$ We prove…

A conjecture of Thomassen from 1982 states that for every k there is an f(k) so that every strongly f(k)-connected tournament contains k edge-disjoint Hamilton cycles. A classical theorem of Camion, that every strongly connected tournament…

A famous conjecture of P\'osa from 1962 asserts that every graph on $n$ vertices and with minimum degree at least $2n/3$ contains the square of a Hamilton cycle. The conjecture was proven for large graphs in 1996 by Koml\'os, S\'ark\"ozy…

In 2010, N. Lichiardopol conjectured for $q \geq 3$ and $k \geq 1$ that any tournament with minimum out-degree at least $(q-1)k-1$ contains $k$ disjoint cycles of length $q$. We prove this conjecture for $q \geq 5$. Since it is already…

We generalize the recent results of Chaiken et al. to a rectangular $m\times n$ chessboard. An explicit formula for the number of nonattacking configurations of one-move riders on such a chessboard is calculated in two different ways, one…