3 papers
cs.DM2011
The Tower of Hanoi problem on Path_h graphs
Daniel Berend, Amir Sapir, Shay Solomon
The generalized Tower of Hanoi problem with h \ge 4 pegs is known to require a sub-exponentially fast growing number of moves in order to transfer a pile of n disks from one peg to…
math.GR2009
Nilpotent Groups are Round
D. Berend, M. D. Boshernitzan
We define a notion of roundness for finite groups. Roughly speaking, a group is round if one can order its elements in a cycle in such a way that some natural summation operators m…
cond-mat.mes-hall2005
Discrete charging of metallic grains: Statistics of addition spectra
Yshai Avishai, Daniel Berend, Luba Bromberg
We analyze the statistics of electrostatic energies (and their differences) for a quantum dot system composed of a finite number of electron islands (metallic grains) with rand…