English
Related papers

Related papers: Rectangular Heffter arrays: a reduction theorem

200 papers

In this paper, we extend recent work of the third author and Ziegler on triples of integers $(a,b,c)$, with the property that each of $(a,b,c)$, $(a+1,b+1,c+1)$ and $(a+2,b+2,c+2)$ is multiplicatively dependent, completely classifying such…

Number Theory · Mathematics 2024-11-21 Michael A. Bennett , István Pink , Ingrid Vukusic

Let $H(m,d)$ denote the asymptotic frequency of the natural numbers $k\equiv d \mod m$ in the continued fraction expansions of almost all numbers $x\in[0,1)$. For a fixed number $m\ge 4$, we study $\mathbb Q$-linear relations among the…

Number Theory · Mathematics 2018-06-12 Kurt Girstmair

In this paper we prove several results on Ramsey numbers $R(H,F)$ for a fixed graph $H$ and a large graph $F$, in particular for $F = K_n$. These results extend earlier work of Erd\H{o}s, Faudree, Rousseau and Schelp and of Balister, Schelp…

Combinatorics · Mathematics 2023-03-13 Domagoj Bradač , Lior Gishboliner , Benny Sudakov

For any two arbitrary positive integers `$n$' and `$m$', using the $m$--th KdV hierarchy and the $(n+m)$--th KdV hierarchy as building blocks, we are able to construct another integrable hierarchy (referred to as the $(n,m)$--th KdV…

High Energy Physics - Theory · Physics 2009-10-28 L. Bonora , Q. P. Liu , C. S. Xiong

In this paper we redefine an increasing filtration on the the Hopf algebra S(n,k), From which we get a spectral sequence called May spectral sequence. As an application we computed $H^{*,*}S(n,n)$ at prime 2, $H^{*,*}S(3,2)$ at prime 3 and…

Algebraic Topology · Mathematics 2016-05-04 Liman Chen , Xiangjun Wang , Xuezhi Zhao

The Hecke algebras $\mathcal{H}_{n,k}$ of the group pairs $(S_{kn}, S_k\wr S_n)$ can be endowed with a filtration with respect to the orbit structures of the elements of $S_{kn}$ relative to the action of $S_{kn}$ on the set of…

Representation Theory · Mathematics 2019-12-24 Şafak Özden

We extend results of Jagy and Kaplansky and the present authors and show that for all $k\geq 3$ there are infinitely many positive integers $n$, which cannot be written as $x^2+y^2+z^k=n$ for positive integers $x,y,z$, where for…

Number Theory · Mathematics 2016-07-12 Rainer Dietmann , Christian Elsholtz

The class of strictly sign regular (SSR) matrices has been extensively studied by many authors over the past century, notably by Schoenberg, Motzkin, Gantmacher, and Krein. A classical result of Gantmacher-Krein assures the existence of SSR…

Rings and Algebras · Mathematics 2025-04-15 Projesh Nath Choudhury , Shivangi Yadav

We show that infinitely many three-term arithmetic progressions $N, N+d, N+2d$ of powerful numbers exist with $d = 2\sqrt{N} + 1$. We further conjecture that infinitely many of these progressions consist of three consecutive terms in the…

Number Theory · Mathematics 2026-05-11 Wouter van Doorn

The main result of this thesis is to show that there are only finitely many integers $n$ such that both $n$ and $d(n)$ are highly composite numbers at the same time, where $d(n)$ is the divisor function. Bertrand's postulate [4] is used…

Number Theory · Mathematics 2023-05-25 Lars Magnus Øverlier

Let $\mathcal{S}_n$ denote the set of permutations of $\{1,2,\dots,n\}$. The function $f(n,s)$ is defined to be the minimum size of a subset $S\subseteq \mathcal{S}_n$ with the property that for any $\rho\in \mathcal{S}_n$ there exists some…

Combinatorics · Mathematics 2020-04-30 Kevin Hendrey , Ian M. Wanless

We prove the following results solving a problem raised in [Y. Caro, R. Yuster, On zero-sum and almost zero-sum subgraphs over $\mathbb{Z}$, Graphs Combin. 32 (2016), 49--63]. For a positive integer $m\geq 2$, $m\neq 4$, there are…

Combinatorics · Mathematics 2017-09-01 Yair Caro , Adriana Hansberg , Amanda Montejano

Let $n$ and $s$ be fixed integers such that $n\geq 2$ and $1\leq s\leq \frac{n}{2}$. Let $M_n(\mathbb{K})$ be the ring of all $n\times n$ matrices over a field $\mathbb{K}$. If a map $\delta:M_n(\mathbb{K})\rightarrow M_n(\mathbb{K})$…

Rings and Algebras · Mathematics 2019-03-13 Xiaowei Xu , Baochuan Xie , Yanhua Wang , Zhibing Zhao

A \emph{magic square} is an $n \times n$ array of distinct positive integers whose sum along any row, column, or main diagonal is the same number. We compute the number of such squares for $n=4$, as a function of either the magic sum or an…

Combinatorics · Mathematics 2011-03-08 Matthias Beck , Andrew Van Herick

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

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

Number Theory · Mathematics 2024-09-05 Philipp Habegger , Alina Ostafe , Igor E. Shparlinski

Inspired by Cohen and te Riele~\cite{Cohen1996}, who computationally verified that for every $n \leq 400$ there exists $k$ such that $\sigma^k(n) \equiv 0 \pmod{n}$ (where $\sigma^k$ denotes the $k$-fold iteration of the sum-of-divisors…

Number Theory · Mathematics 2025-12-29 Zeraoulia Rafik , Pedro Caceres

In this article, a series of Hadamard matrix has been developed using some block matrices with the help of skew Hadamard matrix. Basically an internal structure of skew Hadamard matrix has been changed with some block matrices using…

Combinatorics · Mathematics 2021-08-19 Shipra Kumari , Hrishikesh Mahato

We revisit the complexity of building, given a two-dimensional string of size $n$, an indexing structure that allows locating all $k$ occurrences of a two-dimensional pattern of size $m$. While a structure of size $\mathcal{O}(n)$ with…

Data Structures and Algorithms · Computer Science 2025-08-26 Paweł Gawrychowski , Adam Górkiewicz

For all integers $n \geq k > d \geq 1$, let $m_{d}(k,n)$ be the minimum integer $D \geq 0$ such that every $k$-uniform $n$-vertex hypergraph $\mathcal H$ with minimum $d$-degree $\delta_{d}(\mathcal H)$ at least $D$ has an optimal matching.…

Combinatorics · Mathematics 2024-04-17 Dong Yeap Kang , Tom Kelly , Daniela Kühn , Deryk Osthus , Vincent Pfenninger