12 research outputs found
On growth of Lie algebras, generalized partitions, and analytic functions
AbstractIn this paper we discuss some recent results on two different types of growth of Lie algebras that lead to some combinatorial problems. First, we study the growth of finitely generated Lie algebras (Sections 1–4). This problem leads to a study of generalized partitions. Recently the author has suggested a series of q-dimensions of algebras Dimq,q∈N which includes, as first terms, dimensions of vector spaces, Gelfand–Kirillov dimensions, and superdimensions. These dimensions enabled us to describe the change of a growth in transition from a Lie algebra to its universal enveloping algebra. In fact, this is a result on some generalized partitions. In this paper we give some results on asymptotics for those generalized partitions. As a main application, we obtain an asymptotical result for the growth of free polynilpotent finitely generated Lie algebras. As a corollary, we specify the asymptotic growth of lower central series ranks for free polynilpotent finitely generated groups. We essentially use Hilbert–Poincaré series and some facts on growth of complex functions which are analytic in the unit circle. By growth of such functions we mean their growth when the variable tends to 1. Also we discuss for all levels q=2,3,… what numbers α>0 can be a q-dimension of some Lie (associative) algebra. Second, we discuss a ‘codimension growth’ for varieties of Lie algebras (Sections 5 and 6). It is useful to consider some exponential generating functions called complexity functions. Those functions are entire functions of a complex variable provided the varieties of Lie algebras are nontrivial. We compute the complexity functions for some varieties. The growth of a complexity function for an arbitrary polynilpotent variety is evaluated. Here we need to study the connection between the growth of a fast increasing entire function and the behavior of its Taylor coefficients. As a result we obtain a result for the asymptotics of the codimension growth of a polynilpotent variety of Lie algebras. Also we obtain an upper bound for a growth of an arbitrary nontrivial variety of Lie algebras
Analytic combinatorics for a certain well-ordered class of iterated exponential terms
International audienceThe aim of this paper is threefold: firstly, to explain a certain segment of ordinals in terms which are familiar to the analytic combinatorics community, secondly to state a great many of associated problems on resulting count functions and thirdly, to provide some weak asymptotic for the resulting count functions. We employ for simplicity Tauberian methods. The analytic combinatorics community is encouraged to provide (maybe in joint work) sharper results in future investigations
Phase Transitions for Gödel Incompleteness
Gödel's first incompleteness result from 1931 states that there are true assertions about the natural numbers which do not follow from the Peano axioms. Since 1931 many researchers
have been looking for natural examples of such assertions and breakthroughs have been obtained in the seventies by Jeff Paris (in part jointly with Leo Harrington and Laurie Kirby) and Harvey Friedman who produced first mathematically interesting
independence results in Ramsey theory (Paris) and well-order and well-quasi-order theory (Friedman).
In this article we investigate Friedman style principles of combinatorial well-foundedness for the ordinals below epsilon_0. These principles state that there is a uniform bound on the length of decreasing sequences of ordinals which satisfy an elementary recursive growth rate condition with respect to their Gödel numbers.
For these independence principles we classify (as a part of a general research program) their phase transitions, i.e. we classify exactly the bounding conditions which lead from
provability to unprovability in the induced combinatorial
well-foundedness principles.
As Gödel numbering for ordinals we choose the one which is induced naturally from Gödel's coding of finite sequences from his classical 1931 paper on his incompleteness results.
This choice makes the investigation highly non trivial but rewarding and we succeed in our objectives by using an intricate and surprising interplay between analytic combinatorics and the theory of descent recursive functions.
For obtaining the required bounds on count functions for ordinals we use a classical 1961 Tauberian theorem by Parameswaran which apparently is far remote from Gödel's theorem
Lie Algebras and Growth in Branch Groups
We compute the structure of the Lie algebras associated to two examples of
branch groups, and show that one has finite width while the other, the
``Gupta-Sidki group'', has unbounded width. This answers a question by Sidki.
More precisely, the Lie algebra of the Gupta-Sidki group has Gelfand-Kirillov
dimension .
We then draw a general result relating the growth of a branch group, of its
Lie algebra, of its graded group ring, and of a natural homogeneous space we
call "parabolic space", namely the quotient of the group by the stabilizer of
an infinite ray. The growth of the group is bounded from below by the growth of
its graded group ring, which connects to the growth of the Lie algebra by a
product-sum formula, and the growth of the parabolic space is bounded from
below by the growth of the Lie algebra.
Finally we use this information to explicitly describe the normal subgroups
of the "Grigorchuk group". All normal subgroups are characteristic, and the
number of normal subgroups of index is odd and is asymptotically
Semigroups of matrices of intermediate growth
Finitely generated linear semigroups over a field K that have intermediate growth are considered. New classes of such semigroups are found and a conjecture on the equivalence of the subexponential growth of a finitely generated linear semigroup S and the nonexistence of free noncommutative subsemigroups in S, or equivalently the existence of a nontrivial identity satisfied in S, is stated. This 'growth alternative' conjecture is proved for linear semigroups of degree 2, 3 or 4. Certain results supporting the general conjecture are obtained. As the main tool, a new combinatorial property of groups is introduced and studied