activity
20162023
most citedGeneralizations of a Curious Family of MSTD Sets Hidden By Interior Blocks

4 citations · 15 across the 40 of their papers we have counts for

collaborators
Showing 2022Show all

12 papers · 1 filter

math.FA2022

Schreier families and -(almost) greedy bases

Kevin Beanland, Hung Viet Chu

Let be a hereditary collection of finite subsets of . In this paper, we introduce and characterize -(almost) greedy bases. Given such a famil…

math.NT2022

Linear recurrences of order at most two in nontrivial small divisors and large divisors

Hung Viet Chu, Kevin Huu Le, Steven J. Miller +2

For each positive integer , define $$S'_N \ =\ \{1 < d < \sqrt{N}: d|N\}\mbox{ and }L'_N \ =\ \{\sqrt{N} < d < N : d|N\}.$$ Recently, Chentouf characterized all positive integer…

math.FA2022

The Thresholding Greedy Algorithm versus Approximations with Sizes Bounded by Certain Functions

Hung Viet Chu

Let be a Banach space and be a basis. For a function in a large collection (closed under composition), we define and characterize -gre…

math.FA2022

Larger Greedy Sums for Reverse Partially Greedy Bases

Hung Viet Chu

An interesting result due to Dilworth et al. was that if we enlarge greedy sums by a constant factor in the condition defining the greedy property, then we obtain an equival…

math.FA2022

Strong Partially Greedy Bases with respect to An Arbitrary Sequence

Hung Viet Chu

For Schauder bases, Dilworth et al. introduced and characterized the partially greedy property, which is strictly weaker than the (almost) greedy property. Later, Berasategui et al…

math.FA2022

Extensions and new characterizations of some greedy-type bases

Miguel Berasategui, Pablo M. Berná, Hung Viet Chu

Partially greedy bases in Banach spaces were introduced by Dilworth et al. as a strictly weaker notion than the (almost) greedy bases. In this paper, we study two natural ways to s…