Results 11 to 20 of about 143,397 (296)
Sequences not containing long zero-sum subsequences
European Journal of Combinatorics, 2006 For a finite abelian group \(G\), denote by \(D(G)\) (Davenport's constant) the smallest integer \(d\) such that every sequence of \(d\) elements of \(G\) contains a subsequence with sum zero. A sequence \(S\) with \(| S| \geq D(G)\) is called normal if it contains no zero-sum subsequence longer than \(| S| -D(G)+1\). The authors describe the structure
Weidong Gao 0001, Jujuan Zhuang
openaire +2 more sources
The Structure of a Sequence With Prescribed Zero-sum Subsequences
Integers, 2020 See the abstract in the attached pdf.
David J. Grynkiewicz +2 more
openaire +5 more sources
Extremal sequences for a weighted zero-sum constant
, 2021 18 pages.
Mondal, Santanu +2 more
openaire +4 more sources
Subsequence Sums of Zero-sum-free Sequences [PDF]
The Electronic Journal of Combinatorics, 2009 Let $G$ be a finite abelian group, and let $S$ be a sequence of elements in $G$. Let $f(S)$ denote the number of elements in $G$ which can be expressed as the sum over a nonempty subsequence of $S$. In this paper, we slightly improve some results of Pixton on $f(S)$ and we show that for every zero-sum-free sequences $S$ over $G$ of length $|S|=\exp(G ...
Lev, Vsevolod F.
core +5 more sources
Indexes of long zero-sum sequences over cyclic groups
European Journal of Combinatorics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiangneng Zeng, Pingzhi Yuan
openaire +3 more sources
On One-Zero numbers: a new Horadam-type sequence
IntermathsIn this paper, we present a new sequence of Horadam-type, which we call the One-Zero sequence. We study the recurrence equation and show the Binet formula. The aim of this study is to examine the properties of the aforementioned sequence.
Eudes Antonio Costa +2 more
doaj +2 more sources
On Sequences Without Short Zero-Sum Subsequences
The Electronic Journal of Combinatorics, 2023 Let $G$ be a finite abelian group. It is well known that every sequence $S$ over $G$ of length at least $|G|$ contains a zero-sum subsequence of length at most $\mathsf{h}(S)$, where $\mathsf{h}(S)$ is the maximal multiplicity of elements occurring in $S$.
Xiangneng Zeng, Pingzhi Yuan
openaire +2 more sources
The Listsize Capacity of the Gaussian Channel with Decoder Assistance
Entropy, 2021 The listsize capacity is computed for the Gaussian channel with a helper that—cognizant of the channel-noise sequence but not of the transmitted message—provides the decoder with a rate-limited description of said sequence.
Amos Lapidoth, Yiming Yan
doaj +1 more source
Inductive Methods and Zero-Sum Free Sequences [PDF]
Integers, 2009 AbstractA fairly long-standing conjecture is that the Davenport constant of a groupWe also prove the conjecture for groups of the form ...
Bhowmik, Gautami +2 more
openaire +4 more sources
A Reciprocity on Finite Abelian Groups Involving Zero-Sum Sequences [PDF]
SIAM Journal on Discrete Mathematics, 2021 19 pages, accepted by SIAM Journal on Discrete ...
Dongchun Han, Hanbin Zhang
openaire +3 more sources