Hùng Việt Chu

activity

20212024

most citedOn Schreier-type Sets, Partitions, and Compositions

1 citations · 1 across the 7 of their papers we have counts for

collaborators

7 papers

math.NT2024

A Pair of Diophantine Equations Involving the Fibonacci Numbers

Xuyuan Chen, Hung Viet Chu, Fadhlannafis K. Kesumajana +5

Let $a, b \in N$ be relatively prime. Previous work showed that exactly one of the two equations $a x + b y = (a - 1) (b - 1) /2$ and $a x + b y + 1 = (a - 1) (b - 1) /2$ has a nonnegative…

math.FA2024

Higher Order Tsirelson Spaces and their Modified Versions are Isomorphic

Hung Viet Chu, Thomas Schlumprecht

We prove that for every countable ordinal $ξ$ , the Tsirelson's space $T_{ξ}$ of order $ξ$ , is naturally, i.e., via the identity, $3$ -isomorphc to its modified version. For the first…

math.CO2023★ 1 cited

On Schreier-type Sets, Partitions, and Compositions

Kevin Beanland, Hung Viet Chu

A nonempty set $A \subset N$ is $ℓ$ -strong Schreier if $min A ⩾ ℓ ∣ A ∣ - ℓ + 1$ . We define a set of positive integers to be sparse if either the set has at most t…

math.FA2023

Counterexamples in isometric theory of symmetric and greedy bases

Fernando Albiac, Jose L. Ansorena, Oscar Blasco +2

We continue the study initiated in [F. Albiac and P. Wojtaszczyk, Characterization of $1$ -greedy bases, J. Approx. Theory 138 (2006), no. 1, 65-86] of properties related to greedy…

math.FA2023

On consecutive greedy and other greedy-like type of bases

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

We continue our study of the Thresholding Greedy Algorithm when we restrict the vectors involved in our approximations so that they either are supported on intervals of $N$ …

math.NT2023

Approximation by Egyptian Fractions and the Weak Greedy Algorithm

Hung Viet Chu

Let $0 < θ ⩽ 1$ . A sequence of positive integers $(b_{n})_{n = 1}^{\infty}$ is called a weak greedy approximation of $θ$ if $\sum_{n = 1}^{\infty} 1/ b_{n} = θ$ . We introduce the weak g…