88,108 research outputs found
(k+1)-sums versus k-sums
A -sum of a set is an integer that may be
expressed as a sum of distinct elements of . How large can the ratio of
the number of -sums to the number of -sums be? Writing
for the set of -sums of we prove that whenever . The
inequality is tight -- the above ratio being attained when is a geometric
progression. This answers a question of Ruzsa.Comment: 5 page
On the number of integers in a generalized multiplication table
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.Comment: 65 pages. Minor changes. To appear at J. Reine Angew. Math. The final
publication is available at www.reference-global.co
Spectral radius and Hamiltonicity of graphs with large minimum degree
This paper presents sufficient conditions for Hamiltonian paths and cycles in
graphs. Letting denote the spectral radius of the
adjacency matrix of a graph the main results of the paper are:
(1) Let and let be a graph of order ,
with minimum degree If then has a Hamiltonian cycle, unless
or .
(2) Let and let be a graph of
order , with minimum degree If then has a Hamiltonian path, unless
or
In addition, it is shown that in the above statements, the bounds on are
tight within an additive term not exceeding .Comment: 18 pages. This version gives tighter bound
- β¦