Related papers: Rectangular Heffter arrays: a reduction theorem

Let r mod m be the least positive residue of r modulo m, and set the height of a pair (r,s) of integers, both relatively prime to m, to be the minimum over k, with 0<k<m, of (k r mod m) + (k s mod m). Denote this quantity by h(m,r,s). We…

Rational approximations to a square root $\sqrt{k}$ can be produced by iterating the transformation $f(x) = (dx+k)/(x+d)$ starting from $\infty$ for any positive integer $d$. We show that these approximations coincide infinitely often with…

For a given integer $m$ and any residue $a \pmod{m}$ that can be written as a sum of 3 squares modulo $m$, we show the existence of infinitely many integers $n \equiv a \pmod{m}$ such that the number of representations of $n$ as a sum of…

An $(n,k)$ sequence covering array is a set of permutations of $[n]$ such that each sequence of $k$ distinct elements of $[n]$ is a subsequence of at least one of the permutations. An $(n,k)$ sequence covering array is perfect if there is a…

If $N=2^k > 8$ then there exist exactly $[(k-1)/2]$ pairwise nonequivalent $Z_4$-linear Hadamard $(N,2N,N/2)$-codes and $[(k+1)/2]$ pairwise nonequivalent $Z_4$-linear extended perfect $(N,2^N/2N,4)$-codes. A recurrent construction of…

We study the maximum multiplicity $\mathcal{M}(k,n)$ of a simple transposition $s_k=(k \: k+1)$ in a reduced word for the longest permutation $w_0=n \: n-1 \: \cdots \: 2 \: 1$, a problem closely related to much previous work on sorting…

Let $\theta$ and $\rho$ be real numbers with $0 \le \theta, \rho < 1$ and $\theta$ irrational. We show that the Hecke-Mahler series $$ F_{\theta, \rho} (z_1, z_2) = \sum_{k_1 \ge 1} \, \sum_{k_2 = 1}^{\lfloor k_1 \theta + \rho \rfloor} \,…

For any relatively prime integers $r$ and $s$, let $a_{r,s}(n)$ denote the number of $(r,s)$-regular partitions of a positive integer of $n$ into distinct parts. Prasad and Prasad (2018) proved many infinite families of congruences modulo 2…

A holey Schr\"oder design of type $h_1^{n_1}h_4^{n_2}\cdots h^{n_k}_k$ (HSD$(h_1^{n_1}h_4^{n_2}\cdots h^{n_k}_k))$ is equivalent to a frame idempotent Schr\"oder quasigroup (FISQ$(h_1^{n_1}h_4^{n_2}\cdots h^{n_k}_k))$ of order $n$ with…

For $n\geq 3$ and $r=r(n) \geq 3$, let $\boldsymbol{k} =\boldsymbol{k}(n)=(k_1, \ldots, k_n)$ be a sequence of non-negative integers with sum $M(\boldsymbol{k})=\sum_{j=1}^{n} k_j$. We assume that $M(\boldsymbol{k})$ is divisible by $r$ for…

We demonstrate the existence of $K$-multimagic squares of order $N$ consisting of distinct integers whenever $N>2 K(K+1)$. This improves upon our earlier result in which we only required $N+1$ distinct integers. Additionally, we present a…

For prime powers q we use "strongly orthogonal" linear Sudoku solutions of order q^2 to construct ordered orthogonal arrays of type OOA (4,s,2,q), and for each q we present a range of values of s for which these constructions are valid.

The classical Hard Lefschetz theorem (HLT), Hodge-Riemann bilinear relation theorem (HRR) and Lefschetz decomposition theorem (LD) are stated for a power of a K\"ahler class on a compact K\"ahler manifold. These theorems are not true for an…

Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…

Let $M$ be a subset of $\mathbb{R}^k$. It is an important question in the theory of linear inequalities to estimate the minimal number $h=h(M)$ such that every system of linear inequalities which is infeasible over $M$ has a subsystem of at…

The purpose of this paper is to introduce the concept of reflecting numbers to the realm of number theory and to classify reflecting numbers of certain types. For us, reflecting numbers are coming from congruent numbers, above congruent…

An Orthogonally resolvable Matching Design OMD$(n, k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, called blocks, such that the blocks can be resolved in two different ways. Such a design can be…

Given positive integers $h, N$ satisfying $1 \leqslant h \leqslant 2N^2$, we define $T(h,N)$ to be the number of $2\times 2$ integer matrices with determinant equal to $h$ whose entries lie in $[-N,N]$. Our main result states that for any…

It is known that a real symmetric circulant matrix with diagonal entries $d\geq0$, off-diagonal entries $\pm1$ and orthogonal rows exists only of order $2d+2$ (and trivially of order $1$) [Turek and Goyeneche 2019]. In this paper we…

This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…