English
Related papers

Related papers: On minor-closed classes of matroids with exponenti…

200 papers

Let $K$ be a field, $R$ be a standard graded $K$-algebra and $M$ be a finitely generated graded $R$-module. The rate of $M$, $\rate_R(M)$, is a measure of the growth of the shifts in the minimal graded free resolution of $M$. In this paper,…

Commutative Algebra · Mathematics 2014-10-30 Rasoul Ahangari Maleki

We prove that first-passage percolation times across thin cylinders of the form $[0,n]\times [-h_n,h_n]^{d-1}$ obey Gaussian central limit theorems as long as $h_n$ grows slower than $n^{1/(d+1)}$. It is an open question as to what is the…

Probability · Mathematics 2012-05-17 Sourav Chatterjee , Partha S. Dey

We find, for all sufficiently large $n$ and each $k$, the maximum number of edges in an $n$-vertex graph which does not contain $k+1$ vertex-disjoint triangles. This extends a result of Moon [Canad. J. Math. 20 (1968), 96-102] which is in…

Combinatorics · Mathematics 2017-07-31 Peter Allen , Julia Böttcher , Jan Hladký , Diana Piguet

A conjecture of Erd\H{o}s states that, for any large prime $q$, every reduced residue class $\pmod q$ can be represented as a product $p_1p_2$ of two primes $p_1,p_2\leq q$. We establish a ternary version of this conjecture, showing that,…

Number Theory · Mathematics 2024-02-16 Kaisa Matomäki , Joni Teräväinen

The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to…

Information Theory · Computer Science 2010-09-21 Christine Bachoc , Venkat Chandar , Gerard Cohen , Patrick Sole , Aslan Tchamkerten

We model the growth of a cell population by a piecewise deterministic Markov branching tree. Each cell splits into two offsprings at a division rate $B(x)$ that depends on its size $x$. The size of each cell grows exponentially in time, at…

Probability · Mathematics 2015-05-29 Marie Doumic , Marc Hoffmann , Nathalie Krell , Lydia Robert

We investigate the rate of growth of the function of n which counts the number of complex irreducible representations of a fixed group of degree less than or equal to n. The emphasis is on linear groups, especially compact real and p-adic…

Group Theory · Mathematics 2007-05-23 Michael Larsen , Alexander Lubotzky

We give a description of non-growing subsets in linear groups, which extends the Product theorem for simple groups of Lie type. We also give an account of various related aspects of growth in linear groups.

Group Theory · Mathematics 2012-08-14 Endre Szabó , László Pyber

We answer several questions of Erd\H{o}s regarding sequences of natural numbers $A$ whose translates $n+A$ intersect with the squarefree numbers in various specified ways. For instance, we show that if every translate only contains finitely…

Number Theory · Mathematics 2025-12-09 Wouter van Doorn , Terence Tao

Khan and Miller proved that for every computable non decreasing unbounded function $h\in \omega^\omega$ (henceforth order function), if $h$ is sufficiently large, then there exists a $DNR_h$ that is of minimal degree. Where $h$ has to…

Logic · Mathematics 2020-06-08 Lu Liu

Given an $\mathbb{N}$-weighted tree automaton, we give a decision procedure for exponential vs polynomial growth (with respect to the input size) in quadratic time, and an algorithm that computes the exact polynomial degree of growth in…

Formal Languages and Automata Theory · Computer Science 2026-01-07 Paul Gallot , Nathan Lhote , Lê Thành Dũng Nguyên

We study the countable set of rates of growth of a hyperbolic group with respect to all its finite generating sets. We prove that the set is well-ordered, and that every real number can be the rate of growth of at most finitely many…

Group Theory · Mathematics 2023-08-16 Koji Fujiwara , Zlil Sela

In this undergraduate thesis, we expand on the study of statistics on restricted growth functions avoiding patterns initiated by Campbell, et. al. Restricted growth functions are of interest because they are in bijection with set…

Combinatorics · Mathematics 2020-03-12 Robert Dorward

By the use of Perron-Frobenius theory, simple proofs are given of the Fundamental Theorem of Demography and of a theorem of Cushing and Yicang on the net reproductive rate occurring in matrix models of population dynamics. The latter result…

Rings and Algebras · Mathematics 2007-05-23 Chi-Kwong Li , Hans Schneider

We study for bounded multiplicative functions $f$ sums of the form \begin{align*} \sum_{\substack{n\leq x \atop n\equiv a\pmod q}}f(n), \end{align*} establishing that their variance over residue classes $a \pmod q$ is small as soon as…

Number Theory · Mathematics 2023-08-24 Oleksiy Klurman , Alexander P. Mangerel , Joni Teräväinen

For a transcendental entire function $f$, the property that there exists $r>0$ such that $m^n(r)\to\infty$ as $n\to\infty$, where $m(r)=\min \{|f(z)|:|z|=r\}$, is related to conjectures of Eremenko and of Baker, for both of which order…

Complex Variables · Mathematics 2021-02-04 Daniel A. Nicks , Philip J. Rippon , Gwyneth M. Stallard

Motivated by the classical Hilbert's Sixteenth Problem, we extend some main developments obtained for Hilbert's number in the polynomial setting to the piecewise polynomial context. Specifically, we study the growth of the maximum number of…

Dynamical Systems · Mathematics 2026-01-30 Luana Ascoli , Douglas D. Novaes

A coloring of a matroid is an assignment of colors to the elements of its ground set. We restrict to proper colorings - those for which elements of the same color form an independent set. Seymour proved that a $k$-colorable matroid is also…

Combinatorics · Mathematics 2016-01-29 Michał Lasoń

This paper is concerned with growth series for expansion complexes for finite subdivision rules. Suppose X is an expansion complex for a finite subdivision rule with bounded valence and mesh approaching 0, and let S be a seed for X. One can…

Dynamical Systems · Mathematics 2016-12-15 James W. Cannon , William J. Floyd , Walter R. Parry

In a recent paper, McDiarmid, Semple, and Welsh (2015) showed that the number of tree-child networks with $n$ leaves has the factor $n^{2n}$ in its main asymptotic growth term. In this paper, we improve this by completely identifying the…

Combinatorics · Mathematics 2020-08-04 Michael Fuchs , Guan-Ru Yu , Louxin Zhang