z-logo
open-access-imgOpen Access
Dot product rearrangements
Author(s) -
P. Erdős,
Gary Weiss
Publication year - 1983
Publication title -
international journal of mathematics and mathematical sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 39
eISSN - 1687-0425
pISSN - 0161-1712
DOI - 10.1155/s0161171283000368
Subject(s) - algorithm , computer science
Let a=(an), x=(xn) denote nonnegative sequences; x=(xπ(n)) denotes the rearranged sequence determined by the permutation π, a⋅x denotes the dot product ∑anxn; and S(a,x) denotes {a⋅xπ:π is a permuation of the positive integers}. We examine S(a,x) as a subset of the nonnegative real line in certain special circumstances. The main result is that if an↑∞, then S(a,x)=[a⋅x,∞] for every xn↓≠0 if and only if an+1/an is uniformly bounded

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom