Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, March 12, 2024, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Noah Kravitz (Princeton University)

Can you reconstruct a set from its subset sums?

For a finite subset A of an abelian group, let FS(A) denote the multiset of its 2^{|A|} subset sums. Can you reconstruct A from FS(A)? The answer in general is "no" (for instance, FS({1,3,-4})=FS({-1,-3,4})), but when the ambient group has no 2-torsion, we can obtain a combinatorial description of the fibers of FS. Based on joint work with Federico Glaudo.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login