Zero-sum problems -- a survey

From MaRDI portal
Publication:1917486

DOI10.1016/0012-365X(94)00308-6zbMath0856.05068OpenAlexW2045336254MaRDI QIDQ1917486

Yair Caro

Publication date: 5 September 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00308-6




Related Items (79)

On the existence of zero-sum perfect matchings of complete graphsOn a conjecture of the small Davenport constant for finite groupsA complete characterization of the zero-sum (mod 2) Ramsey numbersMonochromatic and zero-sum sets of nondecreasing diameterExtremal Sequences for Some Weighted Zero-Sum Constants for Cyclic GroupsRepresenting Sequence Subsums as Sumsets of Near Equal Sized SetsOn a conjecture of Zhuang and GaoThe large Davenport constant. I: Groups with a cyclic, index 2 subgroup.Extremal product-one free sequences and \(|G|\)-product-one free sequences of a metacyclic groupOn weighted sums in abelian groupsA five color zero-sum generalizationUnnamed ItemZero-sum subsequences in Abelian non-cyclic groupsZero-sum problems in finite Abelian groups: a surveyZero-sum copies of spanning forests in zero-sum complete graphsA note on minimal zero-sum sequences over ZBinomial coefficients and zero-sum Ramsey numbersMinimal zero-sum sequences in \(C_{n}\oplus C_{n}\)On the Erdös-Ginzburg-Ziv theoremAlmost color-balanced perfect matchings in color-balanced complete graphsGeneral graph pebblingExtremal product-one free sequences in dihedral and dicyclic groupsUnavoidable chromatic patterns in 2‐colorings of the complete graphDivisible subdivisionsZero-sum problems and coverings by proper cosetsOn the zero-sum Ramsey problem over \(\mathbb{Z}_2^d\)Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectationPairing conjugate partitions by residue classesThe Main Zero-Sum Constants over \({\boldsymbol{D}}\) 2n \({\boldsymbol{\times C_2}}\)Tight bounds for divisible subdivisionsBounds on the higher degree Erdős-Ginzburg-Ziv constants over \({\mathbb{F}}_q^n\)On zero-sum subsequences of restricted size. II.Unbalanced spanning subgraphs in edge labeled complete graphsOnn-Sums in an Abelian GroupIntegers without divisors in a given progressionOn the direct and inverse zero-sum problems over \(C_n \rtimes_s C_2\)Cubic symmetric polynomials yielding variations of the Erdős-Ginzburg-Ziv theoremUnnamed ItemUnnamed ItemRemarks on some zero-sum problemsBarycentric sequences and barycentric Ramsey numbers for stars.Zero-sum subsequences in bounded-sum \(\{-r,s\}\)-sequencesON DAVENPORT'S CONSTANTLow weight perfect matchingsRepresentation of group elements as subsequence sums.Weighted Zero-Sums for Some Finite Abelian Groups of Higher RanksHarborth constants for certain classes of metacyclic groupsTwo zero-sum problems and multiple propertiesZero sum cycles in complete digraphsDavenport constant with weights and some related questions. II.Addition theorems on the cyclic groups of order \(p^\ell\).Unnamed ItemZero-sum-free tuples and hyperplane arrangementsZero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\)A weighted generalization of two theorems of GaoAn upper bound for the \(k\)-barycentric Davenport constant of groups of prime orderQuasi-periodic decompositions and the Kemperman structure theoremUnification of zero-sum problems, subset sums and covers of ℤRepresentation of finite abelian group elements by subsequence sumsA Weighted Generalization of Gao's n + D − 1 TheoremAvoiding zero-sum subsequences of prescribed length over the integersThe Determination of 2-color zero-sum generalized Schur NumbersOn zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)A stronger connection between the Erdős-Burgess and Davenport constantsOn a zero-sum generalization of a variation of Schur's equationExtremal product-one free sequences in \(C_q\rtimes_s C_m\)Existence conditions for barycentric sequences.On zero-sum spanning trees and zero-sum connectivityWeighted sums in finite cyclic groupsIterated sumsets and setpartitionsA polynomial-time algorithm for finding zero-sums.An extension of the Erdős-Ginzburg-Ziv theorem to hypergraphsOn the number of subsequences with given sumMinimal zero-sequences and the strong Davenport constantSome inverse problems in zero-sum theoryReconstructing permutation matrices from diagonal sumsOn four colored sets with nondecreasing diameter and the Erdős-Ginzburg-Ziv theoremA zero-sum theoremContributions to zero-sum problems



Cites Work


This page was built for publication: Zero-sum problems -- a survey