English
Related papers

Related papers: Growth degree classification for finitely generate…

200 papers

A lifting of a semilattice S is an algebra A such that the semilattice of compact (=finitely generated) congruences of A is isomorphic to S. The aim of this work is to give a categorical theory of partial algebras endowed with a partial…

Category Theory · Mathematics 2010-12-10 Pierre Gillibert

In this work, we prove the existence of linear recurrences of order M with a non-trivial solution vanishing exactly on the set of gaps (or a subset) of a numerical semigroup S finitely generated by a1 < a2 <...< aN and M = aN. Keywords:…

Commutative Algebra · Mathematics 2013-11-01 Ivan Martino , Luca Martino

In this note, we show that for each minimal norm $N(\cdot)$ on the algebra $M_n$ of all $n \times n$ complex matrices, there exist norms $\|\cdot\|_1$ and $\|\cdot\|_2$ on ${\mathbb C}^n$ such that $$N(A)=\max\{\|Ax\|_2: \|x\|_1=1, x\in…

Functional Analysis · Mathematics 2015-05-13 Madjid Mirzavaziri , Mohammad Sal Moslehian

Let $n>1$ be an integer. The algebras of the title, which we abbreviate as algebras of type $n$, are infinite-dimensional graded Lie algebras $L= \bigoplus_{i=1}^{\infty}L_i$, which are generated by an element of degree $1$ and an element…

Rings and Algebras · Mathematics 2025-01-29 Sandro Mattarei , Simone Ugolini

Let $\Gamma$ denote the modular group $SL(2,\Bbb Z)$ and $C_n(\Gamma)$ the number of congruence subgroups of $\Gamma$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log C_n(\Gamma)}{(\log n)^2/\log\log n} =…

Group Theory · Mathematics 2007-05-23 D. Goldfeld , A. Lubotzky , L. Pyber

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

Dynamical Systems · Mathematics 2007-05-23 Laura DeMarco

In this paper, the author (1) compares subnormal closures of finite sets in free groups; (2) proves that the exponential growth rate (e.g.r.), i.e., the limit of the n-th roots of g(n), where g(n) is the growth function of a subgroup H with…

Group Theory · Mathematics 2014-07-29 Alexander Olshanskii

The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…

Combinatorics · Mathematics 2016-04-18 Jim Geelen , Peter Nelson

Let $\Gamma$ be a discrete subgroup of $\textrm{PGL}(d,\R)$ and fix some euclidean norm $\|\ \|$ on $\R^d.$ Let $N_\Gamma(t)$ be the number of elements in $\Gamma$ whose operator norm is $\leq t.$ In this article we prove an asymptotic for…

Group Theory · Mathematics 2012-01-31 Andrés Sambarino

We show that every non-decreasing function $f\colon \mathbb N\to \mathbb N$ bounded from above by $a^n$ for some $a\ge 1$ can be realized (up to a natural equivalence) as the conjugacy growth function of a finitely generated group. We also…

Group Theory · Mathematics 2017-01-31 M. Hull , D. Osin

We establish new results on the possible growth rates for the sequence (f_n) counting the number of orbits of a given oligomorphic group on unordered sets of size n. Macpherson showed that for primitive actions, the growth is at least…

Logic · Mathematics 2018-10-16 Pierre Simon

This paper presents minimax rates for density estimation when the data dimension $d$ is allowed to grow with the number of observations $n$ rather than remaining fixed as in previous analyses. We prove a non-asymptotic lower bound which…

Statistics Theory · Mathematics 2017-08-16 Daniel J. McDonald

We study product set growth in groups with acylindrical actions on quasi-trees and, more generally, hyperbolic spaces. As a consequence, we show that for every surface $S$ of finite type, there exist $\alpha,\beta>0$ such that for any…

Group Theory · Mathematics 2025-09-24 Alice Kerr

We look at sequences of positive integers that can be realized as degree sequences of iterates of rational dominant maps of smooth projective varieties over arbitrary fields. New constraints on the degree growth of endomorphisms of the…

Algebraic Geometry · Mathematics 2016-06-16 Christian Urech

Let $A$ be a commutative ring, and assume every non-trivial ideal of $A$ has finite-index. We show that if ${\rm{SL}}_n(A)$ has bounded elementary generation then every conjugation-invariant norm on it is either discrete or precompact. If…

Group Theory · Mathematics 2025-04-07 Leonid Polterovich , Yehuda Shalom , Zvi Shem-Tov

We present asymptotic and finite-sample results on the use of stochastic blockmodels for the analysis of network data. We show that the fraction of misclassified network nodes converges in probability to zero under maximum likelihood…

Statistics Theory · Mathematics 2012-05-22 David S. Choi , Patrick J. Wolfe , Edoardo M. Airoldi

Let $\{u_n\}_n$ be a non-degenerate linear recurrence sequence of integers with Binet's formula given by $u_n= \sum_{i=1}^{m} P_i(n)\alpha_i^n.$ Assume $\max_i \vert \alpha_i \vert >1$. In 1977, Loxton and Van der Poorten conjectured that…

Number Theory · Mathematics 2025-10-08 Armand Noubissie

A contragredient Lie superalgebra is a superalgebra defined by a Cartan matrix. A contragredient Lie superalgebra has finite-growth if the dimensions of the graded components (in the natural grading) depend polynomially on the degree. In…

Representation Theory · Mathematics 2008-10-16 Crystal Hoyt , Vera Serganova

We consider an infinite graph G whose vertex set is the set of natural numbers and adjacency depends solely on the difference between vertices. We study the largest cardinality of a set of permutations of [n] any pair of which differ…

Combinatorics · Mathematics 2007-12-11 János Körner , Gábor Simonyi , Blerina Sinaimeri

We study finite semigroups of $n \times n$ matrices with rational entries. Such semigroups provide a rich generalization of transition monoids of unambiguous (and, in particular, deterministic) finite automata. In this paper we determine…

Formal Languages and Automata Theory · Computer Science 2026-01-06 Stefan Kiefer , Andrew Ryzhikov