Related papers: Growth of bilinear maps

We present some results on the proportion of permutations of length $n$ containing certain mesh patterns as $n$ grows large, and give exact enumeration results in some cases. In particular, we focus on mesh patterns where entire rows and…

Solving the algebraic dichotomy conjecture for constraint satisfaction problems over structures first-order definable in countably infinite finitely bounded homogeneous structures requires understanding the applicability of…

A linear map between matrix spaces is positive if it maps positive semidefinite matrices to positive semidefinite ones, and is called completely positive if all its ampliations are positive. In this article quantitative bounds on the…

We give sharp bounds in Breuillard, Green and Tao's finitary version of Gromov's theorem on groups with polynomial growth. Precisely, we show that for every non-negative integer d there exists $c=c(d)>0$ such that if $G$ is a group with…

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

An evolution algebra corresponds to a quadratic matrix $A$ of structural constants. It is known the equivalence between nil, right nilpotent evolution algebras and evolution algebras which are defined by upper triangular matrices $A$. We…

We investigate memory dependent asymptotic growth in scalar Volterra equations with sublinear nonlinearity. To obtain precise results we utilise the powerful theory of regular variation extensively. By computing the growth rate in terms of…

Infinitesimal conformal transformations of $R^n$ are always polynomial and finitely generated when $n>2$. Here we prove that the Lie algebra of infinitesimal conformal polynomial transformations over $R^n$, $n>1$, is maximal in the Lie…

Let $X_1, X_2, ..., X_n, ... $ be a sequence of iid random variables with values in a finite alphabet $\{1,...,m\}$. Let $LI_n$ be the length of the longest increasing subsequence of $X_1, X_2, ..., X_n.$ We express the limiting…

We apply round-off to planar rotations, obtaining a one-parameter family of invertible maps of a two-dimensional lattice. As the angle of rotation approaches pi/2, the fourth iterate of the map produces piecewise-rectilinear motion, which…

We show that Golod-Shafarevich algebras can be homomorphically mapped onto infinite-dimensional algebras with polynomial growth, under mild assumptions of the number of relations of given degrees. In case these algebras are finitely…

Let S be an abelian semigroup, and A a finite subset of S. The sumset hA consists of all sums of h elements of A, with repetitions allowed. Let |hA| denote the cardinality of hA. Elementary lattice point arguments are used to prove that an…

Set systems with strongly restricted intersections, called $\alpha$-intersecting families for a vector $\alpha$, were introduced recently as a generalization of several well-studied intersecting families including the classical oddtown and…

A tree with $n$ vertices has at most $95^{n/13}$ minimal dominating sets. The growth constant $\lambda = \sqrt[13]{95} \approx 1.4194908$ is best possible. It is obtained in a semi-automatic way as a kind of "dominant eigenvalue" of a…

Suppose $X$ and $Y$ are finite complexes, with $Y$ simply connected. Gromov conjectured that the number of mapping classes in $[X,Y]$ which can be realized by $L$-Lipschitz maps grows asymptotically as $L^\alpha$, where $\alpha$ is an…

We address the following question: When a randomly chosen regular bipartite multi--graph is drawn in the plane in the ``standard way'', what is the distribution of its maximum size planar matching (set of non--crossing disjoint edges) and…

Catalytic equations appear in several combinatorial applications, most notably in the numeration of lattice path and in the enumeration of planar maps. The main purpose of this paper is to show that the asymptotic estimate for the…

We prove almost sure convergence of the maximum degree in an evolving graph model combining a growing number of local choices with sublinear preferential attachment. At each step in the growth of the graph, a new vertex is introduced. Then…

We show that every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) has linear growth. This implies that the the corresponding semigroup algebra is a PI algebra.

Let $n_k(s)$ be the maximal length $n$ such that a quaternary additive $[n,k,n-s]_4$-code exists. We solve a natural asymptotic problem by determining the lim sup $\lambda_k$ of $n_k(s)/s,$ and the smallest value of $s$ such that…