中文
相关论文

相关论文: Generalizations of two-stack-sortable permutations

200 篇论文

Let K be the product O(n_1) x O(n_2) x ... x O(n_r) of orthogonal groups. Let V the r-fold tensor product of defining representations of each orthogonal factor. We compute a stable formula for the dimension of the K-invariant algebra of…

表示论 · 数学 2012-09-25 Lauren Kelly Williams

The $k$-arrangements are permutations whose fixed points are $k$-colored. We prove enumerative results related to statistics and patterns on $k$-arrangements, confirming several conjectures by Blitvi\'c and Steingr\'imsson. In particular,…

组合数学 · 数学 2020-05-14 Shishuo Fu , Guo-Niu Han , Zhicong Lin

We prove that the class of permutations generated by passing an ordered sequence $12\dots n$ through a stack of depth 2 and an infinite stack in series is in bijection with an unambiguous context-free language, where a permutation of length…

组合数学 · 数学 2014-08-05 Murray Elder , Geoffrey Lee , Andrew Rechnitzer

We define a new class of generating function transformations related to polylogarithm functions, Dirichlet series, and Euler sums. These transformations are given by an infinite sum over the $j^{th}$ derivatives of a sequence generating…

组合数学 · 数学 2017-06-02 Maxie D. Schmidt

We derive a generating function for the number of integer compositions of $n$ into $k$ parts (i.e., $k$-compositions of $n$) with a given number of inversions, and obtain similar results for $k$-compositions of $n$ with a given number of…

综合数学 · 数学 2026-05-21 E. G. Santos

We define the operation of composing two hereditary classes of permutations using the standard composition of permutations as functions and we explore properties and structure of permutation classes considering this operation. We mostly…

组合数学 · 数学 2017-03-13 Mark Karpilovskij

We prove that the permutations of $\{1,\dots, n\}$ having an increasing (resp., decreasing) subsequence of length $n-r$ index a subset of the set of all $r$th Kronecker powers of $n \times n$ permutation matrices which is a basis for the…

组合数学 · 数学 2022-11-09 Stephen R. Doty

By using the matrix formulation of the two-step approach to distributions of patterns in random sequences, recurrence and explicit formulas for the generating functions of successions in random permutations of arbitrary multisets are…

组合数学 · 数学 2024-05-06 Yong Kong

Permutations in the image of the pop-stack operator are said to be pop-stacked. We give a polynomial-time algorithm to count pop-stacked permutations up to a fixed length and we use it to compute the first 1000 terms of the corresponding…

组合数学 · 数学 2019-08-26 Anders Claesson , Bjarki Ágúst Guðmundsson , Jay Pantone

We construct the R-operator -- solution of the Yang-Baxter equation acting in the tensor product of two infinite-dimensional representations of Faddeev's modular double. This R-operator intertwines the product of two L-operators associated…

数学物理 · 物理学 2015-06-17 D. Chicherin , S. Derkachov

Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We study generating functions for the number…

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

Closed-form generating functions for counting one-face rooted hypermaps with a known number of darts by number of vertices and edges is found, using matrix integral expressions relating to the reduced density operator of a bipartite quantum…

组合数学 · 数学 2015-01-28 Jacob P. Dyer

The stack sort algorithm has been the subject of extensive study over the years. In this paper we explore a generalized version of this algorithm where instead of avoiding a single decrease, the stack avoids a set $T$ of permutations. We…

组合数学 · 数学 2021-06-14 Katalin Berlow

We study involutive set-theoretic solutions of the Yang-Baxter equation of multipermutation level 2. These solutions happen to fall into two classes -- distributive ones and non-distributive ones. The distributive ones can be effectively…

量子代数 · 数学 2020-07-17 Přemysl Jedlička , Agata Pilitowska , Anna Zamojska-Dzienio

We determine all permutations in two large classes of polynomials over finite fields, where the construction of the polynomials in each class involves the denominators of a class of rational functions generalizing the classical Redei…

数论 · 数学 2023-05-11 Zhiguo Ding , Michael E. Zieve

Let $k \geq 2$ be an integer. We prove that factorization of integers into $k$ parts follows the Dirichlet distribution $\text{Dir}\left(\frac{1}{k},\ldots,\frac{1}{k}\right)$ by multidimensional contour integration, thereby generalizing…

数论 · 数学 2023-08-31 Sun-Kai Leung

Starting with a k-linear or DG category admitting a (homotopy) Serre functor, we construct a k-linear or DG 2-category categorifying the Heisenberg algebra of the numerical K-group of the original category. We also define a 2-categorical…

代数几何 · 数学 2025-10-23 Ádám Gyenge , Clemens Koppensteiner , Timothy Logvinenko

A ballot permutation is a permutation $\pi$ such that in any prefix of $\pi$ the descent number is not more than the ascent number. By using a reversal concatenation map, we give a formula for the joint distribution (pk, des) of the peak…

组合数学 · 数学 2020-09-16 David G. L. Wang , T. Zhao

We give a Pieri-type formula for the sum of $K$-$k$-Schur functions $\sum_{\mu\le\lambda} g^{(k)}_{\mu}$ over a principal order ideal of the poset of $k$-bounded partitions under the strong Bruhat order, which sum we denote by…

组合数学 · 数学 2018-05-08 Motoki Takigiku

The dual stable Grothendieck polynomials are a deformation of the Schur functions, originating in the study of the K-theory of the Grassmannian. We generalize these polynomials by introducing a countable family of additional parameters, and…

组合数学 · 数学 2020-09-29 Pavel Galashin , Darij Grinberg , Gaku Liu