105 citations · 232 across the 34 of their papers we have counts for
40 papers
Asymptotics of Landau--Okhotin function
F. Petrov
Landau function is the maximal possible least common multiple of several positive integers with sum not exceeding . Under additional assumptions that these numbers are th…
On stability of spanning tree degree enumerators
Danila Cherkashin, Fedor Petrov, Pavel Prozorov
We show that the spanning tree degree enumerator polynomial of a connected graph is a real stable polynomial if and only if is distance-hereditary.
A combinatorial proof of the Burdzy-Pitman conjecture
Stanisław Cichomski, Fedor Petrov
We prove a sharp upper bound for the number of high degree differences in bipartite graphs: let be a bipartite graph with and $V=\{v_1, v_…
A generalization of Kruskal's theorem on tensor decomposition
Benjamin Lovitz, Fedor Petrov
Kruskal's theorem states that a sum of product tensors constitutes a unique tensor rank decomposition if the so-called k-ranks of the product tensors are large. We prove a "splitti…
On the size of for algebraic
Dmitry Krachun, Fedor Petrov
For a finite set and real , let . Combining a structural theorem of Freiman on sets with small doubling constants together wit…
Alon -- Tarsi numbers of direct products
Alexey Gordeev, Fedor Petrov
We provide a general framework on the coefficients of the graph polynomials of graphs which are Cartesian products. As a corollary, we prove that if is a graph with degre…