2 citations · 2 across the 4 of their papers we have counts for
4 papers
Elementary proof for the bounds of the complexity of a planar multigraph and the size of a prime rectangular squaring
Dmitri Fomin
Two results (together with their relatively elementary proofs) are presented. The first one presents the upper boundary on the number of spanning trees in a finite planar multigrap…
Moser Polynomials and Eulerian Numbers
Dmitri Fomin
Article presents a short investigation into some properties of the Moser polynomials which appear in various problems from algebraic combinatorics. For instance, these polynomials…
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.…
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…