Search arXivSearch

arXiv · 2607.02132

The universal zero-sum invariant and weighted zero-sum for infinite abelian groups II

Abstract

Let $G$ be an abelian group, and let $\mathcal F (G)$ be the free commutative monoid with basis $G$, and $\mathcal A (G)$ the set consisting of all minimal zero-sum subsequences over $G$. For any subset $Ω\subset \mathcal F (G)$, we define the universal zero-sum invariant ${\mathsf d}_Ω(G)$ as the minimal positive integer $\ell$ such that every sequence $T$ over $G$ of length $\ell$ contains a subsequence lying in $Ω$. The classical Davenport constant ${\rm D}(G)$ for $G$ can also be written as ${\mathsf d}_{\mathcal A (G)}(G)$. We give a complete classification of all finite abelian groups for which $\mathcal A(G)$ is a minimal set to represent the Davenport constant. We also investigate the weighted Davenport constant over abelian groups (which may be infinite). Let $F$ and $G$ be abelian groups, and let $Ψ\subseteq \mathrm{Hom}(F,G)$ denote a weight set. We reinterpret the weighted Davenport constant $D_Ψ(G)$ in terms of coverings of Cartesian powers $F^n$ by kernels of induced homomorphisms arising from tuples in $Ψ^n$; these homomorphisms are naturally linked to coproducts in the category of abelian groups. This motivates the notion of kernel-cover compactness, a property characterizing when such kernel coverings admit finite subcovers. We establish a correspondence between weighted zero-sum invariants and kernel-cover structures, where the bound $D_Ψ(G)\le n$ is equivalent to a canonical kernel-cover property on $F^n$. We further study finite reduction phenomena for infinite weight sets and provide sufficient conditions ensuring uniform kernel-cover compactness. The present work constitutes a follow-up to [G. Wang, Comm. Algebra, 2025].

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guoqing Wang. 2026-07-02. The universal zero-sum invariant and weighted zero-sum for infinite abelian groups II. https://arxiv.org/abs/2607.02132

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

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO