On the number of integers in a generalized multiplication table

DOI10.1515/CRELLE-2012-0064MaRDI QIDQ2450179zbMATH OpenOpenAlexFDO

Authors Dimitris Koukoulopoulos

Publication date 16 May 2014

Published in Journal für die Reine und Angewandte Mathematik (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1102.3236

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Distribution of integers with specified multiplicative constraints (11N25)

Abstract: Motivated by the Erdos multiplication table problem we study the following question: Given numbers N_1,...,N_{k+1}, how many distinct products of the form n_1...n_{k+1} with n_i<N_i for all i are there? Call A_{k+1}(N_1,...,N_{k+1}) the quantity in question. Ford established the order of magnitude of A_2(N_1,N_2) and the author of A_{k+1}(N,...,N) for all k>1. In the present paper we generalize these results by establishing the order of magnitude of A_{k+1}(N_1,...,N_{k+1}) for arbitrary choices of N_1,...,N_{k+1} when k is 2,3,4 or 5. Moreover, we obtain a partial answer to our question when k>5. Lastly, we develop a heuristic argument which explains why the limitation of our method is k=5 in general and we suggest ways of improving the results of this paper.

Recommendations

• The multiplication table for smooth integers
• Localized factorizations of integers
• Algorithms for the Multiplication Table Problem
• Factorization in generalized arithmetic progressions and application to the Erdős-Szemerédi sum-product problems
• On a multiplicative hybrid problem

Cited in

(9)

• Equal sums in random sets and the concentration of divisors
• The multiplication table for smooth integers
• A note on the natural density of product sets
• Permutations contained in transitive subgroups
• Balance problems for integer circuits
• Balance problems for integer circuits
• A note on product sets of random sets
• On the set of exceptions in the product of sets of natural numbers with asymptotic density 1
• The multiplication table problem for bipartite graphs

This page was built for publication: On the number of integers in a generalized multiplication table

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