中文
相关论文

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

200 篇论文

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…

群论 · 数学 2009-11-10 D. Goldfeld , A. Lubotzky , N. Nikolov , L. Pyber

For every finite quasisimple group of Lie type $G$, every irreducible character $\chi$ of $G$, and every element $g$ of $G$, we give an exponential upper bound for the character ratio $|\chi(g)|/\chi(1)$ with exponent linear in $\log_{|G|}…

表示论 · 数学 2024-03-15 Michael Larsen , Pham Huu Tiep

We are concerned with exploring the probabilities of first order statements for Galton-Watson trees with $Poisson(c)$ offspring distribution. Fixing a positive integer $k$, we exploit the $k$-move Ehrenfeucht game on rooted trees for this…

概率论 · 数学 2016-01-08 Moumanti Podder , Joel Spencer

We first introduce and derive some basic properties of a two-parameters family of one-sided Levy processes. Their Laplace exponents are given in terms of the Pochhammer symbol. This family includes, in a limit case, the family of Brownian…

概率论 · 数学 2007-12-10 P. Patie

Let $G$ be a finite group of order divisible by a prime $p$. The number of $p$-regular and $p'$-regular conjugacy classes of $G$ is at least $2\sqrt{p-1}$. Also, the number of $p$-rational and $p'$-rational irreducible characters of $G$ is…

群论 · 数学 2021-01-05 Nguyen Ngoc Hung , Attila Maroti

We partition in classes the set of matroids of fixed dimension on a fixed vertex set. In each class we identify two special matroids, respectively with minimal and maximal h-vector in that class. Such extremal matroids also satisfy a…

交换代数 · 数学 2012-12-17 Alexandru Constantinescu , Matteo Varbaro

It is a well-known conjecture, sometimes attributed to Frankl, that for any family of sets which is closed under the union operation, there is some element which is contained in at least half of the sets. Gilmer was the first to prove a…

组合数学 · 数学 2022-11-24 Luke Pebody

Let ${\cal T}$ be a rooted Galton-Watson tree with offspring distribution $\{p_k\}$ that has $p_0=0$, mean $m=\sum kp_k>1$ and exponential tails. Consider the $\lambda$-biased random walk $\{X_n\}_{n\geq 0}$ on ${\cal T}$; this is the…

概率论 · 数学 2007-05-23 Yuval Peres , Ofer Zeitouni

We give an improved algorithm for counting the number of $1324$-avoiding permutations, resulting in 5 further terms of the generating function. We analyse the known coefficients and find compelling evidence that unlike other classical…

组合数学 · 数学 2014-05-28 Andrew R Conway , Anthony J Guttmann

It is proved that the Weisfeiler-Leman dimension of the class of permutation graphs is at most 18. Previously it was only known that this dimension is finite (Gru{\ss}ien, 2017).

组合数学 · 数学 2023-05-26 Jin Guo , Alexander L. Gavrilyuk , Ilia Ponomarenko

We consider random permutations on $\Sn$ with logarithmic growing cycles weights and study asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables…

概率论 · 数学 2018-06-14 Nicolas Robles , Dirk Zeindler

The $\mathit{growth\ rate\ function}$ for a nonempty minor-closed class of matroids $\mathcal{M}$ is the function $h_{\mathcal{M}}(n)$ whose value at an integer $n \ge 0$ is defined to be the maximum number of elements in a simple matroid…

组合数学 · 数学 2014-10-29 Jim Geelen , Peter Nelson

We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.

组合数学 · 数学 2007-05-23 E. Rodney Canfield , Herbert S. Wilf

In 1907 M.Petrovitch initiated the study of a class of entire functions all whose finite sections are real-rooted polynomials. An explicit description of this class in terms of the coefficients of a series is impossible since it is…

经典分析与常微分方程 · 数学 2019-12-19 Vladimir Petrov Kostov , Boris Shapiro

Carlitz proved that, for any prime power q other than 2, the group of all permutations of the finite field F_q is generated by the permutations induced by degree-one polynomials and x^{q-2}. His proof relies on a remarkable polynomial which…

数论 · 数学 2016-03-04 Michael E. Zieve

For each proper minor-closed subclass $\cM$ of the $\GF(q^2)$-representable matroids containing all simple $\GF(q)$-representable matroids, we give, for all large $r$, a tight upper bound on the number of points in a rank-$r$ matroid in…

组合数学 · 数学 2011-05-23 Peter Nelson

The Horton-Strahler number -- also called the register function -- is a combinatorial tool that quantifies the branching complexity of a rooted tree. We study the law of the Horton-Strahler number of stable Galton-Watson trees conditioned…

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

In this paper, we study the following class of fractional Hamiltonian systems: \begin{eqnarray*} \begin{aligned}\displaystyle \left\{ \arraycolsep=1.5pt \begin{array}{ll} (-\Delta)^{\frac{1}{2}} u + u = \Big(I_{\mu_{1}}\ast G(v)\Big)g(v) \…

偏微分方程分析 · 数学 2022-09-27 Shengbing Deng , Junwei Yu

We study trivariate permutation polynomials over $\mathbb{F}_{2^{m}}$ extending two APN permutation families of Li--Kaleyski (IEEE Trans. Inform. Theory, 2024) by allowing the scalar parameter to vary over $\mathbb{F}_{2^m}^*$. For \[…

数论 · 数学 2026-03-17 Daniele Bartoli , Pantelimon Stanica

Some PARI programs have bringed out a property for the non-genus part of the class number of the imaginary quadratic fields, with respect to $(\sqrt D\,)^{\varepsilon}$, where $D$ is the absolute value of the discriminant and $\varepsilon…

数论 · 数学 2019-12-02 Georges Gras