Timeline for Bounding the max-loaded bin using${m \choose k} \|A\|_k^k$

15 events

when toggle format	what		by	license	comment
Aug 22, 2021 at 19:09	vote	accept	usul
May 22, 2021 at 20:54	history	edited	usul	CC BY-SA 4.0	added 508 characters in body
May 22, 2021 at 20:48	history	edited	usul	CC BY-SA 4.0	added 508 characters in body
May 19, 2021 at 19:10	answer	added	esg		timeline score: 3
May 19, 2021 at 16:28	history	edited	usul	CC BY-SA 4.0	added 749 characters in body
May 18, 2021 at 19:14	comment	added	esg		I will try to post a full answer in the next few days. In the meanwhile you may be interested in the proof for the case $k=2$ given in eprint.iacr.org/2005/318 (Theorem 3).
May 18, 2021 at 19:09	comment	added	esg		@kodlu: it was only a short comment, not a full answer.
May 18, 2021 at 0:40	comment	added	usul		@esg Oh yes, thanks, I tried to prove it but was not able to. I pasted your comment in above. A proof sketch would be much appreciated!
May 18, 2021 at 0:39	history	edited	usul	CC BY-SA 4.0	added 310 characters in body
May 17, 2021 at 22:29	comment	added	kodlu		@esg, can you give a link to your answer?
May 17, 2021 at 18:29	comment	added	esg		I had given an answer (roughly 2 years ago) in your blog about this, did you see that?
May 17, 2021 at 14:46	history	edited	usul	CC BY-SA 4.0	added 1 character in body
May 17, 2021 at 4:13	history	edited	usul	CC BY-SA 4.0	fixed precision of statement about simulations
May 17, 2021 at 3:59	history	edited	usul	CC BY-SA 4.0	referred to some simulations I've done to check plausibility
May 15, 2021 at 2:11	history	asked	usul	CC BY-SA 4.0