Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets

08/19/2020
by   Jean Cardinal, et al.
0

The modular subset sum problem consists of deciding, given a modulus m, a multiset S of n integers in 0..m, and a target integer t, whether there exists a subset of S with elements summing to t m, and to report such a set if it exists. We give a simple O(m log m)-time with high probability (w.h.p.) algorithm for the modular subset sum problem. This builds on and improves on a previous Õ(m) w.h.p. algorithm from Axiotis, Backurs, Jin, Tzamos, and Wu (SODA 19). Our method utilizes the ADT of the dynamic strings structure of Gawrychowski et. al (SODA 18). However, as this structure is rather complicated we present a much simpler alternative which we call the Data Dependent Tree. As an application, we consider the computational version of a fundamental theorem in zero-sum Ramsey theory. The Erdős-Ginzburg-Ziv Theorem states that a multiset of 2n - 1 integers always contains a subset of cardinality exactly n whose values sum to a multiple of n. We give an algorithm for finding such a subset in time O(n log n) w.h.p. which improves on an O(n^2) algorithm due to Del Lungo, Marini, and Mori (Disc. Math. 09).

READ FULL TEXT

page 12

page 13

page 14

research
12/11/2020

Faster Deterministic Modular Subset Sum

We consider the Modular Subset Sum problem: given a multiset X of intege...
research
08/16/2022

Simple deterministic O(n log n) algorithm finding a solution of Erdős-Ginzburg-Ziv theorem

Erdős-Ginzburg-Ziv theorem is a famous theorem in additive number theory...
research
07/12/2018

Fast Modular Subset Sum using Linear Sketching

Given n positive integers, the Modular Subset Sum problem asks if a subs...
research
07/28/2022

On the Multidimensional Random Subset Sum Problem

In the Random Subset Sum Problem, given n i.i.d. random variables X_1, ....
research
11/13/2021

Classical and quantum dynamic programming for Subset-Sum and variants

Subset-Sum is an NP-complete problem where one must decide if a multiset...
research
01/04/2020

On the Hardness of Almost All Subset Sum Problems by Ordinary Branch-and-Bound

Given n positive integers a_1,a_2,...,a_n, and a positive integer right ...
research
04/05/2023

Fast computation of approximate weak common intervals in multiple indeterminate strings

In ongoing work to define a principled method for syntenic block discove...

Please sign up or login with your details

Forgot password? Click here to reset