中文
相关论文

相关论文: Permutation classes of every growth rate above 2.4…

200 篇论文

Let $\cM$ be a minor-closed class of matroids that does not contain arbitrarily long lines. The growth rate function, $h:\bN\rightarrow \bN$ of $\cM$ is given by $$h(n) = \max(|M|\, : \, M\in \cM, simple, rank-$n$).$$ The Growth Rate…

组合数学 · 数学 2011-11-01 Jim Geelen , Peter Nelson

We prove that the excedance relation on permutations defined by N. Bergeron and L. Gagnon actually extends to a congruence of the lattice on alternating sign matrices. Motivated by this example, we study all lattice congruences of the…

组合数学 · 数学 2026-02-23 Florent Hivert , Vincent Pilaud , Ludovic Schwob

We study the iteration of the process "a particle jumps to the right" in permutations. We prove that the set of permutations obtained in this model after a given number of iterations from the identity is a class of pattern avoiding…

离散数学 · 计算机科学 2023-06-22 Cyril Banderier , Jean-Luc Baril , Céline Moreira Dos Santos

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

Let $\mathcal D_n$ denote the average number of iterations of West's stack-sorting map $s$ that are needed to sort a permutation in $S_n$ into the identity permutation $123\cdots n$. We prove that…

组合数学 · 数学 2020-09-29 Colin Defant

We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…

概率论 · 数学 2020-07-01 Jacopo Borga , Mathilde Bouvel , Valentin Féray , Benedikt Stufler

In this paper, we construct some new classes of complete permutation monomials with exponent $d=\frac{q^n-1}{q-1}$ using AGW criterion (a special case). This proves two recent conjectures in [Wuetal2] and extends some of these recent…

数论 · 数学 2017-08-24 Xiutao Feng , Dongdai Lin , Liping Wang , Qiang Wang

The concept of pattern avoidance respectively containment in permutations can be extended to permutations on multisets in a straightforward way. In this note we present a direct proof of the already known fact that the well-known…

组合数学 · 数学 2013-06-24 Marie-Louise Bruner

We generalize bounds of Liu-Wan-Xiao for slopes in eigencurves for definite unitary groups of rank $2$ to slopes in eigenvarieties for definite unitary groups of any rank. We show that for a definite unitary group of rank $n$, the Newton…

数论 · 数学 2020-06-03 Lynnelle Ye

The Horton-Strahler number, also known as the register function, provides a tool for quantifying the branching complexity of a rooted tree. We consider the Horton-Strahler number of critical Galton-Watson trees conditioned to have size $n$…

概率论 · 数学 2025-10-22 Robin Khanfir

We determine all permutation polynomials over F_{q^2} of the form X^r A(X^{q-1}) where, for some Q which is a power of the characteristic of F_q, the integer r is congruent to Q+1 (mod q+1) and all terms of A(X) have degrees in {0, 1, Q,…

数论 · 数学 2022-03-09 Zhiguo Ding , Michael E. Zieve

The Cohen-Lenstra-Martinet heuristics lead one to conjecture that the average size of the $p$-torsion in class groups of $G$-extensions of a number field is finite. In a 2021 paper, Lemke Oliver, Wang, and Wood proved this conjecture in the…

数论 · 数学 2024-08-08 Jonas Iskander , Hari R. Iyer

We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…

组合数学 · 数学 2007-05-23 Sophie Huczynska , Vincent Vatter

We show that the least exponential growth of counting functions which admits uncountably many closed permutation classes lies between 2^n and (2.33529...)^n.

组合数学 · 数学 2007-05-23 Martin Klazar

The generating polynomial of permutations of size $n$, counted by the number of alternating runs, has a root at $-1$ of multiplicity $\lfloor (n-2)/2 \rfloor$ for all $n \ge 2$. This result can be derived by combining the David--Barton…

组合数学 · 数学 2025-12-16 Qiongqiong Pan , Yunze Wang , Jiang Zeng

For about 10 years, the classification of permutation patterns was thought completed up to length 6. In this paper, we establish a new class of Wilf-equivalent permutation patterns, namely, (n-1,n-2,n,tau)~(n-2,n,n-1,tau) for any tau in…

组合数学 · 数学 2007-05-23 Zvezdelina Stankova-Frenkel , Julian West

We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permutations avoiding the pattern 1324, and an improved upper bound of 13.5. These results depend on a new exact structural characterisation of…

组合数学 · 数学 2019-05-13 David Bevan , Robert Brignall , Andrew Elvey Price , Jay Pantone

We consider the simple random walk on Galton-Watson trees with supercritical offspring distribution, conditioned on non-extinction. In case the offspring distribution has finite support, we prove an upper bound for the annealed return…

概率论 · 数学 2025-01-22 Peter Müller , Jakob Stern

If a real polynomial $f(x)=p(x^2)+xq(x^2)$ is Hurwitz stable (every root if $f$ lies in the open left half-plane), then the Hermite-Biehler Theorem says that the polynomials $p(-x^2)$ and $q(-x^2)$ have interlacing real roots. We extend…

经典分析与常微分方程 · 数学 2017-01-30 Richard Ellard , Helena Šmigoc

In this paper we use the Klazar-Marcus-Tardos method to prove that if a hereditary property of partitions P has super-exponential speed, then for every k-permutation pi, P contains the partition of [2k] with parts {i, pi(i) + k}, where 1 <=…

组合数学 · 数学 2007-05-23 József Balogh , Béla Bollobás , Robert Morris