A combinatorial problem that arose in integer B₃ sets

MaRDI QIDQ3296952zbMATH OpenFDO

Authors Irene Erazo, John Lopez, Carlos Alberto Trujillo

Publication date 2 July 2020

Full work available at URL http://www.scielo.org.co/scielo.php?script=sci_arttext&pid=S0034-74262019000200195&lng=en&nrm=iso&tlng=en

zbMATH Keywords

\(B_3\) setsSidon sets

Mathematics Subject Classification ID

Sequences (mod (m)) (11B50) Other combinatorial number theory (11B75)

Recommendations

• The number of B₃-sets of a given cardinality
• scientific article; zbMATH DE number 981697
• An upper bound for \(B_{2}[g]\) sets
• A sumset problem
• scientific article; zbMATH DE number 4208147

Cites work

• Cardinality of sets associated to B₃ and B₄ sets
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• On the Size of Finite Sidon Sequences
• The number of squares and \(B_h[g]\) sets

Cited in

(6)

• The number of B₃-sets of a given cardinality
• A new problem on integer sets without 3AP
• Clustered Integer 3SUM via Additive Combinatorics
• scientific article; zbMATH DE number 1145914 (Why is no real title available?)
• scientific article; zbMATH DE number 2069405 (Why is no real title available?)
• Solving \(a\pm b=2c\) in elements of finite sets

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: A combinatorial problem that arose in integer \(B_3\) sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296952)