English
Related papers

Related papers: Growth of bilinear maps

200 papers

Under a map T, a point x recurs at rate given by a sequence {r_n} near a point x_0 if d(T^n(x),x_0)< r_n infinitely often. Let us fix x_0, and consider the set of those x's. In this paper, we study the size of this set for expanding maps…

Dynamical Systems · Mathematics 2007-05-23 J. L. Fernandez , M. V. Melian , D. Pestana

Let $\bm p_0,...,\bm p_{m-1}$ be points in ${\mathbb R}^d$, and let $\{f_j\}_{j=0}^{m-1}$ be a one-parameter family of similitudes of ${\mathbb R}^d$: $$ f_j(\bm x) = \lambda\bm x + (1-\lambda)\bm p_j, j=0,...,m-1, $$ where…

Dynamical Systems · Mathematics 2015-06-26 Nikita Sidorov

We analyze the behavior of multipliers of a degenerating sequence of complex rational maps. We show either most periodic points have uniformly bounded multipliers, or most of them have exploding multipliers at a common scale. We further…

Dynamical Systems · Mathematics 2025-10-30 Chen Gong

The average value of log s(n)/n taken over the first N even integers is shown to converge to a constant lambda when N tends to infinity; moreover, the value of this constant is approximated and proven to be less than 0. Here s(n) sums the…

Number Theory · Mathematics 2009-12-21 Wieb Bosma , Ben Kane

We study random bipartite planar maps defined by assigning nonnegative weights to each face of a map. We prove that for certain choices of weights a unique large face, having degree proportional to the total number of edges in the maps,…

Probability · Mathematics 2015-06-05 Svante Janson , Sigurdur Örn Stefánsson

This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…

Combinatorics · Mathematics 2025-12-01 Thierry Monteil , Khaydar Nurligareev

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…

Group Theory · Mathematics 2010-01-27 László Pyber , Endre Szabó

The symplectic blob algebra $b_n$ ($n \in \mathbb{N}$) is a finite dimensional algebra defined by a multiplication rule on a basis of certain diagrams. The rank $r(n)$ of $b_n$ is not known in general, but $r(n)/n$ grows unboundedly with…

Representation Theory · Mathematics 2018-08-14 Richard Green , Paul Martin , Alison Parker

We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally…

Metric Geometry · Mathematics 2018-11-28 Richard Evan Schwartz

An important aspect in the theory of algebras with polynomial identities is the study of the asymptotic behavior of the codimension sequence $c_n(A),\, n\geq 1,$ which measures the growth of polynomial identities of a given algebra $A$. In…

Rings and Algebras · Mathematics 2025-12-05 Wesley Quaresma Cota , Felipe Yasumura

Subalgebras of upper triangular matrix algebras have played a fundamental role in the classification of minimal varieties of polynomial growth. Such classification has become a source of study in recent years since it leads to the more…

Rings and Algebras · Mathematics 2025-12-09 Wesley Quaresma Cota , Ana Cristina Vieira

We find a layered permutation $w\in S_n$ whose Schubert polynomial $\mathfrak S_w(x_1, \dots, x_n)$ has support of size asymptotically at least $n!/4^n$. This gives precise asymptotics for the growth rate of $\beta(n):= \max_{w\in…

Combinatorics · Mathematics 2025-12-04 Jack Chen-An Chou , Linus Setiabrata

Denote by $f_D(n)$ the maximum size of a set family $\mathcal{F}$ on $[n] \stackrel{\mbox{\normalfont\tiny def}}{=} \{1, \dots, n\}$ with distance set $D$. That is, $|A \bigtriangleup B| \in D$ holds for every pair of distinct sets $A, B…

Combinatorics · Mathematics 2025-12-09 Zichao Dong , Jun Gao , Hong Liu , Minghui Ouyang , Qiang Zhou

Let $\Lambda = \mathrm{SL}_2(\Bbb Z)$ be the modular group and let $c_n(\Lambda)$ be the number of congruence subgroups of $\Lambda$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log c_n(\Lambda)}{(\log n)^2/\log\log…

Group Theory · Mathematics 2009-11-10 D. Goldfeld , A. Lubotzky , N. Nikolov , L. Pyber

If A is a graded connected algebra then we define a new invariant, polydepth A, which is finite if $Ext_A^*(M,A) \neq 0$ for some A-module M of at most polynomial growth. Theorem 1: If f : X \to Y is a continuous map of finite category, and…

Algebraic Topology · Mathematics 2007-05-23 Y. Felix , S. Halperin , J. -C. Thomas

We give some experimental observations on the growth of the norm of certain matrices related to the Mertens function. The results obtained in these experiments convince us that linear algebra may help in the study of Mertens function and…

Number Theory · Mathematics 2016-05-03 Jean-Paul Cardinal

Given a partition $\lambda$ of a number $k$, it is known that by adding a long line of length $n-k$, the dimension of the associated representation of $S_{n}$ is an integer-valued polynomial of degree $k$ in $n$. We show that its expansion…

Combinatorics · Mathematics 2024-10-23 Avichai Cohen , Shaul Zemel

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

Combinatorics · Mathematics 2025-01-30 Boris Bukh , Zichao Dong

We introduce matrix algebra of subsets in metric spaces and we apply it to improve results of Yamauchi and Davila regarding Asymptotic Property C. Here is a representative result: Suppose $X$ is an $\infty$-pseudo-metric space and $n\ge 0$…

Metric Geometry · Mathematics 2017-12-19 Jerzy Dydak

We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…

Probability · Mathematics 2023-06-21 Nicolas Broutin , Nina Kamčev , Gabor Lugosi