Search arXivSearch

arXiv · 2404.11307

On the number of subsequence sums related to the support of a sequence in finite abelian groups

Abstract

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 $Σ_{k}(S) \subset G$ denote the set of group elements which can be expressed as a sum of a subsequence of $S$ with length $k$. Let $Σ(S)=\cup_{k=1}^{|S|}Σ_{k}(S)$ and $Σ_{\geq k}(S)=\cup_{t=k}^{|S|}Σ_{t}(S)$. It is known that if $0\not\in Σ(S)$, then $|Σ(S)|\geq |S|+|\mathrm{supp}(S)|-1$. In this paper, we determine the structure of a sequence $S$ satisfying $0\notin Σ(S)$ and $|Σ(S)|= |S|+|\mathrm{supp}(S)|-1$. As a consequence, we can give a counterexample of a conjecture of Gao, Grynkiewicz, and Xia. Moreover, we prove that if $|S|>k$ and $0\not\in Σ_{\geq k}(S)\cup \mathrm{supp}(S)$, then $|Σ_{\geq k}(S)|\geq |S|-k+|\mathrm{supp}(S)|$. Then we can give an alternative proof of a conjecture of Hamidoune, which was first proved by Gao, Grynkiewicz, and Xia.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rui Wang, Han Chao, Jiangtao Peng. 2024-04-29. On the number of subsequence sums related to the support of a sequence in finite abelian groups. https://arxiv.org/abs/2404.11307

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO