Related papers: Iterated Monodromy Groups of Intermediate Growth

We give a conjecture for the asymptotic growth rate of the number of indecomposable summands in the tensor powers of representations of finite monoids, expressing it in terms of the (Brauer) character table of the monoid's group of units.…

We introduce a new geometric tool for analyzing groups of finite automata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method…

Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…

We study last-iterate convergence of SGD with greedy step size over smooth quadratics in the interpolation regime, a setting which captures the classical Randomized Kaczmarz algorithm as well as other popular iterative linear system…

We construct finitely generated groups of small period growth, i.e. groups where the maximum order of an element of word length $n$ grows very slowly in $n$. This answers a question of Bradford related to the lawlessness growth of groups…

Pointwise and ergodic iteration-complexity results for the proximal alternating direction method of multipliers (ADMM) for any stepsize in(0,(1+\sqrt{5})/2) have been recently established in the literature. In addition to giving alternative…

We study nonstationary dynamical systems formed by sequential concatenation of nonuniformly expanding maps with a uniformly expanding first return map. Assuming a polynomially decaying upper bound on the tails of first return times that is…

We prove that non-elementary hyperbolic groups grow exponentially more quickly than their infinite index quasiconvex subgroups. The proof uses the classical tools of automatic structures and Perron-Frobenius theory. We also extend the main…

Given an $\mathbb{N}$-weighted tree automaton, we give a decision procedure for exponential vs polynomial growth (with respect to the input size) in quadratic time, and an algorithm that computes the exact polynomial degree of growth in…

We prove that the iterated monodromy group of the polynomial $z^2+i$ is just-infinite, regular branch and does not have the congruence subgroup property. This yields the first example of an iterated monodromy group of a polynomial with…

In 1980, Odoni initiated the study of the fixed-point proportion of iterated Galois groups of polynomials motivated by prime density problems in arithmetic dynamics. The main goal of the present paper is to completely settle the…

In this paper, we consider the conjugacy growth function of a group, which counts the number of conjugacy classes which intersect a ball of radius $n$ centered at the identity. We prove that in the case of virtually polycyclic groups, this…

We discuss algorithmic approach to growth of the codimension sequences of varieties of multilinear algebras, or, equivalently, the sequences of the component dimensions of algebraic operads. The (exponentional) generating functions of such…

In this article we give self-contained existence proofs for the sporadic simple groups Co_2 and Fi_{22} using the second author's algorithm [10] constructing finite simple groups from irreducible subgroups of GL_n(2). These two sporadic…

Let $N$ be a finitely generated nilpotent group. The subgroup zeta function $\zeta_N^{\leq}(s)$ and the normal zeta function $\zeta_N^\lhd(s)$ of $N$ are Dirichlet series enumerating the finite index subgroups or the finite index normal…

We develop a novel primal-dual algorithm to solve a class of nonsmooth and nonlinear compositional convex minimization problems, which covers many existing and brand-new models as special cases. Our approach relies on a combination of a new…

In this paper, we employ a version of Stepanov's method, developed by Hanson and Petridis, to prove several results on additive irreducibility of multiplicative subgroups in finite fields of prime order $p$. Specifically, we show that if a…

We critically analyse a recent numerical method due to the first author, Rechnitzer and van Rensburg, which attempts to detect amenability or non-amenability in a finitely generated group by numerically estimating its asymptotic cogrowth…

This note considers the momentum method by Polyak and the accelerated gradient method by Nesterov, both without line search but with fixed step length applied to strictly convex quadratic functions assuming that exact gradients are used and…

We study inert, and ambiguous conjugacy classes in the modular group $\mathrm{PSL}(2,\mathbb{Z})$ from a purely combinatorial perspective. Using word length in the free product representation $\mathbb{Z}_2 * \mathbb{Z}_3$ of the modular…