Growth of bilinear maps

From MaRDI portal



Abstract: For a bilinear map ∗:mathbbRdimesmathbbRdomathbbRd of nonnegative coefficients and a vector sinmathbbRd of positive entries, among an exponentially number of ways combining n instances of s using n−1 applications of ∗ for a given n, we are interested in the largest entry over all the resulting vectors. An asymptotic behavior is that the n-th root of this largest entry converges to a growth rate lambda when n tends to infinity. In this paper, we prove the existence of this limit by a special structure called linear pattern. We also pose a question on the possibility of a relation between the structure and whether lambda is algebraic.











This page was built for publication: Growth of bilinear maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029830)