activity
20182020
most citedWeakly norming graphs are edge-transitive

4 citations · 5 across the 2 of their papers we have counts for

collaborators

7 papers

math.CO20204 cited

Weakly norming graphs are edge-transitive

Alexander Sidorenko

Let be the class of bounded measurable symmetric functions on . For a function and a graph with vertex set and e…

math.CO2019

Approximate Steiner -systems without blocks on points

Alexander Sidorenko

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

math.CO2019

Inequalities for doubly nonnegative functions

Alexander Sidorenko

Let be a bounded symmetric measurable nonnegative function on , and . For a graph with vertices $\{v_1,v_…

math.CO20181 cited

On Turán problems for Cartesian products of graphs

Alexander Sidorenko

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

math.CO2018

On generalized Erdős-Ginzburg-Ziv constants for

Alexander Sidorenko

Let be a finite abelian group, and be a multiple of its exponent. The generalized Erdős-Ginzburg-Ziv constant is the smallest integer such that every sequence…

stat.AP2018

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…