English
Related papers

Related papers: Pattern avoidance and quasisymmetric functions

200 papers

Snakes are analogues of alternating permutations defined for any Coxeter group. We study these objects from the point of view of combinatorial Hopf algebras, such as noncommutative symmetric functions and their generalizations. The main…

Combinatorics · Mathematics 2013-02-12 Matthieu Josuat-Vergès , Jean-Christophe Novelli , Jean-Yves Thibon

We study classes of set partitions determined by the avoidance of multiple patterns, applying a natural notion of partition containment that has been introduced by Sagan. We say that two sets S and T of patterns are equivalent if for each…

Combinatorics · Mathematics 2013-01-30 Vít Jelínek , Toufik Mansour , Mark Shattuck

We investigate the notion of almost avoiding a permutation: $\pi$ almost avoids $\beta$ if one can remove a single entry from $\pi$ to obtain a $\beta$-avoiding permutation.

Combinatorics · Mathematics 2020-07-31 Robert Brignall , Shalosh B. Ekhad , Rebecca Smith , Vince Vatter

We introduce dual Hopf algebras which simultaneously combine the concepts of the k-Schur function theory with the quasi-symmetric Schur function theory. We construct dual basis of these Hopf algebras with remarkable properties.

Combinatorics · Mathematics 2012-05-11 Chris Berg , Luis Serrano

We construct subsets of Euclidean space of large Hausdorff dimension and full Minkowski dimension that do not contain nontrivial patterns described by the zero sets of functions. The results are of two types. Given a countable collection of…

Classical Analysis and ODEs · Mathematics 2018-04-18 Robert Fraser , Malabika Pramanik

Chung and Graham define quasirandom subsets of $\mathbb{Z}_n$ to be those with any one of a large collection of equivalent random-like properties. We weaken their definition and call a subset of $\mathbb{Z}_n$ $\epsilon$-balanced if its…

Combinatorics · Mathematics 2007-05-23 Joshua N. Cooper

We extend the reciprocity method of Jones and Remmel to study generating functions of the form $$\sum_{n \geq 0} \frac{t^n}{n!} \sum_{\sigma \in \mathcal{NM}_n(\Gamma)}x^{\mathrm{LRmin}(\sigma)}y^{1+\mathrm{des}(\sigma)}$$ where $\Gamma$ is…

Combinatorics · Mathematics 2015-10-16 Quang T. Bach , Jeffrey B. Remmel

Shallow permutations were defined in 1977 to be those that satisfy the lower bound of the Diaconis-Graham inequality. Recently, there has been renewed interest in these permutations. In particular, Berman and Tenner showed they satisfy…

Combinatorics · Mathematics 2025-01-30 Kassie Archer , Aaron Geary , Robert P. Laudone

We consider a parameter dependent ensemble of two real random matrices with Gaussian distribution. It describes the transition between the symmetry class of the chiral Gaussian orthogonal ensemble (Cartan class B$|$DI) and the ensemble of…

Mathematical Physics · Physics 2019-02-14 Gernot Akemann , Mario Kieburg , Adam Mielke , Pedro Vidal

We consider the expansion of the square of a complete homogeneous function $h_\lambda$, or of an elementary symmetric function $e_\lambda$, in the basis of Schur functions. This square also decomposes into two plethysms, $s_2[h_\lambda]$…

Combinatorics · Mathematics 2022-03-17 Florence Maas-Gariépy , Étienne Tétreault

This paper builds on two covering Hopf algebras of the Hopf algebra QSym of quasi-symmetric functions, with linear bases parameterized by compositions. One is the Malvenuto-Reutenauer Hopf algebra SSym of permutations, mapped onto QSym by…

Combinatorics · Mathematics 2020-10-22 Li Guo , Jean-Yves Thibon , Houyi Yu

We construct a non-commutative, non-cocommutative, graded bialgebra $\mathbf{\Pi}$ with a basis indexed by the permutations in all finite symmetric groups. Unlike the formally similar Malvenuto-Poirier-Reutenauer Hopf algebra, this…

Combinatorics · Mathematics 2020-05-07 Eric Marberg

Non-crossing and non-nesting permutations are variations of the well-known Stirling permutations. A permutation $\pi$ on $\{1,1,2,2,\ldots, n,n\}$ is called non-crossing if it avoids the crossing patterns $\{1212,2121\}$ and is called…

Combinatorics · Mathematics 2025-05-12 Kassie Archer , Robert P. Laudone

FPSAC 2013 Extended Abstract. We introduce a new basis of the non-commutative symmetric functions whose elements have Schur functions as their commutative images. Dually, we build a basis of the quasi-symmetric functions which expand…

Combinatorics · Mathematics 2013-03-21 Chris Berg , Nantel Bergeron , Franco Saliola , Luis Serrano , Mike Zabrocki

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…

Combinatorics · Mathematics 2007-05-23 David Callan

We introduce a family of quasisymmetric functions called {\em Eulerian quasisymmetric functions}, which have the property of specializing to enumerators for the joint distribution of the permutation statistics, major index and excedance…

Combinatorics · Mathematics 2008-05-19 John Shareshian , Michelle L. Wachs

Quasisymmetric functions in superspace were introduced as a natural extension of classical quasisymmetric functions involving both commuting and anticommuting variables. In this paper, we first provide a characterization of the algebra of…

Combinatorics · Mathematics 2026-04-09 Diego Arcis , Camilo González , Sebastián Márquez

In the Hopf algebra of symmetric functions, Sym, the basis of Schur functions is distinguished since every Schur function is isomorphic to an irreducible character of a symmetric group under the Frobenius characteristic map. In this note we…

Combinatorics · Mathematics 2014-01-30 Stephanie van Willigenburg

We introduce a family of quasisymmetric functions called {\em Eulerian quasisymmetric functions}, which specialize to enumerators for the joint distribution of the permutation statistics, major index and excedance number on permutations of…

Combinatorics · Mathematics 2010-08-24 John Shareshian , Michelle L. Wachs

We investigate pairs of permutations $F,G$ of $\mathbb{F}_{p^n}$ such that $F(x+a)-G(x)$ is a permutation for every $a\in\mathbb{F}_{p^n}$. We show that necessarily $G(x) = \wp(F(x))$ for some complete mapping $-\wp$ of $\mathbb{F}_{p^n}$,…

Information Theory · Computer Science 2022-12-27 Nurdagul Anbar , Tekgul Kalyci , Wilfried Meidl , Constanza Riera , Pantelimon Stanica