Related papers: Growth of bilinear maps

We present a new approach to showing that random graphs are nearly optimal expanders. This approach is based on recent deep results in combinatorial group theory. It applies to both regular and irregular random graphs. Let G be a random…

We study the asymptotic behavior of cumulants of lacunary trigonometric sums $S_n(\omega) := \sum_{k=1}^n \cos (2 \pi a_k \omega)$, $\omega\in[0,1]$, and show that cumulant growth is highly sensitive to the arithmetic structure of the…

Geometric grid classes of permutations have proven to be key in investigations of classical permutation pattern classes. By considering the representation of gridded permutations as words in a trace monoid, we prove that every geometric…

An $(n,d,\lambda)$-graph is a $d$ regular graph on $n$ vertices in which the absolute value of any nontrivial eigenvalue is at most $\lambda$. For any constant $d \geq 3$, $\epsilon>0$ and all sufficiently large $n$ we show that there is a…

In this paper we investigate the growth rate of the number of all possible paths in graphs with respect to their length in an exact analytical way. Apart from the typical rates of growth, i.e. exponential or polynomial, we identify…

The longest increasing subsequence (LIS) of a random walk has so far been studied mainly for zero-mean, symmetric step increments. We numerically investigate the LIS of biased Gaussian random walks, with unit-variance increments and…

We prove the existence of the local limit of uniform random d-regular bipartite planar maps, for every $d\geq 3$, as the number of vertices tends to infinity. The proof relies on a bijection between maps and so-called blossoming trees…

We present a survey of results related to the Milnor's problem on group growth. We discuss the cases of polynomial growth, exponential but not uniformly exponential growth, but the main part of the article is devoted to the intermediate…

This paper presents results on maximal runs, order of squares, palindromes, and unbordered factors of members of the family of binary pattern sequences with the all-one pattern. Restricting ourselves to binary pattern sequences with the…

Let $\mathscr{S}$ be the class of all structures whose growth rate on orbits of subsets of size $n$ is not faster than $\frac{2^n}{p(n)}$ for any polynomial $p$. In this article we give a complete classification of all structures in…

We give a structural description of the finite subsets $A$ of an arbitrary group $G$ which obey the polynomial growth condition $|A^n| \leq n^d |A|$ for some bounded $d$ and sufficiently large $n$, showing that such sets are controlled by…

We derive a priori bounds on the size of the structure constants of the free Lie algebra over a set of indeterminates, relative to its Hall bases. We investigate their asymptotic growth, especially as a function of the length of the…

For any metric space $X$, finite subset spaces of $X$ provide a sequence of isometric embeddings $X=X(1)\subset X(2)\subset\cdots$. The existence of Lipschitz retractions $r_n\colon X(n)\to X(n-1)$ depends on the geometry of $X$ in a subtle…

In this paper, we obtain some estimations of the saddle order which is the sole topological invariant of the non-integrable resonant saddles of planar polynomial vector fields of arbitrary degree $n$. Firstly, we prove that, for any given…

We show that the growth of a unimodular random rooted tree $(T,o)$ of degree bounded by $d$ always exists, assuming its upper growth passes the critical threshold $\sqrt{d-1}$. This complements Timar's work who showed the possible…

We consider anti-unification for simply typed lambda terms in associative, commutative, and associative-commutative theories and develop a sound and complete algorithm which takes two lambda terms and computes their generalizations in the…

We study the sizes of delta-additive sets of unit vectors in a d-dimensional normed space: the sum of any two vectors has norm at most delta. One-additive sets originate in finding upper bounds of vertex degrees of Steiner Minimum Trees in…

We establish a list of characterizations of bounded twin-width for hereditary, totally ordered binary structures. This has several consequences. First, it allows us to show that a (hereditary) class of matrices over a finite alphabet either…

Consider the set of those binary words with no non-empty factors of the form $xxx^R$. Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows polynomially or exponentially with length. In this paper, we demonstrate the…

In this paper we prove the necessity of the main sufficient condition of Meinardus for sub exponential rate of growth of the number of structures, having multiplicative generating functions of a general form and establish a new necessary…