Über ein Problem von Erdös und Moser

DOI10.4064/AA-11-2-205-208zbMath0134.27801OpenAlexW996473569MaRDI QIDQ5345088

András Sárközy

Publication date: 1965

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/aa-11-2-205-208

zbMATH Keywords

number theory

Mathematics Subject Classification ID

Other combinatorial number theory (11B75)

Related Items (25)

Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property ⋮ On the quantum query complexity of local search in two and three dimensions ⋮ Interview with Van Vu ⋮ Double roots of random Littlewood polynomials ⋮ Non-abelian Littlewood-Offord inequalities ⋮ Anticoncentration and the Exact Gap-Hamming Problem ⋮ Erdős-Littlewood-Offord problem with arbitrary probabilities ⋮ From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices ⋮ Improved approximation of linear threshold functions ⋮ A non-uniform Littlewood-Offord inequality ⋮ Quantitative invertibility of random matrices: a combinatorial perspective ⋮ Inverse Littlewood-Offord problems and the singularity of random symmetric matrices ⋮ A new approach to an old problem of Erdős and Moser ⋮ Multivariate estimates for the concentration functions of weighted sums of independent, identically distributed random variables ⋮ Optimal inverse Littlewood-Offord theorems ⋮ Unnamed Item ⋮ Antichain codes ⋮ The Littlewood-Offord problem and invertibility of random matrices ⋮ Resilience for the Littlewood-Offord problem ⋮ Resilience for the Littlewood-Offord problem ⋮ Recent progress in combinatorial random matrix theory ⋮ The Littlewood-Offord problem for Markov chains ⋮ Majorization and Rényi entropy inequalities via Sperner theory ⋮ On the counting problem in inverse Littlewood–Offord theory ⋮ Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors

This page was built for publication: Über ein Problem von Erdös und Moser