English
Related papers

Related papers: A Proof of Willcocks's Conjecture

200 papers

The napkin problem was first posed by John H. Conway, and written up as a `toughie' in "Mathematical Puzzles: A Connoisseur's Collection," by Peter Winkler. To paraphrase Winkler's book, there is a banquet dinner to be served at a…

Combinatorics · Mathematics 2007-05-23 Anders Claesson , T. Kyle Petersen

In 1992, Bollob\'as and Meir showed that for every $k \geq 1$ there exists a constant $c_k$ such that, for any $n$ points in the $k$-dimensional unit cube $[0, 1]^k$, one can find a tour $x_1, \dots, x_n$ through these $n$ points with…

Combinatorics · Mathematics 2026-03-24 Alexey Gordeev

For two odd primes $p$ and $q$ such that $p<q$, let $A(p,q):=(a_k)_{k=1}^{\infty}$ be the arithmetic progression whose $k$th term is given by $a_k=(k-1)(q-p)+p$ (i.e., with $a_1=p$ and $a_2=q$). Here we conjecture that for every positive…

Number Theory · Mathematics 2019-01-24 Romeo Meštrović

Wu in 1999 conjectured that if $H$ is a subgraph of the complete graph $K_{2n+1}$ with $n$ edges, then there is a Hamiltonian cycle decomposition of $K_{2n+1}$ such that each edge of $H$ is in a separate Hamiltonian cycle. The conjecture…

Combinatorics · Mathematics 2024-03-27 Ramin Javadi , Meysam Miralaei

We show that every $3$-uniform hypergraph $H=(V,E)$ with $|V(H)|=n$ and minimum pair degree at least $(4/5+o(1))n$ contains a squared Hamiltonian cycle. This may be regarded as a first step towards a hypergraph version of the P\'osa-Seymour…

Combinatorics · Mathematics 2022-07-08 Wiebke Bedenknecht , Christian Reiher

We formulate a "correct" version of the Quillen conjecture on linear group homology for certain arithmetic rings and provide evidence for the new conjecture. In this way we predict that the linear group homology has a direct summand looking…

K-Theory and Homology · Mathematics 2008-04-23 Marian F. Anton

A famous conjecture of Lov\'asz states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is dense and sufficiently large. In fact, we show that such…

Combinatorics · Mathematics 2017-07-31 Demetres Christofides , Jan Hladký , András Máthé

We survey some recent results on long-standing conjectures regarding Hamilton cycles in directed graphs, oriented graphs and tournaments. We also combine some of these to prove the following approximate result towards Kelly's conjecture on…

Combinatorics · Mathematics 2010-06-04 Daniela Kühn , Deryk Osthus

Given an elliptic curve $E$ over $\mathbb{Q}$ and non-zero integer $r$, the Lang--Trotter conjecture predicts a striking asymptotic formula for the number of good primes $p\leqslant x$, denoted by $\pi_{E,r}(x)$, such that the Frobenius…

Number Theory · Mathematics 2025-11-25 Daqing Wan , Ping Xi

Let $p\geq 7$ and suppose $(p,p-2)$ are twin prime numbers, in [Hatley, 2009], the elliptic curve $E_p:y^2=x(x-2)(x-p)$ was considered in the context of a conjecture by Jason Beers about the Mordell-Weil ranks of $E_p/\mathbb{Q}$. I show…

Number Theory · Mathematics 2025-08-19 Kirti Joshi

The 1-2-3 Conjecture, posed in 2004 by Karonski, Luczak, and Thomason, is as follows: "If G is a graph with no connected component having exactly 2 vertices, then the edges of G may be assigned weights from the set {1,2,3} so that, for any…

Combinatorics · Mathematics 2012-11-22 Ben Seamone

The Hilbert-Smith Conjecture states that if G is a locally compact group which acts effectively on a connected manifold as a topological transformation group, then G is a Lie group. A rather straightforward proof of this conjecture is…

Geometric Topology · Mathematics 2007-05-23 Louis F. McAuley

In this paper, we show that a small minimal k-blocking set in PG(n, q3), q = p^h, h >= 1, p prime, p >=7, intersecting every (n-k)-space in 1 (mod q) points, is linear. As a corollary, this result shows that all small minimal k-blocking…

Combinatorics · Mathematics 2012-01-17 Michel Lavrauw , Leo Storme , Geertrui Van de Voorde

It is well known that for any prime $p\equiv 3$ (mod $4$), the class numbers of the quadratic fields $\mathbb{Q}(\sqrt{p})$ and $\mathbb{Q}(\sqrt{-p})$, $h(p)$ and $h(-p)$ respectively, are odd. It is natural to ask whether there is a…

Number Theory · Mathematics 2014-12-02 Lynn Chua , Benjamin Gunby , Soohyun Park , Allen Yuan

Let $S\subseteq \mathbb{N}$ be a numerical semigroup with multiplicity $m$, embedding dimension $\nu$ and conductor $c=f+1=qm-\rho$ for some $q,\rho\in\mathbb{N}$ with $\rho<m$. Let Ap$(S,m) = \{w\_0<w_1 < \ldots < w_{m-1}\}$ be the Ap\'ery…

Combinatorics · Mathematics 2016-10-30 Mariam Dhayni

We present properties and invariants of Hamiltonian circuits in rectangular grids. It is proved that all circuits on a $2n \times 2n$ chessboard have at least $4n$ turns and at least $2n$ straights if $n$ is even and $2n+2$ straights if $n$…

General Mathematics · Mathematics 2021-04-07 Rüdiger Jehn

We show how to adjust a very nice coupling argument due to McDiarmid in order to prove/reprove in a novel way results concerning Hamilton cycles in various models of random graph and hypergraphs. In particular, we firstly show that for…

Combinatorics · Mathematics 2015-02-09 Asaf Ferber

We prove the filling area conjecture in the hyperelliptic case. In particular, we establish the conjecture for all genus 1 fillings of the circle, extending P. Pu's result in genus 0. We translate the problem into a question about closed…

Differential Geometry · Mathematics 2007-05-23 Victor Bangert , Christopher Croke , Sergei V. Ivanov , Mikhail G. Katz

In this short note we confirm the relation between the generalized $abc$-conjecture and the $p$-rationality of number fields. Namely, we prove that given K$/\mathbb{Q}$ a real quadratic extension or an imaginary $S_3$-extension, if the…

Number Theory · Mathematics 2019-07-09 Christian Maire , Marine Rougnant

In Parts I-III we showed that the number of ways to place $q$ nonattacking queens or similar chess pieces on an $n\times n$ chessboard is a quasipolynomial function of $n$ whose coefficients are essentially polynomials in $q$. In this part…

Combinatorics · Mathematics 2021-06-16 Seth Chaiken , Christopher R. H. Hanusa , Thomas Zaslavsky