Hung Viet Chu

Dr. Hung Viet Chu

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 December 2025 in arXiv
Verified
Preprint
Open access
PDF file
HCHung Viet Chu
Hung Viet Chu
SMSteven J Miller
Steven J Miller
GTGarrett Tresch
Garrett Tresch
For two relatively prime positive integers $a, b\in \mathbb{N}$, it is known that exactly one of the two Diophantine equations $$ax + by \ =\ \frac{(a-1)(b-1)}{2}\ \mbox{ and }\ 1 + ax + by \ =\ \frac{(a-1)(b-1)}{2}$$ has a nonnegative integral solution $(x, y)$. Furthermore, the solution is unique. In this note, we summarize recent results and some new ones on the solution of the two equations and provide an overview of problems for future investigation, some of which were presented at the 2025 International Conference on Class Groups of Number Fields and Related Topics.

5 September 2025 in arXiv
Verified
Preprint
Open access
PDF file
HCHung Viet Chu
Hung Viet Chu
YGYubo Geng
Yubo Geng
JKJulian King
Julian King
SMSteven J Miller
Steven J Miller
GTGarrett Tresch
Garrett Tresch
ZVZachary Louis Vasseur
Zachary Louis Vasseur
A nonempty set $F$ is Schreier if $\min F\ge |F|$. Bird observed that counting Schreier sets in a certain way produces the Fibonacci sequence. Since then, various connections between variants of Schreier sets and well-known sequences have been discovered. Building on these works, we prove a linear recurrence for the sequence that counts multisets $F$ with $\min F\ge p|F|$. In particular, if we let $$\mathcal{A}^{(s)}_{p, n}\ :=\ \{F\subset \{\underbrace{1, \ldots, 1}_{s}, \ldots, \underbrace{n-1, \ldots, n-1}_{s}, n\}\,:\,n\in F\mbox{ and }\min F\ge p|F|\},$$ then $$|\mathcal{A}^{(s)}_{p, n}| = \sum_{i=0}^s|\mathcal{A}^{(s)}_{p, n-1-ip}|.$$ If we color $s$ copies of the same integer by different colors from $1$ to $s$, i.e., $\mathcal{B}^{(s)}_{p, n}:= $ $$\{F\subset \{1_{1}, \ldots, 1_{s}, \ldots, (n-1)_1, \ldots, (n-1)_{s}, n\}\,:\,n\in F\mbox{ and }\min F\ge p|F|\},$$ then $$|\mathcal{B}^{(s)}_{p, n}| = \sum_{i=0}^s \binom{s}{i}| \mathcal{B}^{(s)}_{p, n-1-ip}|.$$ Lastly, we count Schreier sets that do not admit multiples of a given integer $u\ge 2$ and witness linear recurrences whose coefficients are drawn from the $u$th row of the Pascal triangle and have alternating signs, except possibly the last one.

27 August 2025 in arXiv
Verified
Preprint
Open access
PDF file
MBMiguel Berasategui
Miguel Berasategui
PBPablo Berná
Pablo Berná
HCHung Viet Chu
Hung Viet Chu
AGAndrea García
Andrea García
We continue the study of Lebesgue-type parameters for various greedy algorithms in quasi-Banach spaces. First, we introduce a parameter that can be used with the quasi-greedy parameter to obtain the exact growth of the Lebesgue parameter for strong partially greedy bases. Second, we establish a new upper bound for the Lebesgue parameter for semi-greedy bases using the quasi-greedy and the squeeze symmetry parameters. Finally, we answer several open questions regarding the optimal power in various bounds proved in [F. Albiac, J. L. Ansorena, and P. M. Berná, New parameters and Lebesgue-type estimates in greedy approximation, Forum Math. Sigma 10 (2022), 1-39].

8 August 2026 in Revista Matemática Complutense
Verified
Journal Article
Closed access
PDF file
MBMiguel Berasategui
Miguel Berasategui
PBPablo Berná
Pablo Berná
HCHung Viet Chu
Hung Viet Chu
AGAndrea García
Andrea García

21 July 2026 in The Fibonacci Quarterly
Verified
Journal Article
Closed access
HCHung Viet Chu
Hung Viet Chu
RGRishabh Gulecha
Rishabh Gulecha
SGSicheng Guo
Sicheng Guo
NJNathanael Johnson
Nathanael Johnson
SMSteven J Miller
Steven J Miller
YSYeju Shin
Yeju Shin
1. In the study of cyclotomic polynomials Φpq(x) for prime numbers p and q, Beiter [3] used the result that exactly one of the two equations px+qy = (p−1)(q−1)2 and 1+px+qy = (p−1)(q−1)2has a non...

10 December 2025 in arXiv
Verified
Preprint
Open access
PDF file
HCHung Viet Chu
Hung Viet Chu
It was previously known that the almost greedy (AG) property essentially remains the same when we enlarge greedy sums in the classical definition by a factor $λ\geqslant 1$. The present paper shows that if instead, we enlarge greedy sums in a reformulation of the AG property, we obtain a weaker one. However, the new property is essentially independent of the enlarging factor $λ$ once $λ> 1$. In contrast, we observe a continuum of partially greedy-like properties by varying $λ\in [1,\infty)$. Last but not least, under a threshold for $λ$, we characterize the isometric version of the weakened AG property. Specifically, the characterization holds if and only if $λ\in [1, 2]$.