English
Related papers

Related papers: Thresholds for zero-sums with small cross numbers …

200 papers

Let $G$ be a finite additive abelian group with exponent $n$ and $S=g_{1}\cdots g_{t}$ be a sequence of elements in $G$. For any element $g$ of $G$ and $A\subseteq\{1,2,\ldots,n-1\}$, let $N_{A,g}(S)$ denote the number of subsequences…

Number Theory · Mathematics 2019-01-04 Abílio Lemos , Allan O. Moura , Anderson T. Silva , B. K. Moriya

Let $G$ be an additive abelian group. A sequence $S = g_1 \cdot \ldots \cdot g_{\ell}$ of terms from $G$ is a plus-minus weighted zero-sum sequence if there are $\varepsilon_1, \ldots, \varepsilon_{\ell} \in \{-1, 1\}$ such that…

Commutative Algebra · Mathematics 2024-04-29 Alfred Geroldinger , Florian Kainrath

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar…

Number Theory · Mathematics 2017-09-28 David J. Grynkiewicz

Let $\mathbb Z_n$ be the cyclic group of order $n \ge 3$ additively written. S. Savchev \& F. Chen (2007) proved that for each zero-sum free sequence $S = a_1 \bullet \dots \bullet a_t$ over $\mathbb Z_n$ of length $t > n/2$, there is an…

Number Theory · Mathematics 2018-11-12 Sávio Ribas

For a finite abelian group $G$ and a positive integer $d$, let $\mathsf s_{d \mathbb N} (G)$ denote the smallest integer $\ell \in \mathbb N_0$ such that every sequence $S$ over $G$ of length $|S| \ge \ell$ has a nonempty zero-sum…

Number Theory · Mathematics 2010-07-05 Alfred Geroldinger , David J. Grynkiewicz , Wolfgang A. Schmid

Let $G$ be an additive finite abelian group and $\Gamma \subset \operatorname{End} (G)$ be a subset of the endomorphism group of $G$. A sequence $S = g_1 \cdot \ldots \cdot g_{\ell}$ over $G$ is a ($\Gamma$-)weighted zero-sum sequence if…

Number Theory · Mathematics 2022-08-24 Alfred Geroldinger , Franz Halter-Koch , Qinghai Zhong

Let $G$ be a finite abelian group and $S$ a sequence with elements of $G$. Let $|S|$ denote the length of $S$ and $\mathrm{supp}(S)$ the set of all the distinct terms in $S$. For an integer $k$ with $k\in [1, |S|]$, let $\Sigma_{k}(S)…

Combinatorics · Mathematics 2024-04-30 Rui Wang , Han Chao , Jiangtao Peng

We introduce the vertex-arboricity of group-labelled graphs. For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose edges are labelled by elements of $\Gamma$. For an abelian group $\Gamma$ and $A\subseteq \Gamma$, the…

Combinatorics · Mathematics 2023-05-03 O-joung Kwon , Xiaopan Lian

In this note we answer a question of Hurlbert about pebbling in graphs of high girth. Specifically we show that for every g there is a Class 0 graph of girth at least g. The proof uses the so-called Erdos construction and employs a recent…

Combinatorics · Mathematics 2007-05-23 Andrzej Czygrinow , Glenn Hurlbert

Let $G$ be a finite abelian group with exponent $n$. Let $\eta(G)$ denote the smallest integer $\ell$ such that every sequence over $G$ of length at least $\ell$ has a zero-sum subsequence of length at most $n$. We determine the precise…

Number Theory · Mathematics 2016-08-19 Sammy Luo

A perfect code $C$ in a graph $\Gamma$ is an independent set of vertices of $\Gamma$ such that every vertex outside of $C$ is adjacent to a unique vertex in $C$, and a total perfect code $C$ in $\Gamma$ is a set of vertices of $\Gamma$ such…

Combinatorics · Mathematics 2022-10-10 Jun-Yang Zhang

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

Number Theory · Mathematics 2019-10-28 David J. Grynkiewicz

For a finite abelian group $G$ and a positive integer $k$, let $s_{k}(G)$ denote the smallest integer $\ell\in\mathbb{N}$ such that any sequence $S$ of elements of $G$ of length $|S|\geq\ell$ has a zero-sum subsequence with length $k$. The…

Combinatorics · Mathematics 2017-07-19 Xiaoyu He

A subset of an abelian group is {\em sequenceable} if there is an ordering $(x_1, \ldots, x_k)$ of its elements such that the partial sums $(y_0, y_1, \ldots, y_k)$, given by $y_0 = 0$ and $y_i = \sum_{j=1}^i x_i$ for $1 \leq i \leq k$, are…

Combinatorics · Mathematics 2022-04-04 Simone Costa , Stefano Della Fiore , M. A. Ollis , Sarah Z. Rovner-Frydman

Let $G$ be a finite group, $n$ a positive integer. $\pi(n)$ denotes the set of all prime divisors of $n$ and $\pi(G)=\pi(|G|)$. The prime graph $\Gamma(G)$ of $G$, defined by Grenberg and Kegel, is a graph whose vertex set is $\pi(G)$, two…

Group Theory · Mathematics 2020-09-17 Zhongbi Wang , Heng Lv , Yanxiong Yan , Guiyun Chen

Let $\Gamma$ be a graph with vertex set $V(\Gamma)$. A subset $C$ of $V(\Gamma)$ is called a perfect code in $\Gamma$ if $C$ is an independent set of $\Gamma$ and every vertex in $V(\Gamma)\setminus C$ is adjacent to exactly one vertex in…

Combinatorics · Mathematics 2020-07-17 Xuanlong Ma , Gary L. Walls , Kaishun Wang , Sanming Zhou

A sequence $s_1,s_2,\ldots, s_k$ of elements of a group $G$ is called a valid ordering if the partial products $s_1, s_1 s_2, \ldots, s_1\cdots s_k$ are all distinct. A long-standing problem in combinatorial group theory asks whether, for a…

Combinatorics · Mathematics 2025-08-26 Benjamin Bedert , Matija Bucić , Noah Kravitz , Richard Montgomery , Alp Müyesser

Suppose $G$ is a finite abelian group and $S$ is a sequence of elements in $G$. For any element $g$ of $G$, let $N_g(S)$ denote the number of subsequences of $S$ with sum $g$. The purpose of this paper is to investigate the lower bound for…

Combinatorics · Mathematics 2011-01-25 Gerard Jennhwa Chang , Sheng-Hua Chen , Yongke Qu , Guoqing Wang , Haiyan Zhang

We discuss several questions concerning sum-free sets in groups, raised by Erd\H{o}s in his survey "Extremal problems in number theory" (Proceedings of the Symp. Pure Math. VIII AMS) published in 1965. Among other things, we give a…

Combinatorics · Mathematics 2016-03-17 Terence Tao , Van Vu

We investigate the \textit{group irregularity strength}, $s_g(G)$, of a graph, i.e. the least integer $k$ such that taking any Abelian group $\mathcal{G}$ of order $k$, there exists a function $f:E(G)\rightarrow \mathcal{G}$ so that the…

Combinatorics · Mathematics 2018-10-16 Marcin Anholcer , Sylwia Cichacz , Jakub Przybyło