Related papers: Richardson tableaux and noncrossing partial matchi…
We consider two partial orders on standard Young tableaux. The first one is induced from the weak right Bruhat order on symmetric group by Robinson-Schensted algorithm. The second one is induced from the order on Young diagrams by…
The paper introduces a Poisson-type problem on a mixed-dimensional structure combining a Euclidean domain and a lower-dimensional self-similar component touching a compact surface (interface). The lower-dimensional piece is a so-called…
The Wronski map is a finite, PGL_2(C)-equivariant morphism from the Grassmannian Gr(d,n) to a projective space (the projectivization of a vector space of polynomials). We consider the following problem. If C_r < PGL_2(C) is a cyclic…
Let $L(m,n)$ denote Young's lattice, consisting of all partitions whose Young diagrams are contained within an $m\times n$ rectangle. It is a classical result that the partially ordered set $L(m,n)$ is rank-symmetric, rank-unimodal, and…
We consider families $\mathcal{P}_n$ of plane lattice paths enumerated by Guy, Krattenthaler, and Sagan (1992). We show by explicit bijection that these families are equinumerous with the set $\mathrm{SYT}(n+2,2,1^n)$ of standard Young…
Spanning trees are a representative example of linear matroid bases that are efficiently countable. Perfect matchings of Pfaffian bipartite graphs are a countable example of common bases of two matrices. Generalizing these two examples,…
We establish bijections between three classes of combinatorial objects that have been studied in very different contexts: lattice walks in simplicial regions as introduced by Mortimer--Prellberg, standard cylindric tableaux as introduced by…
We introduce the notions of Schr\"oder shape and of Schr\"oder tableau, which provide some kind of analogs of the classical notions of Young shape and Young tableau. We investigate some properties of the partial order given by containment…
We study the Steinberg variety associated to matrix Schubert varieties, and develop a Robinson-Schensted type correspondence, $\tau\leftrightarrow(\Lambda,\mathsf Q,\mathsf P)$. Here $\tau$ is a partial permutation of size $p\times q$,…
We elaborate upon a bijection discovered by Cools, Draisma, Payne, and Robeva between the set of rectangular standard Young tableaux and the set of equivalence classes of chip configurations on certain metric graphs under the relation of…
A cyclic descent function on standard Young tableaux of size $n$ is a function that restricts to the usual descent function when $n$ is omitted, such that the number of standard Young tableaux of given shape with cyclic descent set…
In the symmetric group $S_n$, each element $\sigma$ has an associated cycle type $\alpha$, a partition of $n$ that identifies the conjugacy class of $\sigma$. The Robinson-Schensted (RS) correspondence links each $\sigma$ to another…
Crossings of knot diagrams can be divided into classes (tribes) compatible with Reidemeister moves. Tribes can be considered as localization of the notion of weak chord index introduced by M. Xu. In the article we describe tribes of…
Given independent standard Gaussian points $v_1, \ldots, v_n$ in dimension $d$, for what values of $(n, d)$ does there exist with high probability an origin-symmetric ellipsoid that simultaneously passes through all of the points? This…
We present a randomized algorithm for generating standard set-valued tableaux by extending the Green-Nijenhuis-Wilf hook walk algorithm. In the case of asymptotically rank two partitions, we use this algorithm to give a fully polynomial…
In this paper we investigate a family of matroids introduced by Ardila and Billey to study one-dimensional intersections of complete flag arrangements of $\mathbb{C}^n$. The set of lattice points $P_n$ inside the equilateral triangle $S_n$…
We present nine bijections between classes of Dyck paths and classes of standard Young tableaux (SYT). In particular, we consider SYT of flag and rectangular shapes, we give Dyck path descriptions for certain SYT of height at most 3, and we…
The number of standard Young tableaux of a fixed shape is famously given by the hook-length formula due to Frame, Robinson and Thrall. A bijective proof of Novelli, Pak and Stoyanovskii relies on a sorting algorithm akin to jeu-de-taquin…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
Parton distribution functions (PDFs) are nonperturbative quantities describing the relation between a hadron and quarks and gluons within it. We propose to extract PDFs from QCD global analysis of "data" generated by lattice QCD…