A Survey of Problems in Combinatorial Number Theory

DOI10.1016/S0167-5060(08)70697-6MaRDI QIDQ3893989zbMATH OpenOpenAlexFDO

Authors P. Erdős

Publication date 1980

Published in Combinatorial Mathematics, Optimal Designs and Their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-5060(08)70697-6

zbMATH Keywords

covering congruencesdense sets of integersinfinite subsets of integersproblemssieve methods

Mathematics Subject Classification ID

Problem books (00A07) Permutations, words, matrices (05A05) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Elementary number theory (11A99) Arithmetic progressions (11B25) Special sequences and polynomials (11B83) Distribution of primes (11N05) Goldbach-type theorems; other additive questions involving primes (11P32)

Cited in

(25)

• Old and new problems and results in combinatorial number theory: van der Waerden's theorem and related topics
• Problems and results in discrete mathematics
• A proof of a sumset conjecture of Erdős
• Integer sets with prescribed pairwise differences being distinct
• Hamiltonicity of a coprime graph
• Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson
• Discordant sets and ergodic Ramsey theory
• Dense edge-magic graphs and thin additive bases
• scientific article; zbMATH DE number 3891444 (Why is no real title available?)
• New primitive covering numbers and their properties
• scientific article; zbMATH DE number 3477291 (Why is no real title available?)
• scientific article; zbMATH DE number 3573944 (Why is no real title available?)
• scientific article; zbMATH DE number 1303203 (Why is no real title available?)
• \(k\)-fold Sidon sets
• scientific article; zbMATH DE number 867703 (Why is no real title available?)
• Equal-subset-sum faster than the meet-in-the-middle
• Minimum coprime graph labelings
• Finite products sets and minimally almost periodic groups
• The structure and number of Erdős covering systems
• A proof of Erdős's B+B+t conjecture
• Infinite unrestricted sumsets of the form B+B in sets with large density
• Arithmetic progressions at the journal of the LMS
• The density finite sums theorem
• Problems on infinite sumset configurations in the integers and beyond
• Counterexamples to generalizations of the Erdős B+B+t problem

This page was built for publication: A Survey of Problems in Combinatorial Number Theory

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