Numerical semigroups of Szemerédi type (Q2420402): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the degree of regularity of a certain quadratic Diophantine equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On formulas for the Frobenius number of a numerical semigroup. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large 3-free sets. I. The small \(n\) case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the Frobenius problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5704414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical semigroups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets without \(k\)-term arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets of integers containing k elements in arithmetic progression / rank
 
Normal rank

Latest revision as of 10:53, 19 July 2024

scientific article
Language Label Description Also known as
English
Numerical semigroups of Szemerédi type
scientific article

    Statements

    Numerical semigroups of Szemerédi type (English)
    0 references
    0 references
    0 references
    0 references
    6 June 2019
    0 references
    Given any length \(k\ge3\) and density \(0 < \delta \le 1\), let \(\operatorname{Sz}(k ,\delta)\) denote the set consisting of all positive integers \(n\) such that every subset \(X \subseteq [1, n]\) of density \(| X |/ n \ge \delta\) contains an arithmetic progression of length \(k\). Szemerédi's Theorem shows that this set is not empty. The authors show that \(\operatorname{Sz}(k ,\delta)\cup \{0 \}\) is an additive subsemigroup of the set of non-negative integers for every integer \(k \ge 3\) and \(0 < \delta\le 1\) which complement in the set of non-negative integers if finite. To prove this they use a weaker version of Szemerédi's theorem that given an integer \(k\ge 3\) and \(0 < \delta\le 1\), there exists a positive integer \(n = n(k ,\delta )\) such that every subset \(A \subseteq [ 1 , n ]\) of density \(| A |/ n \ge\delta\) contains an arithmetic progression of length \(k\). Then they determine \(\mathop{Sz}(3 ,\delta)\) for various values of \(\delta< 1\), and \(\operatorname{Sz}(4 ,1/2)\).
    0 references
    arithmetic progression
    0 references
    van der Waerden number
    0 references
    multiplicity
    0 references
    Frobenius number
    0 references
    conductor
    0 references

    Identifiers