中文
相关论文

相关论文: Intervals of permutation class growth rates

200 篇论文

The class Av(1324), of permutations avoiding the pattern 1324, is one of the simplest sets of combinatorial objects to define that has, thus far, failed to reveal its enumerative secrets. By considering certain large subsets of the class,…

组合数学 · 数学 2015-09-07 David Bevan

We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…

In this work we obtain recurrent formulae for the number of permutations with either increasing or monotonic (i.e., both increasing and decreasing) runs of bounded length. Our formulae allow one to efficiently compute the number of such…

组合数学 · 数学 2013-02-25 Max A. Alekseyev

For a bilinear map $*:\mathbb R^d\times \mathbb R^d\to \mathbb R^d$ of nonnegative coefficients and a vector $s\in \mathbb R^d$ of positive entries, among an exponentially number of ways combining $n$ instances of $s$ using $n-1$…

离散数学 · 计算机科学 2021-04-22 Vuong Bui

The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the…

组合数学 · 数学 2024-06-11 Mathilde Bouvel , Lapo Cioni , Benjamin Izart

In this paper, we consider the moments of statistics on conjugacy classes of the colored permutation groups $\mathfrak{S}_{n,r}=\mathbb{Z}_r\wr \mathfrak{S}_n$. We first show that any fixed moment coincides on all conjugacy classes where…

组合数学 · 数学 2025-09-09 Jesse Campion Loth , Michael Levet , Kevin Liu , Sheila Sundaram , Mei Yin

Let $\beta > 1$ be a real number and $(\epsilon_1(x, \beta), \epsilon_2(x, \beta), \ldots)$ be the $\beta$-expansion of a point $x \in (0, 1]$. For all $x \in (0,1]$, let $A(D(x))$ be the set of accumulation points of $\frac{-\log_\beta…

动力系统 · 数学 2016-12-16 Lixuan Zheng , Min Wu , Bing Li

There is a well-known upper bound on the growth rate of the merge of two permutation classes. Curiously, there is no known merge for which this bound is not achieved. Using staircases of permutation classes, we provide sufficient conditions…

组合数学 · 数学 2016-08-26 Michael Albert , Jay Pantone , Vincent Vatter

We characterize which residue classes contain infinitely many totients (values of Euler's function) and which do not. We show that the union of all residue classes that are totient-free has asymptotic density 3/4, that is, almost all…

数论 · 数学 2020-05-06 Kevin Ford , Sergei Konyagin , Carl Pomerance

We study the first and second orders of the asymptotic expansion, as the dimension goes to infinity, of the moments of the Hilbert-Schmidt norm of a uniformly distributed matrix in the p-Schatten unit ball. We consider the case of matrices…

泛函分析 · 数学 2022-02-17 Benjamin Dadoun , Matthieu Fradelizi , Olivier Guédon , Pierre-André Zitt

We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…

It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.

组合数学 · 数学 2012-02-14 M. H. Albert , Micah Coleman , Ryan Flynn , Imre Leader

Green proved an arithmetic analogue of Szemer\'edi's celebrated regularity lemma and used it to verify a conjecture of Bergelson, Host, and Kra which sharpens Roth's theorem on three-term arithmetic progressions in dense sets. It shows that…

组合数学 · 数学 2017-08-30 Jacob Fox , Huy Tuan Pham

Fix a strong rectangulation pattern $P$ of size $L$. We show that the growth constant of the class of strong rectangulations avoiding $P$ is strictly smaller than $\Lambda =27/2$, the growth constant for all strong rectangulations. More…

组合数学 · 数学 2025-12-01 Kaoru Sano

We prove an explicit analogue of Legendre's conjecture for almost primes. Namely, for every integer $n \geq 1$, the interval $(n^2,(n+1)^2)$ contains an integer having at most $3$ prime factors, counted with multiplicity. This improves the…

数论 · 数学 2026-05-20 Peter J. Campbell

Let $\mathcal{A}$ be a finite set of $d\times d$ matrices with integer entries and let $m_n(\mathcal{A})$ be the maximum norm of a product of $n$ elements of $\mathcal{A}$. In this paper, we classify gaps in the growth of…

数论 · 数学 2014-10-22 Jason P. Bell , Michael Coons , Kevin G. Hare

We analyze the asymptotic extremal growth rate of the Betti numbers of clique complexes of graphs on n vertices not containing a fixed forbidden induced subgraph H. In particular, we prove a theorem of the alternative: for any H the growth…

组合数学 · 数学 2020-04-29 Karim Adiprasito , Eran Nevo , Martin Tancer

Let $S$ be a finite semigroup and let $A$ be a finite dimensional $S$-graded algebra. We investigate the exponential rate of growth of the sequence of graded codimensions $c_n^S(A)$ of $A$, i.e $\lim\limits_{n \rightarrow \infty}…

环与代数 · 数学 2018-05-14 Alexey Gordienko , Geoffrey Janssens , Eric Jespers

We prove the conjecture of A. Postnikov that (A) the number of regions in the inversion hyperplane arrangement associated with a permutation $w\in \Sn$ is at most the number of elements below $w$ in the Bruhat order, and (B) that equality…

组合数学 · 数学 2007-10-08 Axel Hultman , Svante Linusson , John Shareshian , Jonas Sjöstrand

A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…

组合数学 · 数学 2007-05-23 Terence Tao