Work

On Lev's periodicity conjecture

Year: 2025

Type: article

Abstract: We classify the sum‐free subsets of whose density exceeds . This yields a resolution of Vsevolod Lev's periodicity conjecture, which asserts that if a sum‐free subset is maximal with respect to inclusion and aperiodic (in the sense that there is no non‐zero vector satisfying ), then —a bound known to be optimal if , while for there are no such sets.

Source: Bulletin of the London Mathematical Society

DOI: 10.1112/blms.70043

Author: Christian Reiher

Institution: Universität Hamburg

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,930

OpenAlex ID: W4408659663

FWCI:

Cites: 14

Cited by:

Related to: 10