加载中…
For a possibly ramified -covering of connected graphs, we establish an Iwasawa-type asymptotic formula for the growth of the -adic valuations of the complexities. The formula is expressed as a polynomial in and with explicit leading coefficients and ; in particular, we eliminate the error term of the form appearing in earlier work. We then establish a Kida-type formula describing the behavior of under a -covering between -coverings, assuming . Finally, for any fixed and integer , we construct an unramified -covering of a bouquet with prescribed - and -invariants.

生成讲解博客的中文版本

生成AI智能校验的中文版本