中文
相关论文

相关论文: An update on the existence of integer Heffter arra…

200 篇论文

A Heffter array is an m by n matrix with nonzero entries from Z_{2mn+1} such that i) every row and column sum to 0, and ii) no element from {x,-x} appears twice. We construct some Heffter arrays. These arrays are used to build current…

组合数学 · 数学 2014-12-03 Dan Archdeacon

In this paper we introduce a special class of partially filled arrays. A magic partially filled array $\mathrm{MPF}_\Omega(m,n; s,k)$ on a subset $\Omega$ of an abelian group $(\Gamma,+)$ is a partially filled array of size $m\times n$ with…

组合数学 · 数学 2022-09-22 Fiorenza Morini , Marco Antonio Pellegrini

For integers $n,k,s$, we give a formula for the number $T(n,k,s)$ of order $k$ subsets of the ring $\mathbb{Z}/n\mathbb{Z}$ whose sum of elements is $s$ modulo $n$. To do so, we describe explicitly a sequence of matrices $M(k)$, for…

数论 · 数学 2025-03-21 David Broadhurst , Xavier Roulleau

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…

组合数学 · 数学 2025-11-27 Simone Costa

Let $S$ be a subset of a group $G$ (not necessarily abelian) such that $S\,\cap -S$ is empty or contains only elements of order $2$, and let $\mathbf{h}=(h_1,\ldots, h_m)\in \mathbb{N}^m$ and $\mathbf{k}=(k_1, \ldots, k_n)\in \mathbb{N}^n$.…

组合数学 · 数学 2026-05-06 Lorenzo Mella , Tommaso Traetta

The notion of a Heffter array, which received much attention in the last decade, is equivalent to a pair of orthogonal Heffter systems. In this paper we study the existence problem of a set of $r$ mutually orthogonal Heffter systems for any…

组合数学 · 数学 2024-06-18 Marco Buratti , Anita Pasotti

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…

组合数学 · 数学 2019-08-12 Nicholas J. Cavenagh , D. Donovan , E. Ş. Yazici

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…

组合数学 · 数学 2020-02-21 Raphael Yuster

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, \[…

数论 · 数学 2009-11-12 Michael Boshernitzan , David Ralston

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…

组合数学 · 数学 2009-06-12 E. Rodney Canfield , Brendan D. McKay

The Hofstadter $H$ sequence is defined by $H(1) = 1$ and $H(n) = n-H(H(H(n-1)))$ for $n > 1$. If $\alpha$ is the real root of $x^3+x=1$ we show that the numbers $\alpha H(n) \mod 1$ are not uniformly distributed on $[0,1]$, but converge to…

数论 · 数学 2022-06-03 Rodrigo Angelo

It was shown by V. Bergelson that any set B with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each positive integer k there exist integers a,b,d such that $ {b(a+id)^j:i,j…

组合数学 · 数学 2014-02-26 Mathias Beiglböck

For integers $n \geq k \geq 1$, the {\em Kneser graph} $K(n, k)$ is the graph with vertex-set consisting of all the $k$-element subsets of $\{1,2,\ldots,n\}$, where two $k$-element sets are adjacent in $K(n,k)$ if they are disjoint. We show…

组合数学 · 数学 2025-03-19 Hou Tin Chau , David Ellis , Ehud Friedgut , Noam Lifshitz

Let $A$ be a commutative noetherian ring, $\frak a$ be an ideal of $A$, $m,n$ be non-negative integers and let $M$ be an $A$-module such that $\Ext^i_A(A/\frak a,M)$ is finitely generated for all $i\leq m+n$. We define a class $\cS_n(\frak…

交换代数 · 数学 2022-01-13 Mohammad Khazaei , Reza Sazeedeh

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…

组合数学 · 数学 2021-06-09 Simone Costa , Anita Pasotti

This article aims to provide exponential lower bounds on the number of non-isomorphic $k$-gonal biembeddings of the complete multipartite graph into orientable surfaces. For this purpose, we use the concept, introduced by Archdeacon in…

组合数学 · 数学 2022-03-03 Simone Costa , Anita Pasotti

The shiftable Heffter arrays are naturally generalized to the shiftable Heffter spaces. We present a recursive construction which starting from a single shiftable Heffter space leads to infinitely many other shiftable Heffter spaces of the…

组合数学 · 数学 2024-12-23 Marco Buratti , Anita Pasotti

We consider the notion of a signed magic array, which is an $m \times n$ rectangular array with the same number of filled cells $s$ in each row and the same number of filled cells $t$ in each column, filled with a certain set of numbers…

组合数学 · 数学 2017-01-09 Abdollah Khodkar , Christian Schulz , Nathan Wagner

In 1978 Erd\H os asked if every sufficiently large set of points in general position in the plane contains the vertices of a convex $k$-gon, with the additional property that no other point of the set lies in its interior. Shortly after,…

计算几何 · 计算机科学 2019-10-21 Luis Barba , Frank Duque , Ruy Fabila-Monroy , Carlos Hidalgo-Toscano

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…

组合数学 · 数学 2015-12-01 Guangjun Xu , Sanming Zhou