An addition theorem on the integers modulo \(n\)

From MaRDI portal
Publication:1119963

DOI10.1016/0022-314X(89)90077-2zbMath0672.10038MaRDI QIDQ1119963

Paul Lemke, Daniel J. Kleitman

Publication date: 1989

Published in: Journal of Number Theory (Search for Journal in Brave)




Related Items (34)

On the pebbling number of \(\mathcal{C}_m \times \mathcal{C}_n\) in case of even parityOptimal pebbling on gridsNote on the index conjecture in zero-sum theory and its connection to a Dedekind-type sumOn the index-r-free sequences over finite cyclic groupsZero-sum problems in finite Abelian groups: a surveyOn tiny zero-sum sequences over finite abelian groupsOn the structure of n-zero-sum free sequences over cyclic groups of order nModified linear programming and class 0 bounds for graph pebblingGeneral graph pebblingCycles and girth in pebble assignment graphsPebbling Graphs of Diameter Three and FourA note on optimal pebbling of hypercubesAn improved upper bound for the pebbling threshold of the \(n\)-pathOn a combinatorial problem of Erdős, Kleitman and LemkePebbling on zig-zag chain graph of n odd cyclesThe t-pebbling number of Lamp graphsUnnamed ItemSolution to the index conjecture in zero-sum theoryRestricted optimal pebbling and domination in graphsPebbling Graphs of Fixed DiameterOn an inverse problem of Erdős, Kleitman, and LemkeMinimal zero sum sequences of length four over finite cyclic groupsComputing bounds on product graph pebbling numbersTwo-player pebbling on diameter 2 graphsMinimal zero-sum sequences of length four over cyclic group with order \(n = p^{\alpha} q^{\beta}\)Product-one subsequences over subgroups of a finite groupThreshold and complexity results for the cover pebbling gameThe optimal \(t\)-pebbling number of a certain complete \(m\)-ary treeOn a conjecture of Lemke and KleitmanON THE INDEX-CONJECTURE ON LENGTH FOUR MINIMAL ZERO-SUM SEQUENCESOptimally pebbling hypercubes and powersMinimal zero-sequences and the strong Davenport constantOn the index conjecture in zero-sum theory: Singular caseOn properties of pebble assignment graphs



Cites Work


This page was built for publication: An addition theorem on the integers modulo \(n\)