Alexander Sidorenko

activity

20172023

most citedMinimum bias multiple taper spectral estimation

345 citations · 400 across the 16 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

math.CO2020

On Turán numbers of the complete $4$ -graphs

Alexander Sidorenko

The Turán number $T (n, α + 1, r)$ is the minimum number of edges in an $n$ -vertex $r$ -graph whose independence number does not exceed $α$ . For each $r \geq 2$ , there exists $t_{*} (r)$ suc…

math.CO2020★ 4 cited

Weakly norming graphs are edge-transitive

Alexander Sidorenko

Let $H$ be the class of bounded measurable symmetric functions on $[0, 1]^{2}$ . For a function $h \in H$ and a graph $G$ with vertex set ${v_{1}, \dots, v_{n}}$ and e…

On Turán numbers of the complete 4-graphs

Weakly norming graphs are edge-transitive

On Turán numbers of the complete $4$ -graphs