English
Related papers

Related papers: Pattern avoidance and quasisymmetric functions

200 papers

We introduce two families of symmetric functions generalizing the factorial Schur $P$- and $Q$- functions due to Ivanov. We call them $K$-theoretic analogues of factorial Schur $P$- and $Q$- functions. We prove various combinatorial…

Combinatorics · Mathematics 2013-05-27 Takeshi Ikeda , Hiroshi Naruse

We introduce new families of cylindric symmetric functions as subcoalgebras in the ring of symmetric functions $\Lambda$ (viewed as a Hopf algebra) which have non-negative structure constants. Combinatorially these cylindric symmetric…

Combinatorics · Mathematics 2019-07-05 Christian Korff , David Palazzo

We define an S function as the sum of the asymptotic error terms of digamma function of an arithmetic series, $S(a) \equiv \sum_{n=1}^\infty \left[\ln\frac{n}{a} - \frac{a}{2n}-\psi\left(\frac{n}{a}\right)\right]$, and show a few properties…

General Mathematics · Mathematics 2023-04-04 Zhiqi Huang

This work highlights the existence of partial symmetries in large families of iterated plethystic coefficients. The plethystic coefficients involved come from the expansion in the Schur basis of iterated plethysms of Schur functions indexed…

Combinatorics · Mathematics 2023-05-31 Álvaro Gutiérrez , Mercedes H. Rosas

We consider a random permutation drawn from the set of 321-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{m+\ell}$ where $m$ is the…

Probability · Mathematics 2017-12-22 Svante Janson

Drawing on a problem posed by Hertzsprung in 1887, we say that a given permutation $\pi\in\mathcal{S}_n$ contains the Hertzsprung pattern $\sigma\in\mathcal{S}_k$ if there is factor $\pi(d+1)\pi(d+2)\cdots\pi(d+k)$ of $\pi$ such that…

Combinatorics · Mathematics 2021-04-08 Anders Claesson

It is known that there is no finitely presented group for which the Dehn function lies asymptotically strictly between linear and quadratic functions. This work presents an example of a semigroup that has Dehn function equivalent to $n \log…

Group Theory · Mathematics 2024-04-29 Roman Repeev

It is known that differences of symmetric functions corresponding to various bases are nonnegative on the nonnegative orthant exactly when the partitions defining them are comparable in dominance order. The only exception is the case of…

Combinatorics · Mathematics 2020-11-18 Alexander Heaton , Isabelle Shankar

In this paper, we give a formula for the number of permutations that avoid the split patterns $3|12$ and $23|1$ with respect to a position $r$. Such permutations count the number of Schubert varieties for which the projection map from the…

Combinatorics · Mathematics 2024-02-28 Travis Grigsby , Edward Richmond

Let S be a subset of the unit disk, and let F(s) denote the class of completely multiplicative functions f such that f(p) is in S for all primes p. The authors' main concern is which numbers arise as mean-values of functions in F(s). More…

Number Theory · Mathematics 2016-09-07 Andrew Granville , K. Soundararajan

Let FI denote the category whose objects are the sets $[n] = \{1,\ldots, n\}$, and whose morphisms are injections. We study functors from the category FI into the category of sets. We write $\mathfrak{S}_n$ for the symmetric group on $[n]$.…

Combinatorics · Mathematics 2018-04-16 Eric Ramos , David Speyer , Graham White

We consider asymptotics of set partition pattern avoidance in the sense of Klazar. One of the results of this paper extends work of Alweiss, and finds a classification for set partitions $\pi$ such that the number of set partitions of $[n]$…

Combinatorics · Mathematics 2019-06-25 Benjamin Gunby

Let $A_k$ be the set of permutations in the symmetric group $S_k$ with prefix 12. This paper concerns the enumeration of involutions which avoid the set of patterns $A_k$. We present a bijection between symmetric Schroder paths of length…

Combinatorics · Mathematics 2008-10-30 Eva Y. P. Deng , Mark Dukes , Toufik Mansour , Susan Y. J. Wu

We introduce new bases for the Hopf algebra of quasisymmetric functions that refine the symmetric powersum basis. These bases are expanded in terms of quasisymmetric monomial functions by using fillings of matrices. We define the analog of…

Combinatorics · Mathematics 2021-12-28 Anthony Lazzeroni

We prove Stanley's conjecture that, if delta_n is the staircase shape, then the skew Schur functions s_{delta_n / mu} are non-negative sums of Schur P-functions. We prove that the coefficients in this sum count certain fillings of shifted…

Combinatorics · Mathematics 2011-08-11 Federico Ardila , Luis G. Serrano

Let $Gr(k,n)$ be the Pl\"ucker embedding of the Grassmann variety of projective $k$-planes in $\P n$. For a projective variety $X$, let $\sigma_s(X)$ denote the variety of its $s-1$ secant planes. More precisely, $\sigma_s(X)$ denotes the…

Algebraic Geometry · Mathematics 2009-01-20 Hirotachi Abo , Giorgio Ottaviani , Chris Peterson

In the present paper we suggest a construction of symmetric functionals on a large class of symmetric spaces over a semifinite von Neumann algebra. This approach establishes a bijection between the symmetric functionals on symmetric spaces…

Operator Algebras · Mathematics 2024-04-23 Galina Levitina , Alexandr Usachev

A consecutive pattern in a permutation $\pi$ is another permutation $\sigma$ determined by the relative order of a subsequence of contiguous entries of $\pi$. Traditional notions such as descents, runs and peaks can be viewed as particular…

Combinatorics · Mathematics 2015-10-23 Sergi Elizalde

We study the relationship between two notions of pattern avoidance for involutions in the symmetric group and their restriction to fixed-point-free involutions. The first is classical, while the second appears in the geometry of certain…

Combinatorics · Mathematics 2022-03-01 Jonathan J. Fang , Zachary Hamaker , Justin M. Troyka

We study additive properties of the set $S$ of bijections (or permutations) $\{1,\dots,n\}\to G$, thought of as a subset of $G^n$, where $G$ is an arbitrary abelian group of order $n$. Our main result is an asymptotic for the number of…

Combinatorics · Mathematics 2017-04-11 Sean Eberhard