F. Noskov

activity

20172026

collaborators

6 papers

math.CO2026

Forbidding just one intersection for short integer sequences

Elizaveta Iarovikova, Fedor Noskov, Georgy Sokolov +1

In this paper, we study the famous Erdős--Sós forbidden intersection problem for words over an alphabet of size $m$ : what is the maximal size of a subfamily $F$ of $[m]^n…

math.CO2025

Exact results and the structure of extremal families for the Duke--Erdős forbidden sunflower problem

Andrey Kupavskii, Fedor Noskov

In 1977, Duke and Erdős asked the following general question: What is the largest size of a family $F \subset (k [ n ])$ that does not contain a sunflower with $s$ pe…

math.CO2024

Linear dependencies, polynomial factors in the Duke--Erd\H os forbidden sunflower problem

Andrey Kupavskii, Fedor Noskov

We call a family of $s$ sets ${F_{1}, \dots, F_{s}}$ a \textit{sunflower with $s$ petals} if, for any distinct $i, j \in [s]$ , one has $F_{i} \cap F_{j} = \cap_{u = 1}^{s} F_{u}$ . The set $…

math.CO2023

Octopuses in the Boolean cube: families with pairwise small intersections, part II

Andrey Kupavskii, Fedor Noskov

The problem we consider originally arises from 2-level polytope theory. This class of polytopes generalizes a number of other polytope families. One of the important questions in t…

math.CO2022

Octopuses in the Boolean cube: families with pairwise small intersections, part I

Andrey Kupavskii, Fedor Noskov

Let $F_{1}, \dots, F_{ℓ}$ be families of subsets of ${1, \dots, n}$ . Suppose that for distinct $k, k^{'}$ and arbitrary $F_1 \in \mathcal F_{k}, F_2 \in \mathcal…

math.OC2017

Around power law for PageRank components in Buckley-Osthus model of web graph

Alexander Gasnikov, Maxim Zhukovskii, Sergey Kim +3

In the paper we investigate power law for PageRank components for the Buckley-Osthus model for web graph. We compare different numerical methods for PageRank calculation. With the…