A. Grebénnikov

collaborators

3 papers

math.AC2023

Non-surjective Milnor patching diagrams

Alexandr Grebennikov

Milnor patching diagram is essentially the commutative square of rings, over which gluing of finitely generated projective modules is possible in the strongest sense. Necessary and…

math.CO2021

On the palindromic Hosoya polynomial of trees

Dmitry Badulin, Alexandr Grebennikov, Konstantin Vorob'ev

A graph $G$ on $n$ vertices of diameter $D$ is called $H$ -palindromic if $α (G, k) = α (G, D - k)$ for all $k = 0, 1, \dots, ⌊ \frac{D}{2} ⌋$ , where $α (G, k)$ is th…

math.CO2021

Logarithmic algorithms for fair division problems

Alexandr Grebennikov, Xenia Isaeva, Andrei V. Malyutin +2

We study the algorithmic complexity of fair division problems with a focus on minimizing the number of queries needed to find an approximate solution with desired accuracy. We show…