中文
相关论文

相关论文: Alternating permutations and symmetric functions

200 篇论文

We establish some identities of Euler related sums. By using these identities, we discuss the closed form representations of sums of harmonic numbers and reciprocal parametric binomial coefficients through parametric harmonic numbers,…

数论 · 数学 2022-07-29 Junjie Quan , Ce Xu , Xixi Zhang

In order to study signed Eulerian numbers, we introduce permutations of a particular type, called parity-alternate permutations, because they take even and odd entries alternately. The objective of this paper is twofold. The first is to…

组合数学 · 数学 2007-05-23 Shinji Tanimoto

The study of pattern containment and avoidance for linear permutations is a well-established area of enumerative combinatorics. A cyclic permutation is the set of all rotations of a linear permutation. Callan initiated the study of…

We study the symmetry/asymmetry of functions providing sharp constants in the embedding theorems ${\stackrel{\circ}{W}}\vphantom{W}_2^r(-1,1)\hookrightarrow{\stackrel{\circ}{W}}\vphantom{W}_\infty^k(-1,1)$ for various $r$ and $k$. The sharp…

经典分析与常微分方程 · 数学 2014-08-19 E. V. Mukoseeva , A. I. Nazarov

We investigate properties of a multivariate function $E(m_1,m_2,...,m_r)$, called {\it orbicyclic}, that arises in enumerative combinatorics in counting non-isomorphic maps on orientable surfaces. $E(m_1,m_2,...,m_r)$ proves to be…

数论 · 数学 2010-03-17 Valery A. Liskovets

We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized…

数论 · 数学 2013-09-02 Kathrin Bringmann , Karl Mahlburg

We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…

数值分析 · 数学 2010-04-22 Richard P. Brent

We develop various aspects of classical enumerative geometry, including Euler characteristics and formulas for counting degenerate fibres in a pencil, with the classical numerical formulas being replaced by identitites in the…

代数几何 · 数学 2021-04-07 Marc Levine

In this paper we investigate a class of (d+1) dimensional cosmological models with a cosmological constant possessing an R^d simply transitive symmetry group and show that it can be written in a form that manifests the effect of a…

广义相对论与量子宇宙学 · 物理学 2015-06-25 Sigbjorn Hervik

An alternating sign matrix is a square matrix with entries 1, 0 and -1 such that the sum of the entries in each row and each column is equal to 1 and the nonzero entries alternate in sign along each row and each column. To some of the…

组合数学 · 数学 2007-05-23 Soichi Okada

In order to better fit real-world datasets, studying asymmetric distribution is of great interest. In this work, we derive several mathematical properties of a general class of asymmetric distributions with positive support which shows up…

Symmetric elliptic integrals, which have been used as replacements for Legendre's integrals in recent integral tables and computer codes, are homogeneous functions of three or four variables. When some of the variables are much larger than…

经典分析与常微分方程 · 数学 2016-09-06 Bille C. Carlson , John L. Gustafson

We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…

表示论 · 数学 2015-12-22 Vadim Gorin , Greta Panova

Recently Richard Stanley initiated a study of the distribution of the length as(w) of the longest alternating subsequence in a random permutation w from the symmetric group $S_n$. Among other things he found an explicit formula for the…

组合数学 · 数学 2007-05-23 Harold Widom

We calculate the large deviations for the length of the longest alternating subsequence and for the length of the longest increasing subsequence in a uniformly random permutation that avoids a pattern of length three. We treat all six…

概率论 · 数学 2023-09-04 Ross G. Pinsky

In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…

组合数学 · 数学 2015-04-10 Shi-Mei Ma , Yeong-Nan Yeh

We study the r-th elementary symmetric polynomial in $n$ variables with 2<r<n. There are two kinds of linear transformations on the parameter space that leave this polynomial invariant: Namely, any permutation of the variables and…

交换代数 · 数学 2016-07-29 Jesko Hüttenhain

We initiate the study of limit shapes for random permutations avoiding a given pattern. Specifically, for patterns of length 3, we obtain delicate results on the asymptotics of distributions of positions of numbers in the permutations. We…

组合数学 · 数学 2013-12-02 Sam Miner , Igor Pak

Starting from some considerations we make about the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that…

组合数学 · 数学 2007-05-23 Astrid Reifegerste

This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…

组合数学 · 数学 2016-11-10 Robertas Petuchovas