Related papers: Growth in groups: ideas and perspectives

The growth of a finitely generated group is an important geometric invariant which has been studied for decades. It can be either polynomial, for a well-understood class of groups, or exponential, for most groups studied by geometers, or…

This is a survey article on some recent developments in the arithmetic theory of linear algebraic groups over higher-dimensional fields, written for the Notices of the AMS.

Nekrashevych conjectured that the iterated monodromy groups of quadratic polynomials with preperiodic critical orbit have intermediate growth. We illustrate some of the difficulties that arise in attacking this conjecture and prove…

This article is concerned with pointwise growth and spreading speeds in systems of parabolic partial differential equations. Several criteria exist for quantifying pointwise growth rates. These include the location in the complex plane of…

We propose a numerical method for studying the cogrowth of finitely presented groups. To validate our numerical results we compare them against the corresponding data from groups whose cogrowth series are known exactly. Further, we add to…

We consider finite-sample inference for a single regression coefficient in the fixed-design linear model $Y = Z\beta + bX + \varepsilon$, where $\varepsilon\in\mathbb{R}^n$ may exhibit complex dependence or heterogeneity. We develop a group…

Let G be an arithmetic lattice in a semisimple algebraic group over a number field. We show that if G has the congruence subgroup property, then the number of n-dimensional irreducible representations of G grows like n^a, where a is a…

Linear forms in logarithms over connected commutative algebraic groups over the algebraic numbers field have been studied widely. However, the theory of linear forms in logarithms over noncommutative algebraic groups have not been developed…

We describe a generalization of the concept of a pc presentation that applies to groups with a nontrivial solvable radical. Such a representation can be much more efficient in terms of memory use and even of arithmetic, than permuattion and…

Put $R=\F[[t_1, \ldots, t_d]])$. We estimate the number of normal subgroups of $\mathrm{SL}_2^1(\F[[t_1, \ldots, t_d]])$ for $p>2$, the number of ideals in the Lie algebra $\Lie(R)$, and the number of ideals in the associative algebra $R$.

We extend the so-called retract relation given in [6] for involutive set-theoretic solutions of the Pentagon Equation and we introduce the notion of associated permutation group to study the family of the commutative non-degenerate ones.…

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

We give examples of countable linear groups in $SL_{n}(R)$ for $n \ge 3$, with no nontrivial normal abelian subgroups, that admit a faithful sharply 2-transitive action on a set. Without the linearity assumption, such groups were recently…

In the growth of bacterial colonies, a great variety of complex patterns are observed in experiments, depending on external conditions and the bacterial species. Typically, existing models employ systems of reaction-diffusion equations or…

Iterated monodromy groups of postcritically-finite rational maps form a rich class of self-similar groups with interesting properties. There are examples of such groups that have intermediate growth, as well as examples that have…

The present survey aims at being a list of Conjectures and Problems in an area of model-theoretic algebra wide open for research, not a list of known results. To keep the text compact, it focuses on structures of finite Morley rank,…

We summarize some of the recent developments which link certain problems in combinatorial theory related to random growth to random matrix theory.

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…

Since their emergence in the 1990's, the support vector machine and the AdaBoost algorithm have spawned a wave of research in statistical machine learning. Much of this new research falls into one of two broad categories: kernel methods and…

This paper proves that in a non-elementary relatively hyperbolic group, the logarithm growth rate of any non-elementary subgroup has a linear lower bound by the logarithm of the size of the corresponding generating set. As a consequence,…