中文
相关论文

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

200 篇论文

Let $q>2$ be a prime power and $f={\tt x}^{q-2}+t{\tt x}^{q^2-q-1}$, where $t\in\Bbb F_q^*$. It was recently conjectured that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following holds: (i) $t=1$, $q\equiv…

数论 · 数学 2012-10-03 Xiang-dong Hou

Geometric grid classes and the substitution decomposition have both been shown to be fundamental in the understanding of the structure of permutation classes. In particular, these are the two main tools in the recent classification of…

组合数学 · 数学 2012-02-10 Michael H. Albert , Nik Ruskuc , Vincent Vatter

The well-known Landau's theorem states that, for any positive integer $k$, there are finitely many isomorphism classes of finite groups with exactly $k$ (conjugacy) classes. We study variations of this theorem for $p$-regular classes as…

群论 · 数学 2015-03-27 Alexander Moreto , Hung Ngoc Nguyen

The exponential growth rate of non polynomially growing subgroups of $GL_d$ is conjectured to admit a uniform lower bound. This is known for non-amenable subgroups, while for amenable subgroups it is known to imply the Lehmer conjecture…

经典分析与常微分方程 · 数学 2022-08-25 Emmanuel Breuillard , Péter P. Varjú

We introduce a new invariant of finitely generated groups, the ambiguity function, and prove that every finitely generated acylindrically hyperbolic group has a linearly bounded ambiguity function. We use this result to prove that the…

群论 · 数学 2020-10-14 Eduard Schesler

(Work in progress) Marcus and Tardos \cite{MarcusTardos2004} proved the Stanley--Wilf conjecture by reducing pattern avoidance to an extremal problem on $0$--$1$ matrices. We give a parallel proof for classical permutation patterns that…

组合数学 · 数学 2025-12-16 Reza Rastegar

Recently, Gross et al. posed the LLC conjecture for the locally log-concavity of the genus distribution of every graph, and provided an equivalent combinatorial version, the CLLC conjecture, on the log-concavity of the generating function…

组合数学 · 数学 2015-11-11 Jonathan L. Gross , Toufik Mansour , Thomas W. Tucker , David G. L. Wang

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

We prove bounds for the absolute sum of all level-$k$ Fourier coefficients for $(-1)^{p(x)}$, where polynomial $p:\mathbf{F}_2^n \to \mathbf{F}_2$ is of degree $1$ or degree $2$.

数论 · 数学 2026-02-27 Lars Becker , Joseph Slote , Alexander Volberg , Haonan Zhang

We present two iterative methods for computing the global and partial extinction probability vectors for Galton-Watson processes with countably infinitely many types. The probabilistic interpretation of these methods involves truncated…

概率论 · 数学 2014-03-06 Sophie Hautphenne , Guy Latouche , Giang Nguyen

The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…

组合数学 · 数学 2016-04-18 Jim Geelen , Peter Nelson

We introduce the notion of a hereditary property for rooted real trees and we also consider reduction of trees by a given hereditary property. Leaf-length erasure, also called trimming, is included as a special case of hereditary reduction.…

概率论 · 数学 2012-11-12 Thomas Duquesne , Matthias Winkel

Motivated by the recent proof of the Stanley-Wilf conjecture, we study the asymptotic behavior of the number of permutations avoiding a generalized pattern. Generalized patterns allow the requirement that some pairs of letters must be…

组合数学 · 数学 2007-05-23 Sergi Elizalde

We consider Cantor measures on the line, with contraction factor $N^{-1}=p^{-\alpha}$ (where $p$ a positive prime, $\alpha$ a positive integer) and $m$ positive integer digits lying in distinct residue classes modulo $N$. We obtain a…

经典分析与常微分方程 · 数学 2026-05-19 Leandro Zuberman

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

组合数学 · 数学 2014-06-11 Tewodros Amdeberhan , Victor H. Moll

One method to generate random permutations involves using Gaussian elimination with partial pivoting (GEPP) on a random matrix $A$ and storing the permutation matrix factor $P$ from the resulting GEPP factorization $PA=LU$. We are…

概率论 · 数学 2024-11-19 John Peca-Medlin , Chenyang Zhong

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

数论 · 数学 2022-11-18 Jared Duker Lichtman

We consider sequences of random variables whose probability generating functions are polynomials all of whose roots lie on the unit circle. The distribution of such random variables has only been sporadically studied in the literature. We…

概率论 · 数学 2013-01-11 Hsien-Kuei Hwang , Vytas Zacharovas

We construct a new infinite family of pairs of imaginary cyclic fields of degree $(p-1)/2$ explicitly with both class numbers divisible by a given prime number $p$. For the proof, we use the fundamental unit of $\mathbb Q(\sqrt{p})$,…

数论 · 数学 2018-09-24 Miho Aoki , Yasuhiro Kishi

We study two related probabilistic models of permutations and trees biased by their number of descents. Here, a descent in a permutation $\sigma$ is a pair of consecutive elements $\sigma(i), \sigma(i+1)$ such that $\sigma(i) >…

概率论 · 数学 2023-12-19 Paul Thévenin , Stephan Wagner