On the number of integers in a generalized multiplication table
From MaRDI portal
Publication:2450179
DOI10.1515/CRELLE-2012-0064zbMATH Open1361.11056arXiv1102.3236OpenAlexW3103204621MaRDI QIDQ2450179FDOQ2450179
Authors: Dimitris Koukoulopoulos
Publication date: 16 May 2014
Published in: Journal für die Reine und Angewandte Mathematik (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1102.3236
Recommendations
Other combinatorial number theory (11B75) Distribution of integers with specified multiplicative constraints (11N25)
Cited In (9)
- The multiplication table for smooth integers
- On the set of exceptions in the product of sets of natural numbers with asymptotic density 1
- The multiplication table problem for bipartite graphs
- Equal sums in random sets and the concentration of divisors
- Balance problems for integer circuits
- Balance problems for integer circuits
- A note on the natural density of product sets
- Permutations contained in transitive subgroups
- A note on product sets of random sets
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)