Related papers: Growth degree classification for finitely generate…

Let $M_n$ be a random $n\times n$ matrix with i.i.d. $\text{Bernoulli}(1/2)$ entries. We show that for fixed $k\ge 1$, \[\lim_{n\to \infty}\frac{1}{n}\log_2\mathbb{P}[\text{corank }M_n\ge k] = -k.\]

Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…

The Gram matrix is a classical object formed from the pairwise inner products of a collection of vectors, with fundamental roles in functional analysis, statistics, combinatorics, and coding theory. In the realm of sequence design,…

Suppose that $X_1,\...,X_n,\...$ are i.i.d. rotationally invariant $N$-by-$N$ matrices. Let $\Pi_n=X_n\... X_1$. It is known that $n^{-1}\log |\Pi_n|$ converges to a nonrandom limit. We prove that under certain additional assumptions on…

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.

We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A|^{1+epsilon} where epsilon depends only on the Lie rank of L, or AAA=L. This implies that for a family of simple…

We show that in a sample of size $n$ from a GEM$(0,\theta)$ random discrete distribution, the gaps $G_{i:n}:= X_{n-i+1:n} - X_{n-i:n}$ between order statistics $X_{1:n} \le \cdots \le X_{n:n}$ of the sample, with the convention $G_{n:n} :=…

For a positive integer $n$, the full transformation semigroup $T_n$ consists of all self maps of the set $\{1,\ldots,n\}$ under composition. Any finite semigroup $S$ embeds in some $T_n$, and the least such $n$ is called the (minimum…

Shalom and Tao showed that a polynomial upper bound on the size of a single, large enough ball in a Cayley graph implies that the underlying group has a nilpotent subgroup with index and degree of polynomial growth both bounded effectively.…

A noncommutative projective variety is defined, after Artin and Zhang, by a graded coherent algebra A, where the category of coherent sheaves is the quotient qgr(A) of the category of finitely presented graded modules by the subcategory of…

Consensus is a well-studied problem in distributed sensing, computation and control, yet deriving useful and easily computable bounds on the rate of convergence to consensus remains a challenge. This paper discusses the use of seminorms for…

Benjamini, Finucane and the first author have shown that if (G_n,S_n) is a sequence of Cayley graphs such that |S_n^n|=O(n^D|S_n|), then the sequence (G_n,d_{S_n}/n) is relatively compact for the Gromov-Hausdorff topology and every cluster…

A topological group $G$ is topologically normally generated if there exists $g \in G$ such that the normal closure of $g$ is dense in $G$. Let $S$ be a tame, infinite type surface whose mapping class group $\mathrm{Map}(S)$ is generated by…

In the first, mostly expository, part of this paper, a graded Lie algebra is associated to every group G given with an N-series of subgroups. The asymptotics of the Poincare series of this algebra give estimates on the growth of the group…

We prove new upper bounds on the size of families of vectors in $\Z_m^n$ with restricted modular inner products, when $m$ is a large integer. More formally, if $\vec{u}_1,\ldots,\vec{u}_t \in \Z_m^n$ and $\vec{v}_1,\ldots,\vec{v}_t \in…

Deep generative models (DGMs) are effective on learning multilayered representations of complex data and performing inference of input data by exploring the generative ability. However, little work has been done on examining or empowering…

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…

The joint spectral radius of a compact set of d-times-d matrices is defined ?to be the maximum possible exponential growth rate of products of matrices drawn from that set. In this article we investigate the ergodic-theoretic structure of…

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 present an explicit construction of a Markovian random growth process on integer partitions such that given it visits some level $n$, it passes through any partition $\lambda$ of $n$ with equal probabilities. The construction has…