中文
相关论文

相关论文: Alternating permutations and symmetric functions

200 篇论文

The objects of our interest are the so-called $A$-permutations, which are permutations whose cycle length lie in a fixed set $A$. They have been extensively studied with respect to the uniform or the Ewens measure. In this paper, we extend…

概率论 · 数学 2013-02-26 Ashkan Nikeghbali , Julia Storm , Dirk Zeindler

A permutation is said to be \emph{alternating} if it starts with rise and then descents and rises come in turn. In this paper we study the generating function for the number of alternating permutations on $n$ letters that avoid or contain…

组合数学 · 数学 2007-05-23 T. Mansour

The graph of overlapping permutations is a directed graph that is an analogue to the De Bruijn graph. It consists of vertices that are permutations of length $n$ and edges that are permutations of length $n+1$ in which an edge $a_1\cdots…

组合数学 · 数学 2016-09-09 John Asplund , N. Bradley Fox

We consider the $q$th root number function for the symmetric group. Our aim is to develop an asymptotic formula for the multiplicities of the $q$th root number function as $q$ tends to $\infty$. We use character theory, number theory and…

群论 · 数学 2017-10-30 Stefan-Christoph Virchow

This paper develops an analogy between the cycle structure of, on the one hand, random permutations with cycle lengths restricted to lie in an infinite set $S$ with asymptotic density $\sigma$ and, on the other hand, permutations selected…

组合数学 · 数学 2009-08-07 Michael Lugo

The goal of this paper is to count the number of distinct functions of n variables, up to permutation of the variables, that can be constructed using each variable exactly once, without constants, using only the operations of addition,…

组合数学 · 数学 2026-02-24 Boaz Cohen

For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation \sigma \in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \lfloor \sqrt{2k-3} \rfloor + e_k, where e_k \in {-1,0} for…

组合数学 · 数学 2012-06-12 Peter Hegarty

Based on a determinantal formula for the higher derivative of a quotient of two functions, we first present the determinantal expressions of Eulerian polynomials and Andre polynomials. In particular, we discover that the Euler number…

组合数学 · 数学 2024-12-20 Shi-Mei Ma , Hong Bian , Jun-Ying Liu , Jean Yeh , Yeong-Nan Yeh

In this paper, we take interest in finding applications for a hook-length formula recently proved in (Morales Pak Panova 2016). This formula can be applied to give a non trivial relation between alternating permutations and weighted Dyck…

组合数学 · 数学 2019-04-18 Lucas Randazzo

We study the number of values taken by the sums $\sum_{i=u}^{v-1} a_i$, where $a_1,a_2,\dots,a_n$ is a permutation of $1,2,\dots,n$ and $1 \leq u < v \leq n+1$. In particular, we show that for a random choice of a permutation, with high…

组合数学 · 数学 2021-08-31 Jakub Konieczny

W-transforms are introduced as uniformity-preserving univariate transformations on the unit interval induced by distribution functions and piecewise strictly monotone functions, and their properties are investigated. When applied…

统计方法学 · 统计学 2025-10-01 Marius Hofert , Zhiyuan Pang

The two linearly independent solutions of the three-term recurrence relation of the associated Askey-Wilson polynomials, found by Ismail and Rahman in [22], are slightly modified so as to make it transparent that these functions satisfy a…

量子代数 · 数学 2012-04-25 Luc Haine , Plamen Iliev

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

组合数学 · 数学 2008-01-29 Joshua Cooper , Andrew Petrarca

We prove a general alternate circular summation formula of theta functions, which implies a great deal of theta-function identities. In particular, we recover several identities in Ramanujan's Notebook from this identity. We also obtain two…

组合数学 · 数学 2021-06-29 Jun-Ming Zhu

Symmetric functions provide one of the most efficient tools for combinatorial enumeration, in the context of objects that may be acted upon by permutations. Only assuming a basic knowledge of linear algebra, we introduce and describe the…

组合数学 · 数学 2021-12-21 François Bergeron

We give estimates for the convolution product of an arbitrary number of endlessly continuable functions. This allows us to deal with nonlinear operations for the corresponding resurgent series, e.g. substitution into a convergent power…

动力系统 · 数学 2016-09-07 Shingo Kamimoto , David Sauzin

In this paper, we obtain some formulas for double nonlinear Euler sums involving harmonic numbers and alternating harmonic numbers. By using these formulas, we give new closed form sums of several quadratic Euler series through Riemann zeta…

数论 · 数学 2017-01-16 Ce Xu

The RSK correspondence is a bijection between permutations and pairs of standard Young tableaux with identical shape, where the tableaux are commonly denoted $P$ (insertion) and $Q$ (recording). It has been an open problem to demonstrate $$…

In this paper, we study the alternating Euler $T$-sums and $\S$-sums, which are infinite series involving (alternating) odd harmonic numbers, and have similar forms and close relations to the Dirichlet beta functions. By using the method of…

数论 · 数学 2022-04-13 Ce Xu , Weiping Wang

We consider the compound decision problem of estimating a vector of $n$ parameters, known up to a permutation, corresponding to $n$ independent observations, and discuss the difference between two symmetric classes of estimators. The first…

统计理论 · 数学 2008-02-12 Eitan Greenshtein , Ya'acov Ritov