中文
相关论文

相关论文: Restricted permutations, continued fractions, and …

200 篇论文

We survey the theory of increasing and decreasing subsequences of permutations. Enumeration problems in this area are closely related to the RSK algorithm. The asymptotic behavior of the expected value of the length is(w) of the longest…

组合数学 · 数学 2007-05-23 Richard P. Stanley

Circular permutations on {1,2,...,n} that avoid a given pattern correspond to ordinary (linear) permutations that end with n and avoid all cyclic rotations of the pattern. Three letter patterns are all but unavoidable in circular…

组合数学 · 数学 2007-05-23 David Callan

We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions…

数论 · 数学 2007-05-23 Moubariz Z. Garaev , Florian Luca , Igor E. Shparlinski

We use catalytic variables to derive generating functions for the permutation classes $Av(\textbf{4123},\textbf{1324})$, $Av(\textbf{4123},\textbf{1243})$, and $Av(\textbf{4123},\textbf{1342})$. Each generating function is algebraic of…

组合数学 · 数学 2016-10-07 Sam Miner

Let $q=4$ and $k$ a positive integer. In this short note, we present a class of permutation polynomials over $\Bbb F_{q^{3k}}$. We also present a generalization.

数论 · 数学 2018-05-17 Neranga Fernando

Say that a permutation of $1,2,\ldots,n$ is \textit{$k$-bounded} if every pair of consecutive entries in the permutation differs by no more than $k$. Such a permutation is \textit{anchored} if the first entry is $1$ and the last entry is…

组合数学 · 数学 2019-09-11 Maria M. Gillespie , Kenneth G. Monks , Kenneth M. Monks

In their study of cyclic pattern containment, Domagalski et al. conjecture differential equations for the generating functions of circular permutations avoiding consecutive patterns of length 3. In this note, we prove and significantly…

组合数学 · 数学 2021-07-13 Sergi Elizalde , Bruce Sagan

We generalize the classical theory of periodic continued fractions (PCFs) over ${\mathbf Z}$ to rings ${\mathcal O}$ of $S$-integers in a number field. Let ${\mathcal B}=\{\beta, {\beta^*}\}$ be the multi-set of roots of a quadratic…

数论 · 数学 2022-12-02 Bradley W. Brock , Noam D. Elkies , Bruce W. Jordan

We present fermionic sum representations of the characters $\chi^{(p,p')}_{r,s}$ of the minimal $M(p,p')$ models for all relatively prime integers $p'>p$ for some allowed values of $r$ and $s$. Our starting point is binomial (q-binomial)…

高能物理 - 理论 · 物理学 2009-10-28 Alexander Berkovich , Barry M. McCoy

We show that whenever $s>k(k+1)$, then for any complex sequence $(\mathfrak a_n)_{n\in \mathbb Z}$, one has $$\int_{[0,1)^k}\left| \sum_{|n|\le N}\mathfrak a_ne(\alpha_1n+\ldots +\alpha_kn^k) \right|^{2s}\,{\rm d}{\mathbf \alpha}\ll…

经典分析与常微分方程 · 数学 2024-07-01 Trevor D. Wooley

We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…

Legendre found that the continued fraction expansion of $\sqrt N$ having odd period leads directly to an explicit representation of $N$ as the sum of two squares. Similarly, it is shown here that the continued fraction expansion of $\sqrt…

数论 · 数学 2019-11-11 Michele Elia

Motivated by the product formula of the Chebyshev polynomials of the second kind $U_n(x)$, we newly introduce the partial Chebyshev polynomials $U^{\mathrm{e}}_n(x)$ and $U^{\mathrm{o}}_n(x)$ and derive their basic properties, relations to…

组合数学 · 数学 2025-04-02 Wojciech Młotkowski , Nobuaki Obata

In this paper we examine the subset of Farey fractions of order Q consisting of those fractions whose denominators are odd. In particular, we consider the frequencies of values of numerators of differences of consecutive elements in this…

数论 · 数学 2009-07-14 Alan K. Haynes

Let $f(x)\in\mathbb{Z}[x]$ be a nonconstant polynomial. Let $n, k$ and $c$ be integers such that $n\ge 1$ and $k\ge 2$. An integer $a$ is called an $f$-exunit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(f(a),n)=1$. In…

数论 · 数学 2021-08-03 Junyong Zhao , Shaofang Hong , Chaoxi Zhu

Legendre discovered that the continued fraction expansion of $\sqrt N$ having odd period leads directly to an explicit representation of $N$ as the sum of two squares. In this vein, it was recently observed that the continued fraction…

数论 · 数学 2021-03-30 Michele Elia

Evil-avoiding permutations, introduced by Kim and Williams in 2022, arise in the study of the inhomogeneous totally asymmetric simple exclusion process. Rectangular permutations, introduced by Chiriv\`i, Fang, and Fourier in 2021, arise in…

组合数学 · 数学 2024-10-17 Katherine Tung

Following a question of J. Cooper, we study the expected number of occurrences of a given permutation pattern $q$ in permutations that avoid another given pattern $r$. In some cases, we find the pattern that occurs least often, (resp. most…

组合数学 · 数学 2009-10-08 Miklos Bona

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…

组合数学 · 数学 2020-03-12 Robert Dorward

Following Mansour, let $S_n^{(r)}$ be the set of all coloured permutations on the symbols $1,2,...,n$ with colours $1,2,...,r$, which is the analogous of the symmetric group when r=1, and the hyperoctahedral group when r=2. Let…

组合数学 · 数学 2007-05-23 T. Mansour
‹ 上一页 1 8 9 10 下一页 ›