S. Sadov

activity

20032022

most citedMarkov's Transformation of Series and the WZ Method

15 citations · 38 across the 21 of their papers we have counts for

collaborators

21 papers

math.CA2022

Beyond Shapiro's problem: from cyclic sums to "graphic'' sums

Sergey Sadov

A review of author's work on cyclic inequalities of Shapiro-Diananda type and related optimization problems is presented.

math.CA2022

Precise asymptotics with log-periodic term in an elementary optimization problem

Sergey Sadov

The function $in f_{n} n x^{1/ n}$ has the asymptotics $e u + e d^{2} (u) / (2 u) + O (1/ u^{2})$ as $x \to \infty$ , where $u = lo g x$ and $d (u)$ is the distance from $u$ to the nearest integer. We gene…

math.CA2022

Lower bound for cyclic sums with one-sided maximal averages in denominators

Sergey Sadov

Let $x = (x_{1}, \dots, x_{n})$ be an $n$ -tuple of positive real numbers and the sequence $(x_{i})_{i \in Z}$ be its $n$ -periodic extension. Given an $n$ -tuple $\mathbf{r}=(r…

math.FA2022

Existence of convolution maximizers in $L_{p} (R^{n})$ for kernels from Lorentz spaces

Sergey Sadov

The paper extends an earlier result of G.V.~Kalachev and the author (Sb. Math. 2019 or arXiv:1712.08836) on the existence of a maximizer of convolution operator acting between two…

quant-ph2022★ 7 cited

On the Cleaning Lemma of Quantum Coding Theory

Gleb Kalachev, Sergey Sadov

The term "Cleaning Lemma" refers to a family of similar propositions that have been used in Quantum Coding Theory to estimate the minimum distance of a code in terms of its length…

math.CO2021

Three steps away from Shapiro's problem: lower bounds for graphic sums with functions `max' or `min' in denominators

Sergey Sadov

Taking Shapiro's cyclic sums $\sum_{i = 1}^{n} x_{i} / (x_{i + 1} + x_{i + 2})$ (assuming index addition mod $n$ ) as a starting point, we introduce a broader class of cyclic sums, called general…

Beyond Shapiro's problem: from cyclic sums to "graphic'' sums

Precise asymptotics with log-periodic term in an elementary optimization problem

Lower bound for cyclic sums with one-sided maximal averages in denominators

Existence of convolution maximizers in Lp​(Rn) for kernels from Lorentz spaces

On the Cleaning Lemma of Quantum Coding Theory

Three steps away from Shapiro's problem: lower bounds for graphic sums with functions `max' or `min' in denominators

Existence of convolution maximizers in $L_{p} (R^{n})$ for kernels from Lorentz spaces