相关论文: Modified Growth Diagrams, Permutation Pivots, and …

Laguerre histories (restricted or not) are certain weighted Motzkin paths with two types of level steps. They are, on one hand, in natural bijection with the set of permutations, and on the other hand, yield combinatorial interpretations…

The sort transform (ST) is a modification of the Burrows-Wheeler transform (BWT). Both transformations map an arbitrary word of length n to a pair consisting of a word of length n and an index between 1 and n. The BWT sorts all rotation…

We extend Fourier analysis to curved spaces by defining a Generalized Fourier Transform (GFT) on any Riemannian manifold $\Sigma$ via spectral decomposition. Under minimal requirements that the transform is an isometric isomorphism and has…

We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…

A conjecture by Deutsch, Kitaev, and Remmel states that the triples of permutation statistics $(S_{10}, S_{12}, S_{17})$ and $(S_{12}, S_{10} ,S_{17})$ are equidistributed over the symmetric group $\mathfrak{S}_n$. Here, $S_{10}$ enumerates…

We construct the Gromov-Witten invariants of moduli of stable morphisms to $\Pf$ with fields. This is the all genus mathematical theory of the Guffin-Sharpe-Witten model, and is a modified twisted Gromov-Witten invariants of $\Pf$. These…

Set partitions avoiding $k$-crossing and $k$-nesting have been extensively studied from the aspects of both combinatorics and mathematical biology. By using the generating tree technique, the obstinate kernel method and Zeilberger's…

This paper proves coherence results for categories with a natural transformation called \emph{intermutation} made of arrows from $(A\wedge B)\vee(C\wedge D)$ to ${(A\vee C)\wedge(B\vee D)}$, for $\wedge$ and $\vee$ being two biendofunctors.…

We define affine growth diagrams consisting of $GL_m$ dominant weights that label the vertices of a staircase-shaped grid. These are also called cylindrical growth diagrams as defined by Speyer and White in the case of partitions. The…

As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…

Recently Albert and Bousquet-M\'elou obtained the solution to the long-standing problem of the enumeration of permutations sortable by two stacks in parallel (2sip). Their solution was expressed in terms of functional equations. E.P. and…

Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…

Recently Albert and Bousquet-M\'elou \cite{AB15} obtained the solution to the long-standing problem of the number of permutations sortable by two stacks in parallel (tsip). Their solution was expressed in terms of functional equations. We…

Baxter permutations originally arose in studying common fixed points of two commuting continuous functions. In 2015, Dilks proposed a conjectured bijection between Baxter permutations and non-intersecting triples of lattice paths in terms…

Let $\mathcal{A}$ and $\mathcal{B}$ be two alternative $W^{*}$-factors. In this paper, we proved that a bijective mapping $\Phi :\mathcal{A}\rightarrow \mathcal{B}$ satisfies $\Phi (ab+ba^{*})=\Phi (a)\Phi (b)+\Phi (b)\Phi (a)^{*}$ (resp.,…

We define piecewise-linear and birational analogues of the toggle-involutions on order ideals of posets studied by Striker and Williams and use them to define corresponding analogues of rowmotion and promotion that share many of the…

We extend a result of B\`{e}s, Martin, Peris and Shkarin by stating: $B_w$ is $\mathscr{F}$-weighted backward shift if and only if $(B_w,\dots, B_w^r)$ is $d$-$\mathscr{F}$, for any $r\in \mathbb{N}$, where $\mathscr{F}$ runs along some…

Many matching, tracking, sorting, and ranking problems require probabilistic reasoning about possible permutations, a set that grows factorially with dimension. Combinatorial optimization algorithms may enable efficient point estimation,…

There is a natural bijection between permutations obtainable using a stack (those avoiding the pattern 312) and permutations obtainable using a queue (those avoiding 321). This bijection is equivalent to one described by Simion and Schmidt…

Lam, Lee and Shimozono introduced the structure of bumpless pipedreams in their study of back stable Schubert calculus. They found that a specific family of bumpless pipedreams, called EG-pipedreams, can be used to interpret the…