activity
20212026
most citedEnergy estimates in sum-product and convexity problems

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

collaborators
Showing 2024Show all

7 papers · 1 filter

math.CO2024

The Turán density of the tight 5-cycle minus one edge

Levente Bodnár, Jared León, Xizhi Liu +1

Let the tight -cycle minus one edge be the -graph on consisting of consecutive triples in the cyclic order. We show that, for eve…

math.CO2024

Phase transition of degenerate Turán problems in -norms

Jun Gao, Xizhi Liu, Jie Ma +1

For a positive real number , the -norm of a graph is the sum of the -th powers of all vertex degrees. We study the maximum -norm $\ma…

math.CO2024

New bounds for the optimal density of covering single-insertion codes via the Turán density

Oleg Pikhurko, Oleg Verbitsky, Maksim Zhukovskii

We prove that the density of any covering single-insertion code over the -symbol alphabet cannot be smaller than for some positive real not…

math.CO2024

Nondegenerate Turán problems under -norms

Wanfang Chen, Daniel Iľkovič, Jared León +2

Given integers and a real number , the -norm of an -graph is the sum of the -th power o…

math.CO2024

Constructions of Turán systems that are tight up to a multiplicative constant

Oleg Pikhurko

For positive integers , the Turán function is the smallest size of an r-graph with n vertices such that every set of s vertices contains at least one edge. Al…

math.CO2024

New lower bound on ball packing density in high-dimensional hyperbolic spaces

Irene Gil Fernández, Jaehoon Kim, Hong Liu +1

We present a new lower bound on the Bowen-Radin maximal density of radius-R ball packings in the m-dimensional hyperbolic space, improving on the basic covering bound by factor Ω(m…

math.CO2024

On the -problem of Brown, Erdős and Sós for

Stefan Glock, Jaehoon Kim, Lyuben Lichev +2

Let denote the maximum number of edges in an -vertex -uniform hypergraph containing no subgraph with edges and at most vertices. Brown, Erdős and Sós…