Related papers: The growth function of S-recognizable sets

This paper deals with the problem of recognizability of functions l: Sigma* --> M that map words to values in the support set M of a monoid (M,.,1). These functions are called M-languages. M-languages are studied from the aspect of their…

A D0L-system is a triple (A, f, w) where A is a finite alphabet, f is an endomorphism of the free monoid over A, and w is a word over A. The D0L-sequence generated by (A, f, w) is the sequence of words (w, f(w), f(f(w)), f(f(f(w))), ...).…

We study the typical growth rate of the number of words of length n which can be extended to beta-expansions of x. In the general case we give a lower bound for the growth rate, while in the case that the Bernoulli convolution associated to…

We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of…

Let $M_n(\mathbb{F})$ be the algebra of $n \times n$ matrices and let $\mathcal S$ be a generating set of $M_n(\mathbb{F})$ as an $\mathbb{F}$-algebra. The length of a finite generating set $\mathcal S$ of $M_n(\mathbb{F})$ is the smallest…

We prove a quantitative refinement of the statement that groups of polynomial growth are finitely presented. Let $G$ be a group with finite generating set $S$ and let $\operatorname{Gr}(r)$ be the volume of the ball of radius $r$ in the…

The ambiguity of a nondeterministic finite automaton (NFA) N for input size n is the maximal number of accepting computations of N for an input of size n. For all k, r 2 N we construct languages Lr,k which can be recognized by NFA's with…

The solvable Farb growth of a group quantifies how well-approximated the group is by its finite solvable quotients. In this note we present a new characterization of polycyclic groups which are virtually nilpotent. That is, we show that a…

For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…

Let $F=\{\mathbf{p}_0,\ldots,\mathbf{p}_n\}$ be a collection of points in $\mathbb{R}^d.$ The set $F$ naturally gives rise to a family of iterated function systems consisting of contractions of the form $$S_i(\mathbf{x})=\lambda \mathbf{x}…

We establish pointwise growth estimates for the spherical derivative of solutions of the first order algebraic differential equations. A generalization of this result to higher order equations is also given. We discuss the related question…

For $g\in \mathbb{N}$, let $G=\Sp(2g,\mathbb{Z})$ be the integral symplectic group and $S(g)$ be the set of all positive integers which can occur as the order of an element in $G$. In this paper, we show that $S(g)$ is a bounded subset of…

Any finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is reached, the word $w$ is called rich. The number of rich words of length $n$ over an alphabet of cardinality $q$ is denoted…

Given a finitely generated semigroup S of the (normed) set of linear maps of a vector space V into itself, we find sufficient conditions for the exponential growth of the number N(k) of elements of the semigroup contained in the sphere of…

We give the first {\sl reconstruction algorithm} for decision trees: given queries to a function $f$ that is $\mathrm{opt}$-close to a size-$s$ decision tree, our algorithm provides query access to a decision tree $T$ where: $\circ$ $T$ has…

Let $S=\{s_{n}\}$ be an increasing finite or infinite subset of $\mathbb N \bigcup \{0\}$ and $X(S)$ the $S$-gap shift associated to $S$. Let $f_{S}(x)=1-\sum\frac{1}{x^{s_{n}+1}}$ be the entropy function which will be vanished at…

We consider a general class of decision problems concerning formal languages, called ``(one-dimensional) unboundedness predicates'', for automata that feature reversal-bounded counters (RBCA). We show that each problem in this class reduces…

Let $R$ be a commutative Noetherian ring, $I$ an ideal, $M$ and $N$ finitely generated $R$-modules. Assume $V(I)\cap Supp(M)\cap Supp(N)$ consists of finitely many maximal ideals and let ${\l}(\e^i(N/I^nN,M))$ denote the length of…

We investigate how the behavior of the function d_A(n) that gives the size of a least size generating set for A^n, influences the structure of a finite solvable algebra A.

Let $\cM$ be a minor-closed class of matroids that does not contain arbitrarily long lines. The growth rate function, $h:\bN\rightarrow \bN$ of $\cM$ is given by $$h(n) = \max(|M|\, : \, M\in \cM, simple, rank-$n$).$$ The Growth Rate…