2 citations · 2 across the 4 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.NT2017★ 2 cited
Is the Multiset of Integers Uniquely Determined by the Multiset of Its -sums?
Dmitri Fomin
In 1957 Leo Moser published a problem in American Mathematical Monthly asking whether knowing the set of all pairwise sums of five numbers one could determine the original numbers.…
math.CO2017
Upper Bounds For Hitting Times Of Random Walks On Sparse Graphs
Dmitri Fomin
We obtain upper bounds (in most cases, sharp) for the hitting times of random walks on finite undirected graphs expressed as functions of the graph's number of edges. In particular…