Related papers: Growth Problems for Representations of Finite Mono…
We give asymptotic formulas for the multiplicities of weights and irreducible summands in high-tensor powers $V_{\lambda}^{\otimes N}$ of an irreducible representation $V_{\lambda}$ of a compact connected Lie group $G$. The weights are…
Tensor parameters that are amortized or regularized over large tensor powers, often called "asymptotic" tensor parameters, play a central role in several areas including algebraic complexity theory (constructing fast matrix multiplication…
In this letter we obtain sharp estimates on the growth rate of solutions to a nonlinear ODE with a nonautonomous forcing term. The equation is superlinear in the state variable and hence solutions exhibit rapid growth and finite-time…
In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…
We give a characterization for asymptotic dimension growth. We apply it to CAT(0) cube complexes of finite dimension, giving an alternative proof of N. Wright's result on their finite asymptotic dimension. We also apply our new…
This note constructs a finitely generated group $W$ whose word-growth is exponential, but for which the infimum of the growth rates over all finite generating sets is 1 -- in other words, of non-uniformly exponential growth. This answers a…
We consider an abstract parabolic problem in a framework of maximal monotone graphs, possibly multi-valued with growth conditions formulated with help of an $x-$dependent $N-$function. The main novelty of the paper consists in the lack of…
For systems of equations with an infinite set of roots, one can sometimes obtain Kushnirenko-Bernstein-Khovanskii type theorem if replace the number of roots by their asymptotic density. We consider systems of entire functions with…
We develop an abstract operator-theoretic variational principle for asymptotic growth rates arising from subadditive processes driven by Markov operators: for each invariant measure on the base, the growth rate equals the supremum of fiber…
Kronecker coefficients encode the tensor products of complex irreducible representations of symmetric groups. Their stability properties have been considered recently by several authors (Vallejo, Pak and Panova, Stembridge). In previous…
We define the class of groups of bounded type from tile inflations. These tile inflations also determine some automata describing the groups. In the case when the automata are stationary, we show that if the set of incompressible elements…
We obtain new asymptotical bounds for the symmetric tensor rank of multiplication in any finite extension of any finite field $\F_q$. In this aim, we use the symmetric Chudnovsky-type generalized algorithm applied on a family of Shimura…
We prove that the non-regular binary matroids with no $P_9^*$-minor have linear growth rate and the maximum size binary matroids with no $P_9^*$-minor are graphic. The main technique in the proof is the Strong Splitter Theorem using which…
In this paper we determine the exact rate of growth of the solution of a deterministic delay differential equation in which the delayed term is regularly varying at infinity and dominates, and determine criteria to characterise this…
In this paper we study the growth rates of Artin monoids and we show that 4 is a universal upper bound. We also show that the generating functions of the associated right-angled Artin monoids are given by families of Chebyshev polynomials.…
A group presentation is said to have rational growth if the generating series associated to its growth function represents a rational function. A long-standing open question asks whether the Heisenberg group has rational growth for all…
We study how much injective morphisms can increase the repetitiveness of a given word. This question has a few possible variations depending on the meaning of ``repetitiveness''. We concentrate on fractional exponents of finite words and…
In a recent paper, McDiarmid, Semple, and Welsh (2015) showed that the number of tree-child networks with $n$ leaves has the factor $n^{2n}$ in its main asymptotic growth term. In this paper, we improve this by completely identifying the…
We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…
We prove a factorization-concentration result for characters of symmetric groups. This is then applied to the asymptotic behaviour of the decomposition of the tensor representations. There are connections with the Pastur-Marcenko…