333 research outputs found
The Thresholding Greedy Algorithm versus Approximations with Sizes Bounded by Certain Functions
Let be a Banach space and be a basis. For a fixed
function in a certain collection (closed under composition),
we define and characterize (, greedy) and (, almost greedy) bases. These
bases nontrivially extend the classical notion of greedy and almost greedy
bases. We study relations among (, (almost) greedy) bases as varies and
show that while a basis is not almost greedy, it can still be (, greedy) for
some . Furthermore, we prove that for all non-identity
function , we have the surprising equivalence \mbox{($f$,
greedy)}\ \Longleftrightarrow \ \mbox{($f$, almost greedy)}.Comment: 20 page
Approximation by Egyptian Fractions and the Weak Greedy Algorithm
Let . A sequence of positive integers
is called a weak greedy approximation of if
. We introduce the weak greedy approximation
algorithm (WGAA), which, for each , produces two sequences of positive
integers and such that
a) ;
b) for all
;
c) there exists such that infinitely
often.
We then investigate when a given weak greedy approximation can be
produced by the WGAA. Furthermore, we show that for any non-decreasing
with and , there exist and
such that a) and b) are satisfied; whether c) is also satisfied depends
on the sequence . Finally, we address the uniqueness of and
and apply our framework to specific sequences.Comment: 14 pages, to appear in Indag. Math. (N.S.
When the Nontrivial, Small Divisors of a Natural Number are in Arithmetic Progression
Iannucci considered the positive divisors of a natural number that do not
exceed and found all forms of numbers whose such divisors are in
arithmetic progression. In this paper, we generalize Iannucci's result by
excluding the trivial divisors and (when is a square).
Surprisingly, the length of our arithmetic progression cannot exceed .Comment: 8 pages. Edited according to anonymous referees' suggestions. To
appear in Quaestiones Mathematica
- β¦