English
Related papers

Related papers: Towards a solution of Archdeacon's conjecture on i…

200 papers

A $(v,k;r)$ Heffter space is a resolvable $(v_r,b_k)$ configuration whose points form a half-set of an abelian group $G$ and whose blocks are all zero-sum in $G$. It was recently proved that there are infinitely many orders $v$ for which,…

Combinatorics · Mathematics 2024-08-23 Marco Buratti , Anita Pasotti

In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…

Number Theory · Mathematics 2014-10-21 William D. Banks , Tristan Freiberg , Caroline L. Turnage-Butterbaugh

A Heffter array over an additive group $G$ is any partially filled array $A$ satisfying that: (1) each one of its rows and columns sum to zero in $G$, and (2) if $i\in G\setminus\{0\}$, then either $i$ or $-i$ appears exactly once in $A$.…

Combinatorics · Mathematics 2024-10-31 Raúl M. Falcón , Lorenzo Mella

Let $(\epsilon_i)$ be a Rademacher sequence, i.e., a sequence of independent and identically distributed random variables satisfying $P(\epsilon_i=1)=P(\epsilon_i=-1)=1/2$. Set $S_n=a_1\epsilon_1+\cdots+a_n\epsilon_n$ for…

Probability · Mathematics 2023-10-26 Shi-Zhen Liu , Ze-Yu Tao , Ze-Chun Hu

Archdeacon, in his seminal paper $[1]$, defined the concept of Heffter array in order to provide explicit constructions of $\mathbb{Z}_{v}$-regular biembeddings of complete graphs $K_v$ into orientable surfaces. In this paper, we first…

Combinatorics · Mathematics 2025-11-27 Simone Costa

Let $f$ be a normalized Hecke eigenform with rational integer Fourier coefficients. It is an interesting question to know how often an integer $n$ has a factor common with the $n$-th Fourier coefficient of $f$. The second author…

Number Theory · Mathematics 2014-03-20 Sanoli Gun , V. Kumar Murty

A famous conjecture of Erd\H os and Straus is that for every integer $n\ge2$, $4/n$ can be represented as $1/x+1/y+1/z$, where $x,y,z$ are positive integers. This conjecture was generalized to $5/n$ by Sierpi\'nski, and then Schinzel…

Number Theory · Mathematics 2026-01-16 Carl Pomerance , Andreas Weingartner

For each positive integer $m$, the $m$th order harmonic numbers are given by $$H_n^{(m)}=\sum_{0<k\le n}\frac1{k^m}\ \ (n=0,1,2,\ldots).$$ We discover exact values of some series involving harmonic numbers of order not exceeding four. For…

Number Theory · Mathematics 2025-03-04 Zhi-Wei Sun

Eberhard proved that for every sequence $(p_k), 3\le k\le r, k\ne 5,7$ of non-negative integers satisfying Euler's formula $\sum_{k\ge3} (6-k) p_k = 12$, there are infinitely many values $p_6$ such that there exists a simple convex…

Combinatorics · Mathematics 2010-05-07 Matt DeVos , Agelos Georgakopoulos , Bojan Mohar , Robert Šámal

It is conjectured that Hadamard matrices exist for all orders $4t$ ($t>0$). However, despite a sustained effort over more than five decades, the strongest overall existence results are asymptotic results of the form: for all odd natural…

Combinatorics · Mathematics 2010-03-23 Warwick de Launey

In this paper we define a new class of partially filled arrays, called $\lambda$-fold relative Heffter arrays, that are a generalisation of the Heffter arrays introduced by Archdeacon in 2015. After showing the connection of this new…

Combinatorics · Mathematics 2021-06-09 Simone Costa , Anita Pasotti

We initiate the study of the sets $H(c)$, $0<c<1$, of real $x$ for which the sequence $(kx)_{k\geq1}$ (viewed mod 1) consistently hits the interval $[0,c)$ at least as often as expected (i. e., with frequency $\geq c$). More formally, \[…

Number Theory · Mathematics 2009-11-12 Michael Boshernitzan , David Ralston

In this paper we will show the existence of a face $2$-colourable biembedding of the complete graph onto an orientable surface where each face is a cycle of a fixed length $k$, for infinitely many values of $k$. In particular, under certain…

Combinatorics · Mathematics 2019-08-12 Nicholas J. Cavenagh , D. Donovan , E. Ş. Yazici

Stanley, building on work of Stern, defined an array of numbers by the recurrence $s(n, 2k) = s(n-1, k)$, $s(n, 2k+1) = s(n-1, k) + s(n-1, k+1)$. Stanley showed that, for each positive integer $r$, the sequence $s_n^r:= \sum_k s(n,k)^r$…

Combinatorics · Mathematics 2019-01-21 David E Speyer

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…

Combinatorics · Mathematics 2026-03-24 Gabriele Di Pietro , Marco Ripà

We prove the second author's "denominator conjecture" [40] concerning the common denominators of coefficients of certain linear forms in zeta values. These forms were recently constructed to obtain lower bounds for the dimension of the…

Number Theory · Mathematics 2007-05-23 C. Krattenthaler , T. Rivoal

For any integer $m\geq 2$ and $r \in \{1,\dots, m\}$, let $f_n^{m,r}$ denote the number of $n$-Dyck paths whose peak's heights are $im+r$ for some integer $i$. We find the generating function of $f_n^{m,r}$ satisfies a simple algebraic…

Combinatorics · Mathematics 2021-12-14 Guoce Xin , Zihao Zhang

Archdeacon, in his seminal paper $[1]$, defined the concept of Heffter array to provide explicit constructions of biembeddings of the complete graph $K_v$ into orientable surfaces, the so-called Archdeacon embeddings, and proved that these…

Combinatorics · Mathematics 2023-04-05 Simone Costa , Lorenzo Mella

Let $m,n,s,k$ be four integers such that $1\leqslant s \leqslant n$, $1\leqslant k\leqslant m$ and $ms=nk$. A signed magic array $SMA(m,n; s,k)$ is an $m\times n$ partially filled array whose entries belong to the subset $\Omega\subset…

Combinatorics · Mathematics 2024-10-08 Fiorenza Morini , Marco Antonio Pellegrini

Hadwiger's conjecture asserts that every graph with chromatic number $t$ contains a complete minor of order $t$. Given integers $n \ge 2k+1 \ge 5$, the Kneser graph $K(n, k)$ is the graph with vertices the $k$-subsets of an $n$-set such…

Combinatorics · Mathematics 2015-12-01 Guangjun Xu , Sanming Zhou