中文
相关论文

相关论文: Modified Erd\H{o}s-Ginzburg-Ziv constants for $\ma…

200 篇论文

For a finite abelian group $(G,+)$ the Harborth constant is defined as the smallest integer $\ell$ such that each squarefree sequence over $G$ of length $\ell$ has a subsequence of length equal to the exponent of $G$ whose terms sum to $0$.…

组合数学 · 数学 2015-11-26 Luz Elimar Marchan , Oscar Ordaz , Dennys Ramos , Wolfgang Schmid

Let $G$ be a finite additive abelian group. For given $k$ a positive integer, the $k$-Harborth constant $g^k(G)$ is defined to be the smallest positive integer $t$ such that given a set $S$ of elements of $G$ with size $t$ there exists a…

组合数学 · 数学 2022-09-30 A. Lemos , B. K. Moriya , A. O. Moura , A. T. Silva

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…

组合数学 · 数学 2017-07-19 Xiaoyu He

We generalize the notion of Erd\H{o}s-Ginzburg-Ziv constants -- along the same lines we generalized in earlier work the notion of Davenport constants -- to a ``higher degree" and obtain various lower and upper bounds. These bounds are…

组合数学 · 数学 2022-07-25 Yair Caro , John R. Schmitt

The Erd\H{o}s-Ginzburg-Ziv theorem states that for any sequence of $2n-1$ integers, there exists a subsequence of $n$ elements whose sum is divisible by $n$. In this article, we provide a simple, practical $O(n\log\log n)$ algorithm and a…

组合数学 · 数学 2025-07-14 Yui Hin Arvin Leung

Let $G$ be an additive finite abelian group with exponent $\exp(G)$. For $L\subseteq \mathbb N$, let $\mathsf{s}_{L}(G)$ be the smallest integer $\ell$ such that every sequence $S$ over $G$ of length $\ell$ has a zero-sum subsequence $T$ of…

组合数学 · 数学 2023-10-10 Shiwen Zhang

The Erd\H{o}s-Burgess constant of a semigroup $S$ is the smallest positive integer $k$ such that any sequence over $S$ of length $k$ contains a nonempty subsequence whose elements multiply to an idempotent element of $S$. In the case where…

组合数学 · 数学 2018-08-21 Noah Kravitz , Ashwin Sah

Adapting Reiher's proof of Kemnitz's conjecture, we obtain two refinements of a theorem of Schmid and Zhuang. Our main results provide improved upper bounds for the Erd\H{o}s-Ginzburg-Ziv constant of rank-two-like $p$-groups, and their…

组合数学 · 数学 2025-10-28 Benjamin Girard , Sofia Zotova

The Harborth constant of a finite group $G$, denoted $\gs(G)$, is the smallest integer $k$ such that the following holds: For $A\subseteq G$ with $|A|=k$, there exists $B\subseteq A$ with $|B|=\exp(G)$ such that the elements of $B$ can be…

组合数学 · 数学 2019-01-17 Niranjan Balachandran , Eshita Mazumdar , Kevin Zhao

The purpose of the article is to provide an unified way to formulate zero-sum invariants. Let $G$ be a finite additive abelian group. Let $B(G)$ denote the set consisting of all nonempty zero-sum sequences over G. For $\Omega \subset B(G$),…

组合数学 · 数学 2017-02-06 Weidong Gao , Yuanlin Li , Jiangtao Peng , Guoqing Wang

Denote by ${\mathfrak s}({\mathbb F}_p^d)$ the Erd{\H o}s--Ginzburg--Ziv constant of ${\mathbb F}_p^d$, that is, the minimum $s$ such that any sequence of $s$ vectors in ${\mathbb F}_p^d$ contains $p$ vectors whose sum is zero. Let…

组合数学 · 数学 2023-03-23 Dmitrii Zakharov

The Erd\H{o}s-Ginzburg-Ziv theorem states that every sequence of 2n - 1 integers contains a subsequence of length n whose sum is divisible by n. Choi, Kang, and Lim gave a simple deterministic O(n log n) algorithm for finding such a…

数据结构与算法 · 计算机科学 2026-05-22 Sunghyeon Jo

$G$ be an additive finite abelian group. The Davenport constant $\mathsf D(G)$ is the smallest integer $t$ such that every sequence (multiset) $S$ over $G$ of length $|S|\ge t$ has a non-empty zero-sum subsequence. Recently, B. Girard…

组合数学 · 数学 2018-03-01 Dongchun Han

Let $G$ be a finite group and exp$(G)$ = lcm$\{$ord$(g)$$\mid$$g \in G \}$. A finite unordered sequence of terms from $G$, where repetition is allowed, is a product-one sequence if its terms can be ordered such that their product equals the…

组合数学 · 数学 2019-08-13 Jun Seok Oh , Qinghai Zhong

Erd\H{o}s-Ginzburg-Ziv theorem says that if there are 2n-1 number is given, then there are n numbers such that their sum is divided by n. We will connect this theorem with the Ramsey theoretic large sets and will prove an infinitary version…

组合数学 · 数学 2022-02-03 Sayan Goswami

Let $G$ be a multiplicatively written finite group. We denote by $\mathsf E(G)$ the smallest integer $t$ such that every sequence of $t$ elements in $G$ contains a product-one subsequence of length $|G|$. In 1961, Erd\H{o}s, Ginzburg and…

组合数学 · 数学 2021-07-21 Yongke Qu , Yuanlin Li

Naslund used Tao's slice rank bounding method to give new exponential upper bounds for the Erd\H{o}s--Ginzburg-Ziv constant of finite Abelian groups of high rank. In our short manuscript we improve slightly Naslund's upper bounds. We extend…

数论 · 数学 2017-12-04 Gábor Hegedüs

For $A\subseteq\mathbb Z_n$, the $A$-weighted Gao constant $E_A(n)$ is defined to be the smallest natural number $k$ such that any sequence of $k$ elements in $\mathbb Z_n$ has a subsequence of length $n$ whose $A$-weighted sum is zero.…

数论 · 数学 2023-02-21 Santanu Mondal , Krishnendu Paul , Shameek Paul

For a finite abelian group $(G,+)$, the constant $C(G)$ is defined to be the smallest natural number $k$ such that any sequence in $G$ having length $k$ will have a subsequence of consecutive terms whose sum is zero. For a subset…

数论 · 数学 2023-02-07 Santanu Mondal , Krishnendu Paul , Shameek Paul

The Erd\H{o}s--Ginzburg--Ziv Problem is a classical extremal problem in discrete geometry. Given $m$ and $n$, the problem asks about the smallest number $s$ such that among any $s$ points in the integer lattice $\mathbb{Z}^n$ one can find…

组合数学 · 数学 2023-03-01 Lisa Sauermann , Dmitrii Zakharov