activity
20202026
most citedGrowth of bilinear maps

5 citations · 15 across the 8 of their papers we have counts for

collaborators

8 papers

math.DS2026

Explicit entropy bounds for symmetric nearest-neighbor subshifts

Vuong Bui

We provide another approach to Friedland's result that the topological entropy of a symmetric nearest-neighbor subshift is computable. Instead of the previous algebraic techniq…

math.CO2023★ 1 cited

A topological version of Hedetniemi's conjecture for equivariant spaces

Vuong Bui, Hamid Reza Daneshpajouh

A topological version of the famous Hedetniemi conjecture says: The mapping index of the Cartesian product of two -spaces is equal to the minimum of their $\mathbb Z/2…

math.CO2022★ 2 cited

An asymptotic lower bound on the number of polyominoes

Vuong Bui

Let be the number of polyominoes of cells and be Klarner's constant, that is, . We show that there exist some positive numbers $A…

math.CO2022

Growth of bilinear maps III: Decidability

Vuong Bui

The following notion of growth rate can be seen as a generalization of joint spectral radius: Given a bilinear map with nonnegative c…

math.CO2021★ 2 cited

Growth of bilinear maps II: Bounds and orders

Vuong Bui

A good range of problems on trees can be described by the following general setting: Given a bilinear map and a vector $s\in\mathbb R…

math.FA2021★ 3 cited

On the joint spectral radius of nonnegative matrices

Vuong Bui

We give an effective bound of the joint spectral radius for a finite set of nonnegative matrices: For every , \[ \sqrt[n]{\left(\frac{V}{UD}\right)^{D} \max_C \max_{i…

math.CO2020★ 2 cited

A bound on the joint spectral radius using the diagonals

Vuong Bui

The primary aim of this paper is to establish bounds on the joint spectral radius for a finite set of nonnegative matrices based on their diagonal elements. The efficacy of this ap…

cs.DM2020★ 5 cited

Growth of bilinear maps

Vuong Bui

For a bilinear map of nonnegative coefficients and a vector of positive entries, among an exponentially number o…