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

16 papers

math.CO2023

Extremal numbers and Sidorenko's conjecture

David Conlon, Joonkyung Lee, Alexander Sidorenko

Sidorenko's conjecture states that, for all bipartite graphs $H$ , quasirandom graphs contain asymptotically the minimum number of copies of $H$ taken over all graphs with the same…

math.CO2023

Modified Erdős-Ginzburg-Ziv constants for $Z_{2}^{d}$

Alexander Sidorenko

Let $G$ be a finite abelian group written additively, and let $r$ be a multiple of its exponent. The modified Erdős-Ginzburg-Ziv constant $s_{r}^{'} (G)$ is the smallest integer…

math.CO2022

Turán numbers $T (n, 5, 3)$ and graphs without induced $5$ -cycles

Iliya Bluskov, Jan de Heer, Alexander Sidorenko

Turán number $T (n, 5, 3)$ is the minimum size of a system of triples out of a base set $X$ of $n$ elements such that every quintuple in $X$ contains a triple from the system. The exa…

math.CO2022★ 4 cited

Turán numbers of $r$ -graphs on $r + 1$ vertices

Alexander Sidorenko

Let $H_{k}^{r}$ denote an $r$ -uniform hypergraph with $k$ edges and $r + 1$ vertices, where $k \leq r + 1$ (it is easy to see that such a hypergraph is unique up to isomorphism). The known…

math.CO2021★ 1 cited

On positive hypergraphs

Alexander Sidorenko

Camarena, Csóka, Hubai, Lippner, and Lovász introduced the notion of positive graphs. This notion naturally extends to $r$ -uniform hypergraphs. In the case when $r$ is odd, we prov…

math.CO2021★ 2 cited

On graph norms for complex-valued functions

Joonkyung Lee, Alexander Sidorenko

For any given graph $H$ , one may define a natural corresponding functional $∥. ∥_{H}$ for real-valued functions by using homomorphism density. One may also extend this to complex-va…

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…

math.CO2019★ 4 cited

Approximate Steiner $(r - 1, r, n)$ -systems without $3$ blocks on $r + 2$ points

Alexander Sidorenko

For a family $F$ of $r$ -graphs, let $ex (n, F)$ denote the maximum number of edges in an $F$ -free $r$ -graph on $n$ vertices. Let ${\mathcal…

math.CO2019★ 1 cited

Inequalities for doubly nonnegative functions

Alexander Sidorenko

Let $g$ be a bounded symmetric measurable nonnegative function on $[0, 1]^{2}$ , and $∥ g ∥ = \int_{[0, 1]^{2}} g (x, y) d x d y$ . For a graph $G$ with vertices $\{v_1,v_…

math.CO2018★ 1 cited

On Turán problems for Cartesian products of graphs

Alexander Sidorenko

Let $A, B$ be disjoint sets of sizes $n$ and $m$ . Let $Q$ be a family of quadruples, having $2$ elements from $A$ and $2$ from $B$ , such that any subset $S \subseteq A \c…

math.CO2018★ 8 cited

On generalized Erdős-Ginzburg-Ziv constants for $Z_{2}^{d}$

Alexander Sidorenko

Let $G$ be a finite abelian group, and $r$ be a multiple of its exponent. The generalized Erdős-Ginzburg-Ziv constant $s_{r} (G)$ is the smallest integer $s$ such that every sequence…

stat.AP2018★ 22 cited

Spectral Estimation of Plasma Fluctuations I: Comparison of Methods

Kurt S. Riedel, Alexander Sidorenko, David J. Thomson

The relative root mean squared errors (RMSE) of nonparametric methods for spectral estimation is compared for microwave scattering data of plasma fluctuations. These methods reduce…

stat.ME2018★ 345 cited

Minimum bias multiple taper spectral estimation

Kurt S. Riedel, Alexander Sidorenko

Two families of orthonormal tapers are proposed for multi-taper spectral analysis: minimum bias tapers, and sinusoidal tapers ${v^{(k)}}$ , where $v_n^{(k)}=\sqrt{\frac{2}{N…

math.CO2017★ 7 cited

Extremal problems on the hypercube and the codegree Turán density of complete $r$ -graphs

Alexander Sidorenko

Let $G$ be a finite abelian group, and $r$ be a multiple of its exponent. The generalized Erdős-Ginzburg-Ziv constant $s_{r} (G)$ is the smallest integer $s$ such that every sequence…

math.CO2017★ 1 cited

An Erdős-Gallai-type theorem for keyrings

Alexander Sidorenko

A keyring is a graph obtained by appending $r \geq 1$ leaves to one of the vertices of a cycle. We prove that for every $r \leq (k - 1) /2$ , any graph with average degree more than $k…

Extremal numbers and Sidorenko's conjecture

Modified Erdős-Ginzburg-Ziv constants for Z2d​

Turán numbers T(n,5,3) and graphs without induced 5-cycles

Turán numbers of r-graphs on r+1 vertices

On positive hypergraphs

On graph norms for complex-valued functions

On Turán numbers of the complete 4-graphs

Weakly norming graphs are edge-transitive

Approximate Steiner (r−1,r,n)-systems without 3 blocks on r+2 points

Inequalities for doubly nonnegative functions

On Turán problems for Cartesian products of graphs

On generalized Erdős-Ginzburg-Ziv constants for Z2d​

Spectral Estimation of Plasma Fluctuations I: Comparison of Methods

Minimum bias multiple taper spectral estimation

Extremal problems on the hypercube and the codegree Turán density of complete r-graphs

An Erdős-Gallai-type theorem for keyrings

Modified Erdős-Ginzburg-Ziv constants for $Z_{2}^{d}$

Turán numbers $T (n, 5, 3)$ and graphs without induced $5$ -cycles

Turán numbers of $r$ -graphs on $r + 1$ vertices

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

Approximate Steiner $(r - 1, r, n)$ -systems without $3$ blocks on $r + 2$ points

On generalized Erdős-Ginzburg-Ziv constants for $Z_{2}^{d}$

Extremal problems on the hypercube and the codegree Turán density of complete $r$ -graphs